2 citations · 5 across the 12 of their papers we have counts for
13 papers
Digital quantum state preparation by nucleation
Jean Paul Sadia, Morten Hjorth-Jensen, Dean Lee +1
Quantum state preparation is crucial for quantum algorithms, and improved state preparation methods can reduce resource requirements by orders of magnitude. In this work, we introd…
Propaq: A Python package for Heisenberg Propagation
Hrishikesh Belagali, Ryan LaRose
We introduce Propaq, a performant and flexible Python package implementing Heisenberg propagation techniques for classically simulating quantum circuits. Propaq is compatible with…
Satisfying Quantum Codes: Physics-Informed and Hardware-Aware Code Design with SAT Solvers
Ben DalFavero, William M. Watkins, Margarite L. LaBorde +4
Although quantum error correction is widely believed to be necessary for impactful applications of quantum computers, the design of quantum error correction codes is largely done b…
Efficient classical simulation of large-scale unitary cluster Jastrow circuits
Hrishikesh Belagali, Thomas Van Camp, R. Pradeep +3
Recent experiments on quantum computers have challenged the limits of classical computation in chemistry, simulating ground states of strongly correlated molecules. Many of these e…
Opportunities and challenges in scaling quantum error detection on hardware
Yanis Le Fur, Ethan Egger, Hong-Ye Hu +3
Quantum error detection can produce unbiased expectation values that exponentially converge to noiseless results as the code distance is increased. Despite this, its performance as…
Overlapped groupings for quantum energy estimation: Maximal variance reduction and deterministic algorithms for reducing variance
Jeremiah Rowland, Rahul Sarkar, Nicolas PD Sawaya +2
Grouping-based measurement strategies are widely used to reduce measurement complexity in near-term quantum algorithms. While these schemes have typically produced disjoint groups,…
The cost of quantum algorithms for biochemistry: A case study in metaphosphate hydrolysis
Ryan LaRose, Antonios M. Alvertis, Alan Bidart +10
We evaluate the quantum resource requirements for ATP/metaphosphate hydrolysis, one of the most important reactions in all of biology with implications for metabolism, cellular sig…
Quantum State Preparation with Resolution Refinement
Scott Bogner, Heiko Hergert, Morten Hjorth-Jensen +3
We introduce a method called resolution refinement that allows one to bootstrap eigenstate preparation on a quantum computer. We first prepare an eigenstate of a low-resolution Ham…
Error mitigation for partially error-corrected quantum computers
Ben DalFavero, Ryan LaRose
We present a method for quantum error mitigation on partially error-corrected quantum computers - i.e., computers with some logical qubits and some noisy qubits. Our method is insp…
A brief history of quantum vs classical computational advantage
Ryan LaRose
In this review article we summarize all experiments claiming quantum computational advantage to date. Our review highlights challenges, loopholes, and refutations appearing in subs…
Non-Clifford diagonalization for measurement shot reduction in quantum expectation value estimation
Nicolas P. D. Sawaya, Daan Camps, Ben DalFavero +3
Estimating expectation values on near-term quantum computers often requires a prohibitively large number of measurements. One widely-used strategy to mitigate this problem has been…
Measurement reduction for expectation values via fine-grained commutativity
Ben DalFavero, Rahul Sarkar, Jeremiah Rowland +3
We introduce a notion of commutativity between operators on a tensor product space, nominally Pauli strings on qubits, that interpolates between qubit-wise commutativity and (full)…
BGLS: A Python Package for the Gate-by-Gate Sampling Algorithm to Simulate Quantum Circuits
Alex Shapiro, Ryan LaRose
The classical simulation of quantum computers is in general a computationally hard problem. To emulate the behavior of realistic devices, it is sufficient to sample bitstrings from…