Skip to content
Preprint

Simplification Rules for Continuous-Time Quantum Walks on Dynamic Graphs

Sep 2026 · 0 citations · 28 references
Physics

TL;DR

This work gives CTQW realizations of the standard single-qubit gates and introduces new graph rewrite rules, which are graph rewrite rules that shorten a dynamic graph sequence while preserving the unitary it implements.

Abstract

Continuous-time quantum walks (CTQWs) on dynamic graphs realize quantum gates as sequences of time-evolving graph Hamiltonians, but naive constructions produce long sequences with redundancy. Simplification rules, which are graph rewrite rules that shorten a dynamic graph sequence while preserving the unitary it implements, are the CTQW analogue of circuit identities in the gate model. In this work, we give CTQW realizations of the standard single-qubit gates and introduce new graph rewrite rules. We demonstrate the simplification rules through worked circuit reductions and outline their use as transpilation primitives for converting between the circuit model and the dynamic graph framework.

View source

Similar papers

Preprint Aug 2026

Predicting Resource Efficient Hamiltonian Decomposition for Continuous-Time Quantum Walk Simulations

This work trains machine learning models to predict, for a given graph, which of the two decompositions produces the smaller CX gate count, and uses the dominant signal from n_Pauli, a property of the Hamiltonian decomposition rather than an intrinsic property of the graph.

Mostafa Atallah, Rebekah Herrman, Zain Saleem · 0 citations
Preprint Sep 2026

One Gate at a Time: Complexity Growth in Random Quantum Circuits

Drawing on insights from stochastic calculus, geometric functional analysis, and randomized linear algebra, the approach exploits the circuit's response to variations of individual gates and requires no control over convergence to high-order unitary designs.

Zhi Li · 1 citation
Preprint Sep 2026

Polynomial-time local-unitary equivalence of graph states

Local-unitary (LU) equivalence asks whether two quantum states differ only by independent changes of basis on their qubits. For graph states, whether this relation can be decided in polynomial time has remained open for over a decade. We give a deterministic algorithm that decides LU equivalence for graphs on $n$ label...

Yuxuan Zhang · 0 citations
Review

Lecture 12: Quantum Walks

This lecture starts the next paradigm for quantum algorithms: quantum walks, which mimic random walks in a way that allows speeding up the algorithmic applications, including sampling from complicated distributions and searching with spatial constraints.

Unknown authors · 0 citations
Preprint Sep 2026

Faster Computation with the Generalized Laplacian Quantum Walk

It is proved that a continuous-time quantum walk effected by a generalized Laplacian, which can arise in spin chains, can solve a computational problem more quickly than typical quantum walks governed by the standard Laplacian or adjacency matrix.

Jonas Duda, Thomas G. Wong · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.