387 citations
- Fermi National Accelerator LaboratoryUS16 papers
- Ames National LaboratoryUS11 papers
- Ames Research CenterUS10 papers
- University of Colorado BoulderUS10 papers
- National Institute of Standards and TechnologyUS9 papers
- Northwestern UniversityUS9 papers
- Iowa State UniversityUS8 papers
- Research Institute for Advanced Computer ScienceUS7 papers
- Lawrence Berkeley National LaboratoryUS5 papers
- Lawrence Livermore National LaboratoryUS5 papers
- Louisiana State UniversityUS5 papers
- University of California, BerkeleyUS4 papers
7 papers · 2 filters
Disentangling the sources of ionizing radiation in superconducting qubits
L. Cardani, I. Colantoni, A. Cruciani +27
Radioactivity was recently discovered as a source of decoherence and correlated errors for the real-world implementation of superconducting quantum processors. In this work, we mea…
Navigating the noise-depth tradeoff in adiabatic quantum circuits
Daniel Azses, Maxime Dupont, Bram Evert +2
Adiabatic quantum algorithms solve computational problems by slowly evolving a trivial state to the desired solution. On an ideal quantum computer, the solution quality improves mo…
Simulating long-range coherence of atoms and photons in quantum computers
Emanuele G. Dalla Torre, Matthew J. Reagor
Lasers and Bose-Einstein condensates (BECs) exhibit macroscopic quantum coherence in seemingly unrelated ways. Lasers possess a well-defined global phase and are characterized by l…
Implementing two-qubit gates at the quantum speed limit
Joel Howard, Alexander Lidiak, Casey Jameson +8
The speed of elementary quantum gates, particularly two-qubit gates, ultimately sets the limit on the speed at which quantum circuits can operate. In this work, we experimentally d…
An entanglement perspective on the quantum approximate optimization algorithm
Maxime Dupont, Nicolas Didier, Mark J. Hodson +2
Many quantum algorithms seek to output a specific bitstring solving the problem of interest--or a few if the solution is degenerate. It is the case for the quantum approximate opti…
Calibrating the Classical Hardness of the Quantum Approximate Optimization Algorithm
Maxime Dupont, Nicolas Didier, Mark J. Hodson +2
Trading fidelity for scale enables approximate classical simulators such as matrix product states (MPS) to run quantum circuits beyond exact methods. A control parameter, the so-ca…