REVIEW 1 cited by
Quantum Random Walks Hit Exponentially Faster
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original 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.
Forward citations
Cited by 1 Pith paper
-
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.
Discussion (0). Continue with ORCID to comment.