Directed Quantum Graphs

• Directed quantum graphs are quantum graph formalisms that explicitly incorporate orientation by relaxing symmetry constraints traditionally imposed on edge structures.
• They employ mechanisms such as control-target assignments, non-symmetric transport operators, and arrow-dependent metric weights to advance quantum walks, state constructions, and geometric formulations.
• Their applications span operator-algebraic classifications, quantum information implementations, and algorithmic query models, providing versatile tools for modern quantum research.

Directed quantum graphs are a family of non-equivalent constructions in which orientation is incorporated into a quantum, operator-algebraic, geometric, or algorithmic graph formalism. In one line of work, a directed quantum graph is a quantum graph on a quantum set with no imposed symmetry condition, so that “undirected” becomes an additional constraint rather than the default. In other lines, directedness is carried by control–target assignments in graph-state constructions, by non-symmetric transport operators in quantum walks on digraphs, by arrow-dependent metric weights in discrete quantum geometry, or by directed access and orientation constraints in quantum graph algorithms. This breadth of usage reflects the wider development of quantum graph theory, which “has been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels,” and later expanded into several distinct research programs (Spitzer et al., 24 Mar 2026, Kiefer et al., 21 Jul 2025, Simone et al., 5 Sep 2025, Tödtli et al., 2016, Majid, 2020).

1. Historical scope and semantic range

In the operator-algebraic literature, the modern directed theory is explicitly presented as an extension of a formerly undirected framework. “Later, Wasilweski provided a solid theory of directed quantum graphs which was formerly only established for undirected quantum graphs,” and this extension already becomes nontrivial on the smallest noncommutative algebra $M_2$ (Kiefer et al., 21 Jul 2025). In that setting, directedness is not a perturbation of classical orientation but a relaxation of self-adjointness-type constraints on the quantum edge structure.

A different usage appears in quantum-information constructions indexed by classical digraphs. There the starting object is an ordinary directed simple graph $G(V,L)$, and the graph is made quantum by assigning qubits to vertices and controlled unitaries to oriented edges. The orientation is operational: the arrow $a\to b$ means that qubit $a$ is the control and qubit $b$ is the target (Simone et al., 5 Sep 2025).

A third usage concerns quantum transport on digraphs. For continuous-time or stochastic quantum walks, directionality conflicts with Hermiticity if one uses the raw directed adjacency or Laplacian as Hamiltonian data. Several papers therefore replace the naive generator by a Hermitian adjacency with phases, a pseudo-Hermitian similarity transform, or a GKSL generator on a digraph (Tödtli et al., 2016, Izaac et al., 2016, Glos, 2021). This suggests that “directed quantum graph” is best treated as a family of related notions rather than a single stabilized definition.

2. Operator-algebraic directed quantum graphs

For a finite-dimensional quantum set $(B,\psi)$, a quantum graph $\mathcal G$ may be presented in three equivalent ways: as a $B'-B'$-bimodule $S\subset B(\mathcal H)$, as a quantum adjacency matrix $A:B\to B$ satisfying

$G(V,L)$0

or as a projection $G(V,L)$1 (Kiefer et al., 21 Jul 2025). In this framework, directedness is the generic case. Undirectedness requires extra symmetry: on a nontracial quantum set, a quantum graph is GNS-undirected iff

$G(V,L)$2

while it is KMS-undirected iff

$G(V,L)$3

In the tracial case these coincide; in the nontracial case they do not (Kiefer et al., 21 Jul 2025).

The complete classification on $G(V,L)$4 makes this distinction concrete. In the tracial case $G(V,L)$5, if $G(V,L)$6 is loopfree with exactly one quantum edge, then it is isomorphic to a unique $G(V,L)$7, $G(V,L)$8, with adjacency matrix

$G(V,L)$9

and it is undirected iff $a\to b$0 (Kiefer et al., 21 Jul 2025). On $a\to b$1, $a\to b$2, there are infinitely many loopfree KMS-undirected quantum graphs that are not GNS-undirected. The paper exhibits the family $a\to b$3, $a\to b$4, as explicit examples of this separation (Kiefer et al., 21 Jul 2025).

The infinite-dimensional extension replaces bounded operator bimodules by Hilbert–Schmidt bimodules. An HS quantum relation is a closed subspace $a\to b$5 such that $a\to b$6. Such $a\to b$7 are in bijection with projections

$a\to b$8

and, when $a\to b$9 is integrable for the slice-map $a$0, there is a normal CP map $a$1 called a quantum adjacency operator (Daws, 28 Nov 2025). Its Kraus form is

$a$2

In this formulation, a general projection $a$3 or CP map $a$4 is the directed object; symmetry requires extra conditions involving the tensor swap $a$5 and, in the nontracial case, KMS-adjoint relations (Daws, 28 Nov 2025).

3. Directed graph states and orientation-dependent entanglement

In the graph-state construction based on a directed simple graph $a$6, with $a$7, the oriented adjacency matrix is

$a$8

Each vertex carries a qubit, so

$a$9

An oriented edge $b$0 is encoded by

$b$1

and the graph state is

$b$2

The paper emphasizes that the arrow $b$3 has a direct operational meaning: qubit $b$4 is the control and qubit $b$5 is the target (Simone et al., 5 Sep 2025).

To obtain a graph-defined state independent of any arbitrary ordering of edges, the construction imposes

$b$6

and

$b$7

These assumptions force

$b$8

so the interaction becomes controlled phase-type (Simone et al., 5 Sep 2025). For the maximally entangling choice, the input is

$b$9

The entanglement observable studied there is the Entanglement Distance,

$(B,\psi)$0

Its main formula is

$(B,\psi)$1

where

$(B,\psi)$2

is the total degree (Simone et al., 5 Sep 2025). The directional information enters the phase

$(B,\psi)$3

but the squared Bloch-vector norm is phase-blind, so the final ED depends only on $(B,\psi)$4, not on the split between in-degree and out-degree. A common misconception is therefore avoided only by distinguishing the state from the observable: the construction is genuinely directed at the kinematic level, but the chosen entanglement functional is insensitive to orientation (Simone et al., 5 Sep 2025).

4. Quantum walks, stochastic walks, and transport on digraphs

For continuous-time quantum walks on a directed graph with adjacency matrix $(B,\psi)$5, one Hermitian formulation is

$(B,\psi)$6

At $(B,\psi)$7, directionality disappears; at $(B,\psi)$8, only the antisymmetric directed part survives. For directed bipartite graphs, transport between the two partitions is completely suppressed at

$(B,\psi)$9

because the resulting Hamiltonian becomes block diagonal (Tödtli et al., 2016). The same model proves two mirror symmetries around $\mathcal G$0 and $\mathcal G$1, yielding $\mathcal G$2-periodicity in $\mathcal G$3 (Tödtli et al., 2016).

A different repair of non-Hermiticity uses pseudo-Hermiticity. Starting from the directed-graph Laplacian

$\mathcal G$4

one assumes $\mathcal G$5 is diagonalizable with real spectrum, finds $\mathcal G$6 such that

$\mathcal G$7

is Hermitian, and evolves with

$\mathcal G$8

This produces a unitary walk in the ordinary inner product and is equivalent to mapping the directed graph to an undirected weighted complete graph with self-loops on the same vertex set (Izaac et al., 2016). The associated directed-graph quantum centrality is defined by the long-time average

$\mathcal G$9

and the statistical analysis shows strong agreement with PageRank on directed acyclic graphs (Izaac et al., 2016).

For arbitrary digraphs, the dissertation-length open-system route replaces unitary CTQW by a GKSL evolution

$B'-B'$0

and distinguishes local, global, and nonmoralizing global interaction models (Glos, 2021). The local model uses

$B'-B'$1

and the limiting-properties analysis proves that, for strongly connected digraphs and for weakly connected digraphs whose condensation graph has exactly one sink, the local-environment-interaction evolution is relaxing (Glos et al., 2017). By contrast, the standard global model moralizes directed graphs, and there exists a directed graph and an initial state for which the global-interaction evolution is non-convergent for every $B'-B'$2 (Glos et al., 2017). The nonmoralizing global interaction QSW enlarges the Hilbert space by splitting each vertex into $B'-B'$3 copies, constructs Lindblad blocks with orthogonal columns, and adds a local rotating Hamiltonian to avoid premature localization; numerically it restores digraph observance much better than standard global interaction (Glos, 2021, Glos et al., 2017).

In the metric-graph branch, a star graph with arm Hamiltonians

$B'-B'$4

exhibits controlled directed transport under arm-dependent periodic fields

$B'-B'$5

For the three-arm example, a suitable choice of $B'-B'$6 almost suppresses transmission into one arm and channels nearly $B'-B'$7 of the wave-packet norm into the desired arm while approximately preserving the packet width (Yusupov et al., 2015).

A discrete-time scattering theory on balanced directed graphs adds a resonance perspective. For a family $B'-B'$8 on a finite directed core plus semi-infinite directed tails, the scattering matrix $B'-B'$9 generally fails to converge to $S\subset B(\mathcal H)$0 at those $S\subset B(\mathcal H)$1 approached by resonances $S\subset B(\mathcal H)$2. The discrepancy is described by rank-one resonant terms

$S\subset B(\mathcal H)$3

and under a channel-balance condition on the resonant state this yields a directed-graph analog of resonant tunneling, including asymptotically anti-diagonal scattering for two channels (Higuchi, 22 Apr 2025).

5. Directed quantum geometry and graph-algebraic morphisms

In the discrete quantum-geometric approach, quantum geometry on a discrete set means “a directed graph with a weight associated to each arrow defining the quantum metric,” and the weights need not be independent of direction (Majid, 2020). For $S\subset B(\mathcal H)$4, the differential calculus is determined by arrows $S\subset B(\mathcal H)$5, with basis $S\subset B(\mathcal H)$6, and the canonical Laplacian satisfies

$S\subset B(\mathcal H)$7

A discrete-time Markov process then becomes

$S\subset B(\mathcal H)$8

with

$S\subset B(\mathcal H)$9

In this sense, directed transition probabilities are reinterpreted as metric data (Majid, 2020).

The same paper introduces a discrete Schrödinger process

$A:B\to B$0

where $A:B\to B$1 comes from a bimodule connection rather than the canonical $A:B\to B$2. For the two-state graph, the one-step evolution matrix is solved explicitly, yielding a $A:B\to B$3-parameter family of unitary connections and an induced generalized Markov process for $A:B\to B$4 with an additional source current built from $A:B\to B$5 (Majid, 2020).

A different, graph-algebraic notion of directionality is categorical. The relation category of graphs $A:B\to B$6 replaces graph maps by relations

$A:B\to B$7

on path sets, and admissible relation morphisms form a category $A:B\to B$8 admitting a contravariant functor to $A:B\to B$9-Alg and to graph $G(V,L)$00-algebras (Castro et al., 30 Mar 2025). The induced maps have the uniform form

$G(V,L)$01

This does not define a quantum graph in the operator-system sense, but it gives a graph-side formalism for morphisms between directed graph-based noncommutative spaces, including Leavitt path algebras, graph $G(V,L)$02-algebras, Cuntz algebras, quantum spheres, and quantum balls (Castro et al., 30 Mar 2025).

6. Quantum algorithms on directed graphs

Algorithmic work uses directed graphs not as static quantum objects but as structures to be queried or tested quantumly. One example arises in causal Feynman loop configurations, where the task is to query which edge orientations of an underlying undirected graph define valid directed acyclic graph configurations. The oracle is built only from multicontrolled Toffoli and $G(V,L)$03 gates, with edge orientations encoded in a register $G(V,L)$04, clause ancillas $G(V,L)$05, and a phase-marking output qubit. The basic Boolean forms are

$G(V,L)$06

and the oracle marks assignments that avoid all forbidden directed cycles (Ramírez-Uribe et al., 2024).

In sparse-graph property testing, the unidirectional model allows only outgoing-edge queries. For $G(V,L)$07-source-subgraph-freeness in this model, the quantum query complexity is

$G(V,L)$08

while the lower bound obtained through a property-testing version of the $G(V,L)$09-collision problem is

$G(V,L)$10

The same work also proves that testing $G(V,L)$11-colorability in bounded-degree undirected graphs still requires $G(V,L)$12 quantum queries (Apers et al., 2024). A later general theorem shows that any property of bounded-degree directed graphs that is testable with $G(V,L)$13 classical queries in the bidirectional model is testable in the quantum unidirectional model with

$G(V,L)$14

queries, and that the number of occurrences of any constant-size subgraph $G(V,L)$15 can be approximated up to additive error $G(V,L)$16 using $G(V,L)$17 quantum queries (Peng et al., 9 Apr 2026). These results belong to quantum algorithms on directed graphs rather than to quantum graph objects themselves, but they form an important computational branch of the subject.

7. Conceptual distinctions and recurrent misconceptions

A recurrent misconception is that directed quantum graphs should have a single formal definition. The literature instead divides sharply by what is being quantized. In operator-algebraic quantum graph theory, directedness is the absence of symmetry constraints, and undirectedness is extra structure such as $G(V,L)$18, $G(V,L)$19, or $G(V,L)$20 (Kiefer et al., 21 Jul 2025, Daws, 28 Nov 2025). In graph-state constructions, directedness is encoded operationally by control–target asymmetry, yet the entanglement distance studied in one prominent model depends only on the total degree sequence, not on orientation (Simone et al., 5 Sep 2025). In walk-based theories, the basic obstruction is different: naive directed adjacency destroys Hermiticity, so one must choose between Hermitian phase adjacencies, pseudo-Hermitian similarity transforms, or open-system generators, and these choices do not preserve directed structure in the same way (Tödtli et al., 2016, Izaac et al., 2016, Glos, 2021).

Another misconception is that “directed” automatically implies nonreciprocal observables. The directed graph-state model shows the opposite possibility: the preparation rule is directed, but the chosen multipartite entanglement functional is orientation-blind (Simone et al., 5 Sep 2025). Conversely, the global stochastic-walk literature shows that a formally unitary or dissipative evolution may fail to respect the intended digraph because of moralization, so directional data can be present in the definition yet degraded dynamically (Glos et al., 2017).

These divergences suggest a useful editorial principle: the phrase “directed quantum graphs” names a research area rather than a single object class. Its stable core is the study of how orientation interacts with quantum adjacency, quantum transport, noncommutative edge spaces, or quantum access to graph structure. Its unstable boundary lies in the fact that the meaning of “graph,” “adjacency,” and even “undirected” changes from one framework to another.