Related papers: Quantum Simulation of the First-Quantized Pauli-Fi…
We present a quantum algorithm for simulating the dynamics of a first-quantized Hamiltonian in real space based on the truncated Taylor series algorithm. We avoid the possibility of singularities by applying various cutoffs to the system…
The simulation of quantum dynamics calls for quantum algorithms working in first quantized grid encodings. Here, we propose a variational quantum algorithm for performing quantum dynamics in first quantization. In addition to the usual…
We explore the utilization of higher-order discretization techniques in optimizing the gate count needed for quantum computer based solutions of partial differential equations. To accomplish this, we present an efficient approach for…
We introduce novel algorithms for the quantum simulation of molecular systems which are asymptotically more efficient than those based on the Trotter-Suzuki decomposition. We present the first application of a recently developed technique…
We provide practical simulation methods for scalar field theories on a quantum computer that yield improved asymptotics as well as concrete gate estimates for the simulation and physical qubit estimates using the surface code. We achieve…
We provide a new approach for compiling quantum simulation circuits that appear in Trotter, qDRIFT and multi-product formulas to Clifford and non-Clifford operations that can reduce the number of non-Clifford operations by a factor of up to…
First quantized, grid-based methods for chemistry modelling are a natural and elegant fit for quantum computers. However, it is infeasible to use today's quantum prototypes to explore the power of this approach, because it requires a…
Quantum simulations of chemistry in first quantization offer important advantages over approaches in second quantization including faster convergence to the continuum limit and the opportunity for practical simulations outside the…
Light-matter coupled Hamiltonians are central to cavity materials engineering and polaritonic chemistry, but are challenging to simulate with classical hardware due to the scaling of the Hilbert space with the number of quantum photon modes…
Quantum algorithms for selecting a subspace of Hamiltonians to diagonalize have emerged as a promising alternative to variational algorithms in the NISQ era. So far, such algorithms, which include the quantum selected configuration…
Extracting the Hamiltonian of interacting quantum-information processing systems is a keystone problem in the realization of complex phenomena and large-scale quantum computers. The remarkable growth of the field increasingly requires…
We present a quantum algorithm based on repeated measurement to solve initial-value problems for nonlinear ordinary differential equations (ODEs), which may be generated from partial differential equations in plasma physics. We map a…
Scaling the size of monolithic quantum computer systems is a difficult task. As the number of qubits within a device increases, a number of factors contribute to decreases in yield and performance. To meet this challenge, distributed…
Simulation of the Hubbard model is a leading candidate for the first useful applications of a fault-tolerant quantum computer. A recent study of quantum algorithms for early simulations of the Hubbard model [Kivlichan \textit{et al.}…
Quantum algorithms for electronic-structure simulations are actively being developed, yet many hybrid quantum-classical approaches are bottlenecked by the measurement overhead associated with large molecular Hamiltonians. Here we introduce…
In this work, we present a quantum algorithm for direct first-principles simulation of electron-nuclear dynamics on a first-quantized real-space grid. Our algorithm achieves best-in-class efficiency for block-encoding the…
Solving the electronic structure problem via unitary evolution of the electronic Hamiltonian is one of the promising applications of digital quantum computers. One of the practical strategies to implement the unitary evolution is via…
Quantum chemistry and materials science are among the most promising areas for demonstrating algorithmic quantum advantage and quantum utility due to their inherent quantum mechanical nature. Still, large-scale simulations of quantum…
Many applications of practical interest rely on time evolution of Hamiltonians that are given by a sum of Pauli operators. Quantum circuits for exact time evolution of single Pauli operators are well known, and can be extended trivially to…
Recent work has deployed linear combinations of unitaries techniques to reduce the cost of fault-tolerant quantum simulations of correlated electron models. Here, we show that one can sometimes improve upon those results with optimized…