Superdiffusive quantum stochastic walk definable of arbitrary directed graph

Abstract

In this paper we define a quantum stochastic walk on arbitrary directed graph with super-diffusive propagation on a line graph. Our model is based on global environment interaction QSW, which is known to have ballistic propagation. However we discovered, that in this case additional amplitude transitions occur, hence graph topology is changed into moral graph. Because of that we call the effect a spontaneous moralization. We propose a general correction scheme, which is proved to remove unnecessary transition and thus to preserve the graph topology. In the end we numerically show, that super-diffusive propagation is preserved. Because of that our new model may be applied as effective evolution on arbitrary directed graph.

References in corpus (12)

• Quantum algorithm for solving linear systems of equations
• Optimal Hamiltonian Simulation by Quantum Signal Processing
• Simulating Hamiltonian dynamics with a truncated Taylor series
• Creating superpositions that correspond to efficiently integrable probability distributions
• A random walk approach to quantum algorithms
• Quantum algorithm for simulating the dynamics of an open quantum system
• Simulating sparse Hamiltonians with star decompositions
• A Quantum Algorithm for the Hamiltonian NAND Tree
• Digital quantum simulation of many-body non-Markovian dynamics
• Efficient Quantum Algorithms for Simulating Lindblad Evolution
• QSWalk: a Mathematica package for quantum stochastic walks on arbitrary graphs
• Reexamination of decoherence in quantum walks on the hypercube

Cited by in corpus (23)

• Quantum Chemistry in the Age of Quantum Computing
• Variational quantum simulation of general processes
• Collision models can efficiently simulate any multipartite Markovian quantum dynamics
• A general quantum algorithm for open quantum dynamics demonstrated with the Fenna-Matthews-Olson complex
• Quantum simulation of dissipative collective effects on noisy quantum computers
• Quantum flags, and new bounds on the quantum capacity of the depolarizing channel
• Causal limit on quantum communication
• Quantum Simulation of the Radical Pair Dynamics of the Avian Compass
• Quantum Algorithms for Open Lattice Field Theory
• On the distribution of the mean energy in the unitary orbit of quantum states
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers
• Efficient quantum algorithm to simulate open systems through a single environmental qubit
• QSW_MPI: a framework for parallel simulation of quantum stochastic walks
• Quantum State Discrimination on Reconfigurable Noise-Robust Quantum Networks
• Commutation simulator for open quantum dynamics
• Nonlinear Spectroscopy via Generalized Quantum Phase Estimation
• Bounding the quantum capacity with flagged extensions
• Quantum walks on hypergraphs
• Digital Quantum Simulations of the Non-Resonant Open Tavis-Cummings Model
• Quantum algorithms based on quantum trajectories
• A Randomized Method for Simulating Lindblad Equations and Thermal State Preparation
• Quantum Simulation of Two-Level $PT$-Symmetric Systems Using Hermitian Hamiltonians
• Quantum State Preparation and Non-Unitary Evolution with Diagonal Operators