Related papers: Efficient Simulation of Sparse, Non-Local Fermion …
Simulating quantum systems is believed to be one of the first applications for which quantum computers may demonstrate a useful advantage. For many problems in physics, we are interested in studying the evolution of the electron-phonon…
Quantum computing promises to revolutionize many-body simulations for quantum chemistry, but its potential is constrained by limited qubits and noise in current devices. In this work, we introduce the Lossy Quantum Selected Configuration…
Simulating real-time dynamics of gauge theories represents a paradigmatic use case to test the hardware capabilities of a quantum computer, since it can involve non-trivial input states preparation, discretized time evolution, long-distance…
Simulating open quantum systems, which interact with external environments, presents significant challenges on noisy intermediate-scale quantum (NISQ) devices due to limited qubit resources and noise. In this paper, we propose an efficient…
Moderate-size quantum computers are now publicly accessible over the cloud, opening the exciting possibility of performing dynamical simulations of quantum systems. However, while rapidly improving, these devices have short coherence times,…
Today's experimental noisy quantum processors can compete with and surpass all known algorithms on state-of-the-art supercomputers for the computational benchmark task of Random Circuit Sampling [1-5]. Additionally, a circuit-based quantum…
Establishing the precise computational boundary between classically tractable fermionic systems and those capable of genuine quantum advantage is a central challenge in quantum simulation. While injecting non-Gaussian ``magic" inputs into…
Understanding the dynamics of quantum systems is crucial in many areas of physics, but simulating many-body systems presents significant challenges due to the large Hilbert space to navigate and the exponential growth of computational…
Quantum computers offer the potential to simulate nuclear processes that are classically intractable. With the goal of understanding the necessary quantum resources to realize this potential, we employ state-of-the-art…
Quantum many-body systems out of equilibrium pose some of the most intriguing questions in physics. Unfortunately, numerically keeping track of time evolution of states under Hamiltonian dynamics constitutes a severe challenge for all known…
The simulation of strongly correlated fermionic systems remains one of the most significant challenges in computational physics due to the exponential growth of the Hilbert space and the fermionic sign problem. In this work, we present a…
The quantum stochastic drift protocol, also known as qDRIFT, has become a popular algorithm for implementing time-evolution of quantum systems using randomised compiling. In this work we develop qFLO, a higher order randomised algorithm for…
In order to model realistic quantum devices it is necessary to simulate quantum systems strongly coupled to their environment. To date, most understanding of open quantum systems is restricted either to weak system-bath couplings, or to…
Computing the ground-state properties of quantum many-body systems is a promising application of near-term quantum hardware with a potential impact in many fields. The conventional algorithm quantum phase estimation uses deep circuits and…
We prove classical simulation hardness, under the generalized $\mathsf{P}\neq\mathsf{NP}$ conjecture, for quantum circuit families with applications in near-term chemical ground state estimation. The proof exploits a connection to particle…
Simulating molecular systems on quantum computers requires efficient mappings from Fermionic operators to qubit operators. Traditional mappings such as Jordan-Wigner or Bravyi-Kitaev often produce high-weight Pauli terms, increasing circuit…
Number-conserved subspace encoding reduces resources needed for quantum simulations, but scalable complexity trade-off bounds for $M$ modes and $N$ particles with $\mathcal{O}(N\log M)$ qubits have remained unknown. We study…
Simulating out-of-equilibrium dynamics of quantum field theories in nature is challenging with classical methods, but is a promising application for quantum computers. Unfortunately, simulating interacting bosonic fields involves a high…
Quantum simulation of fermionic Hamiltonians is a leading application of quantum computing, but accurate execution on present-day hardware is limited by error accumulation in deep Trotter circuits. We present a device-matched…
Combinatorial optimization is a promising application for near-term quantum computers, however, identifying performant algorithms suited to noisy quantum hardware remains as an important goal to potentially realizing quantum computational…