We study path integration on a quantum computer that performs quantum summation. We assume that the measure of path integration is Gaussian, with the eigenvalues of its covariance operator of order j^{-k} with k>1. For the Wiener measure occurring in many applications we have k=2. We want to compute an $\e$-approximation to path integrals whose integrands are at least Lipschitz. We prove:
1. Path integration on a quantum computer is tractable.
2. Path integration on a quantum computer can be solved roughly $\e^{-1}$ times faster than on a classical computer using randomization, and exponentially faster than on a classical computer with a worst case assurance.
3.The number of quantum queries is the square root of the number of function values needed on a classical computer using randomization. More precisely, the number of quantum queries is at most $4.22 \e^{-1}$. Furthermore, a lower bound is obtained for the minimal number of quantum queries which shows that this bound cannot be significantly improved.
4.The number of qubits is polynomial in $\e^{-1}$. Furthermore, for the Wiener measure the degree is 2 for Lipschitz functions, and the degree is 1 for smoother integrands.
We have analyzed an efficient integration of the multi-qubit echo quantum memory into the quantum computer scheme on the atomic resonant ensembles in quantum electrodynamics cavity. Here, one atomic ensemble with controllable inhomogeneous broadening is used for the quantum memory node and other atomic ensembles characterized by the homogeneous broadening of the resonant line are used as processing nodes. We have found optimal conditions for efficient integration of multi-qubit quantum memory modified for this analyzed physical scheme and we have determined a specified shape of the self tempor…
This paper reviews and generalizes Feynman's path integration methods which use time slicing with straight line segments and Fourier sine series. The generalizations are done from variational calculus considerations and in one dimension for simplicity in demonstrating concepts.
Monte Carlo integration approximates an integral of a black-box function by taking the average of many evaluations (i.e., samples) of the function (integrand). For $N$ queries of the integrand, Monte Carlo integration achieves the estimation error of $O(1/ \sqrt{N})$. Recently, Johnston introduced quantum supersampling (QSS) into rendering as a numerical integration method that can run on quantum computers. QSS breaks the fundamental limitation of the $O(1/ \sqrt{N})$ convergence rate of Monte Carlo integration and achieves the faster convergence rate. We introduce yet another quantum numerica…
In the path integral formulation of quantum mechanics, the phase factor Exp[iS(x[t])] is associated with every path x[t]. Summing this factor over all paths yields Feynman's propagator as a sum-over-paths. In the original formulation, the complex phase was a mathematical device invoked to extract wave behaviour in a particle framework. In this paper we show that the phase itself can have a physical origin in time reversal, and that the propagator can be drawn by a single deterministic path.
The propagator associated to the potential barrier $V=V_{0}\cosh ^{-2}(ωx)$ is obtained by solving path integrals. The method of delta functionals based on canonical and other transformations is used to reduce the path integral for this potential into a path integral for the Morse potential problem. The dimensional extension technique is seen to be essential for performing the multiple integral representation of the propagator. The correctly normalized scattering wave functions and the scattering function are derived. To test the method employed, the free particle and the $δ-$function barrier …
Identifying computational tasks suitable for (future) quantum computers is an active field of research. Here we explore utilizing quantum computers for the purpose of solving differential equations. We consider two approaches: (i) basis encoding and fixed-point arithmetic on a digital quantum computer, and (ii) representing and solving high-order Runge-Kutta methods as optimization problems on quantum annealers. As realizations applied to two-dimensional linear ordinary differential equations, we devise and simulate corresponding digital quantum circuits, and implement and run a 6$^{\mathrm{th…
A computational problem fed into a gate-model quantum computer identifies an objective function with a particular computational pathway (objective function connectivity). The solution of the computational problem involves identifying a target objective function value that is the subject to be reached. A bottleneck in a gate-model quantum computer is the requirement of several rounds of quantum state preparations, high-cost run sequences, and multiple rounds of measurements to determine a target (optimal) state of the quantum computer that achieves the target objective function value. Here, we …
We present an architecture to investigate wave-particle duality in $N$-path interferometers on a universal quantum computer involving as low as $2\log N$ qubits and develop a measurement scheme which allows the efficient extraction of quantifiers of interference visibility and which-path information. We implement our algorithms for interferometers with up to $N=16$ paths in proof-of-principle experiments on a noisy intermediate-scale quantum (NISQ) device using down to $\mathcal{O}(\log N)$ gates and despite increasing noise consistently observe a complementary behavior between interference vi…
Performing efficient quantum computer tuneup and calibration is essential for growth in system complexity. In this work we explore the link between facilitating such capabilities and the underlying architecture of the physical hardware. We focus on the specific challenge of measuring (``mapping'') spatially inhomogeneous quasi-static calibration errors using spectator qubits dedicated to the task of sensing and calibration. We introduce a novel architectural concept for such spectator qubits: arranging them spatially according to prescriptions from optimal 2D approximation theory. We show that…
The Feynman-Kac path integration problem was studied in the worst case setting by Plaskota et al. (J. Comp. Phys. 164 (2000) 335) for the univariate case and by Kwas and Li (J. Comp. 19 (2003) 730) for the multivariate case with d space variables. In this paper we consider the multivariate Feynman-Kac path integration problem in the randomized and quantum settings. For smooth multivariate functions, it was proven in Kwas and Li (2003) that the classical worst case complexity suffers from the curse of dimensionality in d. We show that in both the randomized and quantum settings the curse of dim…
In this paper the Feynman path integral technique is applied to two-dimensional spaces of non-constant curvature: these spaces are called Darboux spaces $\DI$--$\DIV$. We start each consideration in terms of the metric and then analyze the quantum theory in the separable coordinate systems. The path integral in each case is formulated and then solved in the majority of cases, the exceptions being quartic oscillators where no closed solution is known. The required ingredients are the path integral solutions of the linear potential, the harmonic oscillator, the radial harmonic oscillator, the mo…
In this paper the path integral technique is applied to the quantum motion on the Hermitian hyperbolic space HH(2). The Schrödinger equation on this space separates in 12 coordinate systems which are closely related to the coordinate systems on the two-dimensional hyperboloid. For six coordinate systems out of the twelve it is possible to find a path integral solution.
Even in the absence of external influences the operability of a quantum computer (QC) is not guaranteed because of the effects of residual one- and two-body imperfections. Here we investigate how these internal flaws affect the performance of a quantum controlled-NOT (CNOT) gate in an isolated flawed QC. First we find that the performance of the CNOT gate is considerably better when the two-body imperfections are strong. Secondly, we find that the largest source of error is due to a coherent shift rather than decoherence or dissipation. Our results suggest that the problem of internal imperfec…
What It Is Like To Be A Quantum Computer: A Closed Quantum Global Workspace -- Conscious Access and Integration as Correlation Dynamics in Hilbert Space
In this paper we introduce a design for an optical topological cluster state computer constructed exclusively from a single quantum component. Unlike previous efforts we eliminate the need for on demand, high fidelity photon sources and detectors and replace them with the same device utilised to create photon/photon entanglement. This introduces highly probabilistic elements into the optical architecture while maintaining complete specificity of the structure and operation for a large scale computer. Photons in this system are continually recycled back into the preparation network, allowing fo…
Trapped-ion quantum information processors store information in atomic ions maintained in position in free space via electric fields. Quantum logic is enacted via manipulation of the ions' internal and shared motional quantum states using optical and microwave signals. While trapped ions show great promise for quantum-enhanced computation, sensing, and communication, materials research is needed to design traps that allow for improved performance by means of integration of system components, including optics and electronics for ion-qubit control, while minimizing the near-ubiquitous electric-f…
The development of a large scale quantum computer is a highly sought after goal of fundamental research and consequently a highly non-trivial problem. Scalability in quantum information processing is not just a problem of qubit manufacturing and control but it crucially depends on the ability to adapt advanced techniques in quantum information theory, such as error correction, to the experimental restrictions of assembling qubit arrays into the millions. In this paper we introduce a feasible architectural design for large scale quantum computation in optical systems. We combine the recent deve…
Path integration for the potential V=αcosθ is performed. Satisfaction of the corresponding Schrödinger equation by the resulting Feynman kernel is demonstrated. Expressions for the related Green function are presented.
We apply quantum integration to elementary particle-physics processes. In particular, we look at scattering processes such as ${\rm e}^+{\rm e}^- \to q \bar q$ and ${\rm e}^+{\rm e}^- \to q \bar q' {\rm W}$. The corresponding probability distributions can be first appropriately loaded on a quantum computer using either quantum Generative Adversarial Networks or an exact method. The distributions are then integrated sing the method of Quantum Amplitude Estimation which shows a quadratic speed-up with respect to classical techniques. In simulations of noiseless quantum computers, we obtain per-c…
Quantum mechanics in conical space is studied by the path integral method. It is shown that the curvature effect gives rise to an effective potential in the radial path integral. It is further shown that the radial path integral in conical space can be reduced to a form identical with that in flat space when the discrete angular momentum of each partial wave is replaced by a specific non-integral angular momentum. The effective potential is found proportional to the squared mean curvature of the conical surface embedded in Euclidean space. The path integral calculation is compatible with the S…
The motion of a particle in the field of dispiration (due to a wedge disclination and a screw dislocation) is studied by path integration. By gauging $SO(2) \otimes T(1)$, first, we derive the metric, curvature, and torsion of the medium of dispiration. Then we carry out explicitly path integration for the propagator of a particle moving in the non-Euclidean medium under the influence of a scalar potential and a vector potential. We obtain also the winding number representation of the propagator by taking the non-trivial topological structure of the medium into account. We extract the energy s…
By using path integrals, the stochastic process associated to the time evolution of the quantum probability density is formally rewritten in terms of a stochastic differential equation, given by Newton's equation of motion with an additional multiplicative stochastic force. However, the term playing the role of the stochastic force is defined by a non-positive-definite probability functional, providing a clear example of the negative (or "extended") probabilities characteristic of quantum mechanics.
Despite being a well-established operational approach to quantify entanglement, Rényi entropy calculations have been plagued by their computational complexity. We introduce here a theoretical framework based on an optimal thermodynamic integration scheme, where the Rényi entropy can be efficiently evaluated using regularizing paths. This approach avoids slowly convergent fluctuating contributions and leads to low-variance estimates. In this way, large system sizes and high levels of entanglement in model or first-principles Hamiltonians are within our reach. We demonstrate it in the one-dimens…
Ooura's double exponential integration formula for Fourier transforms is applied to the oscillatory integrals occuring in the path-integral description of real-time Quantum Mechanics. Due to an inherent, implicit regularization multi-dimensional Gauss-Fresnel integrals are obtained numerically with high precision but modest number of function calls. In addition, the Maslov correction for the harmonic oscillator is evaluated numerically with an increasing number of time slices in the path integral thereby clearly demonstrating that the real-time propagator acquires an additional phase $ - π/2 $…
Accurate thermodynamic simulations of correlated fermions using path integral Monte Carlo (PIMC) methods are of paramount importance for many applications such as the description of ultracold atoms, electrons in quantum dots, and warm-dense matter. The main obstacle is the fermion sign problem (FSP), which leads to an exponential increase in computation time both with increasing the system-size and with decreasing temperature. Very recently, Hirshberg et al. [J. Chem. Phys. 152, 171102 (2020)] have proposed to alleviate the FSP based on the Bogoliubov inequality. In the present work, we extend…
We propose that holographic spacetimes can be regarded as collections of quantum circuits based on path-integrals. We relate a codimension one surface in a gravity dual to a quantum circuit given by a path-integration on that surface with an appropriate UV cut off. Our proposal naturally generalizes the conjectured duality between the AdS/CFT and tensor networks. This largely strengthens the surface/state duality and also provides a holographic explanation of path-integral optimizations. For static gravity duals, our new framework provides a derivation of the holographic complexity formula giv…
In self-interacting scalar field theories kinetic expansion is an alternative way of calculating the generating functional for Green's functions where the zeroth order non-Gaussian path integral becomes diagonal in x-space and reduces to the product of an ordinary integral at each point which can be evaluated exactly. We discuss how to deal with such functional integrals and propose a new perturbative expansion scheme which combines the elements of the kinetic expansion with that of usual perturbation theory. It is then shown that, when the cutoff dependent bare parameters in the potential are…
p-Adic generalization of the Feynman path integrals in quantum mechanics is considered. The probability amplitude for a particle in a constant field is calculated. Path integrals over p-adic space have the same form as those over R.
Accurate path integral Monte Carlo or molecular dynamics calculations of isotope effects have until recently been expensive because of the necessity to reduce three types of errors present in such calculations: statistical errors due to sampling, path integral discretization errors, and thermodynamic integration errors. While the statistical errors can be reduced with virial estimators and path integral discretization errors with high-order factorization of the Boltzmann operator, here we propose a method for accelerating isotope effect calculations by eliminating the integration error. We sho…
