### Abstract

This paper addresses the question: what processes take polynomial time on a quantum computer that require exponential time classically? We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one comer to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum walks. We provide the basic framework for quantum hitting time and give two alternative definitions to set the ground for its study on general graphs. We outline a possible application to sequential packet routing.

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

Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |

Editors | Sanjeev Asora, Amit Sahai, Klaus Jansen, Jose D.P. Rolim |

Publisher | Springer-Verlag |

Pages | 354-369 |

Number of pages | 16 |

ISBN (Print) | 3540407707, 9783540407706 |

State | Published - Jan 1 2003 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 2764 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)*(pp. 354-369). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 2764). Springer-Verlag.

**Discrete quantum walks hit exponentially faster.** / Kempe, Julia.

Research output: Chapter in Book/Report/Conference proceeding › Chapter

*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics).*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 2764, Springer-Verlag, pp. 354-369.

}

TY - CHAP

T1 - Discrete quantum walks hit exponentially faster

AU - Kempe, Julia

PY - 2003/1/1

Y1 - 2003/1/1

N2 - This paper addresses the question: what processes take polynomial time on a quantum computer that require exponential time classically? We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one comer to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum walks. We provide the basic framework for quantum hitting time and give two alternative definitions to set the ground for its study on general graphs. We outline a possible application to sequential packet routing.

AB - This paper addresses the question: what processes take polynomial time on a quantum computer that require exponential time classically? We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one comer to its opposite is polynomial in n. This gives the first exponential quantum-classical gap in the hitting time of discrete quantum walks. We provide the basic framework for quantum hitting time and give two alternative definitions to set the ground for its study on general graphs. We outline a possible application to sequential packet routing.

UR - http://www.scopus.com/inward/record.url?scp=35248893912&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=35248893912&partnerID=8YFLogxK

M3 - Chapter

SN - 3540407707

SN - 9783540407706

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 354

EP - 369

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

A2 - Asora, Sanjeev

A2 - Sahai, Amit

A2 - Jansen, Klaus

A2 - Rolim, Jose D.P.

PB - Springer-Verlag

ER -