Experimental Implementation of Quantum Walks on IBM Quantum Computers
arXiv:2002.01905 · doi:10.1007/s11128-020-02938-5
Abstract
The development of universal quantum computers has achieved remarkable success in recent years, culminating with the quantum supremacy reported by Google. Now 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.
References in corpus (20)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- Quantum Mechanics helps in searching for a needle in a haystack
- Quantum Computation and Decision Trees
- Observation of topologically protected bound states in a one dimensional photonic system
- Exploring Topological Phases With Quantum Walks
- A 2D Quantum Walk Simulation of Two-Particle Dynamics
- Photon propagation in a discrete fiber network: An interplay of coherence and losses
- Mimicking the probability distribution of a two-dimensional Grover walk with a single-qubit coin
- The Staggered Quantum Walk Model
- Quantum Random Walks do not need a Coin Toss
- Experimental simulation and limitations of quantum walks with trapped ions
- Experimental realization of a momentum-space quantum walk
- Staggered Quantum Walks with Hamiltonians
- Efficient and scalable quantum walk algorithms via the quantum Fourier transform
- A Comparison of Quantum Walk Implementations on NISQ Computers
- Quantum search on the two-dimensional lattice using the staggered model with Hamiltonians
- The tessellation problem of quantum walks
- The graph tessellation cover number: extremal bounds, efficient algorithms and hardness
- Boundary-induced coherence in the staggered quantum walk on different topologies
Cited by in corpus (28)
- A Comparison of Quantum Walk Implementations on NISQ Computers
- Implementation of quantum compression on IBM quantum computers
- Efficient implementation of discrete-time quantum walks on quantum computers
- Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware
- One-Dimensional Lazy Quantum walk in Ternary System
- Circuit Implementation of Discrete-Time Quantum Walks via the Shunt Decomposition Method
- Circuit Design for -coloring Problem and Its Implementation in Any Dimensional Quantum System
- Parametrized constant-depth quantum neuron
- Circuit Design for Clique Problem and Its Implementation on Quantum Computer
- Coin dimensionality as a resource in quantum metrology involving discrete-time quantum walks
- On Applying the Lackadaisical Quantum Walk Algorithm to Search for Multiple Solutions on Grids
- Discrete-time Semiclassical Szegedy Quantum Walks
- An Overview of Quantum Software Engineering in Latin America
- Coined quantum walks on the line: Disorder, entanglement, and localization
- n-Qubit Operations on Sphere and Queueing Scaling Limits for Programmable Quantum Computer
- High-fidelity state transfer via quantum walks from delocalized states
- Quantum walk processes in quantum devices
- Logarithmic expansion of many-body wave packets in random potentials
- Quantum walks as thermalizations, with application to fullerene graphs
- Optimizing topology for quantum probing with discrete-time quantum walks
- Implementation of hitting times of discrete time quantum random walks on Cubelike graphs
- Recurrence in discrete-time quantum stochastic walks
- Quantum simulation of perfect state transfer on weighted cubelike graphs
- Quantum Walks, Feynman Propagators and Graph Topology on an IBM Quantum Computer
- Implementation of Continuous-Time Quantum Walks on Quantum Computers
- Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks
- United Nation Security Council in Quantum World: Experimental Realization of Quantum Anonymous Veto Protocols using IBM Quantum Computer
- Dissipation in fermionic two-body continuous-time quantum walk under the steepest entropy ascent formalism