Quantum graphs of homomorphisms
- URL: http://arxiv.org/abs/2601.09685v1
- Date: Wed, 14 Jan 2026 18:36:43 GMT
- Title: Quantum graphs of homomorphisms
- Authors: Andre Kornell, Bert Lindenhovius,
- Abstract summary: category $mathsfqGph$ of quantum graphs.<n> quantum graph $[G,H]$ is nonempty iff the $(G,H)$-homomorphism game has a winning quantum strategy.<n>Every finite reflexive quantum graph is the confusability quantum graph of a quantum channel.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We introduce a category $\mathsf{qGph}$ of quantum graphs, whose definition is motivated entirely from noncommutative geometry. For all quantum graphs $G$ and $H$ in $\mathsf{qGph}$, we then construct a quantum graph $[G,H]$ of homomorphisms from $G$ to $H$, making $\mathsf{qGph}$ a closed symmetric monoidal category. We prove that for all finite graphs $G$ and $H$, the quantum graph $[G,H]$ is nonempty iff the $(G,H)$-homomorphism game has a winning quantum strategy, directly generalizing the classical case. The finite quantum graphs in $\mathsf{qGph}$ are tracial, real, and self-adjoint, and the morphisms between them are CP morphisms that are adjoint to a unital $*$-homomorphism. We show that Weaver's two notions of a CP morphism coincide in this context. We also show that every finite reflexive quantum graph is the confusability quantum graph of a quantum channel, answering a question of Daws.
Related papers
- Homomorphism Indistinguishability Relations induced by Quantum Groups [0.23020018305241333]
Homomorphism indistinguishability is a way of characterising many natural equivalence relations on graphs.<n>We generalise Manvcinska and Roberson's result to all easy quantum groups.
arXiv Detail & Related papers (2025-05-12T16:58:51Z) - Group Invariant Quantum Latin Squares [0.0]
A quantum Latin square is an $n times n$ array of unit vectors where each row and column forms an orthonormal basis of a fixed complex vector space.<n>We show that a $(G,G')$-invariant quantum Latin square exists if and only if the multisets of degrees of irreducible representations are equal for $G$ and $G'$.
arXiv Detail & Related papers (2024-12-31T00:16:01Z) - Planar #CSP Equality Corresponds to Quantum Isomorphism -- A Holant
Viewpoint [0.0]
Graph homomorphism is the special case where each of $mathcalF$ and $mathcalF'$ contains a single symmetric 0-1-valued binary constraint function.
We show that any pair of sets $mathcalF$ and $mathcalF'$ of real-valued, arbitrary-arity constraint functions give the same value on any planar #CSP instance.
arXiv Detail & Related papers (2022-12-06T21:38:40Z) - Quantum isomorphism of graphs from association schemes [0.0]
We show that any two Hadamard graphs on the same number of vertices are quantum isomorphic.
This follows from a more general recipe for showing quantum isomorphism of graphs arising from certain association schemes.
arXiv Detail & Related papers (2022-09-10T03:22:28Z) - Algebraic Aspects of Boundaries in the Kitaev Quantum Double Model [77.34726150561087]
We provide a systematic treatment of boundaries based on subgroups $Ksubseteq G$ with the Kitaev quantum double $D(G)$ model in the bulk.
The boundary sites are representations of a $*$-subalgebra $Xisubseteq D(G)$ and we explicate its structure as a strong $*$-quasi-Hopf algebra.
As an application of our treatment, we study patches with boundaries based on $K=G$ horizontally and $K=e$ vertically and show how these could be used in a quantum computer
arXiv Detail & Related papers (2022-08-12T15:05:07Z) - Monogamy of entanglement between cones [43.57338639836868]
We show that monogamy is not only a feature of quantum theory, but that it characterizes the minimal tensor product of general pairs of convex cones.<n>Our proof makes use of a new characterization of products of simplices up to affine equivalence.
arXiv Detail & Related papers (2022-06-23T16:23:59Z) - Beyond the Berry Phase: Extrinsic Geometry of Quantum States [77.34726150561087]
We show how all properties of a quantum manifold of states are fully described by a gauge-invariant Bargmann.
We show how our results have immediate applications to the modern theory of polarization.
arXiv Detail & Related papers (2022-05-30T18:01:34Z) - Qudit lattice surgery [91.3755431537592]
We observe that lattice surgery, a model of fault-tolerant qubit computation, generalises straightforwardly to arbitrary finite-dimensional qudits.
We relate the model to the ZX-calculus, a diagrammatic language based on Hopf-Frobenius algebras.
arXiv Detail & Related papers (2022-04-27T23:41:04Z) - Uncertainties in Quantum Measurements: A Quantum Tomography [52.77024349608834]
The observables associated with a quantum system $S$ form a non-commutative algebra $mathcal A_S$.
It is assumed that a density matrix $rho$ can be determined from the expectation values of observables.
Abelian algebras do not have inner automorphisms, so the measurement apparatus can determine mean values of observables.
arXiv Detail & Related papers (2021-12-14T16:29:53Z) - Quantum double aspects of surface code models [77.34726150561087]
We revisit the Kitaev model for fault tolerant quantum computing on a square lattice with underlying quantum double $D(G)$ symmetry.
We show how our constructions generalise to $D(H)$ models based on a finite-dimensional Hopf algebra $H$.
arXiv Detail & Related papers (2021-06-25T17:03:38Z) - The Geometry of Time in Topological Quantum Gravity of the Ricci Flow [41.94295877935867]
We continue the study of nonrelativistic quantum gravity associated with a family of Ricci flow equations.<n>This topological gravity is of the cohomological type, and it exhibits an $cal N=2$ extended BRST symmetry.<n>We demonstrate a standard one-step BRST gauge-fixing of a theory whose fields are $g_ij$, $ni$ and $n$, and whose gauge symmetries consist of (i) the topological deformations of $g_ij$, and (ii) the ultralocal nonrelativistic limit of space
arXiv Detail & Related papers (2020-11-12T06:57:10Z) - Graph Homomorphism Convolution [19.94778871237204]
We show that graph homomorphism numbers provide a natural invariant (isomorphism invariant and $mathcalF$-invariant) embedding maps which can be used for graph classification.
By choosing $mathcalF$ whose elements have bounded tree-width, we show that the homomorphism method is efficient compared with other methods.
arXiv Detail & Related papers (2020-05-03T23:56:20Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.