Related papers: Interacting quantum walks
The goal of the presented paper is to provide an introduction to the basic computational models used in quantum information theory. We review various models of quantum Turing machine, quantum circuits and quantum random access machine…
By leveraging quantum-mechanical properties like superposition, entanglement, and interference, quantum computing (QC) offers promising solutions for problems that classical computing has not been able to solve efficiently, such as drug…
A quantum computer, i.e. utilizing the resources of quantum physics, superposition of states and entanglement, could furnish an exponential gain in computing time. A simulation using such resources is called a quantum simulation. The…
We study the most elementary model of electron motion introduced by R.Feynman in 1965. It is a game, in which a checker moves on a checkerboard by simple rules, and we count the turnings. The model is also known as one-dimensional quantum…
A discrete time quantum walk is known to be the single-particle sector of a quantum cellular automaton. For a long time, these models have interested the community for their nice properties such as locality or translation invariance. This…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schr\"{o}dinger equation or wavefunctions. Unlike the standard QM…
Simulating quantum many-body systems on a classical computer generally requires a computational cost that grows exponential with the number of particles. This computational complexity has been the main obstacle to understanding various…
It is discussed an opportunity to introduce new class of quantum algorithms based on possibility to express amplitude of transition between two states of quantum system as sum of some function along all possible classical paths. Continuous…
A quantum walk places a traverser into a superposition of both graph location and traversal "spin." The walk is defined by an initial condition, an evolution determined by a unitary coin/shift-operator, and a measurement based on the…
Very much as its classical counterpart, quantum cellular automata are expected to be a great tool for simulating complex quantum systems. Here we introduce a partitioned model of quantum cellular automata and show how it can simulate, with…
The relation between entropy and information has great significance for computation. Based on the strict reversibility of the laws of microphysics, Landauer (1961), Bennett (1973), Priese (1976), Fredkin and Toffoli (1982), Feynman (1985)…
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal…
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 origin and nature of time in complex systems is explored using quantum (or 'Feynman') clocks and the signals produced by them. Networks of these clocks provide the basis for the evolution of complex systems. The general concept of…
Quantum computers are expected to contribute more efficient and accurate ways of modeling economic processes. Quantum hardware is currently available at a relatively small scale, but effective algorithms are limited by the number of logic…
Quantum walks function as essential means to implement quantum simulators, allowing one to study complex and often directly inaccessible quantum processes in controllable systems. In this contribution, the notion of a driven Gaussian…
We study the model of quantum walks on cycles enriched by the addition of 1-step memory. We provide a formula for the probability distribution and the time-averaged limiting probability distribution of the introduced quantum walk. Using the…
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic…
The development of quantum algorithms based on quantum versions of random walks is placed in the context of the emerging field of quantum computing. Constructing a suitable quantum version of a random walk is not trivial: pure quantum…
This paper presents a simple model that mimics quantum mechanics (QM) results in terms of probability fields of free particles subject to self-interference, without using Schroedinger equation or complex wavefunctions. Unlike the standard…