Related papers: Interacting quantum walks
Quantum walks have emerged as an interesting approach to quantum information processing, exhibiting many unique properties compared to the analogous classical random walk. Here we introduce a model for a discrete-time quantum walk with…
Quantum walks are a well-established model for the study of coherent transport phenomena and provide a universal platform in quantum information theory. Dynamically influencing the walker's evolution gives a high degree of flexibility for…
Quantum computing technologies are making steady progress. This has opened new opportunities for tackling problems whose complexity prevents their description on classical computers. A prototypical example of these complex problems are…
Quantum random walks have received much interest due to their non-intuitive dynamics, which may hold the key to a new generation of quantum algorithms. What remains a major challenge is a physical realization that is experimentally viable…
Quantum walks have proven to be a universal model for quantum computation and to provide speed-up in certain quantum algorithms. The discrete-time quantum walk (DTQW) model, among others, is one of the most suitable candidates for circuit…
We show that Feynman's Clock construction, in which the time-evolution of a closed quantum system is encoded as a ground state problem, can be extended to open quantum systems. In our formalism, the ground states of an ensemble of…
We introduce the driven discrete time quantum walk, where walkers are added during the walk instead of only at the beginning. This leads to interference in walker number and very different dynamics when compared to the original quantum…
We present an implementation of Grover's algorithm in the framework of Feynman's cursor model of a quantum computer. The cursor degrees of freedom act as a quantum clocking mechanism, and allow Grover's algorithm to be performed using a…
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…
Quantum walks can reconstruct quantum algorithms for quantum computation, where the precise controls of quantum state transfers between arbitrary distant sites are required. Here, we investigate quantum walks using a periodically…
A proof that continuous time quantum walks are universal for quantum computation, using unweighted graphs of low degree, has recently been presented by Childs [PRL 102 180501 (2009)]. We present a version based instead on the discrete time…
Simulating quantum physics with a device which itself is quantum mechanical, a notion Richard Feynman originated, would be an unparallelled computational resource. However, the universal quantum simulation of fermionic systems is daunting…
This course of lectures has been taught for several years at the Lomonosov Moscow State University; its modified version in 2021 is read in the Zhejiang University (Hangzhou), in the framework of summer school on quantum computing. The…
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 walks, both discrete and continuous, serve as fundamental tools in quantum information processing with diverse applications. This work introduces a hybrid quantum walk model that integrates the coin mechanism of discrete walks with…
The unification of gravity and quantum mechanics remains one of the most profound open questions in science. With recent advances in quantum technology, an experimental idea first proposed by Richard Feynman is now regarded as a promising…
Quantum walks with memory(QWM) are a type of modified quantum walks that record the walker's latest path. As we know, only two kinds of QWM are presented up to now. It is desired to design more QWM for research, so that we can explore the…
As R.Feynman has shown to F. Dyson -- who published it then in 1990 under the name of "Feynman's proof of Maxwell's equations" -- the only interactions compatible with the canonical uncertainty relation (for scalar particles on flat $\R^3$)…
A quantum simulator is a well controlled quantum system that can simulate the behavior of another quantum system which may require exponentially large classical computing resources to understand otherwise. In the 1980s, Feynman proposed the…
Quantum many-body (QMB) systems are generally computationally hard: the computing resources necessary to simulate them exactly can often exceed the existing computation resources by orders of magnitude. For this reason, Richard Feynman…