44 citations · 236 across the 15 of their papers we have counts for
18 papers
LEAP: Scaling Numerical Optimization Based Synthesis Using an Incremental Approach
Ethan Smith, Marc G. Davis, Jeffrey Larson +3
While showing great promise, circuit synthesis techniques that combine numerical optimization with search over circuit structures face scalability challenges due to a large number…
Constant-Depth Circuits for Dynamic Simulations of Materials on Quantum Computers
Lindsay Bassman, Roel Van Beeumen, Ed Younis +3
Dynamic simulation of materials is a promising application for near-term quantum computers. Current algorithms for Hamiltonian simulation, however, produce circuits that grow in de…
Leveraging Randomized Compiling for the QITE Algorithm
Jean-Loup Ville, Alexis Morvan, Akel Hashim +13
The success of the current generation of Noisy Intermediate-Scale Quantum (NISQ) hardware shows that quantum hardware may be able to tackle complex problems even without error corr…
Randomized compiling for scalable quantum computing on a noisy superconducting quantum processor
Akel Hashim, Ravi K. Naik, Alexis Morvan +11
The successful implementation of algorithms on quantum processors relies on the accurate control of quantum bits (qubits) to perform logic gate operations. In this era of noisy int…
Heuristics for Quantum Compiling with a Continuous Gate Set
Marc Grau Davis, Ethan Smith, Ana Tudor +3
We present an algorithm for compiling arbitrary unitaries into a sequence of gates native to a quantum processor. As accurate CNOT gates are hard for the foreseeable Noisy- Interme…
Sums of Euler products and statistics of elliptic curves
Chantal David, Dimitris Koukoulopoulos, Ethan Smith
We present several results related to statistics for elliptic curves over a finite field as corollaries of a general theorem about averages of Euler products that we…