Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry

• URL: http://arxiv.org/abs/2605.19471v1
• Date: Tue, 19 May 2026 07:22:47 GMT
• Title: Efficient Fault-Tolerant Ancilla Preparation for Quantum BCH codes via Cyclic Symmetry
• Abstract summary: One of the major challenges in realizing fault-tolerant quantum computers (FTQCs) is the requirement for a large number of physical qubits.<n> quantum BCH codes, which offer both high rates and large code distances, are promising yet underexplored candidates.<n>We propose a framework for designing low-overhead distillation method to determine which non-fault-tolerant circuits can successfully produce a fault-tolerant state.
• Score: 7.453590733843195
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: One of the major challenges in realizing fault-tolerant quantum computers (FTQCs) is the requirement for a large number of physical qubits. To address this issue, high-rate quantum error correcting codes, which efficiently embed logical qubits into physical qubits, have recently attracted considerable attention. Among such codes, quantum BCH codes, which offer both high rates and large code distances, are promising yet underexplored candidates. However, no fault-tolerant ancilla preparation method specialized for this class had been established. We employ a two-stage approach (non-fault-tolerant preparation + entanglement distillation) for ancilla preparation. We then propose a framework for designing low-overhead distillation method that strategically leverages the cyclic symmetry of quantum BCH codes to determine which non-fault-tolerant circuits can successfully produce a fault-tolerant state. Numerical simulations on several high-performance quantum BCH codes up to 127 qubits demonstrate that our method achieves lower spatial overhead and logical error rates than conventional distillation circuits. Furthermore, we evaluated the logical error rates under a circuit-level noise model, and obtained performance benchmarks in realistic settings. This efficient state preparation technique is expected to contribute to the early realization of practical FTQCs, particularly on highly connected quantum platforms such as neutral atom systems.

Related papers

• AQER: a scalable and efficient data loader for digital quantum computers [62.40228216126285]
  We develop AQER, a scalable AQL method that constructs the loading circuit by systematically reducing entanglement in target states.<n>We conduct systematic experiments to evaluate the effectiveness of AQER, using synthetic datasets, classical image and language datasets, and a quantum many-body state datasets with up to 50 qubits.
  arXiv  Detail & Related papers  (2026-02-02T14:39:42Z)
• Continual Quantum Architecture Search with Tensor-Train Encoding: Theory and Applications to Signal Processing [68.35481158940401]
  CL-QAS is a continual quantum architecture search framework.<n>It mitigates challenges of costly encoding amplitude and forgetting in variational quantum circuits.<n>It achieves controllable robustness expressivity, sample-efficient generalization, and smooth convergence without barren plateaus.
  arXiv  Detail & Related papers  (2026-01-10T02:36:03Z)
• Fail fast: techniques to probe rare events in quantum error correction [0.9159338434295846]
  We develop three techniques to characterize the rare-event regime for general quantum low-density parity-check codes under circuit noise.<n>We observe strong low-error-rate performance with the recently proposed Relay decoder.
  arXiv  Detail & Related papers  (2025-11-19T06:57:29Z)
• Realization of a Quantum Error Detection Code with a Dynamically Reassigned Ancillary Qubit [0.0]
  superconducting qubits are among the most promising candidates for scalable QEC.<n>limited nearest-neighbor connectivity presents significant challenges for implementing a wide range of error correction codes.<n>We experimentally demonstrate a quantum error detection scheme that employs a dynamically reassigned ancillary qubit on a chain of three linearly connected transmon qubits.
  arXiv  Detail & Related papers  (2025-06-25T15:16:56Z)
• VQC-MLPNet: An Unconventional Hybrid Quantum-Classical Architecture for Scalable and Robust Quantum Machine Learning [50.95799256262098]
  Variational quantum circuits (VQCs) hold promise for quantum machine learning but face challenges in expressivity, trainability, and noise resilience.<n>We propose VQC-MLPNet, a hybrid architecture where a VQC generates the first-layer weights of a classical multilayer perceptron during training, while inference is performed entirely classically.
  arXiv  Detail & Related papers  (2025-06-12T01:38:15Z)
• 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)
• Quantum LDPC codes for erasure-biased atomic quantum processors [0.0]
  Quantum Low-Density Parity-Check (LDPC) codes have been recently shown to provide a path towards fault-tolerant quantum computing.<n>We demonstrate that when the dominant errors are erasures, quantum LDPC codes additionally provide high thresholds and even stronger logical error suppression.
  arXiv  Detail & Related papers  (2025-02-27T15:23:40Z)
• Low-density parity-check representation of fault-tolerant quantum circuits [5.064729356056529]
  In fault-tolerant quantum computing, quantum algorithms are implemented through quantum circuits capable of error correction. This paper presents a toolkit for designing and analysing fault-tolerant quantum circuits.
  arXiv  Detail & Related papers  (2024-03-15T12:56:38Z)
• 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)
• Compilation of a simple chemistry application to quantum error correction primitives [44.99833362998488]
  We estimate the resources required to fault-tolerantly perform quantum phase estimation on a minimal chemical example. We find that implementing even a simple chemistry circuit requires 1,000 qubits and 2,300 quantum error correction rounds.
  arXiv  Detail & Related papers  (2023-07-06T18:00:10Z)
• 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)
• Synergy Between Quantum Circuits and Tensor Networks: Short-cutting the Race to Practical Quantum Advantage [43.3054117987806]
  We introduce a scalable procedure for harnessing classical computing resources to provide pre-optimized initializations for quantum circuits. We show this method significantly improves the trainability and performance of PQCs on a variety of problems. By demonstrating a means of boosting limited quantum resources using classical computers, our approach illustrates the promise of this synergy between quantum and quantum-inspired models in quantum computing.
  arXiv  Detail & Related papers  (2022-08-29T15:24:03Z)
• 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)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)

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.