9 papers
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…
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…
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…