相关论文: Quantum "Pathfinder"
Quantum field theory reconciles quantum mechanics and special relativity, and plays a central role in many areas of physics. We develop a quantum algorithm to compute relativistic scattering probabilities in a massive quantum field theory…
The path integral formulation in quantum mechanics corresponds to the first quantization since it is just to rewrite the quantum mechanical amplitude into many dimensional integrations over discretized coordinates $x_n$. However, the path…
Although the suspicion that quantum mechanics is emergent has been lingering for a long time, only now we begin to understand how a bridge between classical and quantum mechanics might be squared with Bell's inequalities and other…
Variational algorithms have particular relevance for near-term quantum computers but require non-trivial parameter optimisations. Here we propose Analytic Descent: Given that the energy landscape must have a certain simple form in the local…
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and…
It is well known that for certain tasks, quantum computing outperforms classical computing. A growing number of contributions try to use this advantage in order to improve or extend classical machine learning algorithms by methods of…
The article is an overview of the role of graph complexes in the Feynman path integral quantization. The underlying mathematical language is that of PROPs and operads, and their representations. The sum over histories approach, the Feynman…
The given article example of physical analogies to be entered information space-time. The opportunity of Poincare group use is shown for transition from one frame in another, for this purpose is entered invariant velocity of transition of…
A systematic classification of Feynman path integrals in quantum mechanics is presented and a table of solvable path integrals is given which reflects the progress made during the last ten years or so, including, of course, the main…
Quantum advantage is notoriously hard to find and even harder to prove. For example the class of functions computable with classical physics actually exactly coincides with the class computable quantum-mechanically. It is strongly believed,…
Whereas the entropy of any deterministic classical system described by a principle of least action is zero, one can assign a "quantum information" to quantum mechanical degree of freedom equal to Hausdorff area of the deviation from a…
Recently, there has been a growing literature exploring the generalization of quantum algorithms, such that different quantum algorithms are special examples of a more fundamental structure. In this short paper, we provide a general…
We show that the computational effort for the numerical solution of fermionic quantum systems, occurring e.g., in quantum chemistry, solid state physics, field theory in principle grows with less than the square of the particle number for…
Quantum algorithms require a universal set of gates that can be implemented in a physical system. For these, an optimal decomposition into a sequence of available operations is desired. Here, we present a method to find such sequences for a…
Classical transport equations with probabilistic initial conditions can be viewed as quantum systems. In a discrete version they are probabilistic automata. The time-local probabilistic information is encoded in a classical wave function.…
The Feynman path integral approach to quantum mechanics is examined in the case where the configuration space is curved. It is shown how the ambiguity that is present in the choice of path integral measure may be resolved if, in addition to…
The paper develops the idea that the dynamics of both classical and quantum processes is time reversible. It is shown how this classical analogy allows one to define the measure for the path integral in quantum mechanics.
In the rapidly growing area of quantum information, the Deutsch algorithm is ubiquitous and, in most cases, the first one to be introduced to any student of this relatively new field of research. The reason for this historical relevance…
A natural mapping of paths in a curved space onto the paths in the corresponding (tangent) flat space may be used to reduce the curved-space-time path integral to the flat-space-time path integral. The dynamics of the particle in a curved…
It is demonstrated that in gate-based quantum computing architectures quantum walk is a natural mathematical description of quantum gates. It originates from field-matter interaction driving the system, but is not attached to specific qubit…