Related papers: Experimental Implementation of the Quantum Random-…
Providing an optimal path to a quantum annealing algorithm is key to finding good approximate solutions to computationally hard optimization problems. Reinforcement is one of the strategies that can be used to circumvent the exponentially…
We explore a discrete-time, coined quantum walk on a quantum network where the coherent superposition of walker-moves originates from the unitary interaction of the walker-coin with the qubit degrees of freedom in the quantum network. The…
Quantum walks on networks are a paradigmatic model in quantum information theory. Quantum-walk algorithms have been developed for various applications, including spatial-search problems, element-distinctness problems, and node centrality…
The quantum random walk has been much studied recently, largely due to its highly nonclassical behavior. In this paper, we study one possible route to classical behavior for the discrete quantum walk on the line: the presence of decoherence…
Quantum walk (QW), which is considered as the quantum counterpart of the classical random walk (CRW), is actually the quantum extension of CRW from the single-coin interpretation. The sequential unitary evolution engenders correlation…
In quantum computing, the quantum walk search algorithm is designed for locating fixed marked nodes within a graph. However, when multiple marked nodes exist, the conventional search algorithm lacks the capacity to simultaneously amplify…
The quantum walk (QW) is the term given to a family of algorithms governing the evolution of a discrete quantum system and as such has a founding role in the study of quantum computation. We contribute to the investigation of QW phenomena…
Using resonant interaction between atoms and the field in a high quality cavity, we show how to realize quantum random walks as proposed by Aharonov et al [Phys. Rev. A {\bf48}, 1687 (1993)]. The atoms are driven strongly by a classical…
We analyze a continuous-time quantum walk on a chimera graph, which is a graph of choice for designing quantum annealers, and we discover beautiful quantum-walk features such as localization that starkly distinguishes classical from quantum…
The quantum SearchRank algorithm is a promising tool for a future quantum search engine based on PageRank quantization. However, this algorithm loses its functionality when the $N/M$ ratio between the network size $N$ and the number of…
We apply a discrete quantum walk from a quantum particle on a discrete quantum spacetime from loop quantum gravity and show that the related Entanglement Entropy can drive a entropic force. We apply this concepts to propose a model of a…
Estimation of the coin parameter(s) is an important part of the problem of implementing more robust schemes for quantum simulation using quantum walks. We present the estimation of the quantum coin parameter used for one-dimensional…
We investigate if the degradation of a quantum directional reference frame through repeated use can be modeled as a classical direction undergoing a random walk on a sphere. We demonstrate that the behaviour of the fidelity for a degrading…
We propose a scheme for implementing quantum algorithms with resonant interactions. Our scheme only requires resonant interactions between two atoms and a cavity mode, which is simple and feasible. Moreover, the implementation would be an…
In this paper, I propose a realistic interpretation (RI) of quantum mechanics, that is, an interpretation according to which a particle follows a definite path in spacetime. The path is not deterministic but it is rather a random walk.…
A novel concept of quantum random access memory (qRAM) employing a quantum walk is provided. Our qRAM relies on a bucket brigade scheme to access the memory cells. Introducing a bucket with chirality left and right as a quantum walker, and…
We initiate the systematic study of experimental quantum physics from the perspective of computational complexity. To this end, we define the framework of quantum algorithmic measurements (QUALMs), a hybrid of black box quantum algorithms…
Using coordinate-free basic operators on toy Fock spaces \cite{AP}, quantum random walks are defined following the ideas in \cite{LP,AP}. Strong convergence of quantum random walks associated with bounded structure maps is proved under…
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…
We introduce the quantum quincunx, which physically demonstrates the quantum walk and is analogous to Galton's quincunx for demonstrating the random walk. In contradistinction to the theoretical studies of quantum walks over orthogonal…