Teleporting two-qubit entanglement across 19 qubits on a superconducting quantum computer
arXiv:2407.02858 · doi:10.1103/PhysRevApplied.23.014057
Abstract
Quantum teleportation is not merely a fascinating corollary of quantum entanglement, it also finds utility in quantum processing and circuit compilation. In this paper, we measure and track the entanglement and fidelity of two-qubit states prepared on a 127-qubit IBM Quantum device, as one of the qubits is teleported across 19 qubits. We design, evaluate and compare two distinct approaches to teleportation: post-selected measurement categorisation and dynamic circuit corrections based on mid-circuit measurements, and compare with direct state transportation using SWAP gates. By optimally choosing the teleportation path which exhibits the highest total negativity entanglement measure across nearest-neighbour pairs, we show the entanglement of a two-qubit graph state is sustained after at least 19 hops in teleportation using the post-selection approach and 17 hops using the dynamic circuit approach. We observe a higher level of teleported entanglement in paths determined from two-qubit negativities compared to those obtained from gate errors, demonstrating an advantage in using the negativity map over the gate error map for compiling quantum circuits.
References in corpus (30)
- Experimental quantum teleportation
- A computable measure of entanglement
- Quantum Machine Learning
- A variational eigenvalue solver on a quantum processor
- Charge insensitive qubit design derived from the Cooper pair box
- Surface codes: Towards practical large-scale quantum computation
- Efficient classical simulation of slightly entangled quantum computations
- Matrix Product States, Projected Entangled Pair States, and variational renormalization group methods for quantum spin systems
- Measurement-based quantum computation with cluster states
- Quantum computational chemistry
- An introduction to quantum machine learning
- Keeping a Quantum Bit Alive by Optimized -Pulse Sequences
- Quantum computing for finance: overview and prospects
- Quantum Teleportation with a Complete Bell State Measurement
- Ultra-Large-Scale Continuous-Variable Cluster States Multiplexed in the Time Domain
- Quantum Teleportation Between Distant Matter Qubits
- Qubit teleportation between non-neighboring nodes in a quantum network
- A Race Track Trapped-Ion Quantum Processor
- Maximum Likelihood, Minimum Effort
- Partial time-reversal transformation and entanglement negativity in fermionic systems
- Efficient Long-Range Entanglement using Dynamic Circuits
- Entanglement in a 20-Qubit Superconducting Quantum Computer
- Generation and verification of 27-qubit Greenberger-Horne-Zeilinger states in a superconducting quantum computer
- Whole-device entanglement in a 65-qubit superconducting quantum computer
- Surface code compilation via edge-disjoint paths
- Suppressing quantum circuit errors due to system variability
- Quantum Fourier Transform using Dynamic Circuits
- Efficient quantum readout-error mitigation for sparse measurement outcomes of near-term quantum devices
- Fast Quantum Search Algorithms in Protein Sequence Comparison - Quantum Biocomputing
- Characterization of entanglement on superconducting quantum computers of up to 414 qubits