Results 11 to 20 of about 104,281 (223)

From Discrete Time Quantum Walk to Continuous Time Quantum Walk in Limit Distribution [PDF]

Journal of Computational and Theoretical Nanoscience, 2013
The discrete time quantum walk defined as a quantum-mechanical analogue of the discrete time random walk have recently been attracted from various and interdisciplinary fields.
Shikano, Yutaka
core   +3 more sources

Bidirectional multi-nodes quantum teleportation using discrete-time quantum walk [PDF]

Scientific Reports
We suggest a new technique for bidirectional quantum teleportation (BQT) that combines coherent-state encoding with discrete-time quantum walks to allow two users to communicate quantum information simultaneously.
N. Ikken, P. Kumar, A. Slaoui, B. Kar, R. Ahl Laamara, M. Zomorodi, A. A. Abd El-Latif   +6 more
doaj   +2 more sources

Experimental Implementation of the Quantum Random-Walk Algorithm

Physical Review A, 2003
The quantum random walk is a possible approach to construct new quantum algorithms. Several groups have investigated the quantum random walk and experimental schemes were proposed.
B.C. Travaglione, C. Monroe, D. Collins, D. Leung, D.G. Cory, D.G. Cory, E. Farhi, E. Knill, Hui Li, I.L. Chuang, J. Du, J. Du, J. Du, J. Zhang, J.A. Jones, J.I. Cirac, Jiangfeng Du, Jihui Wu, L. Xiao, L.K. Grover, L.M.K. Vandersypen, M.A. Nielsen, Mingjun Shi, N. Gershenfeld, R. Marx, R.P. Feynman, Rongdian Han, S. Somaroo, W. Dür, X. Fang, X. Peng, Xianyi Zhou, Xiaodong Xu, Y. Aharonov   +33 more
core   +3 more sources

Multi-bit quantum random number generation from a single qubit quantum walk [PDF]

Scientific Reports, 2019
We present a scheme for multi-bit quantum random number generation using a single qubit discrete-time quantum walk in one-dimensional space. Irrespective of the initial state of the qubit, quantum interference and entanglement of particle with the ...
Anupam Sarkar, C. M. Chandrashekar
doaj   +2 more sources

Quantum-walk search in motion [PDF]

Scientific Reports
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 marked nodes
Himanshu Sahu, Kallol Sen
doaj   +2 more sources

A 2D Quantum Walk Simulation of Two-Particle Dynamics

Science, 2012
Multi-dimensional quantum walks can exhibit highly non-trivial topological structure, providing a powerful tool for simulating quantum information and transport systems.
Gabris, Aurel, Hamilton, Craig, Jex, Igor, Laiho, Kaisa, Potocek, Vaclav, Rohde, Peter P., Schreiber, Andreas, Silberhorn, Christine, Stefanak, Martin   +8 more
core   +3 more sources

Universal Computation by Quantum Walk [PDF]

Physical Review Letters, 2009
In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be a sparse matrix with all entries equal to 0 or 1, i.e., the adjacency matrix of a low-degree graph ...
Andrew M Childs
openaire   +5 more sources

Publisher Correction: Proposal of a quantum version of active particles via a nonunitary quantum walk. [PDF]

Sci Rep
Yamagishi M, Hatano N, Obuse H.
europepmc   +3 more sources

Efficient Quantum Walk Circuits for Metropolis-Hastings Algorithm [PDF]

Quantum, 2020
We present a detailed circuit implementation of Szegedy's quantization of the Metropolis-Hastings walk. This quantum walk is usually defined with respect to an oracle.
Jessica Lemieux, Bettina Heim, David Poulin, Krysta Svore, Matthias Troyer   +4 more
doaj   +1 more source

Irrational Quantum Walks

SIAM Journal on Applied Algebra and Geometry, 2023
22 pages, 5 figures.
Gabriel Coutinho, Pedro Ferreira Baptista, Chris Godsil, Thomás Jung Spier, Reinhard Werner   +4 more
openaire   +2 more sources