## Abstract

In typical discrete-time quantum walk algorithms, one measures the position of the walker while ignoring its internal spin/coin state. Rather than neglecting the information in this internal state, we show that additionally measuring it doubles the success probability of many quantum spatial search algorithms. For example, this allows Grover's unstructured search problem to be solved with certainty, rather than with probability 1/2 if only the walker's position is measured, so the additional measurement yields a search algorithm that is twice as fast as without it, on average. Thus the internal state of discrete-time quantum walks holds valuable information that can be utilized to improve algorithms. Furthermore, we determine conditions for which spatial search problems on regular graphs are amenable to this doubling of the success probability, and this involves diagrammatically analyzing search using degenerate perturbation theory and deriving a useful formula for how the quantum walk acts in its reduced subspace.

Original language | English (US) |
---|---|

Article number | 455301 |

Journal | Journal of Physics A: Mathematical and Theoretical |

Volume | 49 |

Issue number | 45 |

DOIs | |

State | Published - Oct 19 2016 |

## All Science Journal Classification (ASJC) codes

- Statistical and Nonlinear Physics
- Statistics and Probability
- Modeling and Simulation
- Mathematical Physics
- Physics and Astronomy(all)