Graph States and the Variety of Principal Minors

• URL: http://arxiv.org/abs/2107.02479v2
• Date: Thu, 8 Sep 2022 05:51:19 GMT
• Title: Graph States and the Variety of Principal Minors
• Authors: Vincenzo Galgano, Fr\'ed\'eric Holweck
• Abstract summary: In Quantum Information theory, graph states are quantum states defined by graphs. In this work we exhibit a correspondence between graph states and the variety of binary symmetric principal minors, in particular their corresponding orbits under the action of $SL(2,mathbb F_2)times nrtimes mathfrak S_n$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In Quantum Information theory, graph states are quantum states defined by graphs. In this work we exhibit a correspondence between graph states and the variety of binary symmetric principal minors, in particular their corresponding orbits under the action of $SL(2,\mathbb F_2)^{\times n}\rtimes \mathfrak S_n$. We start by approaching the topic more widely, that is by studying the orbits of maximal abelian subgroups of the $n$-fold Pauli group under the action of $\mathcal C_n^{\text{loc}}\rtimes \mathfrak S_n$, where $\mathcal C_n^{\text{loc}}$ is the $n$-fold local Clifford group: we show that this action corresponds to the natural action of $SL(2,\mathbb F_2)^{\times n}\rtimes \mathfrak S_n$ on the variety $\mathcal Z_n\subset \mathbb P(\mathbb F_2^{2^n})$ of principal minors of binary symmetric $n\times n$ matrices. The crucial step in this correspondence is in translating the action of $SL(2,\mathbb F_2)^{\times n}$ into an action of the local symplectic group $Sp_{2n}^{\text{loc}}(\mathbb F_2)$ on the Lagrangian Grassmannian $LG_{\mathbb F_2}(n,2n)$. We conclude by studying how the former action restricts onto stabilizer groups and stabilizer states, and finally what happens in the case of graph states.

Related papers

• The Communication Complexity of Approximating Matrix Rank [50.6867896228563]
  We show that this problem has randomized communication complexity $Omega(frac1kcdot n2log|mathbbF|)$. As an application, we obtain an $Omega(frac1kcdot n2log|mathbbF|)$ space lower bound for any streaming algorithm with $k$ passes.
  arXiv  Detail & Related papers  (2024-10-26T06:21:42Z)
• Quantum charges of harmonic oscillators [55.2480439325792]
  We show that the energy eigenfunctions $psi_n$ with $nge 1$ are complex coordinates on orbifolds $mathbbR2/mathbbZ_n$. We also discuss "antioscillators" with opposite quantum charges and the same positive energy.
  arXiv  Detail & Related papers  (2024-04-02T09:16:18Z)
• Provably learning a multi-head attention layer [55.2904547651831]
  Multi-head attention layer is one of the key components of the transformer architecture that sets it apart from traditional feed-forward models. In this work, we initiate the study of provably learning a multi-head attention layer from random examples. We prove computational lower bounds showing that in the worst case, exponential dependence on $m$ is unavoidable.
  arXiv  Detail & Related papers  (2024-02-06T15:39:09Z)
• A Unified Framework for Uniform Signal Recovery in Nonlinear Generative Compressed Sensing [68.80803866919123]
  Under nonlinear measurements, most prior results are non-uniform, i.e., they hold with high probability for a fixed $mathbfx*$ rather than for all $mathbfx*$ simultaneously. Our framework accommodates GCS with 1-bit/uniformly quantized observations and single index models as canonical examples. We also develop a concentration inequality that produces tighter bounds for product processes whose index sets have low metric entropy.
  arXiv  Detail & Related papers  (2023-09-25T17:54:19Z)
• Quantized charge polarization as a many-body invariant in (2+1)D crystalline topological states and Hofstadter butterflies [14.084478426185266]
  We show how to define a quantized many-body charge polarization $vecmathscrP$ for (2+1)D topological phases of matter, even in the presence of non-zero Chern number and magnetic field. We derive colored Hofstadter butterflies, corresponding to the quantized value of $vecmathscrP$, which further refine the colored butterflies from the Chern number and discrete shift.
  arXiv  Detail & Related papers  (2022-11-16T19:00:00Z)
• Synthesis and upper bound of Schmidt rank of the bipartite controlled-unitary gates [0.0]
  We show that $2(N-1)$ generalized controlled-$X$ (GCX) gates, $6$ single-qubit rotations about the $y$- and $z$-axes, and $N+5$ single-partite $y$- and $z$-rotation-types are required to simulate it. The quantum circuit for implementing $mathcalU_cu(2otimes N)$ and $mathcalU_cd(Motimes N)$ are presented.
  arXiv  Detail & Related papers  (2022-09-11T06:24:24Z)
• Monogamy of entanglement between cones [68.8204255655161]
  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. 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)
• Learning a Single Neuron with Adversarial Label Noise via Gradient Descent [50.659479930171585]
  We study a function of the form $mathbfxmapstosigma(mathbfwcdotmathbfx)$ for monotone activations. The goal of the learner is to output a hypothesis vector $mathbfw$ that $F(mathbbw)=C, epsilon$ with high probability.
  arXiv  Detail & Related papers  (2022-06-17T17:55:43Z)
• Algorithms and Hardness for Linear Algebra on Geometric Graphs [14.822517769254352]
  We show that the exponential dependence on the dimension dimension $d in the celebrated fast multipole method of Greengard and Rokhlin cannot be improved. This is the first formal limitation proven about fast multipole methods.
  arXiv  Detail & Related papers  (2020-11-04T18:35:02Z)
• Bulk-boundary asymptotic equivalence of two strict deformation quantizations [0.0]
  The existence of a strict deformation quantization of $X_k=S(M_k(mathbbC))$ has been proven by both authors and K. Landsman citeLMV. A similar result is known for the symplectic manifold $S2subsetmathbbR3$.
  arXiv  Detail & Related papers  (2020-05-09T12:03:18Z)
• Construction of mutually unbiased maximally entangled bases in $\mathbb{C}^{2^s}\otimes\mathbb{C}^{2^s}$ by using Galois rings [0.0]
  We construct mutually unbiased maximally entangled bases in $mathbbC2s otimes mathbbC2s$ by using Galois rings. As applications, we obtain several new types of MUMEBs in $mathbbC2sotimesmathbbC2s$ and prove that $M(2s,2s)geq 3(2s-1)$ raises the lower bound of $M(2s,2s)$ given in cite
  arXiv  Detail & Related papers  (2019-12-28T11:20:42Z)

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.