Efficient circuits for quantum walks

zbMATH Open1237.81047arXiv0903.3465MaRDI QIDQ3171602FDOQ3171602

Chen-Fu Chiang, Pawel Wocjan, Daniel Nagaj

Publication date: 5 October 2011

Full work available at URL: https://arxiv.org/abs/0903.3465

Recommendations

• Efficient quantum circuits for Szegedy quantum walks
• Quantum walks on graphs
• Quantum Random Walks – New Method for Designing Quantum Algorithms
• Efficient and scalable quantum walk algorithms via the quantum Fourier transform
• QUANTUM WALKS ON GENERAL GRAPHS

zbMATH Keywords

Markov chainscircuitwalksquantum speedup

Mathematics Subject Classification ID

Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Quantum computation (81P68) Quantum stochastic calculus (81S25)

Cited In (12)

• Span-Program-Based Quantum Algorithm for Evaluating Unbalanced Formulas
• Quantum simulations of classical random walks and undirected graph connectivity
• Quantum circuits for discrete-time quantum walks with position-dependent coin operator
• Comparing classical and quantum pageranks
• Quantum walks: a comprehensive review
• Physical implementation of quantum walks
• Efficient quantum circuits for continuous-time quantum walks on composite graphs
• Hitting time of quantum walks with perturbation
• Efficient quantum circuits for Szegedy quantum walks
• Efficient and scalable quantum walk algorithms via the quantum Fourier transform
• Circuit implementation of discrete-time quantum walks via the shunt decomposition method
• Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits

This page was built for publication: Efficient circuits for quantum walks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3171602)