Implementation of quantum hitting times of cubelike graphs on IBM’s Qiskit platform

DOI10.1142/S0219749922500204OpenAlexW4285088630MaRDI QIDQ5868977

Rishikant Rajdeepak, Jaideep Mulherkar, V. Sunitha

Publication date: 26 September 2022

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0219749922500204

zbMATH Keywords

hitting timesquantum walksquantum circuitscube-like graphs

Mathematics Subject Classification ID

Discrete-time Markov processes on general state spaces (60J05) Quantum computation (81P68) Random walks on graphs (05C81) Quantum mechanics on special spaces: manifolds, fractals, graphs, lattices (81Q35) Quantum algorithms and complexity in the theory of computing (68Q12) Networks and circuits as models of computation; circuit complexity (68Q06)

Uses Software

• QISKit

Cites Work

• Unnamed Item
• Perfect state transfer in cubelike graphs
• State transfer on graphs
• Combinatorics, Paul Erdős is eighty. Vol. 1
• Quantum walks: a comprehensive review
• Discrete quantum walks hit exponentially faster
• Implementation of quantum walks on IBM quantum computers
• Augmented cubes
• QUANTUM WALKS AND THEIR ALGORITHMIC APPLICATIONS
• Quantum walks on graphs
• Optical implementability of the two-dimensional quantum walk
• Quantum walks and search algorithms

This page was built for publication: Implementation of quantum hitting times of cubelike graphs on IBM’s Qiskit platform