Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:0910.5397 · Physical Review A

Control by quantum dynamics on graphs

Chris D. Godsil, Simone Severini B

Published May 14, 2010• 46 citations
arXivHTMLPDF

Abstract

We address the study of controllability of a closed quantum system whose dynamical Lie algebra is generated by adjacency matrices of graphs. We characterize a large family of graphs that renders a system controllable. The key property is a graph-theoretic feature consisting of a particularly disordered cycle structure. Disregarding efficiency of control functions, but choosing subfamilies of sparse graphs, the results translate into continuous-time quantum walks for universal computation.

DOI
10.1103/physreva.81.052316

Related papers

Perfect State Transfer in Quantum Walks on Graphs

Viv M. Kendon, Christino Tamon

We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time walks quantum walks on highly structured graphs exhibit perfect state transfer for the complete graph of size 2, the path of length 3, and the cycle of size 4. From these, larger graphs can be constructed, and the use of edge weights widens this set considerably. Discrete-time quantum walks have more flexibility through exploiting the coin degrees of freedom, but with the disadvantage that local control of the coin is required if the degree of the vertices varies. The closely related property of periodicity (exact return to the starting state) is also mentioned.

Journal of Computational and Theoretical Nanoscience•Mar 1, 2011•104 citations

On the quantum simulation of complex networks

Duarte Magano, João P. Moutinho, Bruno Coelho Coutinho

Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links. Continuous-time quantum walk algorithms assume that we can simulate the dynamics of quantum systems where the Hamiltonian is given by the adjacency matrix of the graph. It is known that such can be simulated efficiently if the underlying graph is row-sparse and efficiently row-computable. While this is sufficient for many applications, it limits the applicability for this class of algorithms to study real world complex networks, which, among other properties, are characterized by the existence of a few densely connected nodes, called hubs. In other words, complex networks are typically not row-sparse, even though the average connectivity over all nodes can be very small. In this work, we extend the state-of-the-art results on quantum simulation to graphs that contain a small number of hubs, but that are otherwise sparse. Hopefully, our results may lead to new applications of quantum computing to network science.

arXiv:2212.06126•SciPost Physics Core•Aug 24, 2023•6 citations

Continuous-time quantum walks on dynamic graphs

Rebekah Herrman, Travis S. Humble

Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an ordered sequence of graphs governs free evolution of the quantum walk. We then consider how perfect state transfer during the quantum walk can be used to design dynamic graphs that implement a universal set of quantum logic gates. We give explicit examples for a complete logical basis, and we validate implementations using numerical simulations for quantum teleportation and addition circuits. Finally, we discuss the potential for realizing CTQWs on dynamic graphs using actively controlled quantum optical waveguides.

arXiv:1902.01346•Physical Review A•Jul 8, 2019•25 citations

Isolated vertices in continuous-time quantum walks on dynamic graphs

Thomas G. Wong

It was recently shown that continuous-time quantum walks on dynamic graphs, i.e., sequences of static graphs whose edges change at specific times, can implement a universal set of quantum gates. This result treated all isolated vertices as having self-loops, so they all evolved by a phase under the quantum walk. In this paper, we permit isolated vertices to be loopless or looped, and loopless isolated vertices do not evolve at all under the quantum walk. Using this distinction, we construct simpler dynamic graphs that implement the Pauli gates and a set of universal quantum gates consisting of the Hadamard, $T$, and controlled-not gates, and these gates are easily extended to multiqubit systems. For example, the $T$ gate is simplified from a sequence of six graphs to a single graph, and the number of vertices is reduced by a factor of 4. We also construct a generalized phase gate, of which $Z$, $S$, and $T$ are specific instances. Finally, we validate our implementations by numerically simulating a quantum circuit consisting of layers of one- and two-qubit gates, similar to those in recent quantum supremacy experiments, using a quantum walk.

arXiv:1908.00507•Physical Review A•Dec 18, 2019•14 citations

Localization Without Disorder: Quantum Walks on Structured Graphs

Shyam Dhamapurkar, K. Venkata Subrahmanyam

Continuous-time quantum walks (CTQWs) exhibit localization phenomena that differ fundamentally from their classical counterparts, yet the precise relationship between network structure, spectral degeneracy, and confined dynamics remains incompletely understood. In this work, we present a complete analytical characterization of localization in CTQWs on two highly symmetric graph families: barbell graphs and star-of-cliques graphs. These networks combine pronounced spectral degeneracy with modular structure, enabling exact diagonalization and explicit computation of both eigenstate and dynamical inverse participation ratios (IPRs). Our analysis reveals that localization is governed by the interplay between degenerate subspaces, which generate families of confined modes, and hybridization between invariant subspaces, which redistributes spectral weight. Notably, the dynamical IPR can exceed expectations based solely on eigenstate IPRs, demonstrating that coherent superposition within degenerate eigenspaces enhances confinement. By connecting IPR values to the effective number of vertices visited, we provide a structural diagnostic for predicting quantum transport outcomes in modular networks, establishing that connectivity alone can determine where and how strongly a quantum walk localizes.

quant-pharXiv:2603.05643•Physical Review A•Mar 9, 2026•0 citations

Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks

Daniel Klaus Burgarth, Domenico D’Alessandro, Leslie Hogben +2 more

We study the dynamics of systems on networks from a linear algebraic perspective. The control theoretic concept of controllability describes the set of states that can be reached for these systems. Our main result says that controllability in the quantum sense, expressed by the Lie algebra rank condition, and controllability in the sense of linear systems, expressed by the controllability matrix rank condition, are equivalent conditions. We also investigate how the graph theoretic concept of a zero forcing set impacts the controllability property; if a set of vertices is a zero forcing set, the associated dynamical system is controllable. These results open up the possibility of further exploiting the analogy between networks, linear control systems theory, and quantum systems Lie algebraic theory. This study is motivated by several quantum systems currently under study, including continuous quantum walks modeling transport phenomena.

arXiv:1111.1475•IEEE Transactions on Automatic Control•Aug 15, 2013•82 citations
We address the study of controllability of a closed quantum system whose dynamical Lie algebra is generated by adjacency matrices of graphs. We characterize a large family of graphs that renders a system controllable. The key property is a graph-theoretic feature consisting of a particularly disordered cycle structure. Disregarding efficiency of control functions, but choosing subfamilies of sparse graphs, the results translate into continuous-time quantum walks for universal computation.
We provide a brief survey of perfect state transfer in quantum walks on finite graphs. The ability to transfer a quantum state from one part of a quantum computer to another is a key ingredient of scalable architectures. Transfer through structures that do not require locally varying dynamic control simplifies the design and hence reduces the opportunities for errors to arise. Continuous time walks quantum walks on highly structured graphs exhibit perfect state transfer for the complete graph of size 2, the path of length 3, and the cycle of size 4. From these, larger graphs can be constructed, and the use of edge weights widens this set considerably. Discrete-time quantum walks have more flexibility through exploiting the coin degrees of freedom, but with the disadvantage that local control of the coin is required if the degree of the vertices varies. The closely related property of periodicity (exact return to the starting state) is also mentioned.
Quantum walks provide a natural framework to approach graph problems with quantum computers, exhibiting speedups over their classical counterparts for tasks such as the search for marked nodes or the prediction of missing links. Continuous-time quantum walk algorithms assume that we can simulate the dynamics of quantum systems where the Hamiltonian is given by the adjacency matrix of the graph. It is known that such can be simulated efficiently if the underlying graph is row-sparse and efficiently row-computable. While this is sufficient for many applications, it limits the applicability for this class of algorithms to study real world complex networks, which, among other properties, are characterized by the existence of a few densely connected nodes, called hubs. In other words, complex networks are typically not row-sparse, even though the average connectivity over all nodes can be very small. In this work, we extend the state-of-the-art results on quantum simulation to graphs that contain a small number of hubs, but that are otherwise sparse. Hopefully, our results may lead to new applications of quantum computing to network science.
Continuous-time quantum walks (CTQWs) on static graphs provide efficient methods for search and sampling as well as a model for universal quantum computation. We consider an extension of CTQWs to the case of dynamic graphs, in which an ordered sequence of graphs governs free evolution of the quantum walk. We then consider how perfect state transfer during the quantum walk can be used to design dynamic graphs that implement a universal set of quantum logic gates. We give explicit examples for a complete logical basis, and we validate implementations using numerical simulations for quantum teleportation and addition circuits. Finally, we discuss the potential for realizing CTQWs on dynamic graphs using actively controlled quantum optical waveguides.
It was recently shown that continuous-time quantum walks on dynamic graphs, i.e., sequences of static graphs whose edges change at specific times, can implement a universal set of quantum gates. This result treated all isolated vertices as having self-loops, so they all evolved by a phase under the quantum walk. In this paper, we permit isolated vertices to be loopless or looped, and loopless isolated vertices do not evolve at all under the quantum walk. Using this distinction, we construct simpler dynamic graphs that implement the Pauli gates and a set of universal quantum gates consisting of the Hadamard, TTT, and controlled-not gates, and these gates are easily extended to multiqubit systems. For example, the TTT gate is simplified from a sequence of six graphs to a single graph, and the number of vertices is reduced by a factor of 4. We also construct a generalized phase gate, of which ZZZ, SSS, and TTT are specific instances. Finally, we validate our implementations by numerically simulating a quantum circuit consisting of layers of one- and two-qubit gates, similar to those in recent quantum supremacy experiments, using a quantum walk.
Continuous-time quantum walks (CTQWs) exhibit localization phenomena that differ fundamentally from their classical counterparts, yet the precise relationship between network structure, spectral degeneracy, and confined dynamics remains incompletely understood. In this work, we present a complete analytical characterization of localization in CTQWs on two highly symmetric graph families: barbell graphs and star-of-cliques graphs. These networks combine pronounced spectral degeneracy with modular structure, enabling exact diagonalization and explicit computation of both eigenstate and dynamical inverse participation ratios (IPRs). Our analysis reveals that localization is governed by the interplay between degenerate subspaces, which generate families of confined modes, and hybridization between invariant subspaces, which redistributes spectral weight. Notably, the dynamical IPR can exceed expectations based solely on eigenstate IPRs, demonstrating that coherent superposition within degenerate eigenspaces enhances confinement. By connecting IPR values to the effective number of vertices visited, we provide a structural diagnostic for predicting quantum transport outcomes in modular networks, establishing that connectivity alone can determine where and how strongly a quantum walk localizes.
We study the dynamics of systems on networks from a linear algebraic perspective. The control theoretic concept of controllability describes the set of states that can be reached for these systems. Our main result says that controllability in the quantum sense, expressed by the Lie algebra rank condition, and controllability in the sense of linear systems, expressed by the controllability matrix rank condition, are equivalent conditions. We also investigate how the graph theoretic concept of a zero forcing set impacts the controllability property; if a set of vertices is a zero forcing set, the associated dynamical system is controllable. These results open up the possibility of further exploiting the analogy between networks, linear control systems theory, and quantum systems Lie algebraic theory. This study is motivated by several quantum systems currently under study, including continuous quantum walks modeling transport phenomena.