Non-Gaussianity in cat codes: global incompatibility and local geometric alignment with the magic resource

• URL: http://arxiv.org/abs/2607.15739v1
• Date: Fri, 17 Jul 2026 08:20:24 GMT
• Title: Non-Gaussianity in cat codes: global incompatibility and local geometric alignment with the magic resource
• Abstract summary: An exact correspondence between non-Gaussianity (NG) and the magic resource was identified within the Gottesman--Kitaev--Preskill (GKP) encoding framework.<n>Our results identify both the global incompatibility and the locally constructive relation between magic and non-Gaussian resources in cat codes.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Non-Gaussianity is an essential resource for genuine quantum advantages in continuous-variable quantum systems and is regarded as a counterpart of the magic resource in discrete-variable systems. Recently, an exact correspondence between non-Gaussianity (NG) and the magic resource was identified within the Gottesman--Kitaev--Preskill (GKP) encoding framework. Whether such a relation persists beyond GKP encoding, however, remains unclear. Here, we address this question in the cat-code setting. By comparing the Wigner logarithmic negativity (WLN) and a magic measure defined from a phase-operator basis, we analyze the resource geometry of non-degenerate $d$-peaked cat states. We find that cat codes do not inherit the global value-preserving GKP magic--NG equivalence, but their asymptotic WLN geometry allows a constructive local alignment with the magic-measure geometry. Specifically, under a distinguished SU($d$) asymptotic cat code, we establish a sector-dependent alignment between WLN level sets and magic-measure level sets based on their intrinsic local geometries. These results identify both the global incompatibility and the locally constructive relation between magic and non-Gaussian resources in cat codes, suggesting a geometry-based approach to resource correspondences beyond the GKP framework.

Related papers

• Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks [1.5701326192371183]
  We introduce a family of quantum circuits that possess standard indicators of classical simulation hardness.<n>Our construction uses logical circuits of high-rate Calderbank-Shor-Steane (CSS) codes with enhanced symmetries.
  arXiv  Detail & Related papers  (2026-07-09T12:19:50Z)
• Beyond Heuristics: Learnable Density Control for 3D Gaussian Splatting [78.96382179408054]
  We introduce bfLeGS, a framework that reformulates density control as a parameterized policy network optimized via Reinforcement Learning (RL)<n>To maintain computational tractability, we derive a closed-form solution that reduces the complexity of reward calculation from $O(N2)$ to $O(N)$.<n>Experiments on the Mip-NeRF 360, Tanks & Temples, and Deep Blending datasets demonstrate that bfLeGS significantly outperforms state-of-the-art methods.
  arXiv  Detail & Related papers  (2026-05-01T05:04:49Z)
• Kinematic budget of quantum correlations [0.0]
  We introduce a local-unitary-invariant budget split of symmetrised second moments into local and nonlocal sectors.<n>By coarse-graining over gauge-like first moments, the budget geometry acts as a thermodynamic phase diagram.
  arXiv  Detail & Related papers  (2026-03-04T09:40:02Z)
• Variational Bayesian Flow Network for Graph Generation [54.94088904387278]
  We propose Variational Bayesian Flow Network (VBFN) for graph generation.<n>VBFN performs variational lifting to a tractable joint Gaussian variational belief family governed by structured precisions.<n>On synthetic and molecular graph datasets, VBFN improves fidelity and diversity, and surpasses baseline methods.
  arXiv  Detail & Related papers  (2026-01-30T03:59:38Z)
• Mean-Field Control on Sparse Graphs: From Local Limits to GNNs via Neighborhood Distributions [5.081469534056712]
  Mean-field control (MFC) offers a scalable solution to the curse of dimensionality in multi-agent systems.<n>We bridge the gap to real-world network structures by proposing a rigorous framework for MFC on large sparse graphs.
  arXiv  Detail & Related papers  (2026-01-29T09:57:48Z)
• Computable measures of non-Markovianity for Gaussian free fermion systems [0.0]
  We investigate measures of non-Markovianity in open quantum systems governed by free fermionic dynamics.<n>For Gaussian states, trace-based distances -- specifically the Hilbert-Schmidt norm -- and second-order R'enyi mutual information can be efficiently expressed.
  arXiv  Detail & Related papers  (2025-09-30T08:47:20Z)
• A Fresh Look at Generalized Category Discovery through Non-negative Matrix Factorization [83.12938977698988]
  Generalized Category Discovery (GCD) aims to classify both base and novel images using labeled base data. Current approaches inadequately address the intrinsic optimization of the co-occurrence matrix $barA$ based on cosine similarity. We propose a Non-Negative Generalized Category Discovery (NN-GCD) framework to address these deficiencies.
  arXiv  Detail & Related papers  (2024-10-29T07:24:11Z)
• Understanding Matrix Function Normalizations in Covariance Pooling through the Lens of Riemannian Geometry [63.694184882697435]
  Global Covariance Pooling (GCP) has been demonstrated to improve the performance of Deep Neural Networks (DNNs) by exploiting second-order statistics of high-level representations.<n>This paper provides a comprehensive and unified understanding of the matrix logarithm and power from a Riemannian geometry perspective.
  arXiv  Detail & Related papers  (2024-07-15T07:11:44Z)
• Bridging magic and non-Gaussian resources via Gottesman-Kitaev-Preskill encoding [0.0]
  We establish a fundamental link between non-stabilizer states and non-Gaussian states in continuous-variable systems.<n>We show that the negativity of the continuous-variable Wigner function for an encoded GKP state coincides with a magic measure.<n>We also provide a continuous-variable representation of the stabilizer R'enyi entropy.
  arXiv  Detail & Related papers  (2024-06-10T16:09:45Z)
• Positional Encoding as Spatial Inductive Bias in GANs [97.6622154941448]
  SinGAN shows impressive capability in learning internal patch distribution despite its limited effective receptive field. In this work, we show that such capability, to a large extent, is brought by the implicit positional encoding when using zero padding in the generators. We propose a new multi-scale training strategy and demonstrate its effectiveness in the state-of-the-art unconditional generator StyleGAN2.
  arXiv  Detail & Related papers  (2020-12-09T18:27:16Z)
• Efficient simulatability of continuous-variable circuits with large Wigner negativity [62.997667081978825]
  Wigner negativity is known to be a necessary resource for computational advantage in several quantum-computing architectures. We identify vast families of circuits that display large, possibly unbounded, Wigner negativity, and yet are classically efficiently simulatable. We derive our results by establishing a link between the simulatability of high-dimensional discrete-variable quantum circuits and bosonic codes.
  arXiv  Detail & Related papers  (2020-05-25T11:03: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.