A random walk approach to quantum algorithms

DOI10.1098/rsta.2006.1901zbMath1152.81751arXivquant-ph/0609035OpenAlexW2150269682WikidataQ40272050 ScholiaQ40272050MaRDI QIDQ5301913

Vivien M. Kendon

Publication date: 20 January 2009

Published in: Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/quant-ph/0609035

zbMATH Keywords

quantum algorithmsquantum computationquantum information

Mathematics Subject Classification ID

Quantum computation (81P68)

Related Items (23)

Quantum walk, entanglement and thermodynamic laws ⋮ The walker speaks its graph: global and nearly-local probing of the tunnelling amplitude in continuous-time quantum walks ⋮ Anyonic quantum walks ⋮ Quantum Walks ⋮ The energy cost of quantum information losses ⋮ Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits ⋮ Quantum walk and its application domains: a systematic review ⋮ Quantum algorithm for smoothed particle hydrodynamics ⋮ Experimental quantum state transfer of an arbitrary single-qubit state on a cycle with four vertices using a coined quantum random walk ⋮ Unitary coined discrete-time quantum walks on directed multigraphs ⋮ A generalization of Schur functions: applications to Nevanlinna functions, orthogonal polynomials, random walks and unitary and open quantum walks ⋮ Directional correlations in quantum walks with two particles ⋮ Understanding and controllingN-dimensional quantum walks via dispersion relations: application to the two-dimensional and three-dimensional Grover walks—diabolical points and more ⋮ A study and analysis of a discrete quantum walk-based hybrid clustering approach using d-regular bipartite graph and 1D lattice ⋮ Some limit laws for quantum walks with applications to a version of the Parrondo paradox ⋮ Green's function approach for quantum graphs: an overview ⋮ Quantum walks: a comprehensive review ⋮ Decoherence in quantum walks – a review ⋮ A Quantum Dynamical Approach to Matrix Khrushchev's Formulas ⋮ Transition effect matrices and quantum Markov chains ⋮ Two-particle coined-quantum walk with long-range interaction ⋮ Quantum Markov chains ⋮ Faster search of clustered marked states with lackadaisical quantum walks

Cites Work

• Universal Quantum Simulators
• Multiple-particle interference and quantum error correction
• Quantum theory, the Church–Turing principle and the universal quantum computer
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

This page was built for publication: A random walk approach to quantum algorithms