On the Relationship Between Continuous- and Discrete-Time Quantum Walk
Open accessThe DOI matches its Crossref record; 82 of the 82 references it cites were found in a registry or an index.
Abstract
Quantum walk is one of the main tools for quantum algorithms. Defined by analogy to classical random walk, a quantum walk is a time-homogeneous quantum process on a graph. Both random and quantum walks can be defined either in continuous or discrete time. But whereas a continuous-time random walk can be obtained as the limit of a sequence of discrete-time random walks, the two types of quantum walk appear fundamentally different, owing to the need for extra degrees of freedom in the discrete-time case.In this article, I describe a precise correspondence between continuous- and discrete- time quantum walks on arbitrary graphs. Using this correspondence, I show that continuous-time quantum walk can be obtained as an appropriate limit of discrete-time quantum walks. The correspondence also leads to a new technique for simulating Hamiltonian dynamics, giving efficient simulations even in cases where the Hamiltonian is not sparse. The complexity of the simulation is linear in the total evolution time, an improvement over simulations based on high-order approximations of the Lie product formula. As applications, I describe a continuous-time quantum walk algorithm for element distinctness and show how to optimally simulate continuous-time query algorithms of a certain form in the conventional quantum query model. Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“This Bayesian estimation approach to quantum phase estimation has recently been shown experimentally 278 , demonstrating its robustness to noise and decoherence.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [278]
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472
Quantum Mechanics Helps in Searching for a Needle in a Haystack
Grover, L. K. (1997) · Physical Review Letters · doi:10.1103/physrevlett.79.325 · Cited by 4,306 · cited 2×
“Indeed, since Grover’s well-known search algorithm [30] can be interpreted as a quantum walk on the complete graph, amchilds@uwaterloo.”
BackgroundMethodLloyd, S. (1996) · Science · doi:10.1126/science.273.5278.1073 · Cited by 3,088 · cited 1×
“More generally, a Hamiltonian can be simulated efficiently provided it is sparse and efficiently row-computable.”
BackgroundCleve, R., Ekert, A., Macchiavello, C., & Mosca, M. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0164 · Cited by 1,299
Quantum computation and decision trees
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.58.915 · Cited by 1,215 · cited 1×
“As applications, I describe a continuous-time quantum walk algorithm for element distinctness and show how to optimally simulate continuous-time query algorithms of a certain form in the conventional quantum query model.”
MethodQuantum random-walk search algorithm
Shenvi, N., Kempe, J., & Whaley, K. B. (2003) · Physical Review A · doi:10.1103/physreva.67.052307 · Cited by 1,150 · cited 1×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
MethodReversible Markov Chains and Random Walks on Graphs
Aldous, D., & Fill, J. A. (2014) · Cited by 973
Locality in Distributed Graph Algorithms
Linial, N. (1992) · SIAM Journal on Computing · doi:10.1137/0221015 · Cited by 870 · cited 1×
“Suppose we color the edges of the graph of nonzero entries of H; then the subgraphs of any particular color consist of isolated edges, meaning that the evolution on any one of these subgraphs takes place in isolated two-dimensional subspaces, and is easily simulated.”
BackgroundExponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780552 · Cited by 825 · cited 6×
“For example, while the exponential speedup by continuous-time quantum walk described in [12] is generally suspected to carry over to the discrete-time model, the dynamics are more involved, and to the best of my knowledge no rigorous analysis has been provided so far.”
BackgroundInfluentialSelf-citationWEIL, A. A. (1948) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.34.5.204 · Cited by 801 · cited 1×
“A classic result of Weil says that, provided ψ is nontrivial and c 6= 0, the absolute value of the Kloosterman sum is at most 2√q [53].”
BackgroundSpatial search by quantum walk
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.022314 · Cited by 725 · cited 5×
“In principle, this could be done using techniques from [15, 16].”
BackgroundMethodInfluentialSelf-citationQuantum Walk Algorithm for Element Distinctness
Ambainis, A. (2007) · SIAM Journal on Computing · doi:10.1137/s0097539705447311 · Cited by 703
Efficient Quantum Algorithms for Simulating Sparse Hamiltonians
Berry, D. W., Ahokas, G., Cleve, R., & Sanders, B. C. (2007) · Communications in Mathematical Physics · doi:10.1007/s00220-006-0150-x · Cited by 692 · cited 3×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
MethodAharonov, D., Ambainis, A., Kempe, J., & Vazirani, U. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380758 · Cited by 654 · cited 1×
“1 Similarly, one can define two notions of quantum walk, the continuous-time quantum walk [14, 27] and the discrete-time quantum walk [2, 6, 52].”
BackgroundQuantum search by local adiabatic evolution
Roland, J., & Cerf, N. J. (2002) · Physical Review A · doi:10.1103/physreva.65.042308 · Cited by 629 · cited 1×
“Note, however, that almost all known continuous-time quantum algorithms have HD time-independent (with the notable exception of adiabatic algorithms for search [22, 43], which can nevertheless be simulated efficiently in the quantum circuit model [44]) and satisfy ‖abs(HD)‖ = O(1).”
Background(2004) · doi:10.1109/focs.2004.53 · Cited by 599
Ambainis, A., Bach, E., Nayak, A., Vishwanath, A., & Watrous, J. (2001) · Proceedings of the thirty-third annual ACM symposium on Theory of computing · doi:10.1145/380752.380757 · Cited by 562 · cited 1×
“As applications, I describe a continuous-time quantum walk algorithm for element distinctness and show how to optimally simulate continuous-time query algorithms of a certain form in the conventional quantum query model.”
MethodFrom quantum cellular automata to quantum lattice gases
Meyer, D. A. (1996) · Journal of Statistical Physics · doi:10.1007/bf02199356 · Cited by 556 · cited 1×
“In particular, there is no translationinvariant discrete-time unitary process on a d-dimensional lattice [37, 38], and in fact, only graphs with special properties can support local unitary dynamics at all, even without homogeneity restrictions [46].”
BackgroundEquations over Finite Fields An Elementary Approach
Schmidt, W. M. (1976) · Lecture Notes in Mathematics · doi:10.1007/bfb0080437 · Cited by 520
From Quantum Cellular Automata To Quantum Lattice Gases
Meyer, D., Qca, F., David, Q., & Meyer, A. (1996) · CERN Document Server (European Organization for Nuclear Research) · Cited by 496
An Example of the Difference Between Quantum and Classical Random Walks
Childs, A. M., Farhi, E., & Gutmann, S. (2002) · Quantum Information Processing · doi:10.1023/a:1019609420309 · Cited by 481 · cited 1×
“1 Similarly, one can define two notions of quantum walk, the continuous-time quantum walk [14, 27] and the discrete-time quantum walk [2, 6, 52].”
BackgroundSelf-citationAnalog analogue of a digital quantum computation
Farhi, E., & Gutmann, S. (1998) · Physical Review A · doi:10.1103/physreva.57.2403 · Cited by 384 · cited 1×
“Such a model was first introduced by Farhi and Gutmann to describe a continuous-time analog [26] of Grover’s search algorithm [30]; it was later studied in a broader context by Mochon [39] and applied to the quantum walk algorithm for evaluating balanced binary game trees [25].”
MethodQuantum Walk on the LinePreprint
Ashwin, N., & Vishwanath, A. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0010117 · Cited by 371
Quantum lower bounds for the collision and the element distinctness problems
Aaronson, S., & Shi, Y. (2004) · Journal of the ACM · doi:10.1145/1008731.1008735 · Cited by 328
Adiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta-Shma, A. (2003) · Proceedings of the thirty-fifth annual ACM symposium on Theory of computing · doi:10.1145/780542.780546 · Cited by 322 · cited 2×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
BackgroundMethodCoins Make Quantum Walks Faster
Ambainis, A., Kempe, J., & Rivosh, A. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0402107 · Cited by 245 · cited 2×
“Unlike quantum algorithms for search on low-degree graphs [8, 16, 17, 52], no continuous-time analog of the element distinctness algorithm has been known: the walk takes place on a high-degree Johnson graph, and sparse Hamiltonian techniques are insufficient to implement it.”
MethodCreating superpositions that correspond to efficiently integrable probability distributions
Grover, L. K., & Rudolph, T. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0208112 · Cited by 221 · cited 3×
“Indeed, the discrete-time quantum walk can be carried out efficiently provided only that the Hamiltonian is efficiently index-computable, and that the weights appearing in the states (4) are integrable in the sense of [29].”
BackgroundInfluentialQuantum Simulations of Classical Random Walks and Undirected Graph Connectivity
Watrous, J. (2001) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1732 · Cited by 216
Quantum Algorithms for Some Hidden Shift Problems
van Dam, W., Hallgren, S., & Ip, L. (2006) · SIAM Journal on Computing · doi:10.1137/s009753970343141x · Cited by 215
Bužek, V., Derka, R., & Massar, S. (1999) · Physical Review Letters · doi:10.1103/physrevlett.82.2207 · Cited by 212 · cited 1×
“e. However, other input states can give better estimates depending on the application. In particular, the initial state r 2 M+1 MX−1 x=0 sin π(x+1) M+1 |xi (48) minimizes the variance of the estimate [11, 20, 34], so it gives the best possible bound in (47). This initial state leads to the probability distribution |aθ…”
BackgroundQuantum Walks on the Hypercube
Moore, C., & Russell, A. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-45726-7_14 · Cited by 207 · cited 1×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
MethodHow Powerful is Adiabatic Quantum Computation
van Dam, W., Mosca, M., & Vazirani, U. V. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 204
Faster quantum-walk algorithm for the two-dimensional spatial search
Tulsi, A. (2008) · Physical Review A · doi:10.1103/physreva.78.012310 · Cited by 185 · cited 1×
“Unlike quantum algorithms for search on low-degree graphs [8, 16, 17, 52], no continuous-time analog of the element distinctness algorithm has been known: the walk takes place on a high-degree Johnson graph, and sparse Hamiltonian techniques are insufficient to implement it.”
MethodConnecting the discrete- and continuous-time quantum walks
Strauch, F. W. (2006) · Physical Review A · doi:10.1103/physreva.74.030301 · Cited by 180 · cited 1×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
MethodMagniez, F., Nayak, A., Roland, J., & Sántha, M. (2007) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1250790.1250874 · Cited by 179 · cited 1×
“This approach was later generalized [35, 50] and applied to quantum algorithms for triangle finding [36], checking matrix multiplication [10], and testing group commutativity [34].”
MethodQuantum information processing in continuous time
Childs, A. M., & Farhi, E. (2004) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 167
Self-citationAny AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer
Ambainis, A., Childs, A. M., Reichardt, B. W., Špalek, R., & Zhang, S. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.57 · Cited by 160 · cited 4×
“But for algorithms that effectively work in a low-energy subspace (e.g., [16, 17]), or that only depend on a small spectral gap (e.g., [7, 43]), it may be feasible to use little or no rescaling.”
BackgroundMethodInfluentialSelf-citationSpatial search and the Dirac equation
Childs, A. M., & Goldstone, J. (2004) · Physical Review A · doi:10.1103/physreva.70.042312 · Cited by 146
Self-citationA Quantum Algorithm for the Hamiltonian NAND TreePreprint
Farhi, E., Goldstone, J., & Gutmann, S. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0702144 · Cited by 141 · cited 2×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
BackgroundMethodQuantum lower bounds for the collision and the element distinctness problems
Shi, Y. (2003) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2002.1181975 · Cited by 135
Exponential algorithmic speedup by a quantum walk
Childs, A. M., Cleve, R., Deotto, E., Farhi, E., Gutmann, S., & Spielman, D. A. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780551.780552 · Cited by 135
Self-citationQuantum Walks On GraphsPreprint
Aharonov, D., Ambainis, A., Kempe, J., & Vazirani, U. V. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0012090 · Cited by 127 · cited 1×
“1 Similarly, one can define two notions of quantum walk, the continuous-time quantum walk [14, 27] and the discrete-time quantum walk [2, 6, 52].”
BackgroundOn the absence of homogeneous scalar unitary cellular automata
Meyer, D. (1996) · Physics Letters A · doi:10.1016/s0375-9601(96)00745-1 · Cited by 125 · cited 1×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
MethodOptimum phase-shift estimation and the quantum description of the phase difference
Luis, A., & Peřina, J. (1996) · Physical Review A · doi:10.1103/physreva.54.4564 · Cited by 123 · cited 1×
“minimizes the variance of the estimate [11,20, 34 ], so it gives the best possible bound in (47).”
BackgroundAny AND-OR Formula of Size N Can Be Evaluated in Time $N^{1/2+o(1)}$ on a Quantum Computer
Ambainis, A., Childs, A. M., Reichardt, B. W., Špalek, R., & Zhang, S. (2010) · SIAM Journal on Computing · doi:10.1137/080712167 · Cited by 122
Self-citationBrouwer, A. E., Cohen, A. M., & Neumaier, A. (1989) · Universitext · doi:10.1007/978-1-4614-1939-6_11 · Cited by 121
Quantum algorithms for the triangle problem
Magniez, F., Sántha, M., & Szegedy, M. (2005) · Symposium on Discrete Algorithms · doi:10.5555/1070432.1070591 · Cited by 116
Optimal Quantum Circuits for General Phase Estimation
van Dam, W., D’Ariano, G. M., EKERT, A. K., Macchiavello, C., & Mosca, M. (2007) · Physical Review Letters · doi:10.1103/physrevlett.98.090501 · Cited by 115 · cited 1×
“In particular, the initial state √ 2 M + 1 M−1 ∑ x=0 sin π(x+ 1) M + 1 |x〉 (48) minimizes the variance of the estimate [11, 20, 34], so it gives the best possible bound in (47).”
BackgroundAdiabatic Quantum State Generation and Statistical Zero KnowledgePreprint
Aharonov, D., & Ta‐Shma, A. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0301023 · Cited by 109 · cited 2×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
BackgroundMethodSpan-program-based quantum algorithm for evaluating formulas
Reichardt, B. W., & Špalek, R. (2008) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1374376.1374394 · Cited by 108 · cited 4×
“This approach was later generalized [36, 51] and applied to quantum algorithms for triangle finding [37], checking matrix multiplication [10], and testing group commutativity [35].”
BackgroundMethodInfluential2006, Quantum verification of matrix products
Buhrman, H., & Špalek, R. (2004) · UvA-DARE (University of Amsterdam) · Cited by 103
On The Randomness of Legendre and Jacobi Sequences
Damgård, I. (1990) · Lecture notes in computer science · doi:10.1007/0-387-34799-2_13 · Cited by 98
Quantum verification of matrix products
Buhrman, H., & Špalek, R. (2006) · ACM-SIAM Symposium on Discrete Algorithms (SODA) · doi:10.1145/1109557.1109654 · Cited by 97 · cited 1×
“This approach was later generalized [35, 50] and applied to quantum algorithms for triangle finding [36], checking matrix multiplication [10], and testing group commutativity [34].”
MethodQuantum Complexity of Testing Group Commutativity
Magniez, F., & Nayak, A. (2007) · Algorithmica · doi:10.1007/s00453-007-0057-8 · Cited by 93 · cited 1×
“This approach was later generalized [35, 50] and applied to quantum algorithms for triangle finding [36], checking matrix multiplication [10], and testing group commutativity [34].”
MethodSpectra of Quantized Walks and a $\sqrt{δε}$ rulePreprint
Szegedy, M. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0401053 · Cited by 86
Quantum Algorithms for Hidden Nonlinear Structures
Childs, A. M., Schulman, L. J., & Vazirani, U. V. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.18 · Cited by 85
Self-citationAdiabatic quantum state generation and statistical zero knowledge
Aharonov, D., & Ta‐Shma, A. (2003) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/780543.780546 · Cited by 80
On the Digraph of a Unitary Matrix
Simone Severini, B. (2003) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/s0895479802410293 · Cited by 73 · cited 1×
“In particular, there is no translationinvariant discrete-time unitary process on a d-dimensional lattice [37, 38], and in fact, only graphs with special properties can support local unitary dynamics at all, even without homogeneity restrictions [46].”
BackgroundQuantum Walks on the HypercubePreprint
Moore, C., & Russell, A. C. (2001) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0104137 · Cited by 73 · cited 1×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
MethodMochon, C. (2007) · Physical Review A · doi:10.1103/physreva.75.042313 · Cited by 64 · cited 2×
“Such a model was first introduced by Farhi and Gutmann to describe a continuous-time analog [26] of Grover’s search algorithm [30]; it was later studied in a broader context by Mochon [39] and applied to the quantum walk algorithm for evaluating balanced binary game trees [25].”
MethodQUANTUM ALGORITHMS FOR SOME HIDDEN SHIFT PROBLEMS
van Dam, W., Hallgren, S., & Ip, L. (2002) · Cited by 59
Quantum algorithms for subset finding
Childs, A. M., & Eisenberg, J. M. (2003) · CERN Document Server (European Organization for Nuclear Research) · Cited by 54
Self-citationQuantum-circuit model of Hamiltonian search algorithms
Roland, J., & Cerf, N. J. (2003) · Physical Review A · doi:10.1103/physreva.68.062311 · Cited by 45 · cited 1×
“Note, however, that almost all known continuous-time quantum algorithms have HD time-independent (with the notable exception of adiabatic algorithms for search [22,44], which can nevertheless be simulated efficiently in the quantum circuit model [ 45 ]) and satisfy � abs(HD) �= O(1).”
BackgroundAlmost Tight Bound for the Union of Fat Tetrahedra in Three Dimensions
Ezra, E. E., & Sharir, M. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.10 · Cited by 45
Quantum Verification of Matrix ProductsPreprint
Buhrman, H., & Špalek, R. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0409035 · Cited by 45 · cited 1×
“This approach was later generalized [35, 50] and applied to quantum algorithms for triangle finding [36], checking matrix multiplication [10], and testing group commutativity [34].”
MethodEfficient discrete-time simulations of continuous-time quantum query algorithms
Cleve, R., Gottesman, D., Mosca, M., Somma, R. D., & Yonge-Mallo, D. L. (2009) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/1536414.1536471 · Cited by 40 · cited 4×
“In the case where HD is time-independent and satisfies ‖abs(HD)‖ = O(1), this simulation outperforms [19].”
BackgroundMethodInfluentialA nearly optimal discrete query quantum algorithm for evaluating NAND formulasPreprint
Ambainis, A. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0704.3628 · Cited by 38
Quantum algorithms for subset finding
Childs, A. M., & Eisenberg, J. M. (2005) · Quantum Information and Computation · doi:10.26421/qic5.7-7 · Cited by 36
Self-citationQuantum computation of zeta functions of curves
Kedlaya, K. S. (2006) · Computational Complexity · doi:10.1007/s00037-006-0204-7 · Cited by 30 · cited 1×
“(Note that for the special case of small characteristic, it is possible to calculate more general exponential sums using the results of [31], as observed by Shparlinski; see [17].”
ResultQuantum Complexity of Testing Group CommutativityPreprint
Magniez, F., & Nayak, A. (2005) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0506265 · Cited by 22 · cited 1×
“This approach was later generalized [35, 50] and applied to quantum algorithms for triangle finding [36], checking matrix multiplication [10], and testing group commutativity [34].”
MethodQuantum walk algorithm for element distinctnessPreprint
Ambainis, A. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0311001 · Cited by 20 · cited 3×
“Finally, I discuss limitations of the method for simulating Hamiltonians with negative matrix elements, and present two problems that motivate attempting to circumvent these limitations.”
BackgroundMethodAny AND-OR Formula of Size N can be Evaluated in time N^{1/2 + o(1)} on a Quantum Computer
Ambainis, A., Childs, A. M., Reichardt, B. W., Špalek, R., & Zhang, S. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.4389507 · Cited by 19
Self-citationOptimal phase estimation in quantum networks
van Dam, W., D’Ariano, G. M., EKERT, A. K., Macchiavello, C., & Mosca, M. (2007) · Journal of Physics A Mathematical and Theoretical · doi:10.1088/1751-8113/40/28/s07 · Cited by 17 · cited 1×
“e. However, other input states can give better estimates depending on the application. In particular, the initial state r 2 M+1 MX−1 x=0 sin π(x+1) M+1 |xi (48) minimizes the variance of the estimate [11, 20, 34], so it gives the best possible bound in (47). This initial state leads to the probability distribution |aθ…”
BackgroundAn Analog Analogue of a Digital Quantum ComputationPreprint
Farhi, E., & Gutmann, S. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/9612026 · Cited by 16 · cited 1×
“Such a model was first introduced by Farhi and Gutmann to describe a continuous-time analog [26] of Grover’s search algorithm [30]; it was later studied in a broader context by Mochon [39] and applied to the quantum walk algorithm for evaluating balanced binary game trees [25].”
MethodQuantum Algorithms for Hidden Nonlinear Structures
Childs, A. M., Schulman, L. J., & Vazirani, U. V. (2007) · Annual Symposium on Foundations of Computer Science · doi:10.1109/focs.2007.4389510 · Cited by 11
Self-citationQuantum Algorithms for the Triangle ProblemPreprint
Magniez, F., Sántha, M., & Szegedy, M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0310134 · Cited by 11 · cited 1×
“This approach was later generalized [35, 50] and applied to quantum algorithms for triangle finding [36], checking matrix multiplication [10], and testing group commutativity [34].”
MethodQuantum-circuit model of Hamiltonian search algorithms (6 pages)
Cerf, N. J., & Roland, J. (2003) · Physical Review A · Cited by 6
Quantum Algorithms for some Hidden Shift ProblemsPreprint
van Dam, W., Hallgren, S., & Ip, L. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0211140 · Cited by 3
Quantum computation of zeta functions of curvesPreprint
Kedlaya, K. S. (2004) · arXiv (Cornell University) · doi:10.48550/arxiv.math/0411623 · Cited by 1 · cited 1×
“(Note that for the special case of small characteristic, it is possible to calculate more general exponential sums using the results of [31], as observed by Shparlinski; see [17].”
ResultQuantum simulations of classical random walks and undirected graph connectivityPreprint
Watrous, J. (1998) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/9812012 · Cited by 1 · cited 2×
“However, by enlarging the state space to include extra degrees of freedom, sometimes referred to as a quantum coin—or equivalently, by considering a walk on the directed edges of a graph—this limitation can be overcome [52].”
BackgroundQuantum circuit implementation of the Hamiltonian versions of Grover's algorithm
Roland, J., & Cerf, N. J. (2003) · CERN Document Server (European Organization for Nuclear Research) · doi:10.48550/arxiv.quant-ph/0302138 · cited 1×
“Note, however, that almost all known continuous-time quantum algorithms have HD time-independent (with the notable exception of adiabatic algorithms for search [22,44], which can nevertheless be simulated efficiently in the quantum circuit model [ 45 ]) and satisfy � abs(HD) �= O(1).”
BackgroundQuantum algorithms for subset findingPreprint
Childs, A. M., & Eisenberg, J. M. (2003) · arXiv (Cornell University) · doi:10.48550/arxiv.quant-ph/0311038
Self-citation
Cited by
Quantum Algorithm for Linear Systems of Equations
Harrow, A. W., Hassidim, A., & Lloyd, S. (2009) · Physical Review Letters · doi:10.1103/physrevlett.103.150502 · Cited by 3,325
“Some variants of this idea are considered in [4, 12, 20].”
BackgroundMethodInfluentialQuantum Support Vector Machine for Big Data Classification
Rebentrost, P., Mohseni, M., & Lloyd, S. (2014) · Physical Review Letters · doi:10.1103/physrevlett.113.130503 · Cited by 1,951
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560
Quantum Walks of Correlated Photons
Peruzzo, A., Lobino, M., Matthews, J. C. F., Matsuda, N., Politi, A., Poulios, K., Zhou, X.-Q., Lahini, Y., Ismail, N., Wörhoff, K., et al. (2010) · Science · doi:10.1126/science.1193515 · Cited by 929
Quantum walks: a comprehensive review
Venegas-Andraca, S. E. (2012) · Quantum Information Processing · doi:10.1007/s11128-012-0432-5 · Cited by 934
“Child’s contribution In [110], Childs presents the following mathematical framework for simulating a continuous quantum walk as a limit ( − approximation) of discrete quantum walks (for the sake of clarity and readability of the original paper, we closely follow the notation used in [110]): (a) Let H be a general N ×…”
Method
Metadata
- Authors
- Childs, A. M.
- Affiliations
- University of Waterloo (CA)
- Corresponding author
- Childs, Andrew M.
- ORCID
- Childs, Andrew M.
- Venue
- Communications in Mathematical Physics
- Published
- 2009-10-10
- Volume
- 294
- Issue
- 2
- Pages
- 581-603
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2098948451
- Cited by
- 411
- References
- 70
- Citations by year
- 2026: 15 · 2025: 32 · 2024: 39 · 2023: 48 · 2022: 34 · 2021: 30 · 2020: 24 · 2019: 31 · 2018: 16 · 2017: 21 · 2016: 18 · 2015: 13 · 2014: 17 · 2013: 12 · 2012: 21
- FWCI
- 19.96
- Type
- journal article
- Language
- en
- Open access
- green
- arxiv.org
- Licence
- www.springer.com/tdm (tdm)
- Locations
- Communications in Mathematical Physics (publishedVersion)
- arXiv (Cornell University) (acceptedVersion)
- arXiv (Cornell University)
- Funders
- Mitacs
- Natural Sciences and Engineering Research Council of Canada
- Army Research Office
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Information and Cryptography
- Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
- Keywords
- continuous-time quantum walks, discrete-time quantum walks, Hamiltonian simulation, element distinctness
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.