From the 1 of 1.7k papers with an AI index.
24.4k citations
- University of California, BerkeleyUS97 papers
- Stanford UniversityUS81 papers
- Massachusetts Institute of TechnologyUS75 papers
- Google DeepMind (United Kingdom)GB60 papers
- Carnegie Mellon UniversityUS54 papers
- University of TorontoCA54 papers
- Princeton UniversityUS51 papers
- Cornell UniversityUS49 papers
- University of Illinois Urbana-ChampaignUS41 papers
- Columbia UniversityUS35 papers
- University of WashingtonUS35 papers
- University of California, Santa BarbaraUS34 papers
5 papers · 2 filters
Quantum block lookahead adders and the wait for magic states
Craig Gidney
We improve the Toffoli count of low depth quantum adders, and analyze how their spacetime cost reacts to having a limited number of magic state factories. We present a block lookah…
Microwaves in Quantum Computing
Joseph C. Bardin, Daniel H. Slichter, David J. Reilly
Quantum information processing systems rely on a broad range of microwave technologies and have spurred development of microwave devices and methods in new operating regimes. Here…
Focus beyond quadratic speedups for error-corrected quantum advantage
Ryan Babbush, Jarrod McClean, Michael Newman +3
In this perspective, we discuss conditions under which it would be possible for a modest fault-tolerant quantum computer to realize a runtime advantage by executing a quantum algor…
The Snake Optimizer for Learning Quantum Processor Control Parameters
Paul V. Klimov, Julian Kelly, John M. Martinis +1
High performance quantum computing requires a calibration system that learns optimal control parameters much faster than system drift. In some cases, the learning procedure require…
Investigating Quantum Approximate Optimization Algorithms under Bang-bang Protocols
Daniel Liang, Li Li, Stefan Leichenauer
The quantum approximate optimization algorithm (QAOA) is widely seen as a possible usage of noisy intermediate-scale quantum (NISQ) devices. We analyze the algorithm as a bang-bang…