Probing the limits of classical computing with arbitrarily connected quantum circuits
Talkat Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms · 2024-04-22..04-26·
summary
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 error around 2×10^-3 two-qubit error (including transport memory contribution). Tensor-network costs are estimated with Cotengra for random-regular-graph circuits and show that depth ~12 reaches state-vector hardness for N=56. Mirror benchmarking and a coherent-heavy noise model give return probabilities ≈0.2–0.4 (roughly 30% zero-error runs), so the hardware runs these hard-to-simulate circuits at measurable fidelity.
AI-written summary · about
chapters (8)
- 0:00Introduction
- 1:05Quantinuum’s trapped ion QC
- 4:25Scaling arbitrary circuits
- 15:14Random circuit sampling
- 28:48Tensor network costs
- 35:40Circuit fidelity & benchmarking
- 41:2056-qubit results
- 45:21Q&A
related talks
28mThe Problem with Qubits
31mDemonstrating an Unconditional Separation Between Quantum and Classical Information Resources
01h 10mQuantum Advantage with Shallow Clifford Circuits
01h 08mPutting Quantum Supremacy on a Rigorous Footing
19mAvenues for Quantum Error Correction and Mitigation
59mUtility, Computational Cost, and Effective Quantum Volume of NISQ Experiments
21mWhich qubit is the best- The current state of the art in different
53mThe quantum computers are coming