Scalable Postselection of Quantum Resources

• URL: http://arxiv.org/abs/2603.08697v1
• Date: Mon, 09 Mar 2026 17:55:44 GMT
• Title: Scalable Postselection of Quantum Resources
• Abstract summary: We present an approach to lower the overhead of quantum computing using scalable postselection.<n>We show that scalable postselection provides a $4times$ reduction in the overhead per logical gate, at the same logical error probability.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The large overhead imposed by quantum error correction is a critical challenge to the realization of quantum computers, and motivates searching for alternative error correcting codes and fault-tolerant circuit constructions. Postselection is a powerful tool that builds large programs out of probabilistically generated sub-circuits, and has been shown to increase the threshold of quantum error correction based on fusing fixed-size resource states or concatenated codes. In this work, we present an approach to lower the overhead of quantum computing using scalable postselection, based on directly postselecting sub-circuits with a size extensive in the code distance using decoder soft information. We introduce a metric, the partial gap, that estimates what the logical gap of a resource state will be after it is consumed, and show that postselection based on the partial gap leads to scalable improvements in the logical error rate. In the specific context of implementing logical gates via teleportation through a cluster state, we demonstrate that scalable postselection provides a $4\times$ reduction in the overhead per logical gate, at the same logical error probability.

Related papers

• Programmable Dissipation via Partial Quantum Error Correction [2.614894682819833]
  We show that logical noise can instead be turned into a calibrated resource.<n>One fault-tolerant round induces a logical completely positive trace-preserving map.<n>We derive an accuracy criterion for multi-step simulation in which the code distance is chosen.
  arXiv  Detail & Related papers  (2026-05-28T16:49:07Z)
• Distributed Quantum Error Correction with Permutation-Invariant Approximate Codes [0.7161783472741748]
  We introduce a distributed quantum error correction framework based on approximate codes to address this challenge.<n>We derive a lower bound and present corresponding simulations which indicate that this nontraditional approach can provide marked advantage.<n>Results highlight the potential of approximate distributed error correction strategies for scalable, modular, fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2025-09-29T17:28:39Z)
• Lattice surgery-based logical state teleportation via noisy links [1.351813974961217]
  We study the correctability phase diagram of the logical state teleportation protocol.<n>We find that the correctability-threshold lines decay as a power law with increasing separation.<n>Our results indicate that the logical state teleportation protocol can tolerate much higher noise rates in the linking region.
  arXiv  Detail & Related papers  (2025-04-22T09:49:03Z)
• Mitigating errors in logical qubits [1.6385815610837167]
  We develop new methods to quantify logical failure rates with exclusive decoders. We identify a regime at low error rates where the exclusion rate decays with code distance. Our work highlights the importance of post-selection as a powerful tool in quantum error correction.
  arXiv  Detail & Related papers  (2024-05-06T18:04:41Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• 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)
• 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)
• Fault-tolerant Coding for Entanglement-Assisted Communication [46.0607942851373]
  This paper studies the study of fault-tolerant channel coding for quantum channels. We use techniques from fault-tolerant quantum computing to establish coding theorems for sending classical and quantum information in this scenario. We extend these methods to the case of entanglement-assisted communication, in particular proving that the fault-tolerant capacity approaches the usual capacity when the gate error approaches zero.
  arXiv  Detail & Related papers  (2022-10-06T14:09:16Z)
• Logical blocks for fault-tolerant topological quantum computation [55.41644538483948]
  We present a framework for universal fault-tolerant logic motivated by the need for platform-independent logical gate definitions. We explore novel schemes for universal logic that improve resource overheads. Motivated by the favorable logical error rates for boundaryless computation, we introduce a novel computational scheme.
  arXiv  Detail & Related papers  (2021-12-22T19:00:03Z)
• Hardware-Efficient, Fault-Tolerant Quantum Computation with Rydberg Atoms [55.41644538483948]
  We provide the first complete characterization of sources of error in a neutral-atom quantum computer. We develop a novel and distinctly efficient method to address the most important errors associated with the decay of atomic qubits to states outside of the computational subspace. Our protocols can be implemented in the near-term using state-of-the-art neutral atom platforms with qubits encoded in both alkali and alkaline-earth atoms.
  arXiv  Detail & Related papers  (2021-05-27T23:29:53Z)
• 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.