Single-Shot Universality in Quantum LDPC Codes via Code-Switching

• URL: http://arxiv.org/abs/2510.08552v1
• Date: Thu, 09 Oct 2025 17:57:46 GMT
• Title: Single-Shot Universality in Quantum LDPC Codes via Code-Switching
• Authors: Shi Jie Samuel Tan, Yifan Hong, Ting-Chun Lin, Michael J. Gullans, Min-Hsiu Hsieh,
• Abstract summary: We present a single-shot, universal protocol that uses code-switching between high-rate quantum codes to perform fault-tolerant quantum computation.<n>We achieve this feat with single-shot code-switching between constant-rate 2D hypergraph product (HGP) codes and high-rate 3D HGP codes.<n>We prove the fault-tolerance of our code-switching protocol under both the adversarial and localstochastic noise models.
• Score: 7.411709177042115
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Code-switching is a powerful technique in quantum error correction that allows one to leverage the complementary strengths of different codes to achieve fault-tolerant universal quantum computation. However, existing code-switching protocols that encapsulate recent generalized lattice surgery approaches often either require many rounds of measurements to ensure fault-tolerance or suffer from low code rates. We present a single-shot, universal protocol that uses code-switching between high-rate quantum codes to perform fault-tolerant quantum computation. To our best knowledge, our work contains the first universal fault-tolerant quantum computation protocol that achieves what we term single-shot universality on high-rate codes that is characterized by (i) single-shot error correction, (ii) single-shot state preparation, as well as (iii) universal logical gates and logical measurements with constant depth circuits. We achieve this feat with single-shot code-switching between constant-rate 2D hypergraph product (HGP) codes and high-rate 3D HGP codes that can be viewed as a generalization of Bombin's dimensional jump for color codes and Hillmann et al.'s single-shot lattice surgery for higher-dimensional topological codes. In addition, we prove the fault-tolerance of our code-switching protocol under both the adversarial and local-stochastic noise models. We introduce a vastly simpler recipe to construct high-rate 3D HGP codes with transversal CCZ gates that grants immense flexibility in the choice of expander graphs and local codes, allowing us to expand the search space for codes with good parameters and interesting logical gates. Our work opens an alternative path towards universal fault-tolerant quantum computation with low space-time overhead by circumventing the need for magic state distillation.

Related papers

• Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation [0.47267770920095536]
  This work implements logical Clifford and T gates through novel ancilla-mediated protocols.<n>Our implementation is deterministic, does not consume ancilla registers, does not modify the underlying data codes or registers, and is generic over all stabilizer codes.
  arXiv  Detail & Related papers  (2026-01-16T03:06:56Z)
• Constant-Overhead Addressable Gates via Single-Shot Code Switching [1.6822770693792826]
  It is a major challenge to perform addressable and parallel logical operations on constantrate quantum LDPC (qLDPC) codes.<n>We introduce fault-tolerant protocols for performing various addressable gadgets as well as parallel logical operations with constant space-time overhead.
  arXiv  Detail & Related papers  (2025-10-08T08:37:50Z)
• Qudit low-density parity-check codes [0.4053073794503683]
  We introduce a general framework for finding qudit LDPC codes and apply our formalism to several promising types of LDPC codes.<n>We then numerically search for and decode several novel qudit codes compatible with near-term hardware.
  arXiv  Detail & Related papers  (2025-10-07T22:25:28Z)
• Low Overhead Universal Quantum Computation with Triorthogonal Codes [8.516351290711953]
  We study the use of triorthogonal codes for universal fault-tolerant quantum computation.<n>We propose two methods to circumvent the Eastin-Knill theorem, which prohibits any single quantum error-correcting code from supporting both universality and a gate set.
  arXiv  Detail & Related papers  (2025-10-07T09:17:10Z)
• Universal fault-tolerant logic with heterogeneous holographic codes [38.98035278249248]
  We introduce a new class of holographic codes that realize the ability to support universal fault-tolerant quantum logic.<n>Unlike standard tunabled codes, we establish that the new codes can encode more than a single logical qubit per code block.<n>Our work strengthens the case for the utility of holographic quantum codes for practical quantum computing.
  arXiv  Detail & Related papers  (2025-04-14T16:28:33Z)
• Universal quantum computation via scalable measurement-free error correction [45.29832252085144]
  We show that universal quantum computation can be made fault-tolerant in a scenario where the error-correction is implemented without mid-circuit measurements.<n>We introduce a measurement-free deformation protocol of the Bacon-Shor code to realize a logical $mathitCCZ$ gate.<n>In particular, our findings support that below-breakeven logical performance is achievable with a circuit-level error rate below $10-3$.
  arXiv  Detail & Related papers  (2024-12-19T18:55:44Z)
• Measurement-free, scalable and fault-tolerant universal quantum computing [1.2600261666440378]
  We present a complete toolbox for fault-tolerant universal quantum computing without the need for measurements during algorithm execution. We develop new fault-tolerant, measurement-free protocols to transfer encoded information between 2D and 3D color codes. Our measurement-free approach provides a practical and scalable pathway for universal quantum computing on state-of-the-art quantum processors.
  arXiv  Detail & Related papers  (2024-10-17T14:04:14Z)
• Near-optimal decoding algorithm for color codes using Population Annealing [44.99833362998488]
  We implement a decoder that finds the recovery operation with the highest success probability. We study the decoder performance on a 4.8.8 color code lattice under different noise models.
  arXiv  Detail & Related papers  (2024-05-06T18:17:42Z)
• Small Quantum Codes from Algebraic Extensions of Generalized Bicycle Codes [4.299840769087443]
  Quantum LDPC codes range from the surface code, which has a vanishing encoding rate, to very promising codes with constant encoding rate and linear distance. We devise small quantum codes that are inspired by a subset of quantum LDPC codes, known as generalized bicycle (GB) codes.
  arXiv  Detail & Related papers  (2024-01-15T10:38:13Z)
• Fault-Tolerant Computing with Single Qudit Encoding [49.89725935672549]
  We discuss stabilizer quantum-error correction codes implemented in a single multi-level qudit. These codes can be customized to the specific physical errors on the qudit, effectively suppressing them. We demonstrate a Fault-Tolerant implementation on molecular spin qudits, showcasing nearly exponential error suppression with only linear qudit size growth.
  arXiv  Detail & Related papers  (2023-07-20T10:51:23Z)
• Single-shot decoding of good quantum LDPC codes [38.12919328528587]
  We prove that quantum Tanner codes facilitate single-shot quantum error correction (QEC) of adversarial noise. We show that in order to suppress errors over multiple repeated rounds of QEC, it suffices to run the parallel decoding algorithm for constant time in each round.
  arXiv  Detail & Related papers  (2023-06-21T18:00:01Z)
• 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)
• Neural Belief Propagation Decoding of Quantum LDPC Codes Using Overcomplete Check Matrices [60.02503434201552]
  We propose to decode QLDPC codes based on a check matrix with redundant rows, generated from linear combinations of the rows in the original check matrix. This approach yields a significant improvement in decoding performance with the additional advantage of very low decoding latency.
  arXiv  Detail & Related papers  (2022-12-20T13:41:27Z)
• Transversal Injection: A method for direct encoding of ancilla states for non-Clifford gates using stabiliser codes [55.90903601048249]
  We introduce a protocol to potentially reduce this overhead for non-Clifford gates. Preliminary results hint at high quality fidelities at larger distances.
  arXiv  Detail & Related papers  (2022-11-18T06:03:10Z)

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.