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

Graph Quantum Magic Squares and Free Spectrahedra

La Piana, Francesca

Published Dec 9, 2025• 0 citations
arXivHTMLPDF

Abstract

Recently De les Coves, Drescher and Netzer showed that an analogue of the Birkhoff--von Neumann theorem fails in the quantum setting. Motivated by this and questions arising in the study of quantum automorphisms of graphs, we introduce a graph-based variant of quantum magic squares and show that the analogue already fails for the cycle \(C_4\), via an explicit counterexample. We also show that they admit monic linear matrix inequality descriptions, hence form compact free spectrahedra.

DOI
10.48550/arxiv.2512.08797

Related papers

Compact graphs and quantum automorphisms

Pedro Baptista, Gabriel Coutinho, Chris Godsil +1 more

Compact graphs are graphs for which the fractional automorphism polytope has no genuinely fractional vertices. This paper proposes a quantum analogue of this idea by evaluating the fundamental magic unitary of the quantum automorphism group on states, which we show to produce a closed convex set of doubly stochastic matrices sitting between the classical automorphism polytope and the full fractional automorphism polytope. Our main result is that the natural quantum analogue of compactness is classical, that is, a quantum compact graph is classically compact. We also relate this set to the quantum orbital algebra and obtain a hierarchy of classical and quantum compactness pseudo notions. The framework recovers familiar consequences of compactness through commutants and suggests quantum analogues of generous transitivity and distance-transitivity. We also isolate examples and open problems indicating where quantum symmetries may strictly refine the classical compactness theory.

quant-pharXiv:2606.13928•Jun 15, 2026

Quantum magic squares: Dilations and their limitations

Gemma De las Cuevas, Tom Drescher, Tim Netzer

Quantum permutation matrices and quantum magic squares are generalizations of permutation matrices and magic squares, where the entries are no longer numbers but elements from arbitrary (non-commutative) algebras. The famous Birkhoff–von Neumann theorem characterizes magic squares as convex combinations of permutation matrices. In the non-commutative case, the corresponding question is as follows: Does every quantum magic square belong to the matrix convex hull of quantum permutation matrices? That is, does every quantum magic square dilate to a quantum permutation matrix? Here, we show that this is false even in the simplest non-commutative case. We also classify the quantum magic squares that dilate to a quantum permutation matrix with commuting entries and prove a quantitative lower bound on the diameter of this set. Finally, we conclude that not all Arveson extreme points of the free spectrahedron of quantum magic squares are quantum permutation matrices.

arXiv:1912.07332•Journal of Mathematical Physics•Nov 1, 2020•24 citations

Quantum Graph Theory by Example

Gian Luca Spitzer, Ion Nechita

Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in working with quantum graphs compared to classical graphs stems from the fact that they are no longer discrete objects. This makes it generally difficult to construct insightful, non-trivial examples. We present a collection of non-trivial quantum graphs that can be thought of in discrete terms, and that can be expressed in the diagrammatic formalism introduced by Musto, Reutter, and Verdon. The examples arise as the quantum graphs acted on by increasingly smaller classical matrix groups, and are parametrised by triples of matrices $(A, B, C)$. The parametrisation reveals a clean decomposition of quantum graph structure into classical and genuinely quantum components: $A$ and $C$ are described by a classical weighted graph called the strange graph, while $B$ provides a purely quantum contribution with no classical analogue. Based on this model, we give exact formulas or establish bounds for quantum graph parameters, such as the number of connected components, the chromatic number, the independence number, and the clique number. Our results provide the first large, parametric families of quantum graphs for which standard graph parameters can be computed analytically.

math.OACross-listedarXiv:2603.23651•Quantum•Mar 26, 2026•1 citation

Quantum graph models of quantum chaos: an introduction and some recent applications

Gregory Berkolaiko, Sven Gnutzmann

Quantum graphs are a paradigmatic model for quantum chaos as well as for spectral theory. We give a concise didactical introduction to quantum graphs, or Schrödinger Hamiltonians on metric graphs, with a focus on results related to quantum chaos, periodic orbit theory and spectral theory. We summarise related seminal results, and give an overview over a few more recent developments.

quant-pharXiv:2604.12690•Apr 15, 2026

Birkhoff-von Neumann Teoremi bağlamında kuantum sihirli kareler

Sunay Doğan

Quantum magic squares are generalizations of doubly stochastic matrices to arbitrary, possibly non-commutative algebras, more specifically C∗-algebras. Birkhoff-von Neumann Theorem states that every doubly stochastic matrix is a convex combination of permutation matrices. One inevitable question is whether a quantum magic square is a convex combinations of quantum permutation matrices. It has been proven by Cuevas, Drescher, and Netzer that the generalization of the Birkhoff-von Neumann Theorem in the quantum setting is not true in general. A quantum magic square is a convex combination of Arveson extreme points but not necessarily a convex combination of quantum permutation matrices. Additionally, the relationships between different subsets of quantum magic squares, including their inclusion properties, have been studied in this context.

•Sep 18, 2024•0 citations

Lowering LCU Circuit Width through Maximum-Weight Birkhoff-von Neumann Decomposition

Ammar Daskin

While classical Sinkhorn scaling applies to nonnegative matrices, we show that any complex square matrix whose element-wise absolute value has total support can be mapped to a phased doubly stochastic matrix, or alternatively embedded into a larger doubly stochastic matrix via matrix completion. Standard Birkhoff-von~Neumann and Pauli decompositions represent such matrices as linear combinations of $O(N^2)$ permutation or Pauli terms, leading to a large ancilla overhead in a quantum Linear Combination of Unitaries (LCU) implementation. We prove that a bottleneck variant of Birkhoff's algorithm reduces the number of permutations to $O(N\log(N/\varepsilon))$, where $\varepsilon$ is the $\ell_1$-norm approximation error of the reconstructed matrix, and demonstrate empirically that a largest-weight greedy variant requires only $\approx 2N$ terms for dense matrices (the exact average observed is $\approx 2.4N$). The quadratic reduction in term count directly shrinks the ancilla register from $2\log_2 N$ to $\log_2 N$ qubits, shortens the SELECT circuit, and is especially valuable in fixed-Hadamard LCU architectures, where---under the standard uniform-coefficient assumption---the success probability scales as $1/K$; our convex decomposition achieves $α=1$ exactly and therefore avoids this penalty. The approach enables compact quantum implementations of dense operators appearing in optimal transport, non-Hermitian simulation, and other settings amenable to Sinkhorn preconditioning. Furthermore, because the decomposition is a convex combination, the LCU normalization constant for the scaled matrix $S$ is exactly $α_S = 1$, and the uniform superposition is an eigenvector of $S$ with eigenvalue~1. This structure can be exploited to achieve high success probability without amplitude amplification in many practical scenarios, including quantum walks and Markov chain simulations.

quant-pharXiv:2605.27430•May 25, 2026•0 citations
Recently De les Coves, Drescher and Netzer showed that an analogue of the Birkhoff--von Neumann theorem fails in the quantum setting. Motivated by this and questions arising in the study of quantum automorphisms of graphs, we introduce a graph-based variant of quantum magic squares and show that the analogue already fails for the cycle (C_4), via an explicit counterexample. We also show that they admit monic linear matrix inequality descriptions, hence form compact free spectrahedra.
Compact graphs are graphs for which the fractional automorphism polytope has no genuinely fractional vertices. This paper proposes a quantum analogue of this idea by evaluating the fundamental magic unitary of the quantum automorphism group on states, which we show to produce a closed convex set of doubly stochastic matrices sitting between the classical automorphism polytope and the full fractional automorphism polytope. Our main result is that the natural quantum analogue of compactness is classical, that is, a quantum compact graph is classically compact. We also relate this set to the quantum orbital algebra and obtain a hierarchy of classical and quantum compactness pseudo notions. The framework recovers familiar consequences of compactness through commutants and suggests quantum analogues of generous transitivity and distance-transitivity. We also isolate examples and open problems indicating where quantum symmetries may strictly refine the classical compactness theory.
Quantum permutation matrices and quantum magic squares are generalizations of permutation matrices and magic squares, where the entries are no longer numbers but elements from arbitrary (non-commutative) algebras. The famous Birkhoff–von Neumann theorem characterizes magic squares as convex combinations of permutation matrices. In the non-commutative case, the corresponding question is as follows: Does every quantum magic square belong to the matrix convex hull of quantum permutation matrices? That is, does every quantum magic square dilate to a quantum permutation matrix? Here, we show that this is false even in the simplest non-commutative case. We also classify the quantum magic squares that dilate to a quantum permutation matrix with commuting entries and prove a quantitative lower bound on the diameter of this set. Finally, we conclude that not all Arveson extreme points of the free spectrahedron of quantum magic squares are quantum permutation matrices.
Quantum graphs have been introduced by Duan, Severini, and Winter to describe the zero-error behaviour of quantum channels. Since then, quantum graph theory has become a field of study in its own right. A substantial source of difficulty in working with quantum graphs compared to classical graphs stems from the fact that they are no longer discrete objects. This makes it generally difficult to construct insightful, non-trivial examples. We present a collection of non-trivial quantum graphs that can be thought of in discrete terms, and that can be expressed in the diagrammatic formalism introduced by Musto, Reutter, and Verdon. The examples arise as the quantum graphs acted on by increasingly smaller classical matrix groups, and are parametrised by triples of matrices (A,B,C)(A, B, C)(A,B,C). The parametrisation reveals a clean decomposition of quantum graph structure into classical and genuinely quantum components: AAA and CCC are described by a classical weighted graph called the strange graph, while BBB provides a purely quantum contribution with no classical analogue. Based on this model, we give exact formulas or establish bounds for quantum graph parameters, such as the number of connected components, the chromatic number, the independence number, and the clique number. Our results provide the first large, parametric families of quantum graphs for which standard graph parameters can be computed analytically.
Quantum magic squares are generalizations of doubly stochastic matrices to arbitrary, possibly non-commutative algebras, more specifically C∗-algebras. Birkhoff-von Neumann Theorem states that every doubly stochastic matrix is a convex combination of permutation matrices. One inevitable question is whether a quantum magic square is a convex combinations of quantum permutation matrices. It has been proven by Cuevas, Drescher, and Netzer that the generalization of the Birkhoff-von Neumann Theorem in the quantum setting is not true in general. A quantum magic square is a convex combination of Arveson extreme points but not necessarily a convex combination of quantum permutation matrices. Additionally, the relationships between different subsets of quantum magic squares, including their inclusion properties, have been studied in this context.
While classical Sinkhorn scaling applies to nonnegative matrices, we show that any complex square matrix whose element-wise absolute value has total support can be mapped to a phased doubly stochastic matrix, or alternatively embedded into a larger doubly stochastic matrix via matrix completion. Standard Birkhoff-von~Neumann and Pauli decompositions represent such matrices as linear combinations of O(N2)O(N^2)O(N2) permutation or Pauli terms, leading to a large ancilla overhead in a quantum Linear Combination of Unitaries (LCU) implementation. We prove that a bottleneck variant of Birkhoff's algorithm reduces the number of permutations to O(Nlog⁡(N/ε))O(N\log(N/\varepsilon))O(Nlog(N/ε)), where ε\varepsilonε is the ℓ1\ell_1ℓ1​-norm approximation error of the reconstructed matrix, and demonstrate empirically that a largest-weight greedy variant requires only ≈2N\approx 2N≈2N terms for dense matrices (the exact average observed is ≈2.4N\approx 2.4N≈2.4N). The quadratic reduction in term count directly shrinks the ancilla register from 2log⁡2N2\log_2 N2log2​N to log⁡2N\log_2 Nlog2​N qubits, shortens the SELECT circuit, and is especially valuable in fixed-Hadamard LCU architectures, where---under the standard uniform-coefficient assumption---the success probability scales as 1/K1/K1/K; our convex decomposition achieves α=1α=1α=1 exactly and therefore avoids this penalty. The approach enables compact quantum implementations of dense operators appearing in optimal transport, non-Hermitian simulation, and other settings amenable to Sinkhorn preconditioning. Furthermore, because the decomposition is a convex combination, the LCU normalization constant for the scaled matrix SSS is exactly αS=1α_S = 1αS​=1, and the uniform superposition is an eigenvector of SSS with eigenvalue~1. This structure can be exploited to achieve high success probability without amplitude amplification in many practical scenarios, including quantum walks and Markov chain simulations.