Related papers: Efficient Quantum Simulation Algorithms in the Pat…
We reformulate quantum computation in terms of Lagrangian (sum-over-path) formalism, in contrast to the widely used Hamiltonian (unitary gate) formulation. We exemplify this formalism with some widely-studied models, including the standard…
Feynman's Lagrangian path integral was an outgrowth of Dirac's vague surmise that Lagrangians have a role in quantum mechanics. Lagrangians implicitly incorporate Hamilton's first equation of motion, so their use contravenes the uncertainty…
Path integral formulation of quantum mechanics (and also other equivalent formulations) depends on a Lagrangian and/or Hamiltonian function that is chosen to describe the underlying classical system. The arbitrariness presented in this…
We study how parallelism can speed up quantum simulation. A parallel quantum algorithm is proposed for simulating the dynamics of a large class of Hamiltonians with good sparse structures, called uniform-structured Hamiltonians, including…
Efficient control of qubits plays a key role in quantum information processing. In the current work, an alternative set of differential equations are derived for an optimal quantum control of single or multiple qubits with or without…
To date, all proposed quantum algorithms for simulating quantum field theory (QFT) simulate (continuous-time) Hamiltonian lattice QFT as a stepping stone. Two overlooked issues are how large we can take the timestep in these simulations…
Solving partial differential equations for extremely large-scale systems within a feasible computation time serves in accelerating engineering developments. Quantum computing algorithms, particularly the Hamiltonian simulations, present a…
Path integral-based simulation methodologies play a crucial role for the investigation of nuclear quantum effects by means of computer simulations. However, these techniques are significantly more demanding than corresponding classical…
Transport phenomena play a key role in a variety of application domains, and efficient simulation of these dynamics remains an outstanding challenge. While quantum computers offer potential for significant speedups, existing algorithms…
Extension of Feynman's path integral to quantum mechanics of noncommuting spatial coordinates is considered. The corresponding formalism for noncommutative classical dynamics related to quadratic Lagrangians (Hamiltonians) is formulated.…
We provide a quantum algorithm for simulating the dynamics of sparse Hamiltonians with complexity sublogarithmic in the inverse error, an exponential improvement over previous methods. Specifically, we show that a $d$-sparse Hamiltonian $H$…
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…
Although the Hamiltonian formalism is so far favored for quantum computation of lattice gauge theory, the path integral formalism would never be useless. The advantages of the path integral formalism are the knowledge and experience…
Simulation of realistic classical mechanical systems is of great importance to many areas of engineering such as robotics, dynamics of rotating machinery and control theory. In this work, we develop quantum algorithms to estimate quantities…
Effective Lagrangians containing arbitrary interactions of massive vector fields are quantized within the Hamiltonian path integral formalism. It is proven that correct Hamiltonian quantization of these models yields the same result as…
Efficient representations of the Hamiltonian such as double factorization drastically reduce circuit depth or number of repetitions in error corrected and noisy intermediate scale quantum (NISQ) algorithms for chemistry. We report a…
We present a quantum algorithm for simulating the dynamics of Hamiltonians that are not necessarily sparse. Our algorithm is based on the input model where the entries of the Hamiltonian are stored in a data structure in a quantum random…
The difficulty of simulating quantum dynamics depends on the norm of the Hamiltonian. When the Hamiltonian varies with time, the simulation complexity should only depend on this quantity instantaneously. We develop quantum simulation…
Consider a path of non-degenerate eigenstates of unitary operators or Hamiltonians with minimum eigenvalue gap G. The eigenpath traversal problem is to transform one or more copies of the initial to the final eigenstate. Solutions to this…
A path integral formalism for non-equilibrium systems is proposed based on a manifold of quasi-equilibrium densities. A generalized Boltzmann principle is used to weight manifold paths with the exponential of minus the information…