Quantum gate teleportation

Applying a CNOT gate by using gate teleportation. Uses Bell basis measurement (decomposed here into a CNOT, an H, and two measurements), Bell basis initialization (decomposed here into two resets, an H, and a CNOT), and classical feedback in the form of Pauli operations controlled by the measurement results.

Quantum gate teleportation is a quantum circuit construction where a gate is applied to target qubits by first applying the gate to an entangled state and then teleporting the target qubits through that entangled state. [1][2]

This separation of the physical application of the gate from the target qubit can be useful in cases where applying the gate directly to the target qubit may be more likely to destroy it than to apply the desired operation. For example, the KLM protocol can be used to implement a Controlled NOT gate on a photonic quantum computer, but the process can be prone to errors that destroy the target qubits. By using gate teleportation, the CNOT operation can be applied to a state that can be easily recreated if it is destroyed, allowing the KLM CNOT to be used in long-running quantum computations without risking the rest of the computation. Additionally, gate teleportation is a key component of magic state distillation, a technique that can be used to overcome the limitations of the Eastin-Knill theorem. [3]

Quantum gate teleportation has been demonstrated in various types of quantum computers, including linear optical, [4] superconducting quantum computing, [5] and trapped ion quantum computing. [6]

## References

[edit]

1. ^ Jozsa, Richard (2005). "An introduction to measurement based quantum computation". arXiv:quant-ph/0508124. Bibcode:2005quant.ph..8124J. `{{cite journal}}`: Cite journal requires `|journal=` (help)
2. ^ Colin P. Williams (2010). Explorations in Quantum Computing. Springer. pp. 633–641. ISBN 978-1-4471-6801-0.
3. ^ Gottesman, Daniel; Chuang, Isaac L. (1999). "Quantum Teleportation is a Universal Computational Primitive". Nature. 402 (6760): 390–393. arXiv:quant-ph/9908010. Bibcode:1999Natur.402..390G. doi:10.1038/46503. S2CID 4411647.
4. ^ Chou, K.S.; Blumoff, J.Z.; Wang, C.S.; Reinhold, P.C.; Axline, C.J.; Gao, Y.Y.; Frunzio, L.; Devoret, M.H.; Jiang, Liang; Schoelkopf, R.J. (2010). "Teleportation-based realization of an optical quantum two-qubit entangling gate". PNAS. 107 (49): 20869–20874. arXiv:1011.0772. Bibcode:2010PNAS..10720869G. doi:10.1073/pnas.1005720107. PMC 3000260. PMID 21098305.
5. ^ Gao, Wei-Bo; Poulin, David (2018). "Deterministic teleportation of a quantum gate between two logical qubits". Nature. 561 (7723): 368–373. arXiv:1801.05283. Bibcode:2018Natur.561..368C. doi:10.1038/s41586-018-0470-y. PMID 30185908. S2CID 3820071.
6. ^ Wan, Yong; Kienzler, Daniel; Erickson, Stephen D.; Mayer, Karl H.; Tan, Ting Rei; Wu, Jenny J.; Vasconcelos, Hilma M.; Glancy, Scott; Knill, Emanuel; Wineland, David J.; Wilson, Andrew C.; Leibfried, Dietrich (2019). "Quantum gate teleportation between separated qubits in a trapped-ion processor". Science. 364 (6443): 875–878. arXiv:1902.02891. Bibcode:2019Sci...364..875W. doi:10.1126/science.aaw9415. PMID 31147517. S2CID 119088844.

* v
* t
* e

Quantum information science

General|

* DiVincenzo's criteria
* NISQ era
* Quantum computing
* timeline
* Quantum information
* Quantum programming
* Quantum simulation
* Qubit
* physical vs. logical
* Quantum processors
* cloud-based

Theorems|

* Bell's
* Eastin–Knill
* Gleason's
* Gottesman–Knill
* Holevo's
* No-broadcasting
* No-cloning
* No-communication
* No-deleting
* No-hiding
* No-teleportation
* PBR
* Quantum speed limit
* Threshold
* Solovay–Kitaev
* Purification

Quantum
communication|

* Classical capacity
* entanglement-assisted
* quantum capacity
* Entanglement distillation
* Monogamy of entanglement
* LOCC
* Quantum channel
* quantum network
* Quantum teleportation
* quantum gate teleportation
* Superdense coding

| Quantum cryptography|

* Post-quantum cryptography
* Quantum coin flipping
* Quantum money
* Quantum key distribution
* BB84
* SARG04
* other protocols
* Quantum secret sharing

|

Quantum algorithms|

* Amplitude amplification
* Bernstein–Vazirani
* BHT
* Boson sampling
* Deutsch–Jozsa
* Grover's
* HHL
* Hidden subgroup
* Quantum annealing
* Quantum counting
* Quantum Fourier transform
* Quantum optimization
* Quantum phase estimation
* Shor's
* Simon's
* VQE

Quantum
complexity theory|

* BQP
* EQP
* QIP
* QMA
* PostBQP

Quantum
processor benchmarks|

* Quantum supremacy
* Quantum volume
* Randomized benchmarking
* XEB
* Relaxation times
* T1
* T2

Quantum
computing models|

* Adiabatic quantum computation
* Continuous-variable quantum information
* One-way quantum computer
* cluster state
* Quantum circuit
* quantum logic gate
* Quantum machine learning
* quantum neural network
* Quantum Turing machine
* Topological quantum computer

Quantum
error correction|

* Codes
* CSS
* quantum convolutional
* stabilizer
* Shor
* Bacon–Shor
* Steane
* Toric
* gnu
* Entanglement-assisted

Physical
implementations|

| Quantum optics|

* Cavity QED
* Circuit QED
* Linear optical QC
* KLM protocol

|

Ultracold atoms|

* Neutral atom QC
* Trapped-ion QC

Spin-based|

* Kane QC
* Spin qubit QC
* NV center
* NMR QC

Superconducting|

* Charge qubit
* Flux qubit
* Phase qubit
* Transmon

Quantum
programming|

* OpenQASM–Qiskit–IBM QX
* Quil–Forest/Rigetti QCS
* Cirq
* Q#
* libquantum
* many others...

* Quantum information science
* Quantum mechanics topics

*[v]: View this template
*[t]: Discuss this template
*[e]: Edit this template