REVIEW 5 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
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 5 Pith papers
-
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.
-
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.
-
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). Sign in to comment.