REVIEW 11 cited by
Opportunities and Challenges in Fault-Tolerant Quantum Computation
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
Signed reviews
read the original abstract
I will give an overview of what I see as some of the most important future directions in the theory of fault-tolerant quantum computation. In particular, I will give a brief summary of the major problems that need to be solved in fault tolerance based on low-density parity check codes and in hardware-specific fault tolerance. I will then conclude with a discussion of a possible new paradigm for designing fault-tolerant protocols based on a space-time picture of quantum circuits.
Forward citations
Cited by 11 Pith papers
-
Decoding across transversal Clifford gates in the surface code
A new logical-observable matching decoder lets surface codes run fast transversal Clifford gates while correcting all errors below half the code distance, and windowed variants trade efficiency against reset speed.
-
Compressing Syndrome Measurement Sequences
Fault-tolerant syndrome extraction can be compressed from r stabilizer measurements to O(d log r) by combining stabilizer generators through the parity check matrix of a classical code.
-
Low-overhead error detection with spacetime codes
Spacetime coherent Pauli checks, found by reducing check search to a linear-code decoding problem, detect errors in Clifford circuits with mild overhead and improve single-shot state fidelity by up to 236x in experime...
-
Transversal Logical Clifford gates on rotated surface codes with reconfigurable neutral atom arrays
The authors complete a transversal Clifford gate set on rotated surface codes by embedding a fold-transversal S gate inside a syndrome extraction round, with detector construction and numerical support.
-
A Heterogeneous Distributed Architecture for Quantum Simulation
A heterogeneous distributed architecture with a central magic core and 1D cold-storage lanes executes fault-tolerant fermionic simulations with about 2x speedup over homogeneous distributed baselines at matched T-fact...
-
A Pathway to Practical Quantum Advantage in Solving Navier-Stokes Equations
A spectral-sparsity-based quantum solver is claimed to solve 2^80-cell Navier-Stokes problems in 42.6 days with 8.71 million physical qubits, a 1,100x speedup over a classical supercomputer.
-
Universal Quantum Error Mitigation via Random Inverse Depolarizing Approximation
RIDA estimates a circuit's global depolarization probability from a random half-gate identity circuit and uses it to amplify noisy expectation values.
-
Spacetime Markov length: a diagnostic for fault tolerance via mixed-state phases
The paper introduces the spacetime Markov length: the decay length of conditional mutual information of syndrome history, and provides evidence that its divergence marks the fault-tolerance threshold.
-
Quantum Error Correction in Adversarial Regimes
The paper gives a generalized Knill-Laflamme condition for quantum list-decodable codes and a pseudorandom-unitary protocol for unambiguous list decoding that is claimed to be secure against polynomial-time quantum ad...
-
Dynamics and rupture of doped Motility Induced Phase Peparation
Adding passive particles to a phase-separated active suspension can produce a stable, self-sustained drift of the dense slab.
-
A Fundamental Bound for Robust Quantum Gate Control
For any gate realizable in an ideal model, Theorem 1 bounds the worst-case fidelity from below by a function of only the gate time and an aggregate uncertainty frequency.
Discussion (0). Continue with ORCID to comment.