Efficient implementation of discrete-time quantum walks on quantum computers
arXiv:2402.01854 · doi:10.3390/e26040313
Abstract
Quantum walks have proven to be a universal model for quantum computation and to provide speed-up in certain quantum algorithms. The discrete-time quantum walk (DTQW) model, among others, is one of the most suitable candidates for circuit implementation, due to its discrete nature. Current implementations, however, are usually characterized by quantum circuits of large size and depth, which leads to a higher computational cost and severely limits the number of time steps that can be reliably implemented on current quantum computers. In this work, we propose an efficient and scalable quantum circuit implementing the DTQW on the -cycle based on the diagonalization of the conditional shift operator. For time-steps of the DTQW, the proposed circuit requires only two-qubit gates compared to the of the current most efficient implementation based on quantum Fourier transforms. We test the proposed circuit on an IBM quantum device for a Hadamard DTQW on the - and -cycle characterized by periodic dynamics and recurrent generation of maximally entangled single-particle states. Experimental results are meaningful well beyond the regime of few time steps, paving the way for reliable implementation and use on quantum computers.
arXiv commentAccepted version: 24 pages, 12 figures
References in corpus (50)
- Quantum entanglement
- Quantum Computing in the NISQ era and beyond
- Elementary gates for quantum computation
- Noisy intermediate-scale quantum (NISQ) algorithms
- Quantum Computation and Decision Trees
- A Quantum Random Walk Search Algorithm
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Spatial search by quantum walk
- Probing entanglement entropy via randomized measurements
- Experimental Comparison of Two Quantum Computing Architectures
- Universal quantum computation using the discrete time quantum walk
- Qudit Quantum State Tomography
- Experimental Implementation of Discrete Time Quantum Random Walk on an NMR Quantum Information Processor
- Controlling discrete quantum walks: coins and intitial states
- Challenges and Opportunities of Near-Term Quantum Computing Systems
- A random walk approach to quantum algorithms
- Relationship Between Quantum Walk and Relativistic Quantum Mechanics
- Classical approach to the graph isomorphism problem using quantum walks
- Efficient Quantum Walk on a Quantum Processor
- Perfect state transfer and efficient quantum routing: a discrete-time quantum walk approach
- Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
- Quantum Walks as simulators of neutrino oscillations in vacuum and matter
- Quadratic speedup for spatial search by continuous-time quantum walk
- Experimental Implementation of Quantum Walks on IBM Quantum Computers
- Quantum key distribution with quantum walks
- Quantum Logic with Interacting Bosons in 1D
- Universal quantum computing using single-particle discrete-time quantum walk
- Discrete-time quantum walk on complex networks for community detection
- A quantum-walk-inspired adiabatic algorithm for graph isomorphism
- Efficient quantum circuits for arbitrary sparse unitaries
- Qubit state transfer via discrete-time quantum walks
- Discrete-time quantum walk algorithm for ranking nodes on a network
- Quantum state revivals in quantum walks on cycles
- The Grover search as a naturally occurring phenomenon
- Efficient and scalable quantum walk algorithms via the quantum Fourier transform
- A Comparison of Quantum Walk Implementations on NISQ Computers
- Photonic Discrete-time Quantum Walks and Applications
- Efficient quantum circuits for continuous-time quantum walks on composite graphs
- Link prediction with continuous-time classical and quantum walks
- Quantum routing of information using chiral quantum walks
- Quantum direct communication protocols using discrete-time quantum walk
- Order from chaos in quantum walks on cyclic graphs
- Quantum direct communication protocol using recurrence in k-cycle quantum walk
- Quantum circuits for the realization of equivalent forms of one-dimensional discrete-time quantum walks on near-term quantum hardware
- Multi-qubit quantum computing using discrete-time quantum walks on closed graphs
- Circuit Implementation of Discrete-Time Quantum Walks via the Shunt Decomposition Method
- Error suppression by a virtual two-qubit gate
- Cycle discrete-time quantum walks on a noisy quantum computer
- Recurrent generation of maximally entangled single particle states via quantum walks on cyclic graphs
Cited by in corpus (6)
- Review on Quantum Walk Computing: Theory, Implementation, and Application
- Adaptive Lattice Gas Algorithm: Classical and Quantum implementations
- Recurrence in discrete-time quantum stochastic walks
- Controlling quantum chaos via Parrondo strategies on noisy intermediate-scale quantum hardware
- Circuit Implementation of Discrete-Time Quantum Walks on Complex Networks
- Implementation of Continuous-Time Quantum Walks on Quantum Computers