REVIEW 17 cited by
Fault-Tolerant Postselected Quantum Computation: Schemes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
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.
Forward citations
Cited by 17 Pith papers
-
Quantum Memory and Autonomous Computation in Two Dimensions
A two-dimensional dissipative quantum cellular automaton achieves passive quantum error correction with a nonzero noise threshold and supports fault-tolerant universal computation.
-
Quantum Universality in Composite Systems: A Trichotomy of Clifford Resources
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.
-
Fast simulation of fermions with reconfigurable qubits
Fermionic permutations can be compiled into O(N log N) Clifford gates in O(log N) depth, reducing fermion-to-qubit simulation overhead from O(N) to O(log N) per layer.
-
A distillation-teleportation protocol for fault-tolerant QRAM
An adaptive distillation-teleportation protocol implements a fault-tolerant QRAM query with poly(n) quantum resources and 1/poly(n) device fidelity, at the cost of an exponential classical dataset update each round.
-
Cups and Gates I: Cohomology invariants and logical quantum operations
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 Λ.
-
High-Precision Multi-Qubit Clifford+T Synthesis by Unitary Diagonalization
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.
-
Measurement-based quantum machine learning
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.
-
Spectral signatures of nonstabilizerness and criticality in infinite matrix product states
The stabilizer Rényi entropy of an infinite matrix product state decomposes into bulk, boundary, and exponentially decaying parts, and the associated 'magic correlation length' diverges at criticality with a different...
-
No-Go Theorem on Fault Tolerant Gadgets for Multiple Logical Qubits
No stabilizer code can implement the full logical Clifford group on multiple logical qubits using transversal gates, fold-transversal gates beyond two qubits, or code automorphisms.
-
Stabilizer Code-Generic Universal Fault-Tolerant Quantum Computation
Ancilla-mediated protocols enable deterministic universal logical gates on any stabilizer code without ancilla consumption or code modification.
-
Scalable accuracy gains from postselection in quantum error correcting codes
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.
-
Use of Faulty States in Cat-Code Error Correction
Proposes multi-component bridge states outside cat code space for syndrome extraction in teleportation-based cat code QEC when nonlinear interactions are limiting.
-
Non-Hermitian Computers Need No Complex Numbers
Non-Hermitian QC with real gate set {H, CCNOT, G} achieves P^#P power in poly time, showing complex numbers are unnecessary.
-
Quantum-Classical Embedding via Ghost Gutzwiller Approximation for Enhanced Simulations of Correlated Electron Systems
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.
-
Optimizing resource allocation for accuracy in noisy variational quantum algorithms
A simulation-derived phenomenological model optimizes the trade-off between quantum circuit size and iteration count to minimize total gate operations for a desired accuracy in noisy VQE algorithms.
-
Quantum simulation of out-of-equilibrium dynamics in gauge theories
The paper reviews advances in quantum simulation of out-of-equilibrium dynamics in gauge theories, covering particle production, string breaking, thermalization, and related phenomena.
-
Design Automation in Quantum Error Correction
A comprehensive review of automated tools and methods for designing quantum error-corrected circuits, with case studies on T-gate optimization, surface-code layout, ML decoders, and verification.
Discussion (0). Continue with ORCID to comment.