Discrete-time quantum walk on circular graph: simulations and effect of gate depth and errors
From MaRDI portal
(Redirected from Publication:5003369)
Random walks on graphs (05C81) Sums of independent random variables; random walks (60G50) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65) Quantum computation (81P68) Computational stability and error-correcting codes for quantum computation and communication processing (81P73)
Recommendations
- Circuit implementation of discrete-time quantum walks via the shunt decomposition method
- Implementation of quantum walks on IBM quantum computers
- Efficient and scalable quantum walk algorithms via the quantum Fourier transform
- Implementation of quantum hitting times of cubelike graphs on IBM's qiskit platform
- QUANTUM WALKS ON GENERAL GRAPHS
Cites work
- Cnot-based design and query management in quantum relational databases
- Decomposition of unitary matrices and quantum gates
- Efficient Realization of Toffoli and NCV Circuits for IBM QX Architectures
- Quantum walks: a comprehensive review
- Realizability assessment of probabilistic quantum cnot gate based on experimental implementation
Cited in
(5)- Double controlled quantum phase gate based on three atoms trapped in separate optical cavities
- Implementation of quantum walks on IBM quantum computers
- Circuit implementation of discrete-time quantum walks via the shunt decomposition method
- Implementation of quantum hitting times of cubelike graphs on IBM's qiskit platform
- Adjustable-depth quantum circuit for position-dependent coin operators of discrete-time quantum walks
This page was built for publication: Discrete-time quantum walk on circular graph: simulations and effect of gate depth and errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5003369)
