TSS Graphs for Hadamard Matrices: Real vs Complex

arXiv:2609.16813 · quant-ph, math-ph, math.MP · Submitted 2026-09-15 · Read on arXiv

quant-ph, math-ph, math.MP

Submitted: 2026-09-15

Updated: 2026-09-16

Project page: https://matrix-toolbox.github.io/chm

Terminology

• Degeneracy — 4× in this paper · explained in 3 episodes
• Clustering — 2× in this paper · explained in 2 episodes
• Quantum Circuits — 2× in this paper · explained in 2 episodes
• Redundancy — 2× in this paper · explained in 2 episodes
• Sparsity — 2× in this paper · explained in 4 episodes
• Topological Structure of Superpositions — 2× in this paper
• Abstraction — 1× in this paper · explained in 1 episode
• Core — 1× in this paper · explained in 2 episodes
• Entanglement — 1× in this paper · explained in 3 episodes
• Hilbert Space — 1× in this paper · explained in 2 episodes

Sources

• Quantum Walks On Graphs
• A fast quantum mechanical algorithm for database search
• Imperfect Graphs from Unitary Matrices -- I

Related papers

• Reconquering Bell sampling on qudits: stabilizer learning and testing, quantum pseudorandomness bounds, and more
• Encrypted clones can leak: Classification of informative subsets in Quantum Encrypted Cloning
• Polynomial-time classical and quantum simulation of quantum impurity models
• Theory of quantum-enhanced interferometry with general Markovian light sources
• A convergent hierarchy of spectral gap certificates for qubit Hamiltonians
• Universal Bound and Phase Transition in Many-Body Fermionic Non-Gaussianity