Dynamics and computation in linear open quantum walks
arXiv:2503.17591 · doi:10.1103/lg6c-sgvn
Abstract
Open Quantum Walks (OQW) are a type of quantum walk governed by the system's interaction with its environment. We explore the time evolution and the limit behavior of the OQW framework for Quantum Computation and show how we can represent random unitary quantum channels, such as the dephasing and depolarizing channels, in this model. We also develop a simulation protocol with circuit representation for this model, which is heavily inspired by the fact that graphs represent OQW and are, thereby, local (meaning that the state in a particular node interacts only with its neighborhood). We obtain asymptotic advantages in the system's dimension, circuit depth, and CNOT count compared to other simulation methods.
References in corpus (23)
- Quantum random walks - an introductory overview
- Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
- Universal computation by quantum walk
- Quantum walks: a comprehensive review
- Realization of quantum walks with negligible decoherence in waveguide lattices
- Universal quantum computation using the discrete time quantum walk
- Quantum Circuits for Isometries
- Open Quantum Random Walks
- Classical approach to the graph isomorphism problem using quantum walks
- Non-Markovian random unitary qubit dynamics
- Non-Markovianity degree for random unitary evolution
- A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex
- Review on Quantum Walk Computing: Theory, Implementation, and Application
- Efficiency of open quantum walk implementation of dissipative quantum computing algorithms
- Two-Unitary Decomposition Algorithm and Open Quantum System Simulation
- Open Quantum Walks: a short introduction
- Photonic quantum walks with four-dimensional coins
- Quantum Simulation of the Radical Pair Dynamics of the Avian Compass
- Microscopic derivation of Open Quantum Walks
- Optimizing Gate Decomposition for High-Level Quantum Programming
- Efficient learning of mixed-state tomography for photonic quantum walk
- Quantum-walk search in motion
- Discrete-Time Open Quantum Walks for Vertex Ranking in Graphs