Quantum technology promises to revolutionize how we learn about the physical world. An
experiment that processes quantum data with a quantum computer could have substantial …

The recent proliferation of NISQ devices has made it imperative to understand their power. In
this work, we define and study the complexity class NISQ, which encapsulates problems that …

There has been recent promising experimental and theoretical evidence that quantum
computational tools might enhance the precision and efficiency of physical experiments …

Quantum nuclear dynamics with wavepacket time evolution is classically intractable and
viewed as a promising avenue for quantum information processing. Here, we use IonQ …

We present a procedure to reduce the depth of quantum circuits and improve the accuracy of
results in computing post-Hartree–Fock electronic structure energies in large molecular …

In this paper, we study the problem of learning an unknown quantum circuit of a certain
structure. If the unknown target is an-qubit Clifford circuit, we devise an efficient algorithm to …

The accurate determination of chemical properties is known to have a critical impact on
multiple fundamental chemical problems but is deeply hindered by the steep algebraic …

This paper studies the quantum computational complexity of the discrete logarithm (DL) and
related group-theoretic problems in the context of “generic algorithms”—that is, algorithms …

The exponential scaling of the quantum degrees of freedom with the size of the system is
one of the biggest challenges in computational chemistry and particularly in quantum …

Simon's problem is one of the most important problems demonstrating the power of quantum
algorithms, as it greatly inspired the proposal of Shor's algorithm. The generalized Simon's …