Related papers: Efficient and precise quantum simulation of ultra-…
Transport phenomena play a key role in a variety of application domains, and efficient simulation of these dynamics remains an outstanding challenge. While quantum computers offer potential for significant speedups, existing algorithms…
We present a quantum algorithm for the calculation of scattering amplitudes of massive charged scalar particles in scalar quantum electrodynamics. Our algorithm is based on continuous-variable quantum computing architecture resulting in…
We demonstrate and test the adiabatic projection method, a general new framework for calculating scattering and reactions on the lattice. The method is based upon calculating a low-energy effective theory for clusters which becomes exact in…
What makes a class of quantum circuits efficiently classically simulable on average? I present a framework that applies harmonic analysis of groups to circuits with a structure encoded by group parameters. Expanding the circuits in a…
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…
We propose a method for enacting the unitary time propagation of two interacting neutrons at leading order of chiral effective field theory by efficiently encoding the nuclear dynamics into a single multi-level quantum device. The emulated…
Simulating physical systems with variational quantum algorithms is a well-studied approach, but it is challenging to implement in current devices due to demands in qubit number and circuit depth. We show how limited knowledge of the system,…
It is difficult to calculate the energy levels and eigenstates of a large physical system on a classical computer because of the exponentially growing size of the Hilbert space. In this work, we experimentally demonstrate a quantum…
The difficulty of simulating quantum dynamics depends on the norm of the Hamiltonian. When the Hamiltonian varies with time, the simulation complexity should only depend on this quantity instantaneously. We develop quantum simulation…
We report the quantum computing of reacting flows by simulating the Hamiltonian dynamics. The scalar transport equation for reacting flows is transformed into a Hamiltonian system, mapping the dissipative and non-Hermitian problem in…
We investigate the quantum algorithm of Babbush et al. (arXiv:2303.13012v3) for simulating coupled harmonic oscillators, which promises exponential speedups over classical methods. Focusing on linearly connected oscillator chains, we bridge…
Approximation errors must be taken into account when compiling quantum programs into a low-level gate set. We present a methodology that tracks such errors automatically and then optimizes accuracy parameters to guarantee a specified…
Quantum computers can efficiently simulate Lindbladian dynamics, enabling powerful applications in open system simulation, thermal and ground-state preparation, autonomous quantum error correction, dissipative engineering, and more. Despite…
Simulation of continuous time evolution requires time discretization on both classical and quantum computers. A finer time step improves simulation precision, but it inevitably leads to increased computational efforts. This is particularly…
We propose an orbifold lattice formulation of QCD suitable for quantum simulations. We show explicitly how to encode gauge degrees of freedom into qubits using noncompact variables, and how to write down a simple truncated Hamiltonian in…
Digital quantum simulation has broad applications in approximating unitary evolution of Hamiltonians. In practice, many simulation tasks for quantum systems focus on quantum states in the low-energy subspace instead of the entire Hilbert…
The R-matrix method is a fully-quantum time-independent scattering method, used to simulate nuclear, electron-atom, electron-ion, electron-molecule scattering and more. Here, a novel R-matrix method, RmatReact, is presented as applied to…
To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations…
We present a quantum averaging theory (QAT) for analytically modeling unitary gate dynamics in driven quantum systems beyond the rotating-wave approximation. QAT addresses the simultaneous presence of distinct timescales by generating a…
A Euclidean formulation of relativistic quantum mechanics is discussed. Representations of the Hilbert space inner product and Poincar\'e generators are all expressed in terms of Euclidean space-time variables. The formulation does not…