598 citations · 5.7k across the 69 of their papers we have counts for
7 papers · 2 filters
Tight bounds on the simultaneous estimation of incompatible parameters
Jasminder S. Sidhu, Yingkai Ouyang, Earl T. Campbell +1
The estimation of multiple parameters in quantum metrology is important for a vast array of applications in quantum information processing. However, the unattainability of fundamen…
Compilation by stochastic Hamiltonian sparsification
Yingkai Ouyang, David R. White, Earl T. Campbell
Simulation of quantum chemistry is expected to be a principal application of quantum computing. In quantum simulation, a complicated Hamiltonian describing the dynamics of a quantu…
The Role of Multiplicative Complexity in Compiling Low T-count Oracle Circuits
Giulia Meuli, Mathias Soeken, Earl Campbell +2
We present a constructive method to create quantum circuits that implement oracles for -variabl…
Efficient quantum measurement of Pauli operators in the presence of finite sampling error
Ophelia Crawford, Barnaby van Straaten, Daochen Wang +3
Estimating the expectation value of an operator corresponding to an observable is a fundamental task in quantum computation. It is often impossible to obtain such estimates directl…
Lower bounds on the non-Clifford resources for quantum computations
Michael Beverland, Earl Campbell, Mark Howard +1
We establish lower-bounds on the number of resource states, also known as magic states, needed to perform various quantum computing tasks, treating stabilizer operations as free. O…
A quantum compiler for qudits of prime dimension greater than 3
Luke E. Heyfron, Earl Campbell
Prevailing proposals for the first generation of quantum computers make use of 2-level systems, or qubits, as the fundamental unit of quantum information. However, recent innovatio…