相关论文: Efficient simulation of one-dimensional quantum ma…
Quantum computers could potentially simulate the dynamics of systems such as polyatomic molecules on a much larger scale than classical computers. We investigate a general quantum computational algorithm that simulates the time evolution of…
We review our results for the dynamics of isolated many-body quantum systems described by one-dimensional spin-1/2 models. We explain how the evolution of these systems depends on the initial state and the strength of the perturbation that…
Recent progress in the development of quantum technologies has enabled the direct investigation of dynamics of increasingly complex quantum many-body systems. This motivates the study of the complexity of classical algorithms for this…
Quantum simulators have made a remarkable progress towards exploring the dynamics of many-body systems, many of which offer a formidable challenge to both theoretical and numerical methods. While state-of-the-art quantum simulators are in…
IBM quantum computers are used to simulate the dynamics of small systems of interacting quantum spins. For time-independent systems with fewer than three spins, we compute the exact time evolution at arbitrary times and measure spin…
We discuss efficient simulation and certification of the dynamics induced by a quantum many-body Hamiltonian with short-ranged interactions, extending prior results for one-dimensional systems [Osborne, Phys. Rev. Lett. 97, 157202 (2006)…
We present the method of walk-sum to study the real-time dynamics of interacting quantum many-body systems. The walk-sum method generates explicit expressions for any desired pieces of an evolution operator U independently of any others.…
We propose a general framework of quantum kinetic Monte Carlo algorithm, based on a stochastic representation of a series expansion of the quantum evolution. Two approaches have been developed in the context of quantum many-body spin…
We introduce a method to efficiently study the dynamical properties of many-body localized systems in the regime of strong disorder and weak interactions. Our method reproduces qualitatively and quantitatively the real-time evolution with a…
The physics of quantum mechanics is the inspiration for, and underlies, quantum computation. As such, one expects physical intuition to be highly influential in the understanding and design of many quantum algorithms, particularly…
We present a low-space overhead simulation algorithm based on the truncated Dyson series for time-dependent quantum dynamics. This algorithm is applied to simulating time-independent Hamiltonians by transitioning to the interaction picture,…
This report is concerned with the efficiency of numerical methods for simulating quantum spin systems, with the aim to implement an improved method for simulation of a time-dependent Hamiltonian that displays chirped pulses at a high…
We describe a simple method for simulating time-independent Hamiltonian $H$ that could be decomposed as $H = \sum_{i=1}^m H_i$ where each $H_i$ can be efficiently simulated. Approaches relying on product formula generally work by splitting…
A strong analog classical simulation of general quantum evolution is proposed, which serves as a novel scheme in quantum computation and simulation. The scheme employs the approach of geometric quantum mechanics and quantum informational…
Compared with time independent Hamiltonians, the dynamics of generic quantum Hamiltonians $H(t)$ are complicated by the presence of time ordering in the evolution operator. In the context of digital quantum simulation, this difficulty…
What interactions are sufficient to simulate arbitrary quantum dynamics in a composite quantum system? Dodd et al. (quant-ph/0106064) provided a partial solution to this problem in the form of an efficient algorithm to simulate any desired…
Simulation of quantum systems is notoriously challenging for classical computers, while quantum hardware is naturally well-suited for this task. However, the imperfections of contemporary quantum systems poses a considerable challenge in…
The simulation of quantum systems is a task for which quantum computers are believed to give an exponential speedup as compared to classical ones. While ground states of one-dimensional systems can be efficiently approximated using Matrix…
Simulating the time-evolution of quantum mechanical systems is BQP-hard and expected to be one of the foremost applications of quantum computers. We consider classical algorithms for the approximation of Hamiltonian dynamics using…
The physics of a closed quantum mechanical system is governed by its Hamiltonian. However, in most practical situations, this Hamiltonian is not precisely known, and ultimately all there is are data obtained from measurements on the system.…