Efficient circuits for quantum walks
From MaRDI portal
Applications of Markov chains and discrete-time Markov processes on general state spaces (social mobility, learning theory, industrial processes, etc.) (60J20) Quantum computation (81P68) Quantum stochastic calculus (81S25) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41)
Recommendations
Cited in
(17)- Quantum walks: a comprehensive review
- Efficiency of open quantum walk implementation of dissipative quantum computing algorithms
- Hitting time of quantum walks with perturbation
- Physical implementation of quantum walks
- Efficient quantum circuits for Szegedy quantum walks
- Comparing classical and quantum pageranks
- Efficient and scalable quantum walk algorithms via the quantum Fourier transform
- Circuit implementation of discrete-time quantum walks via the shunt decomposition method
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Approximate locality for quantum systems on graphs
- Span-program-based quantum algorithm for evaluating unbalanced formulas
- Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits
- Quantum walk sampling by growing seed sets
- Quantum simulations of classical random walks and undirected graph connectivity
- Quantum circuits for discrete-time quantum walks with position-dependent coin operator
- Szegedy walk unitaries for quantum maps
- Adjustable-depth quantum circuit for position-dependent coin operators of discrete-time quantum walks
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)
