Abstract Quantum algorithms can potentially overcome the boundary of computationally hard problems. One of the cornerstones in modern optics is the beam propagation algorithm, facilitating the calculation of how waves with a particular dispersion relation propagate in time and space. This algorithm solves the wave propagation equation by Fourier transformation, multiplication with a transfer function, and subsequent back transformation. This transfer function is determined from the respective dispersion relation, which can often be expanded as a polynomial. In the case of paraxial wave propagation in free space or picosecond pulse propagation, this expansion can be truncated after the quadratic term. The classical solution to the wave propagation requires O ( NlogN ) computation steps, where N is the number of points into which the wave function is discretized. Here, we show that the propagation can be performed as a quantum algorithm with O logN 2 single-controlled phase gates, indicating exponentially reduced computational complexity. We herein demonstrate this quantum beam propagation method (QBPM) and perform such propagation in both one- and two-dimensional systems for the double-slit experiment and Gaussian beam propagation. We highlight the importance of the selection of suitable observables to retain the quantum advantage in the face of the statistical nature of the quantum measurement process, which leads to sampling errors that do not exist in classical solutions.
Abstract Quantum algorithms can potentially overcome the boundary of computationally hard problems. One of the cornerstones in modern optics is the beam propagation algorithm, facilitating the calculation of how waves with a particular dispersion relation propagate in time and space. This algorithm solves the wave propagation equation by Fourier transformation, multiplication with a transfer function, and subsequent back transformation. This transfer function is determined from the respective dispersion relation, which can often be expanded as a polynomial. In the case of paraxial wave propagation in free space or picosecond pulse propagation, this expansion can be truncated after the quadratic term. The classical solution to the wave propagation requires O ( NlogN ) computation steps, where N is the number of points into which the wave function is discretized. Here, we show that the propagation can be performed as a quantum algorithm with O logN 2 single-controlled phase gates, indicating exponentially reduced computational complexity. We herein demonstrate this quantum beam propagation method (QBPM) and perform such propagation in both one- and two-dimensional systems for the double-slit experiment and Gaussian beam propagation. We highlight the importance of the selection of suitable observables to retain the quantum advantage in the face of the statistical nature of the quantum measurement process, which leads to sampling errors that do not exist in classical solutions.
We propose a quantum algorithm that simulates the propagation of a light field through a weakly inhomogeneous medium. In the paraxial approximation, the wave equation in an inhomogeneous material takes the form of the Schrödinger equation with a time-dependent Hamiltonian. This reduction is used to simulate wave optical dynamics on a quantum computer. Beam propagator operators for a short propagation distance are constructed using an efficient and flexible block encoding that enables the simulation of various optical setups. The algorithm is showcased by simulating the propagation of a one-dimensional Gaussian beam through a lens of finite thickness, and the resulting spherical aberration is demonstrated.
Quantum simulation is a prominent application of quantum computers. While there is extensive previous work on simulating finite-dimensional systems, less is known about quantum algorithms for real-space dynamics. We conduct a systematic study of such algorithms. In particular, we show that the dynamics of a d -dimensional Schrödinger equation with η particles can be simulated with gate complexity O~(ηdFpoly(log(g′/ϵ))) , where ϵ is the discretization error, g′ controls the higher-order derivatives of the wave function, and F measures the time-integrated strength of the potential. Compared to the best previous results, this exponentially improves the dependence on ϵ and g′ from poly(g′/ϵ) to poly(log(g′/ϵ)) and polynomially improves the dependence on T and d , while maintaining best known performance with respect to η . For the case of Coulomb interactions, we give an algorithm using η3(d+η)Tpoly(log(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates, and another using η3(4d)d/2Tpoly(log(ηdTg′/(Δϵ)))/Δ one- and two-qubit gates and QRAM operations, where T is the evolution time and the parameter Δ regulates the unbounded Coulomb interaction. We give applications to several computational problems, including faster real-space simulation of quantum chemistry, rigorous analysis of discretization error for simulation of a uniform electron gas, and a quadratic improvement to a quantum algorithm for escaping saddle points in nonconvex optimization.
We propose a gate-based quantum algorithm for the prediction step of Bayesian state estimation based on the Fokker-Planck equation on a discretized position-velocity state space. The probability density is encoded in the amplitudes of a quantum state, enabling a compact representation of high-dimensional distributions. Exploiting the circulant structure of finite-difference operators, the evolution is realized in the spectral domain using quantum Fourier transforms and phase rotations.
A key result is that the drift component can be implemented exactly in amplitude space, leading to an accurate reproduction of the classical transport dynamics. In contrast, the diffusion term does not admit a linear representation in amplitude space due to the nonlinear relation between probability density and wave function. To enable a quantum implementation, we introduce a unitary surrogate based on a Wick rotation, transforming diffusion into a dispersive phase evolution. This yields a fully unitary propagation that can be implemented efficiently on a gate-based quantum computer. The proposed method is evaluated numerically for different scenarios and shows strong agreement with the exact solution of the Fokker-Planck equation. The approach demonstrates the potential of quantum computing for Bayesian state estimation, as the representable state space grows exponentially with the number of qubits. This allows the efficient representation and propagation of probability densities that would otherwise require complex tensor decompositions on classical hardware, making the method a promising candidate for high-dimensional filtering problems.
Summary form only given. Quantum computers are expected to increase the efficiency of solving problems such as factoring large integers. However an experimental implementation of even relatively simple quantum information processing with a few to a dozen qubits presents an enormous technological challenge. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing due to the ease with which photon interference can be observed. However these early proposals required huge single photon optical nonlinearities. Unfortunately currently available optical nonlinearities are too weak and too noisy to be useful. Recently however we have discovered that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photodetectors. Our methods exploit feed forward from photo-detectors and are robust against errors from photon loss and detector inefficiency. In this tutorial I will outline this scheme, highlighting the technical challenges required to implement it. The tutorial will be relatively self contained with a brief introduction to quantum optics and quantum computation.
This work considers the semi-classical description of two applications involving cold atoms. This is, on one hand, the behavior of a BOSE-EINSTEIN condensate in hybrid systems, i.e. in contact with a microscopic object (carbon nanotubes, fullerenes, etc.). On the other, the evolution of phase space distributions in matter wave interferometers utilizing ray tracing methods was discussed. For describing condensates in hybrid systems, one can map the GROSS-PITAEVSKII equation, a differential equation in the complex-valued macroscopic wave function, onto a system of two differential equations in density and phase. Neglecting quantum dispersion, one obtains a semiclassical description which is easily modified to incorporate interactions between condensate and microscopical object. In our model, these interactions comprise attractive forces (CASIMIR-POLDER forces) and loss of condensed atoms due to inelastic collisions at the surface of the object. Our model exhibited the excitation of sound waves that are triggered by the object’s rapid immersion, and spread across the condensate thereafter. Moreover, local particle loss leads to a shrinking of the bulk condensate. We showed that the total number of condensed particles is decreasing potentially in the beginning (large condensate, strong mean field interaction), while it decays exponentially in the long-time limit (small condensate, mean field inetraction negligible). For representing the physics of matter wave interferometers in phase space, we utilized the WIGNER function. In semi-classical approximation, which again consists in ignoring the quantum dispersion, this representation is subject to the same equation of motion as classical phase space distributions, i.e. the LIOUVILLE equation. This implies that time evolution of theWIGNER function follows a phase space flow that consists of classical trajectories (classical transport). This means, for calculating a time-evolved distribution, one has know the initial distribution and one has to solve the classical equations of motion. Concerning the initial distribution, we have studied a stationary solution of the nonlinear LIOUVILLE equation, the LAMBERT density. We saw that it agrees very well with results from singleparticle quantum mechanics as well as the MAXWELL-BOLTZMANN distribution in the weakly interacting limit. Likewise, in the strongly interacting limit, familiar results of the THOMAS-FERMI approximation are recovered. A distribution that is first prepared in a trap and then released can be described quite conveniently in terms of WIGNER functions. However, propagation in optical potentials associated to the interferometer elements (beam splitter, Pi-half-pulse) do not satisfy the condition of the semiclassical approximation. Nevertheless, one finds discrete before-after mappings that describe the effect of these elements on incident distributions. This leads to several channels of phase space propagation which relate to the interferometer paths and interferences between them. The formalism for WIGNER functions in an interferometer can be translated straightforwardly into a ray tracing algorithm. As mentioned above, this algorithm solves the classical equations of motion and computes time-evolved distributions, using values of the initial distribution. This procedure, in contrast to most analytical solutions, does not require the HAMILTON function to be quadratic (e.g. free propagation, const. acceleration, harmonic oscillator). We compared simulation results to analytic expressions in case of freely propagating GAUSS distribution. They showed perfect agreement, especially for the functional dependence of wave length and contrast of interference fringes on the laser pulse timings.
Modelling of electromagnetic wave propagation in telecommunications has evolved from empirical models to highly deterministic ray tracing and numerical methods. The extraordinary computational effort of these methods and their wave nature seem ideally suited to be approached by quantum algorithms. We first examine current progress by reviewing recent proposals in the field. We scrutinize potentially advantageous quantum architectures, ranging from mainstream gate-level computers and near-term, mid-scale noisy architectures with limited capabilities, to adiabatic and annealing approaches that are already in commercial use. We analyze the weaknesses and strengths of recent proposals. Beyond the core algorithm, mechanisms to bridge the quantum and classical worlds are of particular interest. Extremely diverse algorithm specifications, from those based on Hamiltonian simulations and emulation of variational optimization to the unconstrained binary formulation, are compared with the use of pure gate-level circuits and known quantum subroutines. We show that the graph Laplacian, given its ability to integrate boundary conditions, is uniquely suited for quantum propagation modelling algorithms rooted in differential numerical methods. Quantum computers could overcome the temporal and spatial limitations of classical methods for larger computational domains and, to some extent, address the problems of dispersion and stability in finite-difference approximations. The ability to express the solution of a problem as an eigenvalue problem turns out to be an advantage in the quantum world, where eigenvalues and eigenvectors are inextricably intertwined with quantum mechanics. In this paper, we identify the most promising techniques and scenarios that hold the greatest potential.