Evidence for the utility of quantum computing before fault tolerance
Talkat Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms · 2024-04-22..04-26·
summary
Experiment demonstrates reliable expectation values from a noisy 127‑qubit processor by combining probabilistic error cancellation (formal error bounds, high variance cost) and zero‑noise extrapolation, anchored to a learnable sparse Pauli noise model (two‑body Lindbladian parametrization learned in ~30 minutes from nine basis measurements). Circuits are Trotterized kicked Ising evolutions (depths up to 60, stabilizers spanning 68 qubits); mitigated outputs match some classical approximations while exposing where MPS/isoTNS fail, giving first experimental evidence of useful pre‑fault‑tolerant information.
AI-written summary · about
chapters (10)
- 0:00Quantum utility before fault tolerance
- 2:06Error mitigation in NISQ devices
- 8:55Error mitigation trade-offs
- 13:54Sparse noise model for experiments
- 23:54Probabilistic error cancellation checks
- 26:25127-qubit experiments scaling
- 33:09Results versus classical simulations
- 37:32Certifiable error bars next steps
- 39:40Future experiments and hardware
- 42:06Q&A
related talks
19mAvenues for Quantum Error Correction and Mitigation
28mThe Problem with Qubits
53mThe quantum computers are coming
01h 01mInvited Talk: Welcome to Quantum 3.0!
03mQuantum Algorithms, Complexity, and Fault Tolerance
01h 37mFault-Tolerance Against Adversarial Errors & PCPs
34mQuantum Computing: Between Hope and Hype
01h 10mArchitectural mechanisms of a universal fault-tolerant quantum computer