# Quantum search with multiple walk steps per oracle query

@article{Wong2015QuantumSW, title={Quantum search with multiple walk steps per oracle query}, author={Thomas G. Wong and Andris Ambainis}, journal={Physical Review A}, year={2015}, volume={92}, pages={022338} }

We identify a key difference between quantum search by discrete- and continuous-time quantum walks: a discrete-time walk typically performs one walk step per oracle query, whereas a continuous-time walk can effectively perform multiple walk steps per query while only counting query time. As a result, we show that continuous-time quantum walks can outperform their discrete-time counterparts, even though both achieve quadratic speedups over their corresponding classical random walks. To provide… CONTINUE READING

#### Citations

##### Publications citing this paper.

SHOWING 1-10 OF 17 CITATIONS

## Exceptional quantum walk search on the cycle

VIEW 1 EXCERPT

CITES BACKGROUND

## Equivalence of Szegedy’s and coined quantum walks

VIEW 3 EXCERPTS

CITES METHODS

## Spatial search by continuous-time quantum walk with multiple marked vertices

VIEW 2 EXCERPTS

CITES BACKGROUND & METHODS

## Exceptional Configurations for Search by Szegedy's Quantum Walk

VIEW 1 EXCERPT

CITES BACKGROUND

## Adjacent Vertices Can Be Hard to Find by Quantum Walks

VIEW 3 EXCERPTS

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 22 REFERENCES

## Quantum random-walk search algorithm

VIEW 3 EXCERPTS

## Grover Search with Lackadaisical Quantum Walks

VIEW 1 EXCERPT

## Spatial search by quantum walk

VIEW 11 EXCERPTS

HIGHLY INFLUENTIAL

## Coins make quantum walks faster

VIEW 6 EXCERPTS

## Quantum walk algorithm for element distinctness

VIEW 2 EXCERPTS

## Quantum speed-up of Markov chain based algorithms

VIEW 2 EXCERPTS

## Connectivity is a poor indicator of fast quantum search.

VIEW 1 EXCERPT