Implementation of quantum hitting times of cubelike graphs on IBM's qiskit platform
From MaRDI portal
(Redirected from Publication:5868977)
Random walks on graphs (05C81) Discrete-time Markov processes on general state spaces (60J05) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35)
Recommendations
- Implementation of quantum walks on IBM quantum computers
- Circuit implementation of discrete-time quantum walks via the shunt decomposition method
- Discrete-time quantum walk on circular graph: simulations and effect of gate depth and errors
- Discrete quantum walks hit exponentially faster
- Discrete quantum walks hit exponentially faster
Cites work
- Augmented cubes
- Combinatorics, Paul Erdős is eighty. Vol. 1
- Discrete quantum walks hit exponentially faster
- scientific article; zbMATH DE number 2144695 (Why is no real title available?)
- Implementation of quantum walks on IBM quantum computers
- Optical implementability of the two-dimensional quantum walk
- Perfect state transfer in cubelike graphs
- Quantum walks and search algorithms
- QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
- Quantum walks on graphs
- Quantum walks: a comprehensive review
- State transfer on graphs
Cited in
(4)
This page was built for publication: Implementation of quantum hitting times of cubelike graphs on IBM's qiskit platform
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868977)
