Approximate Quantum Error Correction with 1D Log-Depth Circuits

• URL: http://arxiv.org/abs/2503.17759v1
• Date: Sat, 22 Mar 2025 12:54:04 GMT
• Title: Approximate Quantum Error Correction with 1D Log-Depth Circuits
• Authors: Guoding Liu, Zhenyu Du, Zi-Wen Liu, Xiongfeng Ma,
• Abstract summary: We construct quantum error-correcting codes based on one-dimensional, logarithmic-depth random Clifford encoding circuits with a two-layer circuit structure.<n>We show that the error correction inaccuracy decays exponentially with circuit depth, resulting in negligible errors for these logarithmic-depth circuits.
• Score: 0.824969449883056
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Efficient and high-performance quantum error correction is essential for achieving fault-tolerant quantum computing. Low-depth random circuits offer a promising approach to identifying effective and practical encoding strategies. In this work, we construct quantum error-correcting codes based on one-dimensional, logarithmic-depth random Clifford encoding circuits with a two-layer circuit structure. We demonstrate that these random codes typically exhibit good approximate quantum error correction capability by proving that their encoding rate achieves the hashing bound for Pauli noise and the channel capacity for erasure errors. Moreover, we show that the error correction inaccuracy decays exponentially with circuit depth, resulting in negligible errors for these logarithmic-depth circuits. We also establish that these codes are optimal, proving that logarithmic depth is necessary to maintain a constant encoding rate and high error correction performance. To prove our results, we propose new decoupling theorems for one-dimensional, low-depth circuits. These results also imply the strong decoupling and rapid thermalization within low-depth random circuits and have potential applications in quantum information science.

Related papers

• Demonstrating quantum error mitigation on logical qubits [18.42082909094174]
  A long-standing challenge in quantum computing is developing technologies to overcome the inevitable noise in qubits.<n>We propose and experimentally demonstrate the application of zero-noise extrapolation, a practical quantum error mitigation technique.
  arXiv  Detail & Related papers  (2025-01-15T19:00:33Z)
• Exact Decoding of Repetition Code under Circuit Level Noise [8.281330924913446]
  Repetition code forms a fundamental basis for quantum error correction experiments. Current methods for decoding repetition codes under circuit level noise are suboptimal. We propose an optimal maximum likelihood decoding algorithm called planar.
  arXiv  Detail & Related papers  (2025-01-07T07:14:01Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Testing the Accuracy of Surface Code Decoders [55.616364225463066]
  Large-scale, fault-tolerant quantum computations will be enabled by quantum error-correcting codes (QECC) This work presents the first systematic technique to test the accuracy and effectiveness of different QECC decoding schemes.
  arXiv  Detail & Related papers  (2023-11-21T10:22:08Z)
• 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)
• Scalable noisy quantum circuits for biased-noise qubits [37.69303106863453]
  We consider biased-noise qubits affected only by bit-flip errors, which is motivated by existing systems of stabilized cat qubits. For realistic noise models, phase-flip will not be negligible, but in the Pauli-Twirling approximation, we show that our benchmark could check the correctness of circuits containing up to $106$ gates.
  arXiv  Detail & Related papers  (2023-05-03T11:27:50Z)
• 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)
• Low-overhead quantum error correction codes with a cyclic topology [0.0]
  We show an approach to construct the quantum circuit of a correction code with ancillas entangled with non-neighboring data qubits.<n>We introduce a neural network-based decoding algorithm supported by an improved lookup table decoder.
  arXiv  Detail & Related papers  (2022-11-06T12:22:23Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Performance of teleportation-based error correction circuits for bosonic codes with noisy measurements [58.720142291102135]
  We analyze the error-correction capabilities of rotation-symmetric codes using a teleportation-based error-correction circuit. We find that with the currently achievable measurement efficiencies in microwave optics, bosonic rotation codes undergo a substantial decrease in their break-even potential.
  arXiv  Detail & Related papers  (2021-08-02T16:12:13Z)
• Scalable evaluation of quantum-circuit error loss using Clifford sampling [8.140947383885262]
  We use the quadratic error loss and the final-state fidelity loss to characterize quantum circuits. It is shown that these loss functions can be efficiently evaluated in a scalable way by sampling from Clifford-dominated circuits. Our results pave the way towards the optimization-based quantum device and algorithm design in the intermediate-scale quantum regime.
  arXiv  Detail & Related papers  (2020-07-20T11:51:36Z)
• Efficiently computing logical noise in quantum error correcting codes [0.0]
  We show that measurement errors on readout qubits manifest as a renormalization on the effective logical noise. We derive general methods for reducing the computational complexity of the exact effective logical noise by many orders of magnitude.
  arXiv  Detail & Related papers  (2020-03-23T19:40:56Z)

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.