Implementation of quantum walks on IBM quantum computers

The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now it is possible to implement short-depth quantum circuits with dozens of qubits and to obtain results with significant fidelity. Quantum walks...

Full description

Saved in:
Bibliographic Details
Published in:Quantum information processing 2020-11, Vol.19 (12), Article 426
Main Authors: Acasiete, F., Agostini, F. P., Moqadam, J. Khatibi, Portugal, R.
Format: Article
Language:English
Subjects:
Data Structures and Information Theory
Mathematical Physics
Physics
Physics and Astronomy
Quantum Computing
Quantum Information Technology
Quantum Physics
Spintronics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now it is possible to implement short-depth quantum circuits with dozens of qubits and to obtain results with significant fidelity. Quantum walks are good candidates to be implemented on the available quantum computers. In this work, we implement discrete-time quantum walks with one and two interacting walkers on cycles, two-dimensional lattices, and complete graphs on IBM quantum computers. We are able to obtain meaningful results using the cycle, the two-dimensional lattice, and the complete graph with 16 nodes each, which require 4-qubit quantum circuits up to depth 100.
ISSN:1570-0755
1573-1332
DOI:10.1007/s11128-020-02938-5