Results 61 to 70 of about 104,281 (223)
Predicting quantum advantage by quantum walk with convolutional neural networks
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms.
Alexey A Melnikov +2 more
doaj +1 more source
Multiparticle quantum walk–based error correction algorithm with two-lattice Bose–Hubbard model
When the evolution of discrete time quantum walk is carried out for particles, the ramble state is prone to error due to the influence of system noise. A multiparticle quantum walk error correction algorithm based on the two-lattice Bose–Hubbard model is
Shu-Mei Wang +4 more
doaj +1 more source
Quantum walk on a line for a trapped ion
We show that a multi-step quantum walk can be realized for a single trapped ion with interpolation between quantum and random walk achieved by randomizing the generalized Hadamard coin flip phase.
A. M. Childs +5 more
core +1 more source
Entanglement generation in spatially separated systems using quantum walk [PDF]
We present a novel scheme to generate entanglement between two spatially separated systems. The scheme makes use of spatial entanglement generated by a single-particle quantum walk which is used to entangle two spatially separated, not necessarily ...
Banerjee, Subhashish +2 more
core +1 more source
Quantum walks on embeddings [PDF]
We introduce a new type of discrete quantum walks, called vertex-face walks, based on orientable embeddings. We first establish a spectral correspondence between the transition matrix $U$ and the vertex-face incidence structure. Using the incidence graph, we derive a formula for the principal logarithm of $U^2$, and find conditions for its underlying ...
openaire +3 more sources
Complementarity and quantum walks
We show that quantum walks interpolate between a coherent `wave walk' and a random walk depending on how strongly the walker's coin state is measured; i.e., the quantum walk exhibits the quintessentially quantum property of complementarity, which is ...
A. Ambainis +7 more
core +1 more source
We propose a new method for designing quantum search algorithms for finding a "marked" element in the state space of a classical Markov chain. The algorithm is based on a quantum walk la Szegedy (2004) that is defined in terms of the Markov chain.
Magniez, Frédéric +3 more
openaire +2 more sources
Quantum Optical Random Walk: Quantization Rules and Quantum Simulation of Asymptotics [PDF]
Rules for quantizing the walker+coin parts of a classical random walk are provided by treating them as interacting quantum systems. A quantum optical random walk (QORW), is introduced by means of a new rule that treats quantum or classical noise ...
A. Ambainis +10 more
core +2 more sources
A Crossover Between Open Quantum Random Walks to Quantum Walks
We propose an intermediate walk continuously connecting an open quantum random walk and a quantum walk with parameters $M\in \mathbb{N}$ controlling a decoherence effect; if $M=1$, the walk coincides with an open quantum random walk, while $M=\infty$, the walk coincides with a quantum walk.
Norio Konno, Kaname Matsue, Etsuo Segawa
openaire +2 more sources

