pith. sign in

arxiv: 2606.29739 · v1 · pith:BES5ZE3Enew · submitted 2026-06-29 · 🪐 quant-ph

Quantum complexity resource in Gaussian boson sampling: Core structure of the semidefinite program

Kunwar Kalra , Vitaly Kocharovsky This is my paper

Pith reviewed 2026-06-30 06:32 UTC · model grok-4.3

classification 🪐 quant-ph
keywords Gaussian boson samplingsemidefinite programcovariance matrixpure Gaussian statesymplectic groupRiccati identityquantum resourcehafnian
0
0 comments X

The pith

The semidefinite program for the quantum complexity resource in Gaussian boson sampling always yields a unique pure Gaussian state reconstructible by a Riccati oracle map.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper examines the structure of the quantum complexity resource in Gaussian boson sampling, defined as the minimum-trace physical quantum part of the total covariance matrix whose photon-counting statistics require a #P-hard hafnian evaluation. The authors prove that the optimizer of this semidefinite program is always a unique pure Gaussian state and supply an explicit oracle map obeying an algebraic Riccati identity to reconstruct it. They further show that the full optimization problem compresses exactly onto the active symplectic sector and is equivalent to a minimization over the symplectic group, with closed-form solutions for the passive-diagonalizable class. A sympathetic reader would care because this moves the characterization of the resource from a single scalar (its trace, or photon number) to a complete geometric and algebraic object that isolates the computationally hard quantum component.

Core claim

The semidefinite program that isolates the minimum-trace physical quantum part of the total covariance matrix has as its solution a unique pure Gaussian state. This state is reconstructed by an explicit oracle map that obeys an algebraic Riccati identity. The entire program is equivalent to a minimization over the symplectic group after exact compression to the active sector generated by the dual support, and the passive-diagonalizable states admit closed-form solutions.

What carries the argument

The algebraic Riccati identity satisfied by the oracle map that reconstructs the resource covariance matrix from the support of the dual program.

If this is right

  • The resource covariance matrix is always that of a pure Gaussian state.
  • The optimization problem reduces exactly to minimization over the symplectic group.
  • Passive-diagonalizable states possess explicit closed-form solutions.
  • The full problem compresses onto the active symplectic sector identified by the dual support.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • Numerical solvers could be specialized to the symplectic group to compute the resource more efficiently than generic semidefinite programs.
  • The canonical pure Gaussian component isolates the source of quantum advantage, allowing separate study of how classical noise affects the hard computational core.
  • Direct verification of the Riccati identity on small-mode examples would test the reconstruction map without solving the full program.

Load-bearing premise

The total covariance matrix can be decomposed into a minimum-trace physical quantum part solved by the semidefinite program and a complementary positive-semidefinite part that admits classical simulation.

What would settle it

A concrete covariance matrix for which the semidefinite program optimizer is not a pure Gaussian state or for which the proposed oracle map violates the Riccati identity.

read the original abstract

We present a rigorous analysis of the algebraic and geometric structure of the quantum complexity resource of a system of bosonic modes in Gaussian boson sampling. This resource underlies the quantum advantage of the system: its photon-counting statistics require the evaluation of a hafnian of the resource covariance matrix, and that computation is #P-hard. The resource covariance matrix is the solution of a semidefinite program that extracts the minimum-trace physical quantum part of the total covariance matrix; the complementary part is positive semidefinite and can therefore be simulated classically. Earlier work characterized this resource only through the trace of the quantum part, equal to its photon number. We characterize the optimizer itself, as a quantum state and as a geometric object, beyond the scalar given by its trace. We prove that it is a unique pure Gaussian state and construct an explicit oracle map, obeying an algebraic Riccati identity, that reconstructs the resource. We prove that the full problem compresses exactly onto the active symplectic sector that the dual program support generates. The passive-diagonalizable states are solved in closed form, the first explicit solvable class, and the whole program is shown to be equivalent to a minimization over the symplectic group, that is, over the Siegel upper half-space. Together these results establish that the program determines a canonical localized pure Gaussian component of the resource, and they provide the structural foundation for its detailed analysis.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

0 major / 0 minor

Summary. The paper provides a rigorous analysis of the algebraic and geometric structure of the quantum complexity resource in Gaussian boson sampling. This resource is the solution to a semidefinite program extracting the minimum-trace physical quantum part of the covariance matrix, with the complementary part being classically simulable. The authors prove that the optimizer is a unique pure Gaussian state, construct an explicit oracle map obeying an algebraic Riccati identity, show that the problem compresses exactly onto the active symplectic sector, solve the passive-diagonalizable states in closed form, and demonstrate that the program is equivalent to a minimization over the symplectic group (Siegel upper half-space).

Significance. If the claimed structural results hold, the work is significant for characterizing the quantum complexity resource in GBS beyond its trace (photon number). The uniqueness proof, explicit Riccati oracle map, closed-form solutions for a solvable class, and equivalence to minimization over the Siegel upper half-space provide a detailed geometric and algebraic foundation that could support further analysis of quantum advantage in boson sampling. The explicit constructions and compression result are notable strengths.

Simulated Author's Rebuttal

0 responses · 0 unresolved

We thank the referee for their positive assessment of the manuscript, accurate summary of its contributions, and recommendation to accept. We are pleased that the structural results on the quantum complexity resource in Gaussian boson sampling were viewed as significant.

Circularity Check

0 steps flagged

No significant circularity; derivation self-contained from SDP definition

full rationale

The paper defines the quantum complexity resource explicitly as the minimum-trace physical quantum part of the covariance matrix obtained as the solution to the given semidefinite program, with the complementary PSD part declared simulable classically by definition. All central results (uniqueness of the pure Gaussian optimizer, explicit Riccati oracle map, exact compression onto the active symplectic sector, closed-form passive-diagonalizable solutions, and equivalence to minimization over the Siegel upper half-space) are presented as theorems derived from this SDP and the geometry of the symplectic group. No load-bearing step reduces by construction to a fitted parameter, a self-citation chain, or an ansatz smuggled from prior work; the analysis remains internal to the stated mathematical object and does not invoke external uniqueness theorems or empirical fits that would create circularity.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the existence and uniqueness properties of the SDP solution for the quantum covariance matrix and on standard facts from Gaussian quantum optics and symplectic geometry. No free parameters or invented entities are introduced in the abstract.

axioms (2)
  • domain assumption The total covariance matrix of bosonic modes can be decomposed via SDP into a minimum-trace quantum part and a complementary PSD classical part.
    This decomposition is the foundational definition of the quantum complexity resource throughout the abstract.
  • standard math Gaussian states and symplectic transformations obey the algebraic Riccati identity used for the oracle map.
    Invoked to construct the explicit reconstruction of the resource state.

pith-pipeline@v0.9.1-grok · 5780 in / 1496 out tokens · 40583 ms · 2026-06-30T06:32:49.703740+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Quantum-advantage resource of a two-mode Gaussian state: Analytical theory of convex optimization and a Galois no-go for the closed-form solution

    quant-ph 2026-06 unverdicted novelty 6.0

    First complete certificate-checked solution to quantum-advantage resource extraction from two-mode Gaussian states with Galois-theory proof of no closed-form expression.

Reference graph

Works this paper leans on

33 extracted references · 1 canonical work pages · cited by 1 Pith paper · 1 internal anchor

  1. [1]

    C. Oh, M. Liu, Y. Alexeev, B. Fefferman, L. Jiang, Classical algorithm for simulating experimental Gaussian boson sampling, Nat. Phys.20, 1461– 1468 (2024)

    2024

  2. [2]

    Serafini,Quantum Continuous Variables: A Primer of Theoretical Methods, 2nd ed.; CRC Press: Boca Raton, FL, USA, 2023

    A. Serafini,Quantum Continuous Variables: A Primer of Theoretical Methods, 2nd ed.; CRC Press: Boca Raton, FL, USA, 2023

    2023

  3. [3]

    Weedbrook, S

    C. Weedbrook, S. Pirandola, R. Garc´ ıa-Patr´ on et al., Gaussian quantum information, Rev. Mod. Phys.84, 621–669 (2012)

    2012

  4. [4]

    Zhong, H

    H.-S. Zhong, H. Wang, Y.-H. Deng et al., Quantum computational advantage using photons, Science370, 1460–1463 (2020)

    2020

  5. [5]

    Takeda, A

    S. Takeda, A. Furusawa, Toward large-scale fault-tolerant universal photonic quantum computing, APL Photonics4, 060902 (2019)

    2019

  6. [6]

    Preskill, Quantum computing in the NISQ era and beyond, Quantum2, 79 (2018)

    J. Preskill, Quantum computing in the NISQ era and beyond, Quantum2, 79 (2018)

    2018

  7. [7]

    Boixo, S

    S. Boixo, S. V. Isakov, V. N. Smelyanskiy et al., Characterizing quantum supremacy in near-term devices, Nature Phys.14, 595–600 (2018)

    2018

  8. [8]

    H. A. Rad, T. Ainsworth, R. N. Alexander et al., Scaling and networking a modular photonic quantum computer, Nature638, 912–919 (2025)

    2025

  9. [9]

    H.-L. Liu, H. Su, Y.-H. Deng et al., Gaussian boson sampling with 1,024 squeezed states in 8,176 modes, Nature653, 687–692 (2026)

    2026

  10. [10]

    C. S. Hamilton, R. Kruse, L. Sansoni, S. Barkhofen, C. Silberhorn, I. Jex, Gaussian boson sampling, Phys. Rev. Lett.119, 170501 (2017)

    2017

  11. [11]

    Quesada, J

    N. Quesada, J. M. Arrazola, N. Killoran, Gaussian boson sampling using threshold detectors, Phys. Rev. A98, 062322 (2018)

    2018

  12. [12]

    Zhong, L.-C

    H.-S. Zhong, L.-C. Peng, Y. Li et al., Experimental Gaussian Boson sampling, Sci. Bulletin64, 511–515 (2019)

    2019

  13. [13]

    M.-H. Yung, X. Gao, and J. Huh, Universal bound on sampling bosons in linear optics and its computational implications, Natl. Sci. Rev.6, 719–729 (2019)

    2019

  14. [14]

    H. Wang, J. Qin, X. Ding et al., Boson Sampling with 20 input photons and a 60-mode interferometer in a 10 14-dimensional Hilbert space, Phys. Rev. Lett.123, 250503 (2019)

    2019

  15. [15]

    D. J. Brod, E. F. Galv˜ ao, A. Crespi et al., Photonic implementation of boson sampling: a review, Advanced Photonics1, 034001 (2019)

    2019

  16. [16]

    Zhong, Y.-H

    H.-S. Zhong, Y.-H. Deng, J. Qin et al., Phase-Programmable Gaussian Boson Sampling Using Stimulated Squeezed Light, Phys. Rev. Lett.127, 180502 (2021)

    2021

  17. [17]

    Deshpande, A

    A. Deshpande, A. Mehta, T. Vincent et al., Quantum computational advantage via high-dimensional Gaussian boson sampling, Sci. Adv.8, eabi7894 (2022)

    2022

  18. [18]

    J. F. F. Bulmer, B. A. Bell, R. S. Chadwick et al., The boundary for quantum advantage in Gaussian boson sampling, Sci. Adv.8, eabl9236 (2022)

    2022

  19. [19]

    L. S. Madsen, F. Laudenbach, M. F. Askarani et al., Quantum computational advantage with a programmable photonic processor, Nature 20•Kalra and Kocharovsky 606, 75–81 (2022)

    2022

  20. [20]

    Deng, Y.-C

    Y.-H. Deng, Y.-C. Gu, H.-L. Liu et al., Gaussian boson sampling with pseudo-photon-number-resolving detectors and quantum computational advantage, Phys. Rev. Lett.131, 150601 (2023)

    2023

  21. [21]

    Deng, S.-Q

    Y.-H. Deng, S.-Q. Gong, Y.-C. Gu et al., Solving graph problems using Gaussian boson sampling, Phys. Rev. Lett.130, 190601 (2023)

    2023

  22. [22]

    Yu, Z.-P

    S. Yu, Z.-P. Zhong, Y. Fang et al., A universal programmable Gaussian boson sampler for drug discovery, Nature Comp. Sci.3, 839–848 (2023)

    2023

  23. [23]

    V. V. Kocharovsky, Vl. V. Kocharovsky, S. V. Tarasov, The Hafnian Master Theorem, Linear Algebra Appl.651, 144–161 (2022)

    2022

  24. [24]

    V. V. Kocharovsky, Vl. V. Kocharovsky, S. V. Tarasov, Atomic boson sampling in a Bose–Einstein-condensed gas, Phys. Rev. A106, 063312 (2022)

    2022

  25. [25]

    Toda, PP is as hard as the polynomial-time hierarchy, SIAM J

    S. Toda, PP is as hard as the polynomial-time hierarchy, SIAM J. Comput. 20, 865–877 (1991)

    1991

  26. [26]

    Basu, A complex analog of Toda’s theorem, Found

    S. Basu, A complex analog of Toda’s theorem, Found. Comput. Math.12, 327–362 (2012)

    2012

  27. [27]

    V. V. Kocharovsky, K. Kalra, Wigner distribution sets a universal lower bound for quantum advantage, Entropy28, 188 (2026)

    2026

  28. [28]

    V. V. Kocharovsky and K. Kalra, The quantum-advantage resource in multimode OPA light: Identification, optimization, extraction, arXiv: 2606.18605v1 [quant-ph] 17 Jun 2026

    work page internal anchor Pith review Pith/arXiv arXiv 2026

  29. [29]

    Ben-Tal and A

    A. Ben-Tal and A. Nemirovski.Lectures on Modern Convex Optimization. MPS–SIAM Series on Optimization, 2001

    2001

  30. [30]

    D. N. Zubarev,Nonequilibrium Statistical Thermodynamics.Consultants Bureau, New York (1974)

    1974

  31. [31]

    S. V. Tarasov, Vl. V. Kocharovsky, V. V. Kocharovsky, Grand Canonical Versus Canonical Ensemble: Universal Structure of Statistics and Thermodynamics in a Critical Region of Bose–Einstein Condensation of an Ideal Gas in Arbitrary Trap, J. Stat. Phys.161, 942–964 (2015)

    2015

  32. [32]

    Williamson

    J. Williamson. On the algebraic problem concerning the normal forms of linear dynamical systems, American Journal of Mathematics58, 141–163, 1936

    1936

  33. [33]

    Lancaster and L

    P. Lancaster and L. Rodman.Algebraic Riccati Equations. Oxford University Press, 1995

    1995