Efficient quantum circuits for Szegedy quantum walks
From MaRDI portal
Publication:2362658
DOI10.1016/j.aop.2017.04.006zbMath1366.81116arXiv1609.00173OpenAlexW2514933340MaRDI QIDQ2362658
Publication date: 11 July 2017
Published in: Annals of Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1609.00173
Related Items (9)
Partition-based discrete-time quantum walks ⋮ Quantum walk and its application domains: a systematic review ⋮ Comparing classical and quantum pageranks ⋮ Quantum abstract detecting systems ⋮ Unitary coined discrete-time quantum walks on directed multigraphs ⋮ Explicit Quantum Circuits for Block Encodings of Certain Sparse Matrices ⋮ A systematic method to building Dirac quantum walks coupled to electromagnetic fields ⋮ Discrete-time semiclassical Szegedy quantum walks ⋮ Probability distributions for Markov chain based quantum walks
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Quantum walks can find a marked element on any graph
- Efficient quantum algorithms for simulating sparse Hamiltonians
- On the hitting times of quantum versus random walks
- Quantum complexity of testing group commutativity
- Quantum networks for concentrating entanglement
- EXPONENTIAL IMPROVEMENT IN PRECISION FOR SIMULATING SPARSE HAMILTONIANS
- Search via Quantum Walk
- Universal Quantum Simulators
- The $25,000,000,000 Eigenvector: The Linear Algebra behind Google
- Quantum verification of matrix products
- Simulating quantum systems on a quantum computer
- Quantum mixing of Markov chains for special distributions
- Quantum walks on graphs
- A classical approach to the graph isomorphism problem using quantum walks
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
This page was built for publication: Efficient quantum circuits for Szegedy quantum walks
