Quantum simulations of one dimensional quantum systems

Abstract: We present quantum algorithms for the simulation of quantum systems in one spatial dimension, which result in quantum speedups that range from superpolynomial to polynomial. We first describe a method to simulate the evolution of the quantum harmonic oscillator (QHO) based on a refined analysis of the Trotter-Suzuki formula that exploits the Lie algebra structure. For total evolution time $t$ and precision $\epsilon>0$, the complexity of our method is $ O(\exp(\gamma \sqrt{\log(N/\epsilon)}))$, where $\gamma>0$ is a constant and $N$ is the quantum number associated with an "energy cutoff" of the initial state. Remarkably, this complexity is subpolynomial in $N/\epsilon$. We also provide a method to prepare discrete versions of the eigenstates of the QHO of complexity polynomial in $\log(N)/\epsilon$, where $N$ is the dimension or number of points in the discretization. This method may be of independent interest as it provides a way to prepare, e.g., quantum states with Gaussian-like amplitudes. Next, we consider a system with a quartic potential. Our numerical simulations suggest a method for simulating the evolution of sublinear complexity $\tilde O(N^{1/3+o(1)})$, for constant $t$ and $\epsilon$. We also analyze complex one-dimensional systems and prove a complexity bound $\tilde O(N)$, under fairly general assumptions. Our quantum algorithms may find applications in other problems. As an example, we discuss the fractional Fourier transform, a generalization of the Fourier transform that is useful for signal analysis and can be formulated in terms of the evolution of the QHO.

Quantum Simulations of One-Dimensional Quantum Systems

The paper authored by Rolando D. Somma, explores quantum algorithms to simulate quantum systems in one spatial dimension, specifically focusing on the quantum harmonic oscillator (QHO) and quartic potential systems. The work is anchored on the analysis of the Trotter-Suzuki formula and its implications for algorithmic complexity in quantum simulations. The primary objectives include establishing quantum speedups in simulating these systems, understanding the precision requirements, and addressing computational challenges associated with continuous-variable quantum systems.

In the investigation of the quantum harmonic oscillator, the study delves into the intricacies of simulating the evolution operator using refined Trotter-Suzuki approximations. Noteworthy, the complexity achieved for simulating the QHO under specific conditions is subpolynomial concerning parameters (N/\epsilon), where (N) denotes the quantum number associated with the energy cutoff, and (\epsilon) is the precision. The resultant complexity for simulating the QHO evolution operator is (O(\exp(\gamma \sqrt{\log(N/\epsilon)}))), highlighting a remarkable subexponential scaling.

Moreover, the exploration includes quantum algorithms for preparing discrete eigenstates of the QHO with polynomial complexity in (\log(N)/\epsilon). This advancement is significant for efficiently preparing states with Gaussian-like amplitudes, a feature that could have broader implications for state preparation in quantum computing and simulation.

The paper progresses to consider systems with quartic potential, where numerical simulations suggest a method exhibiting sublinear complexity (\tilde{O}(N^{1/3+o(1)})), conditioned on constant (t) and (\epsilon). This proposed approach accounts for polynomial quantum speedup relative to classical counterparts, further embracing the potential of quantum algorithms in handling complex quantum systems and the computational advantages they may offer.

Concerning theoretical implications, the study presents empirical evidence and theoretical formulations to suggest significant quantum algorithmic advantages. These advantages span beyond the harmonic oscillator, extending towards more complex one-dimensional systems. Particularly, the usage of fractional Fourier transforms as another example of potential application underscores the versatility of the developed quantum algorithms in broader scientific and computational contexts.

Future directions and development in AI, particularly for quantum computing, may naturally arise from the methods and results discussed in the paper. For instance, the demonstrated capabilities in simulating quantum systems with refined algorithmic complexity prompts further exploration into high-dimensional and multi-variable quantum systems, a step towards more comprehensive quantum computational models.

In summary, this paper contributes substantial advancements to quantum simulations by leveraging refined analysis and new quantum algorithmic approaches. It sets a promising direction for tackling and efficiently computing the dynamics of quantum systems in one-dimensional contexts, with clear implications and utility in quantum technology and computational sciences.