pith. sign in

arxiv: 2504.16246 · v4 · pith:YDUCDOWYnew · submitted 2025-04-22 · 🧮 math.NA · cs.NA· quant-ph

Projection Coefficients Estimation in Continuous-Variable Quantum Circuits

M. W. AlMasri This is my paper

Pith reviewed 2026-05-22 18:02 UTC · model grok-4.3

classification 🧮 math.NA cs.NAquant-ph
keywords continuous-variable quantum circuitsprojection coefficientsSegal-Bargmann spaceholomorphic functionsphoton-number detectionquantum state preparationquantum algorithmsnumerical analysis
0
0 comments X

The pith

Continuous-variable quantum circuits prepare states for holomorphic functions and extract their projection coefficients via photon-number detection.

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

The paper proposes a continuous-variable quantum algorithm to compute projection coefficients of holomorphic functions in the Segal-Bargmann space. It exploits the isometric correspondence to single-mode quantum states by preparing a circuit-based state |f> associated with the function f(z). Coefficients c_n are then obtained directly from photon-number-resolved measurements, with interferometric phase referencing to recover complex values. The protocol includes oracle constructions for different function classes and noise analysis, offering a quantum-native alternative to classical numerical methods for function characterization and non-Gaussian state analysis.

Core claim

By leveraging the isometric correspondence between holomorphic functions in the Segal-Bargmann space and single-mode quantum states, continuous-variable quantum circuits prepare the state |f> and extract coefficients c_n = <n|f> via photon-number-resolved detection enhanced by interferometric phase referencing, enabling direct quantum estimation and visualization of the coefficient sequence for various functional classes.

What carries the argument

The state-preparation oracle for holomorphic functions in the Segal-Bargmann space, which encodes the function as a quantum state |f> for subsequent extraction of coefficients through photon-number-resolved detection and phase referencing.

If this is right

  • Direct access to the full sequence of complex projection coefficients without classical quadrature.
  • Applicability across multiple classes of holomorphic functions via tailored oracles.
  • Built-in robustness checks against realistic noise sources like inefficient detectors.
  • A hardware-native route to visualize coefficient sequences for non-Gaussian state characterization.

Where Pith is reading between the lines

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

  • If oracle construction extends efficiently to higher-degree or more complex functions, the method could reduce computational cost for coefficient extraction in high-dimensional cases.
  • Multi-mode generalizations might handle multivariate holomorphic functions by extending the single-mode isometric mapping.
  • Integration with existing quantum oracles could allow coefficient analysis for functions defined directly by quantum algorithms.

Load-bearing premise

An efficient state-preparation oracle can be built for the considered functional classes while keeping the protocol stable under detector inefficiency and preparation errors.

What would settle it

Running the protocol on a known holomorphic function such as a low-degree polynomial, comparing the extracted coefficients to exact classical values, and checking agreement within bounds under simulated detector inefficiency and preparation noise.

Figures

Figures reproduced from arXiv: 2504.16246 by M. W. AlMasri.

Figure 1
Figure 1. Figure 1: FIG. 1: The projection coefficients [PITH_FULL_IMAGE:figures/full_fig_p003_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: Comparison of Maclaurin Coefficients and [PITH_FULL_IMAGE:figures/full_fig_p004_2.png] view at source ↗
Figure 3
Figure 3. Figure 3: FIG. 3: The imaginary and real parts of projection [PITH_FULL_IMAGE:figures/full_fig_p004_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: FIG. 4: The magnitudes of the projection coefficients [PITH_FULL_IMAGE:figures/full_fig_p005_4.png] view at source ↗
Figure 5
Figure 5. Figure 5: FIG. 5: The decay of [PITH_FULL_IMAGE:figures/full_fig_p006_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: FIG. 6: Interferometric circuit for phase-sensitive [PITH_FULL_IMAGE:figures/full_fig_p007_6.png] view at source ↗
Figure 7
Figure 7. Figure 7: FIG. 7: Magnitude of the projection coefficients [PITH_FULL_IMAGE:figures/full_fig_p007_7.png] view at source ↗
read the original abstract

In this work, we propose a continuous-variable quantum algorithm to compute the projection coefficients of a holomorphic function in the Segal--Bargmann space by leveraging its isometric correspondence with single-mode quantum states. Using CV quantum circuits, we prepare the state $\ket{f}$ associated with $f(z)$ and extract the coefficients $c_n = \braket{n}{f}$ via photon-number-resolved detection, enhanced by interferometric phase referencing to recover full complex amplitudes. We detail the construction of the state-preparation oracle for various functional classes and analyze the protocol's robustness under realistic noise models, including detector inefficiency and state preparation errors. This enables direct quantum estimation and visualization of the coefficient sequence -- offering a hardware-native protocol for characterizing non-Gaussian states and analyzing functions defined by quantum oracles, complementary to classical numerical integration.

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

2 major / 2 minor

Summary. The manuscript proposes a continuous-variable quantum protocol to estimate the projection coefficients c_n = <n|f> of a holomorphic function f(z) in the Segal-Bargmann space. It uses CV circuits to prepare the associated state |f> = sum c_n |n> and extracts the coefficients via photon-number-resolved detection augmented by interferometric phase referencing. The authors outline state-preparation oracles for specific functional classes (polynomials, exponentials) and analyze robustness to noise models including detector inefficiency and preparation errors, positioning the method as a hardware-native alternative to classical numerical integration for function characterization and non-Gaussian state analysis.

Significance. If the central claims hold, the work offers a direct quantum estimation route for coefficient sequences that could complement classical methods in CV hardware settings, particularly for oracle-defined functions. The inclusion of noise robustness analysis is a constructive element, though the absence of explicit derivations, error bounds, or benchmarks in the provided description limits immediate assessment of practical utility or advantage over existing techniques.

major comments (2)
  1. [§3] §3 (State Preparation Oracle): The constructions for functional classes are described at a high level without explicit circuit decompositions, parameter settings in terms of oracle queries, or query-complexity bounds showing independence from truncation order N. This leaves the central claim that the protocol avoids classical pre-computation of coefficients unsubstantiated and requires concrete gate sequences or pseudocode to verify.
  2. [§5] §5 (Noise Analysis): The robustness discussion under detector inefficiency and state-preparation errors remains qualitative; no quantitative error bounds, fidelity estimates, or numerical simulations for coefficient recovery accuracy are supplied, which is load-bearing for the claim of practical viability.
minor comments (2)
  1. Figure captions and circuit diagrams (if present) should explicitly label the interferometric phase-referencing components and photon-number resolution steps for clarity.
  2. [Introduction] Notation for the Segal-Bargmann space inner product and the mapping to Fock states should be introduced with a brief reminder equation in the introduction for readers outside quantum optics.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for their thoughtful and constructive comments on our manuscript. We address each major comment point by point below, providing clarifications and indicating the revisions we will make to strengthen the presentation of the state-preparation oracles and the noise analysis.

read point-by-point responses

  1. Referee: [§3] §3 (State Preparation Oracle): The constructions for functional classes are described at a high level without explicit circuit decompositions, parameter settings in terms of oracle queries, or query-complexity bounds showing independence from truncation order N. This leaves the central claim that the protocol avoids classical pre-computation of coefficients unsubstantiated and requires concrete gate sequences or pseudocode to verify.

    Authors: We agree that the original description of the state-preparation oracles in Section 3 was at a high level. In the revised manuscript we will add explicit circuit decompositions for the polynomial and exponential functional classes, including concrete gate sequences, parameter settings expressed in terms of oracle queries, and pseudocode. We will also derive and present query-complexity bounds demonstrating that, for these structured holomorphic functions, the number of oracle calls remains independent of the truncation order N because the preparation exploits the analytic properties directly rather than computing coefficients classically. revision: yes

  2. Referee: [§5] §5 (Noise Analysis): The robustness discussion under detector inefficiency and state-preparation errors remains qualitative; no quantitative error bounds, fidelity estimates, or numerical simulations for coefficient recovery accuracy are supplied, which is load-bearing for the claim of practical viability.

    Authors: We acknowledge that the noise-robustness analysis in the original submission was primarily qualitative. In the revised version we will supply quantitative error bounds for coefficient estimation under detector inefficiency and preparation errors, together with fidelity estimates for the recovered complex amplitudes. We will also include numerical simulations that quantify the accuracy of coefficient recovery across a range of noise strengths; these results will be presented in the updated Section 5 to substantiate the practical viability claim. revision: yes

Circularity Check

0 steps flagged

No significant circularity; protocol builds on standard CV mappings without reducing estimation to self-defined inputs.

full rationale

The derivation relies on isometric correspondence between holomorphic functions and single-mode states, with explicit constructions for state-preparation oracles detailed for specific classes (polynomials, exponentials). These constructions are presented as using oracle queries plus CV gates, independent of the coefficient extraction step. No equations reduce the claimed quantum estimation to a fitted parameter or prior self-citation that bears the central load. The protocol's robustness analysis under noise is separate from the core claim. This aligns with the default expectation that most papers exhibit no circularity when the central method remains self-contained against external quantum optics primitives.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the standard isometric correspondence between holomorphic functions and single-mode quantum states plus the feasibility of constructing state-preparation oracles; these are domain assumptions rather than new free parameters or invented entities.

axioms (2)
  • domain assumption There exists an isometric correspondence between holomorphic functions in the Segal-Bargmann space and single-mode quantum states.
    Invoked to associate the function f(z) with the quantum state |f>.
  • domain assumption State-preparation oracles can be constructed for the functional classes of interest.
    Required to prepare |f> on the CV circuit as described.

pith-pipeline@v0.9.0 · 5662 in / 1371 out tokens · 58711 ms · 2026-05-22T18:02:54.894023+00:00 · methodology

discussion (0)

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

Reference graph

Works this paper leans on

33 extracted references · 33 canonical work pages

  1. [1]

    Initialize an empty list to store the projection co- efficients:coefficients= [ ]

    work page

  2. [2]

    , N: FIG

    For eachn= 0,1, . . . , N: FIG. 1: The projection coefficientsc n withn∈ {0,10} for the functionf(z) =e z. (a) Compute the norm-squared ofz n in the Segal– Bargmann spaceH SB: ∥zn∥2 =πn! (b) Generate a polar grid in the complex plane: - Radial coordinate:r∈[0,radius], dis- cretized intonum points. - Angular coordinate:θ∈[0,2π], discretized intonum points....

    work page

  3. [3]

    Return the list of projection coefficients c0, c1, . . . , cN. For illustration purposes, Let us consider the ele- mentary functions such as the exponential function f(z) =e z. The projection coefficients are plotted in 4 nRe(c n) Im(c n)|c n| 0 0.99999989 0.00000000 0.99999989 1 0.99999809 0.00000000 0.99999809 2 0.49999184 0.00000000 0.49999184 3 0.1666...

    work page

  4. [4]

    Prepare|f⟩via ˆUf |0⟩

    work page

  5. [5]

    Perform photon-number-resolving detection (PNRD) on the mode 1

    work page

  6. [6]

    7 n k|0,0⟩ ˆUBS(π/4) ˆUf ˆD(α) FIG

    RepeatMtimes to estimate the probability distri- bution pn =| ⟨n|f⟩ | 2 = |cn|2 N .(40) 1 PNRD is a measurement that projects the state onto the Fock basis, yielding outcomenwith probabilityp n =| ⟨n|ψ⟩ | 2.In real experiments, PNRD devices (e.g., transition-edge sensors, multi- plexed SNSPDs) are non-ideal: finite efficiencyη <1→detected distribution is ...

    work page

  7. [7]

    Ahlfors,Complex Analysis, McGraw-Hill Education; 3rd edition (January 1, 1979)

    L. Ahlfors,Complex Analysis, McGraw-Hill Education; 3rd edition (January 1, 1979)

    work page 1979

  8. [8]

    M. J. Ablowitz and A. S. Fokas,Complex Variables: In- troduction and Applications, 2nd edition, Cambridge Uni- versity Press (2003)

    work page 2003

  9. [9]

    I. E. Segal,Mathematical problems of relativistic physics, in Kac, M. (ed.), Proceedings of the Summer Seminar, Boulder, Colorado, 1960, Vol. II, Lectures in Applied Mathematics, American Mathematical Society (1963)

    work page 1960

  10. [10]

    Bargmann,On a Hilbert space of analytic functions and an associated integral transform part I, Commun

    V. Bargmann,On a Hilbert space of analytic functions and an associated integral transform part I, Commun. Pure. Appl. Math.14(3): 187 (1961)

    work page 1961

  11. [11]

    B. C. Hall,Holomorphic Methods in Analysis and Math- ematical Physics, Contemporary Mathematics, Volume 260, pp. 1-59 (2000)

    work page 2000

  12. [12]

    Perelomov,Generalized Coherent States and Their Applications, Springer Berlin, Heidelberg (1986)

    A. Perelomov,Generalized Coherent States and Their Applications, Springer Berlin, Heidelberg (1986)

    work page 1986

  13. [13]

    Stenholm,A Bargmann representation solution of the Jaynes—Cummings model, Opt

    S. Stenholm,A Bargmann representation solution of the Jaynes—Cummings model, Opt. Commun.36, Pages 75- 78 (1981)

    work page 1981

  14. [14]

    Vourdas, R

    A. Vourdas, R. F. Bishop,Thermal coherent states in the Bargmann representation, Phys. Rev. A50, 3331 (1994)

    work page 1994

  15. [15]

    M. W. AlMasri and M. R. B. Wahiddin,Bargmann representation of quantum absorption refrigerators, Rep. Math. Phys.89(2), Pages 185-198 (2022)

    work page 2022

  16. [16]

    M. W. AlMasri, M. R. B. Wahiddin,Quantum Decom- position Algorithm For Master Equations of Stochastic Processes: The Damped Spin Case, Mod. Phys. Lett. A, 37(32), 2250216 (2022)

    work page 2022

  17. [17]

    M. W. AlMasri, M. R. B. Wahiddin,Integral Trans- forms and PT-symmetric Hamiltonians, Chinese Journal of Physics, Volume85, Pages 127-134 (2023)

    work page 2023

  18. [18]

    M. W. AlMasri,Multi-Valued Quantum Neurons, Int.J. Theor.Phys63, 39 (2024)

    work page 2024

  19. [19]

    M. W. AlMasri,On Logic Gates with Complex Num- bers, International Journal of Parallel, Emergent and Dis- tributed Systems39(6), Pages 682-695 (2024)

    work page 2024

  20. [20]

    Shayegani, K.V

    F. Shayegani, K.V. Samani, M. Abdi, M.W. AlMasri, Dephasing dynamics of a central spin interacting with a classical Ising spin bath, Physics Letters A526, 129966 (2024)

    work page 2024

  21. [21]

    S. D. Bartlett, B. C. Sanders, S. L. Braunstein, K. Nemoto,Efficient Classical Simulation of Continuous Variable Quantum Information Processes, Phys. Rev. Lett.,88, 097904 (2002)

    work page 2002

  22. [22]

    S. L. Braunstein and P. van Loock,Quantum informa- tion with continuous variables, Rev. Mod. Phys.77, 513 (2005)

    work page 2005

  23. [23]

    N. C. Menicucci, P. van Loock, M. Gu, C. Weedbrook, T. C. Ralph, and M. A. Nielsen,Universal Quantum Com- putation with Continuous-Variable Cluster States, Phys. Rev. Lett.97, 110501 (2006)

    work page 2006

  24. [24]

    Adesso and F

    G. Adesso and F. Illuminati,Entanglement in continuous-variable systems: recent advances and current perspectives, J. Phys. A: Math. Theor.40, 7821 (2007). 9

    work page 2007

  25. [25]

    M. Gu, C. Weedbrook, N. C. Menicucci, T. C. Ralph, and P. van Loock,Quantum computing with continuous- variable clusters, Phys. Rev. A79, 062318 (2009)

    work page 2009

  26. [26]

    Virtanenet al., SciPy 1.0 Contributors,Nat

    P. Virtanenet al., SciPy 1.0 Contributors,Nat. Methods 17, 261 (2020)

    work page 2020

  27. [27]

    Killoran, T

    N. Killoran, T. R. Bromley, J. M. Arrazola, M. Schuld, N. Quesada, and S. LloydContinuous-variable quantum neural networks, Phys. Rev. Res.1, 033063 (2019)

    work page 2019

  28. [28]

    A. I. Lvovsky, H. Hansen, T. Aichele, O. Benson, J. Mlynek, S. Schiller,Quantum state reconstruction of the single-photon Fock state, Phys. Rev. Lett.87, 050402 (2001)

    work page 2001

  29. [29]

    Zavatta, S

    A. Zavatta, S. Viciani and M. Bellini,Tomographic re- construction of the single-photon Fock state by high- frequency homodyne detection, Phys. Rev. A70, 053821 (2004)

    work page 2004

  30. [30]

    Hadfield,Single-photon detectors for optical quan- tum information applications

    R. Hadfield,Single-photon detectors for optical quan- tum information applications. Nature Photon3, 696–705 (2009)

    work page 2009

  31. [31]

    Sul’din,Wiener measure and its applications to approximation methods

    A.V. Sul’din,Wiener measure and its applications to approximation methods. I.Izv. Vyssh. Uchebn. Zaved. Mat., 1959, no. 6, 145–158

    work page 1959

  32. [32]

    Sul’din,Wiener measure and its applications to approximation methods

    A.V. Sul’din,Wiener measure and its applications to approximation methods. II., Izv. Vyssh. Uchebn. Zaved. Mat., 1960, no. 5, 165–179

    work page 1960

  33. [33]

    Larkin,Gaussian measure in Hilbert space and applications in numerical analysis, Rocky Mountain J

    F.M. Larkin,Gaussian measure in Hilbert space and applications in numerical analysis, Rocky Mountain J. Math. 2(3): 379-422 (1972)

    work page 1972