Assessing Teleportation of Logical Qubits in a Distributed Quantum Architecture under Error Correction
- URL: http://arxiv.org/abs/2504.05611v2
- Date: Thu, 14 Aug 2025 17:00:55 GMT
- Title: Assessing Teleportation of Logical Qubits in a Distributed Quantum Architecture under Error Correction
- Authors: John Stack, Ming Wang, Frank Mueller,
- Abstract summary: We show that non-local operations and teleportation of qubits between nodes are feasible under Surface Code and qLDPC encodings.<n>We use circuit-level simulations to assess physical and network noise regimes ranging from $10-1$ to $10-6$.<n>Our results indicate that non-local CNOTs can be carried out with a logical error rate of $10-12$ for a physical error rate of $10-3$ and ebit noise of $10-2$.
- Score: 4.352368481242436
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Quantum computing is facing challenges in terms of scaling to thousands of qubits and implementing quantum error correction (QEC). Scaling efforts focus on connecting multiple smaller quantum devices (nodes) in a distributed manner. Non-local CNOTs and teleportation of quantum states become important operations as they enable computation between different nodes in a distributed architecture. For physical qubits, today's high quantum network noise rates prevent the execution of distributed operations with useful accuracy. By employing QEC, we show that non-local operations and teleportation of logical qubits between nodes are feasible under Surface Code and qLDPC encodings with very low logical error rates (LER), even with network noise in near-term regimes. We use circuit-level simulations to assess physical and network noise regimes ranging from $10^{-1}$ to $10^{-6}$. This is a wider range than typically studied in circuit level simulations, understanding the behavior of QEC codes in these regimes is necessary for achieving accurate computation. Our simulations give evidence that transversal distributed operations may carry significantly lower LER than lattice surgery. Importantly, we also find that the LER of our distributed operations decreases exponentially as QEC code distance increases, proving the feasibility of executing large algorithms on distributed quantum computers. Our results indicate that non-local CNOTs can be carried out with a logical error rate of $10^{-12}$ for a physical error rate of $10^{-3}$ and ebit noise of $10^{-2}$. Teleportations realized with the same logical error rate under a physical error rate of $3 \times 10^{-4}$ and ebit noise of $3 \times 10^{-3}$.
Related papers
- Coined Quantum Walks on Complex Networks for Quantum Computers [2.2336243882030025]
In complex networks, the coin and shift operators depend on the varying degrees of the nodes.<n>We implement the circuit using Qmod, a high-level quantum programming language.<n>We execute the proposed circuits on the ibm_torino superconducting quantum processor for Watts-Strogatz models.
arXiv Detail & Related papers (2025-12-18T10:55:55Z) - Surface-code Superconducting Quantum Processors: From Calibration To Logical Performance [0.0]
Current quantum processors are fragile, noisy and fairly limited in both quantity and quality with tens of qubits and physical error rates of around 10-3.
quantum error correction (QEC) is essential to bridge this gap and fully harness the potential of quantum computers.
This thesis focuses on the implementation and optimization of small-scale QEC experiments using the surface code and flux-tunable superconducting qubits.
arXiv Detail & Related papers (2025-04-23T20:09:10Z) - Error correction of a logical qubit encoded in a single atomic ion [0.0]
Quantum error correction (QEC) is essential for quantum computers to perform useful algorithms.<n>Recent work has proposed a complementary approach of performing error correction at the single-particle level.<n>Here we demonstrate QEC in a single atomic ion that decreases errors by a factor of up to 2.2 and extends the qubit's useful lifetime by a factor of up to 1.5.
arXiv Detail & Related papers (2025-03-18T05:10:21Z) - A Quantum-Classical Collaborative Training Architecture Based on Quantum
State Fidelity [50.387179833629254]
We introduce a collaborative classical-quantum architecture called co-TenQu.
Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting.
It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
arXiv Detail & Related papers (2024-02-23T14:09:41Z) - QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum
Circuits [82.50620782471485]
QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits.
It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness.
Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
arXiv Detail & Related papers (2024-01-10T22:33:00Z) - Fast Flux-Activated Leakage Reduction for Superconducting Quantum
Circuits [84.60542868688235]
leakage out of the computational subspace arising from the multi-level structure of qubit implementations.
We present a resource-efficient universal leakage reduction unit for superconducting qubits using parametric flux modulation.
We demonstrate that using the leakage reduction unit in repeated weight-two stabilizer measurements reduces the total number of detected errors in a scalable fashion.
arXiv Detail & Related papers (2023-09-13T16:21:32Z) - Constant-Overhead Fault-Tolerant Quantum Computation with Reconfigurable
Atom Arrays [5.542275446319411]
We propose a hardware-efficient scheme to perform fault-tolerant quantum computation with high-rate qLDPC codes on reconfigurable atom arrays.
Our work paves the way for explorations of low-overhead quantum computing with qLDPC codes at a practical scale.
arXiv Detail & Related papers (2023-08-16T19:47:17Z) - Partially Fault-tolerant Quantum Computing Architecture with
Error-corrected Clifford Gates and Space-time Efficient Analog Rotations [0.5658123802733283]
We propose a quantum computing architecture to close the gap between NISQ and FTQC.
For early-FTQC devices, we can perform roughly $1.72 times 107$ Clifford operations and $3.75 times 104$ arbitrary rotations on 64 logical qubits.
arXiv Detail & Related papers (2023-03-23T11:21:41Z) - Deep Quantum Error Correction [73.54643419792453]
Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing.
In this work, we efficiently train novel emphend-to-end deep quantum error decoders.
The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
arXiv Detail & Related papers (2023-01-27T08:16:26Z) - QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional
Networks [124.7972093110732]
We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations.
To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections.
Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
arXiv Detail & Related papers (2022-11-09T21:43:16Z) - Overcoming leakage in scalable quantum error correction [128.39402546769284]
Leakage of quantum information out of computational states into higher energy states represents a major challenge in the pursuit of quantum error correction (QEC)
Here, we demonstrate the execution of a distance-3 surface code and distance-21 bit-flip code on a Sycamore quantum processor where leakage is removed from all qubits in each cycle.
We report a ten-fold reduction in steady-state leakage population on the data qubits encoding the logical state and an average leakage population of less than $1 times 10-3$ throughout the entire device.
arXiv Detail & Related papers (2022-11-09T07:54:35Z) - Demonstration of teleportation across a quantum network code [0.0]
We study measurement-based quantum network coding (MQNC), which is a protocol particularly suitable for noisy intermediate-scale quantum devices.
In particular, we develop techniques to adapt MQNC to state-of-the-art superconducting processors and subsequently demonstrate successful teleportation of quantum information.
The teleportation in our demonstration is shown to occur with fidelity higher than could be achieved via classical means, made possible by considering qubits from a polar cap of the Bloch Sphere.
arXiv Detail & Related papers (2022-10-06T12:59:48Z) - Iterative Qubits Management for Quantum Index Searching in a Hybrid
System [56.39703478198019]
IQuCS aims at index searching and counting in a quantum-classical hybrid system.
We implement IQuCS with Qiskit and conduct intensive experiments.
Results demonstrate that it reduces qubits consumption by up to 66.2%.
arXiv Detail & Related papers (2022-09-22T21:54:28Z) - Suppressing quantum errors by scaling a surface code logical qubit [147.2624260358795]
We report the measurement of logical qubit performance scaling across multiple code sizes.
Our system of superconducting qubits has sufficient performance to overcome the additional errors from increasing qubit number.
Results mark the first experimental demonstration where quantum error correction begins to improve performance with increasing qubit number.
arXiv Detail & Related papers (2022-07-13T18:00:02Z) - Can Noise on Qubits Be Learned in Quantum Neural Network? A Case Study
on QuantumFlow [25.408147000243158]
This paper aims to tackle the noise issue from another angle.
Instead of creating perfect qubits for general quantum algorithms, we investigate the potential to mitigate the noise issue for dedicate algorithms.
This paper targets quantum neural network (QNN), and proposes to learn the errors in the training phase, so that the identified QNN model can be resilient to noise.
arXiv Detail & Related papers (2021-09-08T04:43:12Z) - Simulation of the five-qubit quantum error correction code on
superconducting qubits [0.0]
We propose a circuit based on the minimal distance-3 QEC code, which requires only 5 data qubits and 5 ancilla qubits.
Thanks to its smaller footprint, the proposed code has a lower logical error rate than Surface-17 for similar physical error rates.
arXiv Detail & Related papers (2021-07-14T05:29:59Z) - Exponential suppression of bit or phase flip errors with repetitive
error correction [56.362599585843085]
State-of-the-art quantum platforms typically have physical error rates near $10-3$.
Quantum error correction (QEC) promises to bridge this divide by distributing quantum logical information across many physical qubits.
We implement 1D repetition codes embedded in a 2D grid of superconducting qubits which demonstrate exponential suppression of bit or phase-flip errors.
arXiv Detail & Related papers (2021-02-11T17:11:20Z) - Quantum error mitigation as a universal error-minimization technique:
applications from NISQ to FTQC eras [0.9622115055919379]
In the early years of fault-tolerant quantum computing (FTQC), the available code distance and the number of magic states will be restricted.
Here, we integrate quantum error correction and quantum error mitigation into an efficient FTQC architecture.
This scheme will dramatically alleviate the required computational overheads and hasten the arrival of the FTQC era.
arXiv Detail & Related papers (2020-10-08T10:27:29Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.