Implementation of quantum walks on IBM quantum computers

DOI10.1007/S11128-020-02938-5MaRDI QIDQ2684259zbMATH OpenOpenAlexFDO

Authors F. Acasiete, F. Agostini, Jalil Khatibi Moqadam, R. Portugal

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

zbMATH Keywords

IBM Q experiencequantum circuitsquantum computingquantum walks

Mathematics Subject Classification ID

Quantum computation (81P68)

Recommendations

• Implementation of quantum hitting times of cubelike graphs on IBM's qiskit platform
• Efficient and scalable quantum walk algorithms via the quantum Fourier transform
• Discrete-time quantum walk on circular graph: simulations and effect of gate depth and errors
• Circuit implementation of discrete-time quantum walks via the shunt decomposition method
• scientific article; zbMATH DE number 7453153

Cites work

• Decompositions of n-qubit Toffoli gates with linear circuit complexity
• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• Quantum random walks do not need a coin toss
• Quantum Walk Algorithm for Element Distinctness
• Quantum walks and search algorithms
• The graph tessellation cover number: chromatic bounds, efficient algorithms and hardness
• The staggered quantum walk model

Cited in

(18)

• Physical implementation of quantum walks
• Total tessellation cover: bounds, hardness, and applications
• Efficient and scalable quantum walk algorithms via the quantum Fourier transform
• Circuit implementation of discrete-time quantum walks via the shunt decomposition method
• Universal computation by multiparticle quantum walk
• Solid state implementation of quantum random walks on general graphs
• Discrete-time quantum walk on circular graph: simulations and effect of gate depth and errors
• scientific article; zbMATH DE number 7453153 (Why is no real title available?)
• Gate-based circuit designs for quantum adder-inspired quantum random walks on superconducting qubits
• Implementation of quantum hitting times of cubelike graphs on IBM's qiskit platform
• 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
• High-fidelity state transfer via quantum walks from delocalized states
• No perfect state transfer in trees with more than 3 vertices
• Quantum simulation of perfect state transfer on weighted cubelike graphs
• An overview of quantum software engineering in Latin America
• Coined quantum walks on complex networks for quantum computers

This page was built for publication: Implementation of quantum walks on IBM quantum computers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2684259)