30 citations · 36 across the 2 of their papers we have counts for
8 papers · 1 filter
Qubit-efficient exponential suppression of errors
Piotr Czarnik, Andrew Arrasmith, Lukasz Cincio +1
Achieving a practical advantage with near-term quantum computers hinges on having effective methods to suppress errors. Recent breakthroughs have introduced methods capable of expo…
Long-time simulations with high fidelity on quantum hardware
Joe Gibbs, Kaitlin Gili, Zoë Holmes +5
Moderate-size quantum computers are now publicly accessible over the cloud, opening the exciting possibility of performing dynamical simulations of quantum systems. However, while…
Variational Quantum Algorithms
M. Cerezo, Andrew Arrasmith, Ryan Babbush +8
Applications such as simulating complicated quantum systems or solving large-scale linear algebra problems are very challenging for classical computers due to the extremely high co…
Effect of barren plateaus on gradient-free optimization
Andrew Arrasmith, M. Cerezo, Piotr Czarnik +2
Barren plateau landscapes correspond to gradients that vanish exponentially in the number of qubits. Such landscapes have been demonstrated for variational quantum algorithms and q…
Unified approach to data-driven quantum error mitigation
Angus Lowe, Max Hunter Gordon, Piotr Czarnik +3
Achieving near-term quantum advantage will require effective methods for mitigating hardware noise. Data-driven approaches to error mitigation are promising, with popular examples…
Operator Sampling for Shot-frugal Optimization in Variational Algorithms
Andrew Arrasmith, Lukasz Cincio, Rolando D. Somma +1
Quantum chemistry is a near-term application for quantum computers. This application may be facilitated by variational quantum-classical algorithms (VQCAs), although a concern for…