Resource-Efficient Quantum Computing by Breaking Abstractions
summary
Claims software can cut required quantum resources by 100–1000× overall; three concrete results support that. Direct-to-pulse compilation groups gates and feeds them to a pulse optimizer, giving about 5–10× latency reduction (≈6× average) until the optimizer fails near ~10 qubits. Noise-aware mapping uses daily calibration to pick reliable qubits and links, boosting success rates up to ~20× (≈3× typical). Using qutrit ancilla trick turns linear-depth multi-control gates into log-depth constructions, reducing gate count and improving fidelity under realistic noise models; prototypes run on IBM/OpenPulse and superconducting testbeds.
AI-written summary · about
chapters (15)
- 0:00Introduction
- 2:22The Hard Problem
- 4:44The Gap
- 5:47Epic Goal
- 6:47First Order Model
- 9:22Direct Occult Pulse Compilation
- 9:45Traditional compiler flow
- 11:37Quantum circuit example
- 24:10Summary
- 25:30Global Operations
- 27:04Quantum Algorithms
- 29:08Other Problems
- 30:35Program Sketching
- 32:27Algorithms vs Machines
- 33:40Conclusion
related talks
23mMake Quantum Computing Useful with Performance Enhancing Infrastructure Software
01h 02mQuantum Computing Concepts
01h 01mBuilding a Quantum Computer with QLDPC Codes
18mIntegrating Quantum Computers in High-Performance Computing Environments
19mExtracting maximum value from today's quantum computers while prep
41mQuantum Computing in Practice: Where We Are, What Works, and What’s Next
47mUnboxing Quantum Computing
35mThe Quantum Computing Future