Quantum walk processes in quantum devices
arXiv:2012.14386 · doi:10.1016/j.heliyon.2023.e13416
Abstract
Simulation and programming of current quantum computers as Noisy Intermediate-Scale Quantum (NISQ) devices represent a hot topic at the border of current physical and information sciences. The quantum walk process represents a basic subroutine in many quantum algorithms and plays an important role in studying physical phenomena. Simulating quantum walk processes is computationally challenging for classical processors. With an increasing improvement in qubits fidelity and qubits number in a single register, there is a potential to improve quantum walks simulations substantially. However, efficient ways to simulate quantum walks in qubit registers still have to be explored. Here, we explore the relationship between quantum walk on graphs and quantum circuits. Firstly, we discuss ways to obtain graphs provided quantum circuit. We then explore techniques to represent quantum walk on a graph as a quantum circuit. Specifically, we study hypercube graphs and arbitrary graphs. Our approach to studying the relationship between graphs and quantum circuits paves way for the efficient implementation of quantum walks algorithms on quantum computers.
arXiv comment11 pages, 5 figures, 3 tables
References in corpus (34)
- Quantum Computing in the NISQ era and beyond
- Quantum Simulation
- An efficient, multiple range random walk algorithm to calculate the density of states
- The scaling laws of human travel
- Quantum random walks - an introductory overview
- Quantum Computation and Decision Trees
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- Perfect state transfer in quantum spin networks
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Hamiltonian Simulation by Qubitization
- Optimal Hamiltonian Simulation by Quantum Signal Processing
- Simulating Hamiltonian dynamics with a truncated Taylor series
- Efficient quantum algorithms for simulating sparse Hamiltonians
- Toward the first quantum simulation with quantum speedup
- Quantum transport simulations in a programmable nanophotonic processor
- Universal computation by multi-particle quantum walk
- On the relationship between continuous- and discrete-time quantum walk
- Adiabatic Quantum Simulation of Quantum Chemistry
- Environment-assisted quantum transport in a 10-qubit network
- Hitting time for quantum walks on the hypercube
- Efficient Quantum Walk on a Quantum Processor
- Architectures for quantum simulation showing a quantum speedup
- Continuous-time Quantum Walks on a Cycle Graph
- Quantum Transport Enhancement by Time-Reversal Symmetry Breaking
- Experimental Implementation of Quantum Walks on IBM Quantum Computers
- Chiral Quantum Walks
- Predicting quantum advantage by quantum walk with convolutional neural networks
- Quantum walks of interacting fermions on a cycle graph
- Experimental demonstration of quantum walks with initial superposition states
- Computing a logarithm of a unitary matrix with general spectrum
- QSWalk: a Mathematica package for quantum stochastic walks on arbitrary graphs
- Simulation of Quantum Walks and Fast Mixing with Classical Processes
- Mixing and Decoherence in Continuous-Time Quantum Walks on Cycles