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:2606.06582

Fun with Graph States: Nonlocal Bell Pairs and the Arf Invariant

Bartlomiej Czech, Yichen Feng, Xianlai Wu, Minjun Xie

quant-phhep-thSubmitted Jun 4, 2026• Announced Jun 8, 2026• 0 citations
v1 · Jun 4, 2026v2 · Jun 10, 2026
arXivHTMLPDF

Abstract

We study inner products and partial amplitudes of graph states--a commonly employed class of quantum states, which are specified by graphs. We find that the magnitudes of these quantities are simply related to the rank of the adjacency matrix of the graph over F_2 while the phase is determined by the Arf invariant of its quadratic refinement. These facts motivate a nonlocal tensor factorization of the Hilbert space, with respect to which all graph states are products of Bell pairs with unentangled ancillae. These results may illuminate the quantum advantage in the framework of Measurement-Based Quantum Computation and suggest that graph states can be usefully visualized in the language of algebraic topology. In addition, we develop a specialized technique for computing expectation values of qubit-wise permutations in graph states, which is useful for calculating multi-invariants.

Comments
31 pages plus appendices, 8 figures

Related papers

The Quantum States of a Graph

Mohd Arif Raza, Adel N. Alahmadi, Widyan Basaffar +6 more

Quantum codes are crucial building blocks of quantum computers. With a self-dual quantum code is attached, canonically, a unique stabilised quantum state. Improving on a previous publication, we show how to determine the coefficients on the basis of kets in these states. Two important ingredients of the proof are algebraic graph theory and quadratic forms. The Arf invariant, in particular, plays a significant role.

Mathematics•May 16, 2023•1 citation

Algebraic and Topological Study of Bell States and Quantum Teleportation

Yong Zhang, Wei Zeng, Ming Lian

Bell states and quantum teleportation play crucial roles in quantum information and computation. However, a comprehensive theoretical study of both topics remains to be carried out. This work aims to investigate key algebraic properties of generalized Bell states and explore the topological features of quantum teleportation. First, the basis theorem and the basis group are introduced to show that the extension of a generalized Bell basis by a unitary matrix still forms an orthonormal basis. Then, a twist operator is defined to establish a connection between a generalized multi-qubit Bell state and a tensor product of two-qubit Bell states. In addition, the Temperley--Lieb algebra, the braid group relations, and the Yang--Baxter equation are employed to provide a topological description of generalized Bell states and quantum teleportation. The results demonstrate that our approach not only offers a clear illustration of relevant quantum information protocols but also reveals the topological nature of quantum entanglement and teleportation.

quant-pharXiv:2602.11218•Feb 12, 2026•0 citations

The measurement of quantum entanglement and enumeration of graph coverings

Michael W. Hero, Jeb F. Willenbring, Lauren Kelly Williams

We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical state space of a multi-particle system in which each particle has finitely many outcomes upon observation. Moreover, these invariant functions separate the entangled and unentangled states, and are therefore viewed as measurements of quantum entanglement. When the ranks of the unitary groups are large, we provide a graph theoretic interpretation for the dimension of the invariants of a fixed degree. We also exhibit a bijection between isomorphism classes of finite coverings of connected simple graphs and a basis for the space of invariants. The graph coverings are related to branched coverings of surfaces.

arXiv:0911.0222•Nov 2, 2009•0 citations

Quantum embedding of graphs for subgraph counting

Bibhas Adhikari

We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate complexity $O(N^2)$, which we refer to as the graph adjacency state. We design quantum measurement operators that capture the edge structure of a target subgraph, enabling estimation of its count via measurements on the $m$-fold tensor product of the adjacency state, where $m$ is the number of edges in the subgraph. We illustrate the framework for triangles, cycles, and cliques. This approach yields quantum logspace algorithms for motif counting, with no known classical counterpart.

quant-pharXiv:2604.18754•Apr 22, 2026•0 citations

Many-body quantum resources of graph states

Marcin Płodzień, Maciej Lewenstein, Jan Chwedeńczuk

Abstract Characterizing the non-classical correlations of a complex many-body system is an important part of quantum technologies. An ideal tool for this task would scale well with the size of the system, be easily computable and be easily measurable. In this work, we focus on graph states, which are promising platforms for quantum computation, simulation, and metrology. We consider four topologies: star graph states with edges, Turán graphs, r-ary tree graphs, and square grid cluster states. We provide a method to characterize their quantum content: many-body Bell correlations, non-separability and entanglement strength for an arbitrary number of qubits. We also relate the strength of these correlations to the usefulness of graph states for quantum sensing. Finally, we characterize many-body entanglement in graph states with up to eight qubits in 146 classes that are not equivalent under local transformations or graph isomorphisms. This technique is straightforward and does not require any assumptions about the multi-qubit state; therefore it could be applied wherever precise knowledge of many-body quantum correlations is necessary.

arXiv:2410.12487•Reports on Progress in Physics•Jul 1, 2025•3 citations

Unifying and Extending Strong Simulation of Quantum Circuits

Floris Geerts, Rihan Hai, Matthias Lanzinger +3 more

We establish functional aggregate queries (FAQs) as a unifying language for exact classical simulation of quantum circuits. A circuit becomes a sum-product query: factors encode gates, internal wire variables are aggregated, and free boundary variables index transition amplitudes. The central insight is that distinct sources of simulation tractability can be exploited within the same InsideOut evaluation scheme. The query specifies what is computed; the evaluation plan, semiring, and representation of intermediate factors determine the cost. This view unifies structural and algebraic simulation guarantees. With explicit factor representations, FAQ evaluation recovers the treewidth bound for tensor-network contraction and yields finer sparsity-sensitive bounds via fractional covers. Over a formal phase semiring, compressed intermediate factors recover rank-width-based simulation for compatible quadratic phase representations. For Clifford circuits, affine-quadratic factors are closed under multiplication and marginalization and remain polynomial in size, yielding polynomial-time exact amplitude computation without any bounded-width assumption. Beyond these recoveries, the framework yields a new tractability criterion: tensor layout symmetry width. This parameter combines local cut-rank with separator symmetry through exact tree-tensor representations. We give a constructive evaluation bound and exhibit a circuit family with bounded tensor layout symmetry width but unbounded phase-graph rank-width and circuit line-graph treewidth. These results establish representation-aware FAQ evaluation as a common algorithmic foundation for classical simulation and a systematic route to new tractable regimes.

quant-pharXiv:2610.00547•Oct 2, 2026•0 citations
We study inner products and partial amplitudes of graph states--a commonly employed class of quantum states, which are specified by graphs. We find that the magnitudes of these quantities are simply related to the rank of the adjacency matrix of the graph over F_2 while the phase is determined by the Arf invariant of its quadratic refinement. These facts motivate a nonlocal tensor factorization of the Hilbert space, with respect to which all graph states are products of Bell pairs with unentangled ancillae. These results may illuminate the quantum advantage in the framework of Measurement-Based Quantum Computation and suggest that graph states can be usefully visualized in the language of algebraic topology. In addition, we develop a specialized technique for computing expectation values of qubit-wise permutations in graph states, which is useful for calculating multi-invariants.
Bell states and quantum teleportation play crucial roles in quantum information and computation. However, a comprehensive theoretical study of both topics remains to be carried out. This work aims to investigate key algebraic properties of generalized Bell states and explore the topological features of quantum teleportation. First, the basis theorem and the basis group are introduced to show that the extension of a generalized Bell basis by a unitary matrix still forms an orthonormal basis. Then, a twist operator is defined to establish a connection between a generalized multi-qubit Bell state and a tensor product of two-qubit Bell states. In addition, the Temperley--Lieb algebra, the braid group relations, and the Yang--Baxter equation are employed to provide a topological description of generalized Bell states and quantum teleportation. The results demonstrate that our approach not only offers a clear illustration of relevant quantum information protocols but also reveals the topological nature of quantum entanglement and teleportation.
We provide formulas for invariants defined on a tensor product of defining representations of unitary groups, under the action of the product group. This situation has a physical interpretation, as it is related to the quantum mechanical state space of a multi-particle system in which each particle has finitely many outcomes upon observation. Moreover, these invariant functions separate the entangled and unentangled states, and are therefore viewed as measurements of quantum entanglement. When the ranks of the unitary groups are large, we provide a graph theoretic interpretation for the dimension of the invariants of a fixed degree. We also exhibit a bijection between isomorphism classes of finite coverings of connected simple graphs and a basis for the space of invariants. The graph coverings are related to branched coverings of surfaces.
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on NNN vertices into a quantum state on 2⌈log⁡2N⌉2\lceil \log_2 N \rceil2⌈log2​N⌉ working qubits and 222 ancilla qubits using its adjacency list, with worst-case gate complexity O(N2)O(N^2)O(N2), which we refer to as the graph adjacency state. We design quantum measurement operators that capture the edge structure of a target subgraph, enabling estimation of its count via measurements on the mmm-fold tensor product of the adjacency state, where mmm is the number of edges in the subgraph. We illustrate the framework for triangles, cycles, and cliques. This approach yields quantum logspace algorithms for motif counting, with no known classical counterpart.
Abstract Characterizing the non-classical correlations of a complex many-body system is an important part of quantum technologies. An ideal tool for this task would scale well with the size of the system, be easily computable and be easily measurable. In this work, we focus on graph states, which are promising platforms for quantum computation, simulation, and metrology. We consider four topologies: star graph states with edges, Turán graphs, r-ary tree graphs, and square grid cluster states. We provide a method to characterize their quantum content: many-body Bell correlations, non-separability and entanglement strength for an arbitrary number of qubits. We also relate the strength of these correlations to the usefulness of graph states for quantum sensing. Finally, we characterize many-body entanglement in graph states with up to eight qubits in 146 classes that are not equivalent under local transformations or graph isomorphisms. This technique is straightforward and does not require any assumptions about the multi-qubit state; therefore it could be applied wherever precise knowledge of many-body quantum correlations is necessary.
We establish functional aggregate queries (FAQs) as a unifying language for exact classical simulation of quantum circuits. A circuit becomes a sum-product query: factors encode gates, internal wire variables are aggregated, and free boundary variables index transition amplitudes. The central insight is that distinct sources of simulation tractability can be exploited within the same InsideOut evaluation scheme. The query specifies what is computed; the evaluation plan, semiring, and representation of intermediate factors determine the cost. This view unifies structural and algebraic simulation guarantees. With explicit factor representations, FAQ evaluation recovers the treewidth bound for tensor-network contraction and yields finer sparsity-sensitive bounds via fractional covers. Over a formal phase semiring, compressed intermediate factors recover rank-width-based simulation for compatible quadratic phase representations. For Clifford circuits, affine-quadratic factors are closed under multiplication and marginalization and remain polynomial in size, yielding polynomial-time exact amplitude computation without any bounded-width assumption. Beyond these recoveries, the framework yields a new tractability criterion: tensor layout symmetry width. This parameter combines local cut-rank with separator symmetry through exact tree-tensor representations. We give a constructive evaluation bound and exhibit a circuit family with bounded tensor layout symmetry width but unbounded phase-graph rank-width and circuit line-graph treewidth. These results establish representation-aware FAQ evaluation as a common algorithmic foundation for classical simulation and a systematic route to new tractable regimes.