⚛️ quantum physics

The simplified quantum circuits for implementing quantum teleportation

This paper proposes simplified quantum circuits for various quantum teleportation protocols that significantly reduce gate count, cost, and depth without requiring feed-forward recovery operations, with successful experimental validation on an IBM quantum computer.

Original authors: Wen-Xiu Zhang, Guo-Zhu Song, Hai-Rui Wei

Published 2026-02-10

📖 3 min read🧠 Deep dive

CC BY 4.0

Original authors: Wen-Xiu Zhang, Guo-Zhu Song, Hai-Rui Wei

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are trying to send a secret, fragile glass sculpture (a quantum state) from your house to a friend’s house across town.

In the world of quantum physics, you can’t just put the sculpture in a box and mail it. If you touch it or look at it too closely during the trip, it shatters. Instead, scientists use a trick called "Quantum Teleportation." You don't actually move the physical object; instead, you use a special "connection" (called entanglement) to recreate the exact pattern of the sculpture at your friend's house.

The Problem: The "Instruction Manual" is Too Long

To make this teleportation work, you need to send a set of instructions to your friend so they can rebuild the sculpture. In a quantum computer, these instructions are written in "Quantum Gates" (the basic commands like "flip this" or "rotate that").

The problem is that current instruction manuals are too long, too complicated, and too slow.

Too long (Gate-count): Using too many commands increases the chance of making a mistake.
Too expensive (Cost): Some commands are harder for the computer to perform.
Too slow (Depth): If the instructions take too long to read, the "quantum connection" might expire (this is called decoherence), and the sculpture shatters before it's rebuilt.

The Solution: The "Short-Hand" Method

The researchers in this paper have essentially discovered a way to write these instruction manuals in "Quantum Shorthand."

They looked at several different ways to teleport information—using different types of "connections" like GHZ states or Cluster states—and found ways to rewrite the commands to be much more efficient.

Think of it like this:
Imagine you are giving someone directions to your house.

The Old Way: "Drive 100 meters, turn left at the red mailbox, drive 50 meters, turn right at the blue hydrant, drive 20 meters..." (This is long and easy to mess up).
The New Way (This Paper): "Take the Main Street exit and go straight." (This is short, fast, and much harder to get wrong).

The Results: Faster, Leaner, and Stronger

The researchers didn't just guess; they proved it works. They tested their "shorthand" instructions on an actual IBM Quantum Computer.

Here is what they achieved:

Massive Compression: For some methods, they cut the number of commands by more than half! For example, in one complex method (the Borras-based scheme), they went from 36 commands down to just 15.
No "Fix-it" Step Needed: Usually, after teleporting, you have to perform a "recovery" step to fix errors. The researchers found ways to design the circuits so that the teleportation is so clean, you don't even need that extra step.
High Accuracy (Fidelity): Even though the instructions are much shorter, the "sculpture" arrived at the destination almost perfectly. They measured a "fidelity" (accuracy) of over 0.9 (90%), which is excellent for these types of experiments.

Why does this matter?

As we build bigger quantum computers, they will become more "noisy" and prone to errors. By making the instructions shorter and faster, we reduce the time the computer has to spend working, which means there is less time for errors to creep in.

This paper is a blueprint for making quantum communication more reliable, efficient, and ready for the real world.

Technical Summary: The Simplified Quantum Circuits for Implementing Quantum Teleportation

Authors: Wen-Xiu Zhang, Guo-Zhu Song, and Hai-Rui Wei
Date: February 10, 2026

1. Problem Statement

In quantum information processing, the efficiency of a quantum circuit is determined by its gate-count (total number of gates), cost (total number of operations), and depth (the number of time steps required for execution). High gate counts and circuit depths increase susceptibility to decoherence, gate errors, and noise, which are significant hurdles in current Noisy Intermediate-Scale Quantum (NISQ) devices. While various quantum teleportation protocols exist using different entangled channels (e.g., GHZ, cluster, Brown, and Borras states), existing implementations are often resource-heavy and require complex feed-forward recovery operations (classical communication used to adjust the state based on measurement results).

2. Methodology

The authors propose a method to compress and simplify existing quantum teleportation circuits. The core methodology involves:

Mathematical Equivalence/Tricks: Utilizing fundamental quantum gate identities and commutation relations to reduce the number of gates. Key identities used include:
- CNOT gate commutation and simplification (e.g., $CNOT_2^3 \cdot CNOT_1^2 \cdot CNOT_2^3 = CNOT_1^2 \cdot CNOT_1^3$ ).
- Hadamard-CNOT transformations (e.g., $(I \otimes H) \cdot CNOT \cdot (I \otimes H) = (H \otimes I) \cdot CNOT_{reversed} \cdot (H \otimes I)$ ).
- SWAP gate decomposition using CNOT gates.
Elimination of Feed-Forward Operations: The researchers redesigned the circuits such that the teleported state is achieved directly through the circuit evolution, removing the need for real-time classical measurement-based corrections.
Experimental Validation: The simplified schemes were implemented on the IBM Quantum computer platform using a "simulator extended stabilizer" to perform quantum state tomography and calculate fidelity.

3. Key Contributions

The paper provides optimized circuit designs for six distinct teleportation scenarios. The primary contribution is the significant reduction in complexity across all metrics:

Teleportation Scheme	Original (Count/Cost/Depth)	Simplified (Count/Cost/Depth)
GHZ-based	10 / 6 / 8	9 / 4 / 6
Two-qubit Cluster-based	9 / 4 / 5	6 / 3 / 5
Three-qubit Cluster-based	12 / 6 / 7	8 / 4 / 5
Brown-based	25 / 15 / 17	18 / 8 / 7
Borras-based	36 / 25 / 20	15 / 8 / 11
Entanglement-swapping	13 / 8 / 8	10 / 5 / 5

4. Results

Resource Reduction: The most dramatic improvements were seen in the Borras-based scheme, where the gate count was reduced by more than 50% (from 36 to 15) and the cost was reduced by nearly 70% (from 25 to 8).
High Fidelity: Experimental results on IBM quantum hardware demonstrated that the simplified circuits maintain high performance. For various test states ( $|M\rangle = \cos \theta/2 |0\rangle + \sin \theta/2 |1\rangle$ ), the fidelity remained consistently high, with values exceeding 0.9 across all tested cases.
Robustness: The reduction in circuit depth and gate count directly translates to better noise resiliency, as evidenced by the successful state tomography in the experimental section.

5. Significance

This work is highly significant for the practical implementation of quantum communication protocols. By minimizing the "footprint" of teleportation circuits, the authors have:

Enhanced Noise Resiliency: Shorter, shallower circuits are less likely to be corrupted by environmental decoherence.
Optimized Resource Management: Reduced gate counts allow for more complex protocols to be run on limited-qubit hardware.
Simplified Protocol Architecture: The removal of feed-forward operations simplifies the integration of quantum teleportation into larger quantum networks, as it reduces the reliance on ultra-fast classical feedback loops.