Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms
2024-04-22..2024-04-26
Berkeley, United States
Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms ·
who it's for
quantum error correction researchers, experimental quantum computing researchers, quantum benchmarking engineers, quantum algorithms researchers, quantum information theorists, quantum hardware architects, quantum software and tooling developers
topics
surface code overhead reduction; quantum LDPC and yoked codes; lattice surgery and ancilla protocols; ZX calculus and fusion complexes; syndrome measurement scheduling; dynamic circuits for QEC; cycle and randomized benchmarking; tensor-network code enumerators; logical teleportation on trapped ions; improved quantum tomography methods; QAOA and continuous-time walks for MAX-CUT; classical simulation of boson sampling
| title | author | length |
|---|---|---|
| Dawn in the age of quantum fault tolerance | Steven Bartlett | 59m |
Quantum hardware now reaches error rates near the surface code thresholds (around a fraction of a percent) but implementing full fault tolerance still needs… | ||
| Halving the cost of surface codes by running error correction at the logical level | Mike Newman | 35m |
Proposes concatenating small rotated surface-code patches into a top-level parity code called yoked surface codes and measuring logical parities by lattice… | ||
| Fault tolerance with the ZX-calculus and fusion complexes: tools for QEC development in the... | Naomi Nickerson | 32m |
Introduces two concrete tooling claims: using the ZX calculus to express circuit, measurement, fusion and Floquet protocols as the same stabilizer-channel… | ||
| Scheduling syndrome measurement circuits | Andrew Cross | 34m |
Describes concrete schedules, simulators and decoders used to measure low‑weight stabilizers on planar and biplanar hardware: finds a family of bivariate… | ||
| QEC demonstrations leveraging dynamic circuits | Maika Takita | 32m |
Demonstrates that preparing a logical CZ magic state on a 4,2,2 code with mid-circuit measurement and real-time feedforward yields lower infidelity than the… | ||
| Quantum Lego: Quantum Codes and their Enumerators from Tensor Networks | Brad Lackey | 30m |
Constructs large stabilizer codes by tracing small code tensors (not just restating the topic) and shows the core claim that the code’s quantum weight… | ||
| How to fault-tolerantly realize any quantum circuit with local operations | Shin-Ho Choe | 30m |
Proposes a procedure that turns any quantum circuit into a geometrically local circuit with polynomial qubit overhead and constant depth overhead while… | ||
| From randomized benchmarking to cycle error reconstruction | Joseph Emerson | 53m |
Claim: randomized compiling turns coherent control errors into stochastic ones so worst-case bounds scale linearly instead of with the problematic sqrt(r)… | ||
| Emergence of Universal Randomness in Quantum Many-body Dynamics | Soonwon Choi | 44m |
Claim: natural many‑body dynamics produce universal pure‑state ensembles — projected ensembles show deep thermalization and, at infinite effective temperature… | ||
| Using chaos to characterize a programmable analog quantum simulator | Adam Shaw | 38m |
A Rydberg atom array runs time‑independent Ising‑like dynamics on up to 60 atoms and yields a measured overlap around 10% fidelity for maximally entangled… | ||
| Fundamental limits to quantum computation | Jens Eisert | 53m |
Proves that a single T-gate renders learning hard for Born‑machine output distributions, gives concrete sample‑complexity lower bounds showing error mitigation… | ||
| Evidence for the utility of quantum computing before fault tolerance | Kristan Temme | 49m |
Experiment demonstrates reliable expectation values from a noisy 127‑qubit processor by combining probabilistic error cancellation (formal error bounds, high… | ||
| High-fidelity and Fault-tolerant Teleportation of a Logical Qubit on a Trapped-ion Quantum Computer | Natalie Brown | 39m |
Quantinuum H2 implements the first fully fault-tolerant logical-qubit teleportation encoded in the [[7,1,3]] Steane (2D color) code, running circuits up to 30… | ||
| An Overview of Quantum Algorithms | Ashley Montanaro | 56m |
Survey of quantum algorithms lists concrete claims and numbers: fault-tolerant Shor-style breaks need roughly 8 hours and 23 million physical qubits for… | ||
| Certifying almost all quantum states with few single-qubit measurements | Robert Huang, John Preskill, Mehdi Soleimanifar | 49m |
Claims that almost all n‑qubit target states (including ones with exponential circuit complexity) are certifiable with O(n^2) single‑qubit measurements, proven… | ||
| Learning Shallow Quantum Circuits and Quantum States Prepared by Shallow Circuits in Polynomial Time | Yunchao Liu | 42m |
Gives polynomial time algorithms that (1) learn a constant‑depth circuit approximating an unknown lattice unitary U in small diamond distance from only random… | ||
| A Quantum Speed-Up for Approximating the Top Eigenvector of aMatrix via Improved Tomography | András Pál Gilyén | 47m |
Claims a quantum algorithm that outputs a classical description of the top eigenvector of a d×d matrix with gap constant using block-encoding plus a new… | ||
| The Virtues of the Quantum Approximate Optimization Algorithm | Edward Farhi | 52m |
QAOA alternates simple cost-phase and single-qubit rotations and delivers concrete, testable claims: MaxCut p=1 provable worst‑case approximation ≥0.6924, SK… | ||
| Continuous-time quantum walks for MAX-CUT are hot | Dan Browne | 40m |
Heuristic framework ties time-independent Hamiltonians to thermalisation and gives explicit, analytic predictions for continuous-time quantum walks solving… | ||
| Circuit Conspiracies | Scott Aaronson | 51m |
Poses the peakedness problem: pick random quantum circuits (1D nearest‑neighbor SU(4) layers), condition on having an output basis string with probability ≥δ… | ||
| Analog quantum machine learning for near-term hardware | Susanne Yelin | 48m |
Demonstrates a concrete pipeline that maps chemists’ model Hamiltonians onto Rydberg atom arrays by encoding spin-S as 2S qubits, moving atoms for programmable… | ||
| Hardware-efficient quantum computing using qudits | Christine Muschik | 48m |
Claims a working trapped-ion qudit processor that runs a hybrid qubit–qudit VQE to find the ground state of a single-plaquette 2D lattice QED model, using… | ||
| Probing the limits of classical computing with arbitrarily connected quantum circuits | Michael Foss Feig | 46m |
A 56-qubit trapped-ion QCCD device called 56-qubit H2 QCCD trap implements arbitrary-connectivity circuits by shuttling ions and achieves a native two-qubit… | ||
| Exploring the quantum computing frontier with reconfigurable atom arrays | Mikhail Lukin | 49m |
A reconfigurable atom array using optical tweezers and Rydberg blockade traps and rearranges thousands of neutral atoms to make defect-free arrays >500 and… | ||
| On Scrambling Times of Quantum Systems, Including Black Holes | Peter W. Shor | 46m |
Argues that the commonly used OTOC scrambling time (outsizedly short) and the time to become nearly maximally entangled are distinct: a… | ||
| A NASA Perspective on Quantum Computing, with Emphasis on Recent Results in Distributed Computing | Eleanor Rieffel | 34m |
The papers claim provable round-complexity wins in the quantum CONGEST-CLIQUE model: two algorithms yield an approximately optimal Steiner tree and an exact… | ||
| Quantum neural networks | Kerstin Beer | 31m |
Presents a concrete architecture called dissipative quantum neural networks that feeds forward by applying layer-to-layer unitaries and tracing out earlier… | ||
| Classical algorithm for simulating experimental Gaussian boson sampling | Changhun Oh | 44m |
A new classical algorithm simulates the largest reported Gaussian boson sampling experiments by exploiting high photon loss (>50%), using a semidefinite… | ||
| nothing matches | ||