Simplification Rules for Continuous-Time Quantum Walks on Dynamic Graphs

arXiv:2609.18463 · quant-ph · Submitted 2026-09-16 · Read on arXiv

quant-ph

Submitted: 2026-09-16

Updated: 2026-09-16

Terminology

• Adjacency Matrix — 15× in this paper · explained in 1 episode
• Continuous-Time Quantum Walk — 12× in this paper
• Combinatorial Optimization — 1× in this paper · explained in 2 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes
• Quantum Circuits — 1× in this paper · explained in 2 episodes
• Redundancy — 1× in this paper · explained in 2 episodes

Sources

• Implementation of Continuous-Time Quantum Walks on Quantum Computers
• A matching decomposition algorithm for simulating quantum walk Hamiltonians
• Relating the multi-angle quantum approximate optimization algorithm and continuous-time quantum walks on dynamic graphs
• A Quantum Approximate Optimization Algorithm
• A quantum walk assisted approximate algorithm for bounded NP optimisation problems

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity