Results 51 to 60 of about 5,812 (253)
Quantum Walks on the Hypercube
Recently, it has been shown that one-dimensional quantum walks can mix more quickly than classical random walks, suggesting that quantum Monte Carlo algorithms can outperform their classical counterparts. We study two quantum walks on the n-dimensional hypercube, one in discrete time and one in continuous time.
Cristopher Moore, Alexander Russell
openaire +2 more sources
Quantum lattice Boltzmann is a quantum walk [PDF]
18 pages, 3 ...
Succi, Sauro +2 more
openaire +2 more sources
GraphDay '16, 1(1), pages 1-16, Austin Texas, January ...
Marko A. Rodriguez, Jennifer H. Watkins
openaire +2 more sources
Quantum Walks: A Markovian Perspective [PDF]
For a continuous-time quantum walk on a line the variance of the position observable grows quadratically in time, whereas, for its classical counterpart on the same graph, it exhibits a linear, diffusive, behaviour. A quantum walk, thus, propagates at a rate which is linear in time, as compared to the square root rate for a classical random walk ...
D. de Falco, D. Tamascelli
openaire +3 more sources
Quantum key distribution with quantum walks [PDF]
published version; 40 pages; 8 ...
Chrysoula Vlachou +4 more
openaire +3 more sources
Time‐resolved X‐ray solution scattering captures how proteins change shape in real time under near‐native conditions. This article presents a practical workflow for light‐triggered TR‐XSS experiments, from data collection to structural refinement. Using a calcium‐transporting membrane protein as an example, the approach can be broadly applied to study ...
Fatemeh Sabzian‐Molaei +3 more
wiley +1 more source
Quantum walks, quantum gates, and quantum computers [PDF]
The physics of quantum walks on graphs is formulated in Hamiltonian language, both for simple quantum walks and for composite walks, where extra discrete degrees of freedom live at each node of the graph. It is shown how to map between quantum walk Hamiltonians and Hamiltonians for qubit systems and quantum circuits; this is done for both a single- and
Hines, Andrew P., Stamp, P. C. E.
openaire +2 more sources
Molecular characterization of covRS mutations in M1UK Streptococcus pyogenes
Group A Streptococcus (GAS) acquires covRS mutations driving a hypervirulent bacterial state, frequently associated with invasive disease‐like necrotizing fasciitis. We demonstrate that the newly emerged M1UK GAS lineage can also acquire these mutations.
Jarrad Pritchard +12 more
wiley +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 walks in an array of quantum dots [PDF]
Quantum random walks are shown to have non-intuitive dynamics, which makes them an attractive area of study for devising quantum algorithms for well-known classical problems as well as those arising in the field of quantum computing. In this work we propose a novel scheme for the physical implementation of a discrete-time quantum random walk using ...
Manouchehri, K., Wang, J. B.
openaire +2 more sources

