Related papers: Quantum "Pathfinder"
We study the heat statistics of a quantum Brownian motion described by the Caldeira-Leggett model. By using the path integral approach, we introduce a novel concept of the quantum heat functional along every pair of Feynman paths. This…
A quantum model based on a Euler-Lagrange variational approach is proposed. In analogy with the classical transport, our approach maintain the description of the particle motion in terms of trajectories in a configuration space. Our method…
In quantum field theory the path integral is usually formulated in the wave picture, i.e., as a sum over field evolutions. This path integral is difficult to define rigorously because of analytic problems whose resolution may ultimately…
Some well-known examples of constrained quantum systems commonly quantized via Feynman path integrals are re-examined using the notion of conditional integrators introduced in [1]. The examples yield some new perspectives on old results. As…
The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen.…
Quantum computers are designed to outperform standard computers by running quantum algorithms. Areas in which quantum algorithms can be applied include cryptography, search and optimisation, simulation of quantum systems, and solving large…
These lectures are intended for graduate students who want to acquire a working knowledge of path integral methods in a wide variety of fields in physics. In general the presentation is elementary and path integrals are developed in the…
Quantum versions of random walks have diverse applications that are motivating experimental implementations as well as theoretical studies. However, the main impetus behind this interest is their use in quantum algorithms, which have always…
This article introduces quantum computation by analogy with probabilistic computation. A basic description of the quantum search algorithm is given by representing the algorithm as a C program in a novel way.
Quantum walks, the quantum mechanical counterpart of classical random walks, is an advanced tool for building quantum algorithms that has been recently shown to constitute a universal model of quantum computation. Quantum walks is now a…
Feynman's path integral formulation arose from his attempt to incorporate the Lagrangian framework into quantum mechanics, offering what he regarded as a more fundamental perspective than the Hamiltonian approach, particularly in the…
The classical notions of continuity and mechanical causality are left in order to refor- mulate the Quantum Theory starting from two principles: I) the intrinsic randomness of quantum process at microphysical level, II) the projective…
Quantum Computing is a new and exciting field at the intersection of mathematics, computer science and physics. It concerns a utilization of quantum mechanics to improve the efficiency of computation. Here we present a gentle introduction…
The possibility of extending the canonical formulation of quantum mechanics (QM) to a space-time symmetric form has recently attracted wide interest. In this context, a recent proposal has shown that a spacetime symmetric many-body…
Work statistics characterizes important features of a non-equilibrium thermodynamic process. But the calculation of the work statistics in an arbitrary non-equilibrium process is usually a cumbersome task. In this work, we study the work…
Richard Feynman's observation that quantum mechanical effects could not be simulated efficiently on a computer led to speculation that computation in general could be done more efficiently if it used quantum effects. This speculation…
These notes discuss the quantum algorithms we know of that can solve problems significantly faster than the corresponding classical algorithms. So far, we have only discovered a few techniques which can produce speed up versus classical…
This paper is an introduction to diagrammatic methods for representing quantum processes and quantum computing. We review basic notions for quantum information and quantum computing. We discuss topological diagrams and some issues about…
The driving force in the pursuit for quantum computation is the exciting possibility that quantum algorithms can be more efficient than their classical analogues. Research on the subject has unraveled several aspects of how that can happen.…
Quantum technology is seeing a remarkable explosion in interest due to a wave of successful commercial technology. As a wider array of engineers and scientists are needed, it is time we rethink quantum educational paradigms. Current…