Related papers: Exponential quantum speedup in simulating coupled …
We present quantum algorithms for simulating the dynamics of a broad class of classical oscillator systems containing $2^n$ coupled oscillators (Eg: $2^n$ masses coupled by springs), including those with time-dependent forces, time-varying…
Simulating large-scale coupled-oscillator systems presents substantial computational challenges for classical algorithms, particularly when pursuing first-principles analyses in the thermodynamic limit. Motivated by the quantum algorithm…
We develop an analog classical simulation algorithm of noiseless quantum dynamics. By formulating the Schr\"{o}dinger equation into a linear system of real-valued ordinary differential equations (ODEs), the probability amplitudes of a…
We present a scheme to efficiently simulate, with a classical computer, the dynamics of multipartite quantum systems on which the amount of entanglement (or of correlations in the case of mixed-state dynamics) is conveniently restricted.…
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…
We present a two-dimensional classical stochastic differential equation for a displacement field of a point particle in two dimensions and show that its components define real and imaginary parts of a complex field satisfying the…
Consumption of magic states promotes the stabilizer model of computation to universal quantum computation. Here, we propose three different classical algorithms for simulating such universal quantum circuits, and characterize them by…
A recent promising arena for quantum advantage is simulating exponentially large classical systems. Here, we show how this advantage can be used to calculate the dynamics of open classical systems experiencing dissipation, including the…
Quantum algorithms for Hamiltonian simulation and linear differential equations more generally have provided promising exponential speed-ups over classical computers on a set of problems with high real-world interest. However, extending…
We present a quantum algorithm which simulates the quantum kicked rotator model exponentially faster than classical algorithms. This shows that important physical problems of quantum chaos, localization and Anderson transition can be…
The simulation of large-scale classical systems in exponentially small space on quantum computers has gained attention. The prior work demonstrated that a quantum algorithm offers an exponential speedup over any classical algorithm in…
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…
Simulating large scale lattice dynamics directly is computationally demanding due to the high complexity involved, yet such simulations are crucial for understanding the mechanical and thermal properties of many physical systems. In this…
We present a super-polynomial improvement in the precision scaling of quantum simulations for coupled classical-quantum systems in this paper. Such systems are found, for example, in molecular dynamics simulations within the…
A long-standing aim of quantum information research is to understand what gives quantum computers their advantage. This requires separating problems that need genuinely quantum resources from those for which classical resources are enough.…
Some of the most enduring questions in physics--including the quantum measurement problem and the quantization of gravity--involve the interaction of a quantum system with a classical environment. Two linearly coupled harmonic oscillators…
We obtain sufficient conditions for the efficient simulation of a continuous variable quantum algorithm or process on a classical computer. The resulting theorem is an extension of the Gottesman-Knill theorem to continuous variable quantum…
In a previous paper [J.S.Briggs and A.Eisfeld, Phys.Rev.A 85, 052111] we showed that the time-development of the complex amplitudes of N coupled quantum states can be mapped by the time development of positions and velocities of N coupled…
We devise a classical algorithm which efficiently computes the quantum expectation values arising in a class of continuous variable quantum circuits wherein the final quantum observable | after the Heisenberg evolution associated with the…
We propose a simple quantum algorithm for simulating highly oscillatory quantum dynamics, which does not require complicated quantum control logic for handling time-ordering operators. To our knowledge, this is the first quantum algorithm…