Related papers: A Quantum Algorithm for the Linear Response of Nuc…
Important nonlinear dynamics, such as those found in plasma and fluid systems, are typically hard to simulate on classical computers. Thus, if fault-tolerant quantum computers could efficiently solve such nonlinear problems, it would be a…
The complex-scaling method can be used to calculate molecular resonances within the Born-Oppenheimer approximation, assuming the electronic coordinates are dilated independently of the nuclear coordinates. With this method, one will…
We describe a method for obtaining the scattering matrix for nuclear or chemical reactions on a finite lattice. Aside from the preparation of the initial and final states as wave packets, the only other operation required is unitary time…
In recent years, energy correlators have emerged as powerful observables for probing the fragmentation dynamics of high-energy collisions. We introduce the first numerical strategy for calculating energy correlators using the Hamiltonian…
We propose a polynomial-time algorithm for simulation of the class of pairing Hamiltonians, e.g., the BCS Hamiltonian, on an NMR quantum computer. The algorithm adiabatically finds the low-lying spectrum in the vicinity of the gap between…
Quantum computers have the potential of solving certain problems exponentially faster than classical computers. Recently, Harrow, Hassidim and Lloyd proposed a quantum algorithm for solving linear systems of equations: given an $N\times{N}$…
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.…
Identifying the Hamiltonian of a quantum system from experimental data is considered. General limits on the identifiability of model parameters with limited experimental resources are investigated, and a specific Bayesian estimation…
We propose an iterative algorithm to simulate the dynamics generated by any $n$-qubit Hamiltonian. The simulation entails decomposing the unitary time evolution operator $U$ (unitary) into a product of different time-step unitaries. The…
The dynamics of the nuclear-spin quantum computer with large number (L=1000) of qubits is considered using a perturbation approach, based on approximate diagonalization of exponentially large sparse matrices. Small parameters are introduced…
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…
This paper summarizes a quantum algorithm of [R.D. Somma, et.al., Phys. Rev. Lett. 101, 130504 (2008)] that simulates a classical annealing process for solving discrete optimization problems. The complexity of the quantum algorithm scales…
The development of tailored materials for specific applications is an active field of research in chemistry, material science and drug discovery. The number of possible molecules that can be obtained from a set of atomic species grow…
We explore Davidson methods for obtaining excitation energies and other linear response properties within quantum self-consistent linear response (q-sc-LR) theory. Davidson-type methods allow for obtaining only a few selected excitation…
We present a quantum algorithm for the dynamical simulation of time-dependent Hamiltonians. Our method involves expanding the interaction-picture Hamiltonian as a sum of generalized permutations, which leads to an integral-free Dyson series…
In computer simulations, quantum delocalization of atomic nuclei can be modeled making use of the Path Integral (PI) formulation of quantum statistical mechanics. This approach, however, comes with a large computational cost. By restricting…
Linear differential equations are ubiquitous in science and engineering. Quantum computers can simulate quantum systems, which are described by a restricted type of linear differential equations. Here we extend quantum simulation algorithms…
Quantum computing employs controllable interactions to perform sequences of logical gates and entire algorithms on quantum registers. This paradigm has been widely explored, e.g., for simulating dynamics of manybody systems by decomposing…
We outline refined versions of two major quantum algorithms for performing principal component analysis and solving linear equations. Our methods are exponentially faster than their classical counterparts and even previous quantum…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? We provide an efficient algorithm to simulate any desired two-body Hamiltonian evolution using any fixed two-body entangling n-qubit…