Related papers: Feynman path sum approach for simulation of linear…
We describe three algorithms for computer-aided symbolic multi-loop calculations that facilitated some recent novel results. First, we discuss an algorithm to derive the canonical form of an arbitrary Feynman integral in order to facilitate…
Boson-sampling is a simplified model for quantum computing that may hold the key to implementing the first ever post-classical quantum computer. Boson-sampling is a non-universal quantum computer that is significantly more straightforward…
An approach to approximate evaluation of the continuum Feynman path integrals is developed for the study of quantum fluctuations of particles and fields in Euclidean time-space. The paths are described by sum of Gauss functions and are…
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…
We present a program that implements the OPP reduction method to extract the coefficients of the one-loop scalar integrals from a user defined (sub)-amplitude or Feynman Diagram, as well as the rational terms coming from the 4-dimensional…
We present the calculation of the Feynman path integral in real time for tunneling in quantum mechanics and field theory, including the first quantum corrections. For this purpose, we use the well-known fact that Euclidean saddle points in…
Large-scale variational quantum algorithms are widely recognized as a potential pathway to achieve practical quantum advantages. However, the presence of quantum noise might suppress and undermine these advantages, which blurs the…
We demonstrate how boson sampling with photons of partial distinguishability can be expressed in terms of interference of fewer photons. We use this observation to propose a classical algorithm to simulate the output of a boson sampler fed…
Gaussian boson sampling is a promising candidate for showing experimental quantum advantage. While there is evidence that noiseless Gaussian boson sampling is hard to efficiently simulate using a classical computer, the current Gaussian…
The one-sided bouncer and the symmetric bouncer involve a one-dimensional particle in a piecewise linear potential. For such problems, the time-dependent quantum mechanical propagator cannot be found in closed form. The semiclassical…
Compared to classical optical coherence theory based on Maxwell's electromagnetic theory and Glauber's quantum optical coherence theory based on matrix mechanics formulation of quantum mechanics, quantum optical coherence theory based on…
The Feynman integral is one of the most accurate methods for calculating density operator dynamics in open quantum systems. However, the number of time steps that can realistically be used is always limited, therefore one often obtains an…
Classical simulation of quantum computation has often been viewed as the method to determine where the horizon of quantum supremacy is located---that is, where quantum computation can no longer be simulated by classical methods. As of now,…
We identify a broad class of physical processes in an optical quantum circuit that can be efficiently simulated on a classical computer: this class includes unitary transformations, amplification, noise, and measurements. This…
By means of the Ito-Nisio theorem, we introduce and discuss a general approach to series representations of path integrals. We then argue that the optimal basis for both ``primitive'' and partial averaged approaches is the Wiener…
Feynman path integrals provide an elegant, classically inspired representation for the quantum propagator and the quantum dynamics, through summing over a huge manifold of all possible paths. From computational and simulational…
Path integrals are a central tool when it comes to describing quantum or thermal fluctuations of particles or fields. Their success dates back to Feynman who showed how to use them within the framework of quantum mechanics. Since then, path…
Path integral Monte Carlo (PIMC) simulations have become an important tool for the investigation of the statistical mechanics of quantum systems. I discuss some of the history of applying the Monte Carlo method to non-relativistic quantum…
In order to find the outcome probabilities of quantum mechanical systems like the optical networks underlying Boson sampling, it is necessary to be able to compute the permanents of unitary matrices, a computationally hard task. Here we…
Near term quantum computers with a high quantity (around 50) and quality (around 0.995 fidelity for two-qubit gates) of qubits will approximately sample from certain probability distributions beyond the capabilities of known classical…