Asymptotic entanglement in circle stabilizer states and states forbidding arbitrary vertex-minors

• URL: http://arxiv.org/abs/2608.21526v1
• Date: Fri, 21 Aug 2026 18:03:42 GMT
• Title: Asymptotic entanglement in circle stabilizer states and states forbidding arbitrary vertex-minors
• Abstract summary: We show that a stabilizer state $|rangle$ can be transformed into another stabilizer state $|rangle$ using only single-qubit Clifford operations and Pauli measurements.<n>Our results establish a connection between stabilizer entanglement and forbidden entanglement-minors, with direct implications for the entanglement that can be generated in quantum devices.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Stabilizer states play a central role in quantum information theory, and understanding their entanglement has motivated a large body of work. A well-studied question in particular is when a stabilizer state $|ψ\rangle$ can be transformed into another stabilizer state $|φ\rangle$ using only single-qubit Clifford operations and Pauli measurements. If this is possible, we say that $|φ\rangle$ is a vertex-minor of $|ψ\rangle$. Assuming Geelen's weak structural conjecture on vertex-minors, we establish the following general statement. For any fixed stabilizer state $|φ\rangle$, the entanglement in stabilizer states $|ψ\rangle$ that do not contain $|φ\rangle$ as a vertex-minor is asymptotically constrained. More concretely, we show that the distance of any sufficiently rank-connected $|ψ\rangle$ not containing $|φ\rangle$ as a vertex-minor grows as $O(\log n)$, and prove similar results for the so-called locally accessible information, a quantity that captures the amount of information that can be learned through single-qubit Pauli measurements. Our results rely on (i) connecting the above two entanglement measures to rank functions of multimatroids, (ii) connecting the rank functions of circle stabilizer states to rank functions on $4$-regular multigraphs, which asymptotically constrains the entanglement of circle stabilizer states, and (iii) using Geelen's weak structural conjecture on vertex-minors to `lift' the previous result to sufficiently connected states in proper vertex-minor-closed families of stabilizer states. Our results establish a connection between asymptotic stabilizer entanglement and forbidden vertex-minors, with direct implications for the entanglement that can be generated in quantum devices.

Related papers

• Exact Quasiprobability Hierarchy of the Double-Morse Oscillator: From Potential Geometry to Operator Ordering [0.0]
  We develop an exact, representation-consistent analysis of the lowest quasi-exact ground state of the symmetric double-Morse oscillator.<n>In the double-Morse potential, the dimensionless parameter $A$ controls the separation of the minima and the central barrier.<n>We show that $A$ controls how the same non-Gaussian and nonclassical state is resolved across complementary representations.
  arXiv  Detail & Related papers  (2026-08-24T14:33:31Z)
• Quantum steering is equivalent to state-preserving conditional expectations [38.996757863405556]
  In systems with infinitely many degrees of freedom, fundamental results from quantum information theory can fail.<n>We show that the ability to steer any ensemble decomposition of the marginal state on $A$ by measurements on $B$ is equivalent to the existence of a state-preserving conditional expectation.
  arXiv  Detail & Related papers  (2026-08-11T10:43:31Z)
• An Argmax Principle for Sum-of-Squares Relaxations on the Sphere [42.540924632302925]
  We develop an argmax principle for analyzing sum-of-squares relaxations of optimization problems over the unit sphere.<n>Our guiding principle is that its maximizers are rounding candidates.
  arXiv  Detail & Related papers  (2026-08-03T17:58:00Z)
• Near-Optimal Clustering in Mixture of Markov Chains [74.3828414695655]
  We study the problem of clustering $T$ trajectories of length $H$, each generated by one of $K$ unknown ergodic Markov chains over a finite state space of size $S$.<n>We derive an instance-dependent, high-probability lower bound on the clustering error rate, governed by the weighted KL divergence between the transition kernels of the chains.<n>We then present a novel two-stage clustering algorithm.
  arXiv  Detail & Related papers  (2025-06-02T05:10:40Z)
• Joint estimation of smooth graph signals from partial linear measurements [5.2395896768723045]
  Weak consistency is established for certain choices of $G$ even when the individual $G_t$'s are very sparse and disconnected.<n>Results are extended to a multi-layer'' ranking problem where $x_t$ corresponds to the latent strengths of a collection of $n$ items.
  arXiv  Detail & Related papers  (2025-05-29T08:41:45Z)
• Stabilizer Ranks, Barnes Wall Lattices and Magic Monotones [1.4323566945483497]
  Kliuchnikov and Sch"onnenbeck showed a connection between the Barnes Wall lattices, stabilizer states and Clifford operations.<n>We show the first quantitative lower bound on stabilizer fidelity as a function of stabilizer ranks.
  arXiv  Detail & Related papers  (2025-03-06T05:20:55Z)
• Quadratic Lower bounds on the Approximate Stabilizer Rank: A Probabilistic Approach [6.169364905804677]
  The approximate stabilizer rank of a quantum state is the minimum number of terms in any approximate decomposition of that state into stabilizer states. We improve the lower bound on the approximate rank to $tilde Omega(sqrt n)$ for a wide range of the approximation parameters.
  arXiv  Detail & Related papers  (2023-05-17T15:09:41Z)
• Near-optimal fitting of ellipsoids to random points [68.12685213894112]
  A basic problem of fitting an ellipsoid to random points has connections to low-rank matrix decompositions, independent component analysis, and principal component analysis. We resolve this conjecture up to logarithmic factors by constructing a fitting ellipsoid for some $n = Omega(, d2/mathrmpolylog(d),)$. Our proof demonstrates feasibility of the least squares construction of Saunderson et al. using a convenient decomposition of a certain non-standard random matrix.
  arXiv  Detail & Related papers  (2022-08-19T18:00:34Z)
• A Law of Robustness beyond Isoperimetry [84.33752026418045]
  We prove a Lipschitzness lower bound $Omega(sqrtn/p)$ of robustness of interpolating neural network parameters on arbitrary distributions. We then show the potential benefit of overparametrization for smooth data when $n=mathrmpoly(d)$. We disprove the potential existence of an $O(1)$-Lipschitz robust interpolating function when $n=exp(omega(d))$.
  arXiv  Detail & Related papers  (2022-02-23T16:10:23Z)
• Lower Bounds on Stabilizer Rank [3.265773263570237]
  We prove that for a sufficiently small constant $delta, the stabilizer rank of any state which is $$-close to those states is $Omega(sqrtn/log n)$. This is the first non-trivial lower bound for approximate stabilizer rank.
  arXiv  Detail & Related papers  (2021-06-06T19:27:51Z)
• Stochastic behavior of outcome of Schur-Weyl duality measurement [45.41082277680607]
  We focus on the measurement defined by the decomposition based on Schur-Weyl duality on $n$ qubits. We derive various types of distribution including a kind of central limit when $n$ goes to infinity.
  arXiv  Detail & Related papers  (2021-04-26T15:03:08Z)

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.