Efficient quantum circuits for Szegedy quantum walks
Authors:
- T. LokeTLT. Loke
- J.B. WangJWJ.B. Wang
- 1 July 2017
- journal article
- Published by Elsevier in Annals of Physics
- Vol. 382, 64-84
Abstract
No abstract availableKeywords
All Related Versions
This publication has 24 references indexed in Scilit:
- Hamiltonian Simulation with Nearly Optimal Dependence on all Parameters2015
- Simulating Hamiltonian Dynamics with a Truncated Taylor SeriesPhysical Review Letters, 2015
- Quantum Google in a Complex NetworkScientific Reports, 2013
- Google in a Quantum NetworkScientific Reports, 2012
- Two-particle quantum walks: Entanglement and graph isomorphism testingPhysical Review A, 2011
- Two-particle quantum walks applied to the graph isomorphism problemPhysical Review A, 2010
- A classical approach to the graph isomorphism problem using quantum walksJournal of Physics A: Mathematical and Theoretical, 2008
- Controlling discrete quantum walks: coins and initial statesNew Journal of Physics, 2003
- Quantum computation and decision treesPhysical Review A, 1998
- Universal Quantum SimulatorsScience, 1996