pith. sign in

arxiv: quant-ph/0402171 · v1 · submitted 2004-02-23 · 🪐 quant-ph

Fault-Tolerant Postselected Quantum Computation: Schemes

classification 🪐 quant-ph
keywords computationquantummethodspostselectedcodesencodederrorsoutput
0
0 comments X
read the original abstract

Postselected quantum computation is distinguished from regular quantum computation by accepting the output only if measurement outcomes satisfy predetermined conditions. The output must be accepted with nonzero probability. Methods for implementing postselected quantum computation with noisy gates are proposed. These methods are based on error-detecting codes. Conditionally on detecting no errors, it is expected that the encoded computation can be made to be arbitrarily accurate. Although the probability of success of the encoded computation decreases dramatically with accuracy, it is possible to apply the proposed methods to the problem of preparing arbitrary stabilizer states in large error-correcting codes with local residual errors. Together with teleported error-correction, this may improve the error tolerance of non-postselected quantum computation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 14 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum Memory and Autonomous Computation in Two Dimensions

    quant-ph 2026-01 unverdicted novelty 8.0

    A two-dimensional dissipative quantum cellular automaton achieves passive quantum error correction with a nonzero noise threshold and supports fault-tolerant universal computation.

  2. Quantum Universality in Composite Systems: A Trichotomy of Clifford Resources

    quant-ph 2025-12 unverdicted novelty 8.0

    Single-qudit universality for Clifford gate sets plus one non-Clifford gate follows a trichotomy determined by the prime factorization of the local dimension d.

  3. Cups and Gates I: Cohomology invariants and logical quantum operations

    quant-ph 2024-10 unverdicted novelty 8.0

    The authors equip CSS codes with cup product structures to generate logical operators in the Λ-th Clifford hierarchy level on Λ code copies via constant-depth unitaries, and construct code families supporting this for any Λ.

  4. Imaginarity-generating power of unitaries: A resource-theoretic approach

    quant-ph 2026-04 unverdicted novelty 7.0

    Unitaries have an exactly quantifiable purity-constrained imaginarity-generating power that depends on intrinsic unitary properties and concentrates near its maximum for typical Haar-random dynamics in high dimensions.

  5. Hybrid Path-Sums for Hybrid Quantum Programs

    cs.PL 2026-04 unverdicted novelty 7.0

    Hybrid Path-Sums offer a new symbolic framework with rewriting rules and assertions to represent, simplify, and verify properties of hybrid quantum-classical programs.

  6. High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization

    quant-ph 2024-08 conditional novelty 7.0

    Search-based approximate diagonalization followed by analytical inversion yields high-precision multi-qubit Clifford+T circuits with 95% fewer non-Clifford gates on real-algorithm benchmarks.

  7. Measurement-based quantum machine learning

    quant-ph 2024-05 unverdicted novelty 7.0

    The authors introduce MuTA as a universal quantum neural network for MBQC and numerically demonstrate its ability to learn gates, classify quantum states, and process data under noise, including photonic hardware constraints.

  8. Local distillation from Reed Muller codes unfolding

    quant-ph 2026-05 unverdicted novelty 6.0

    Local 2D and 3D Reed-Muller distillation factories achieve output infidelities down to 8.256e-9 for CCZ states and 1.1811e-17 for T states from 10^{-3} input infidelity.

  9. Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture

    quant-ph 2026-04 unverdicted novelty 6.0

    A trapped-ion architecture based on LDPC codes and cat-state factories achieves 110 logical qubits and one million T gates per day using 2514 physical qubits, with estimates for Heisenberg model simulation on 100 site...

  10. Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation

    quant-ph 2026-01 unverdicted novelty 6.0

    Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.

  11. Scalable accuracy gains from postselection in quantum error correcting codes

    cond-mat.stat-mech 2025-10 unverdicted novelty 6.0

    Postselection on typical syndromes in the toric code suppresses logical error rates from p_f to p_f^b with b approximately 3.1 via large-deviation arguments.

  12. Use of Faulty States in Cat-Code Error Correction

    quant-ph 2024-12 unverdicted novelty 6.0

    Proposes multi-component bridge states outside cat code space for syndrome extraction in teleportation-based cat code QEC when nonlinear interactions are limiting.

  13. Quantum-Classical Embedding via Ghost Gutzwiller Approximation for Enhanced Simulations of Correlated Electron Systems

    quant-ph 2025-06 unverdicted novelty 5.0

    Introduces ghost Gutzwiller quantum embedding for ground-state and spectral simulations of correlated electrons on quantum devices, tested on the infinite-dimensional Hubbard model with error mitigation.

  14. Quantum simulation of out-of-equilibrium dynamics in gauge theories

    quant-ph 2025-09 unverdicted novelty 2.0

    The paper reviews advances in quantum simulation of out-of-equilibrium dynamics in gauge theories, covering particle production, string breaking, thermalization, and related phenomena.