Results 81 to 90 of about 104,281 (223)
Neighborhood-history quantum walk [PDF]
History dependent discrete time quantum walks (QWs) are often studied for their lattice traversal properties. A particular model in the literature uses the state of a memory qubit at each site to record visits and to control the dynamics of the walk. We generalize this model to the neighborhood-history quantum walk (NHQW), in which the walk dynamics ...
openaire +2 more sources
Quantum Ratchet in Disordered Quantum Walk [PDF]
Symmetrically evolving discrete quantum walk results in dynamic localization with zero mean displacement when the standard evolution operations are replaced by a temporal disorder evolution operation. In this work we show that the quantum ratchet action, that is, a directed transport in standard or disordered discrete‐time quantum walk can be realized ...
Sagnik Chakraborty +3 more
openaire +2 more sources
Disordered quantum walk-induced localization of a Bose-Einstein condensate
We present an approach to induce localization of a Bose-Einstein condensate in a one-dimensional lattice under the influence of unitary quantum walk evolution using disordered quantum coin operation.
A. Ambainis +7 more
core +1 more source
Quantum random walks without walking [PDF]
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 and not limited to special connectivity criteria.
Manouchehri, K, Wang, J. B.
openaire +2 more sources
Searching via walking: How to find a marked subgraph of a graph using quantum walks
We show how a quantum walk can be used to find a marked edge or a marked complete subgraph of a complete graph. We employ a version of a quantum walk, the scattering walk, which lends itself to experimental implementation.
A. Ambainis +8 more
core +1 more source
Finding structural anomalies in star graphs: A general approach
We develop a general theory for a quantum-walk search on a star graph. A star graph has N edges each of which is attached to a central vertex. A graph G is attached to one of these edges, and we would like to find out to which edge it is attached.
Cottrell, Seth, Hillery, Mark
core +1 more source
Research of Quantum Algorithm Based on IBM Q Platform [PDF]
To explore the implementation status of multi-bit quantum algorithm in quantum chips and simulators,Grover search algorithm,quantum random walk algorithm and quantum Fourier transform algorithm are run on IBM quantum chips and simulators respectively.For
WEI Jia,NI Ming,ZHOU Ming,JIANG Wenbing
doaj +1 more source
Quantum walks as a probe of structural anomalies in graphs
We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external vertices, are ...
D. Aharonov +6 more
core +1 more source
Strongly interacting photonic quantum walk using single atom beamsplitters
Photonics provide an efficient way to implement quantum walks, the quantum analog of classical random walks, which demonstrate rich physics with potential applications. However, most photonic quantum walks do not involve photon interactions, which limits
Xinyuan Zheng, Edo Waks
doaj +1 more source
Quantum Walks of Correlated Photons [PDF]
A Correlated Quantum Walk Random walks are powerful tools for modeling statistical events. The analogous quantum walk involves particles tunneling between available sites. Peruzzo et al. (p. 1500 ; see the Perspective by
Peruzzo A. +13 more
openaire +4 more sources

