Scheduling syndrome measurement circuits
Talkat Near-Term Quantum Computers: Fault Tolerance + Benchmarking + Quantum Advantage + Quantum Algorithms · 2024-04-22..04-26·
summary
Describes concrete schedules, simulators and decoders used to measure low‑weight stabilizers on planar and biplanar hardware: finds a family of bivariate bicycle schedules with minimum depth 8 (via symmetry reduction, VPOSD decoding and mixed‑integer checks), applies flag/deflagging circuits and schedule‑induced gauge fixing on heavy‑hex mappings, and shows the rotated subsystem surface code mapped to heavy‑hex yields about a 0.3% threshold and improves with two repetitions; uses Monte Carlo and MWPM/VPOSD comparisons and notes small‑distance performance of alternatives is nearly identical.
AI-written summary · about
chapters (12)
- 0:00Scheduling syndrome measurement circuits
- 1:30Hardware constraints and codes
- 7:46Subsystem codes basics
- 11:42Syndrome circuit design challenges
- 13:48Bivariate bicycle code case
- 18:29Heavy hex compass optimizations
- 23:30Subsystem surface code case
- 27:46Future scheduling directions
- 29:16Q&A: Repeated measurements
- 30:24Q&A: Optimization methods
- 31:49Q&A: Stabilizer interleaving
- 32:57Q&A: Experimental basis
related talks
01h 06mTour de gross: A modular quantum computer based on bivariate bicycle codes
21mCombinatorial Optimization of Train Timetable Fulfilment After Incidents
33mOptimizing the Annoying Stuff: Reducing Costs Obscured by the Abstract Circuit Model
14mDependency-Aware Compilation for Surface Code Quantum Architectures
51mPanel Discussion
21mAutomated Scheduling in the Healthcare Sector
51mFault Tolerance of Stabilizer Channels
18mAutomated distribution of quantum circuits via hypergraph partitioning