Efficient circuits for quantum walks
From MaRDI portal
Publication:3171602
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)
Recommendations
Cited in
(16)- Efficiency of open quantum walk implementation of dissipative quantum computing algorithms
- Quantum simulations of classical random walks and undirected graph connectivity
- Comparing classical and quantum pageranks
- Quantum circuits for discrete-time quantum walks with position-dependent coin operator
- 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
- Szegedy walk unitaries for quantum maps
- Span-program-based quantum algorithm for evaluating unbalanced formulas
- Circuit implementation of discrete-time quantum walks via the shunt decomposition method
- Approximate locality for quantum systems on graphs
- Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits
- 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)
