Fermionic non-Gaussianity via Bell sampling: monotones and efficient quantum algorithms

• URL: http://arxiv.org/abs/2606.05066v1
• Date: Wed, 03 Jun 2026 16:29:05 GMT
• Title: Fermionic non-Gaussianity via Bell sampling: monotones and efficient quantum algorithms
• Abstract summary: We develop efficient quantum algorithms for fermionic non-Gaussianity, all built on the eigenvalue structure of the operator $= sum_j=12n_jotimes_j.<n>We introduce the emphbridge degree of even pure states, a novel non-Gaussianity monotone defined as the largest eigenvalue sector of $$ populated by two copies of the state.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Fermionic non-Gaussianity is an essential resource for unlocking the full computational power of fermionic quantum platforms. In this work we develop monotones and efficient quantum algorithms for fermionic non-Gaussianity, all built on the eigenvalue structure of the operator $Λ= \sum_{j=1}^{2n}γ_j\otimesγ_j$ defined on two copies of an $n$-mode fermionic state, accessible via Bell sampling. In particular, we introduce the \emph{bridge degree} of even pure states, a novel non-Gaussianity monotone defined as the largest eigenvalue sector of $Λ$ populated by two copies of the state. Our key technical result is that the bridge degree is non-increasing under post-selected Gaussian protocols, which yields no-go theorems for Gaussian conversion stronger than those obtainable from previously known monotones and shows that the resource theory of fermionic non-Gaussianity is irreversible in the exact-conversion setting. Beyond this, the bridge degree exhibits several further features: it (i) is easy to compute, (ii) is efficiently witnessed through Bell sampling, (iii) lower-bounds the non-Gaussian gate complexity of state preparation, (iv) controls the non-Gaussian gate complexity of producing quantum state designs, and (v) naturally extends to mixed states via the Choi--Jamiołkowski isomorphism. We further develop an approximate variant together with an efficiently measurable lower bound, yielding an experimentally certifiable lower bound on the non-Gaussian cost of approximately preparing any state, based directly on Bell-sampling data. Finally, the same eigenvalue structure underlies two Bell-sampling-based algorithmic primitives, both with polynomial sample complexity: a two-copy Gaussianity test with perfect completeness, optimal among two-copy tests sharing this property, and a test for the state $2$-design property of matchgate-invariant ensembles.

Related papers

• Fermionic entropy: an efficiently measurable strong monotone for non-Gaussianity [0.0]
  We show that the fermionic entropy, defined through the squared Frobenius norm of the correlation matrix, is a strong pure-state Gaussian.<n>We derive a linear sample bound for testing of fermionic Gaussian states, providing a quadratic improvement over the state of the art.<n>As a further application of our results, we study unitary designs generated by Matchgate circuits supplemented with Majorana-local non-Gaussian gates.
  arXiv  Detail & Related papers  (2026-07-31T17:53:24Z)
• Coherent Quantum Schrodinger Bridge: Two-Boundary Optimal Control for Quantum Algorithm Design [0.913755431537592]
  We formulate this observation as a coherent Quantum Schrdinger Bridge (QSB)<n>We apply this framework to unstructured search, periodicity finding, and matrix arithmetic.<n>The usual circuit components -- oracles, diffusion reflections, controlled phases, and signal-processing rotations -- emerge as Lie-algebraic syntheses of the optimal weak-value drift.
  arXiv  Detail & Related papers  (2026-07-12T03:30:50Z)
• Practical Tests and Witnesses of Fermionic non-Gaussianity [0.34757790689654594]
  We develop tests and witnesses based on fermionic antiflatness (FAF)<n>For $n$-qubit states, we estimate FAF using two complementary protocols: two-copy Bell measurements and a single-copy scheme.<n>For mixed states, we introduce a purity-corrected FAF witness that certifies non-Gaussianity and is highly robust to noise.
  arXiv  Detail & Related papers  (2026-05-25T18:00:03Z)
• Non-Gaussian Entanglement Hierarchy Based on the Schmidt Number [2.999888908665658]
  Non-Gaussian entanglement is a promising resource in various quantum tasks.<n>We introduce a quantitative witness $E_rm NG$ in bipartite bosonic systems.<n>We benchmark the framework with some paradigmatic non-Gaussian states, such as NOON states and squeezed Kerr states.
  arXiv  Detail & Related papers  (2026-05-18T16:15:17Z)
• The symplectic rank of non-Gaussian quantum states [0.0]
  Non-Gaussianity is a key resource for achieving quantum advantages in bosonic platforms.<n>Here, we investigate the symplectic rank: a novel non-Gaussianity monotone that satisfies remarkable operational and resource-theoretic properties.<n>We show that the symplectic rank is a robust non-Gaussian measure, explaining how to witness it in experiments and how to exploit it to meaningfully benchmark different bosonic platforms.
  arXiv  Detail & Related papers  (2025-04-27T18:00:31Z)
• Streaming quantum state purification for general mixed states [2.412198129884481]
  We show that the same algorithm applies much more broadly, enabling the purification of arbitrary mixed states with a nondegenerate principal eigenvalue.<n>In the first approach, we show that, given the largest two eigenvalues, the depolarized noise is the most difficult noise to purify.<n>In the second approach, we provide a new and direct analysis for the performance of purification.
  arXiv  Detail & Related papers  (2025-03-28T17:31:13Z)
• Scalable Equilibrium Sampling with Sequential Boltzmann Generators [60.00515282300297]
  We extend the Boltzmann generator framework with two key contributions.<n>The first is a highly efficient Transformer-based normalizing flow operating directly on all-atom Cartesian coordinates.<n>In particular, we perform inference-time scaling of flow samples using a continuous-time variant of sequential Monte Carlo.
  arXiv  Detail & Related papers  (2025-02-25T18:59:13Z)
• Optimizing random local Hamiltonians by dissipation [44.99833362998488]
  We prove that a simplified quantum Gibbs sampling algorithm achieves a $Omega(frac1k)$-fraction approximation of the optimum. Our results suggest that finding low-energy states for sparsified (quasi)local spin and fermionic models is quantumly easy but classically nontrivial.
  arXiv  Detail & Related papers  (2024-11-04T20:21:16Z)
• Learning with Norm Constrained, Over-parameterized, Two-layer Neural Networks [54.177130905659155]
  Recent studies show that a reproducing kernel Hilbert space (RKHS) is not a suitable space to model functions by neural networks. In this paper, we study a suitable function space for over- parameterized two-layer neural networks with bounded norms.
  arXiv  Detail & Related papers  (2024-04-29T15:04:07Z)
• Sparse random Hamiltonians are quantumly easy [105.6788971265845]
  A candidate application for quantum computers is to simulate the low-temperature properties of quantum systems. This paper shows that, for most random Hamiltonians, the maximally mixed state is a sufficiently good trial state. Phase estimation efficiently prepares states with energy arbitrarily close to the ground energy.
  arXiv  Detail & Related papers  (2023-02-07T10:57:36Z)
• Deterministic Gaussian conversion protocols for non-Gaussian single-mode resources [58.720142291102135]
  We show that cat and binomial states are approximately equivalent for finite energy, while this equivalence was previously known only in the infinite-energy limit. We also consider the generation of cat states from photon-added and photon-subtracted squeezed states, improving over known schemes by introducing additional squeezing operations.
  arXiv  Detail & Related papers  (2022-04-07T11:49:54Z)
• Improved Quantum Algorithms for Fidelity Estimation [77.34726150561087]
  We develop new and efficient quantum algorithms for fidelity estimation with provable performance guarantees. Our algorithms use advanced quantum linear algebra techniques, such as the quantum singular value transformation. We prove that fidelity estimation to any non-trivial constant additive accuracy is hard in general.
  arXiv  Detail & Related papers  (2022-03-30T02:02:16Z)
• Gaussian conversion protocols for cubic phase state generation [104.23865519192793]
  Universal quantum computing with continuous variables requires non-Gaussian resources. The cubic phase state is a non-Gaussian state whose experimental implementation has so far remained elusive. We introduce two protocols that allow for the conversion of a non-Gaussian state to a cubic phase state.
  arXiv  Detail & Related papers  (2020-07-07T09:19:49Z)

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.