Implementation of quantum walks on IBM quantum computers
From MaRDI portal
Publication:2684259
DOI10.1007/S11128-020-02938-5OpenAlexW3010330328MaRDI QIDQ2684259
Renato Portugal, F. P. Agostini, F. Acasiete, Jalil Khatibi Moqadam
Publication date: 16 February 2023
Published in: Quantum Information Processing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2002.01905
Related Items (6)
Unitary coined discrete-time quantum walks on directed multigraphs ⋮ Quantum circuits for discrete-time quantum walks with position-dependent coin operator ⋮ Discrete-time semiclassical Szegedy quantum walks ⋮ Circuit implementation of discrete-time quantum walks via the shunt decomposition method ⋮ Total tessellation cover: bounds, hardness, and applications ⋮ Implementation of quantum hitting times of cubelike graphs on IBM’s Qiskit platform
Cites Work
- Unnamed Item
- The staggered quantum walk model
- Decompositions of \(n\)-qubit Toffoli gates with linear circuit complexity
- The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
- Quantum random walks do not need a coin toss
- Quantum Walk Algorithm for Element Distinctness
- Quantum walks and search algorithms
This page was built for publication: Implementation of quantum walks on IBM quantum computers
