Simulations of small lazy quantum walks on neutral atoms show a fidelity advantage for native multiqubit Rydberg gates over decomposed two-qubit sequences at certain gate-error regimes.
Quantum Random Walks Hit Exponentially Faster
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
abstract
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum random walks. We provide the framework for quantum hitting time and give two alternative definitions to set the ground for its study on general graphs. We then give an application to random routing.
fields
quant-ph 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Lazy Quantum Walks with Native Multiqubit Gates
Simulations of small lazy quantum walks on neutral atoms show a fidelity advantage for native multiqubit Rydberg gates over decomposed two-qubit sequences at certain gate-error regimes.