pith. sign in

arxiv: 2602.10731 · v1 · pith:73SZ4RCPnew · submitted 2026-02-11 · 🪐 quant-ph

Error-Tolerant Quantum State Discrimination: Optimization and Quantum Circuit Synthesis

Chien-Kai Ma , Bo-Hung Chen , Tian-Fu Chen , Dah-Wei Chiou , Jie-Hong Roland Jiang This is my paper

Pith reviewed 2026-05-21 13:45 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum state discriminationerror toleranceconvex optimizationquantum circuit synthesisNaimark dilationminimum-error discriminationunambiguous discrimination
0
0 comments X

The pith

Error-tolerant quantum state discrimination maintains reliability under moderate noise via tunable bounds and distribution fitting.

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

The paper develops strategies for quantum state discrimination that continue to work reliably when moderate noise is present. CrossQSD generalizes unambiguous discrimination by allowing adjustable confidence bounds that balance accuracy against efficiency. FitQSD instead tunes the observed measurement probabilities to stay close to those expected in the ideal noiseless case. These ideas are combined in a single hybrid optimization that smoothly varies between minimum-error discrimination and the fitting objective. All resulting problems are solved as convex programs, then mapped to quantum circuits through a modified Naimark dilation that cuts the number of qubits and gates required.

Core claim

Error-tolerant QSD is achieved by formulating CrossQSD with tunable confidence bounds and FitQSD for outcome-distribution matching as convex programs, then synthesizing the resulting measurements into hardware-efficient circuits via modified Naimark dilation and isometry synthesis.

What carries the argument

CrossQSD and FitQSD frameworks, solved through convex optimization and realized on hardware by a modified Naimark dilation that produces compact isometries.

If this is right

  • Discrimination stays reliable when noise is only moderate.
  • Tunable parameters let users choose any accuracy-efficiency trade-off.
  • Hybrid objectives continuously connect minimum-error and fitting goals.
  • Circuit implementations use substantially fewer qubits and gates.

Where Pith is reading between the lines

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

  • The same optimization and synthesis steps could be applied to related tasks such as quantum hypothesis testing under noise.
  • Hardware experiments would show whether the predicted resource savings survive real-device calibration and control errors.

Load-bearing premise

Moderate noise levels still let the convex programs return useful solutions and the modified Naimark dilation actually cuts qubit and gate counts substantially.

What would settle it

A noise simulation or device run in which the optimized CrossQSD or FitQSD circuits show no gain in reliability or no reduction in resources compared with standard minimum-error discrimination.

Figures

Figures reproduced from arXiv: 2602.10731 by Bo-Hung Chen, Chien-Kai Ma, Dah-Wei Chiou, Jie-Hong Roland Jiang, Tian-Fu Chen.

Figure 1
Figure 1. Figure 1: CrossQSD: Error-to-success ratio Perr/Psucc vs. noise level λ. The predefined states are three coherent states truncated to three qubits; αi = βi = 0.01; λeval = 0.01 [PITH_FULL_IMAGE:figures/full_fig_p006_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FitQSD: Success probability Psucc (left) and L2 distance (right) vs. noise level λ. The predefined states are given by Eq. (9). The MOSEK solver precision is set to 10−9 . conventional approaches such as MED, UQSD, and their noise-aware generaliza￾tions. By jointly maximizing the success probability and minimizing the differ￾ence between the noisy and noiseless measurement outcomes—with a tunable parameter… view at source ↗
Figure 3
Figure 3. Figure 3: Hybrid-objective QSD with ℓ = 1 and the predefined states in Eq. (9): Success probability Psucc (left) and L2 distance (right) vs. noise level λ [PITH_FULL_IMAGE:figures/full_fig_p010_3.png] view at source ↗
Figure 4
Figure 4. Figure 4: Hybrid-objective QSD with ℓ = 1 and the predefined states in Eq. (11): Success probability Psucc (left) and L2 distance (right) vs. noise level λ. Let {Π1, Π2, . . . , Πk} be a POVM on a Hilbert space H, and let {P1, P2, . . . , Pk} be a rank-1 PVM on an extended Hilbert space H′ = H ⊗ HA, where HA is an ancillary system (dilation space). Naimark’s dilation theorem guarantees the existence of an isometry V… view at source ↗
Figure 5
Figure 5. Figure 5: Quantum circuit synthesis workflow for QSD. We demonstrate a simple example of circuit synthesis using our toolkit, with the performance results summarized in [PITH_FULL_IMAGE:figures/full_fig_p013_5.png] view at source ↗
Figure 6
Figure 6. Figure 6: Wigner functions of truncated coherent states represented with 3 to 6 qubits. The blue, green, and red dots correspond to the states |α⟩ with α = 1, ei 2π 3 , and e i 4π 3 , respectively. All figures are generated using QuTiP [22]. synthesized with build_circuit("ccd"). The resulting circuits are then resyn￾thesized into approximate forms using approx_circuit, which adopts the AQC optimization settings fro… view at source ↗
Figure 7
Figure 7. Figure 7: Experimental success probabilities for discriminating each six-qubit-truncated coherent states vs. noise level λ. Acknowledgments This work was supported in part by the National Science and Technology Council of Taiwan under grants 114-2119-M-002-020, the NTU Center of Data Intelli￾gence: Technologies, Applications, and Systems under grant NTU-114L900903, and the NTU Core Consortium Project NTU-CC114L89500… view at source ↗
Figure 8
Figure 8. Figure 8: Runtime benchmarks for Task I [PITH_FULL_IMAGE:figures/full_fig_p023_8.png] view at source ↗
Figure 9
Figure 9. Figure 9: Runtime benchmarks for Task II. 2 3 4 5 6 Number of qubits 10 0 10 1 10 2 R u ntim e (s) MED MED + FRIO CrossQSD FitQSD-minL1 FitQSD-minSS FitQSD-MECO Hybrid-objective [PITH_FULL_IMAGE:figures/full_fig_p024_9.png] view at source ↗
Figure 10
Figure 10. Figure 10: Runtime benchmarks for Task III [PITH_FULL_IMAGE:figures/full_fig_p024_10.png] view at source ↗
read the original abstract

We develop error-tolerant quantum state discrimination(QSD) strategies that maintain reliable performance under moderate noise. Two complementary approaches are proposed: CrossQSD, which generalizes unambiguous discrimination with tunable confidence bounds to balance accuracy and efficiency, and FitQSD, which optimizes the measurement outcome distribution to approximate that of the ideal noiseless case. Furthermore, we provide a unified hybrid-objective QSD framework that continuously interpolates between minimum-error discrimination (MED) and FitQSD, allowing flexible trade-offs among competing objectives. The associated optimization problems are formulated as convex programs and efficiently solved via disciplined convex programming or, in many cases, semidefinite programming. Additionally, a circuit synthesis framework based on a modified Naimark dilation and isometry synthesis enables hardware-efficient implementations with substantially reduced qubit and gate resources. An open-source toolkit automates the full optimization and synthesis workflow, providing a practical route to QSD on current quantum devices.

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 develops error-tolerant quantum state discrimination (QSD) strategies that maintain reliable performance under moderate noise. It proposes CrossQSD, which generalizes unambiguous discrimination with tunable confidence bounds to balance accuracy and efficiency, and FitQSD, which optimizes the measurement outcome distribution to approximate the ideal noiseless case. A unified hybrid-objective framework continuously interpolates between minimum-error discrimination and FitQSD. The associated optimization problems are formulated as convex programs solved via disciplined convex programming or semidefinite programming. A circuit synthesis framework based on modified Naimark dilation and isometry synthesis is introduced to enable hardware-efficient implementations with substantially reduced qubit and gate resources, accompanied by an open-source toolkit that automates the workflow.

Significance. If the quantitative error-tolerance and resource-reduction claims hold, the work provides practical, optimizable methods for implementing QSD on current noisy quantum hardware. Credit is due for casting the problems as convex programs (a sound and standard approach) and for releasing an open-source toolkit that supports reproducibility and automation of the full optimization-plus-synthesis pipeline. The hybrid interpolation framework is a useful contribution for flexible objective trade-offs.

major comments (2)
  1. [Circuit synthesis framework] Synthesis section (modified Naimark dilation and isometry synthesis): the central claim of substantially reduced qubit and gate resources is load-bearing for the hardware-facing contribution, yet the manuscript provides neither explicit before-and-after resource counts nor a proof that the modification remains an exact dilation of the target POVM or that any introduced approximation error is bounded independently of the noise level. Without these, it is unclear whether the synthesized circuits preserve the performance of the convex-optimized measurements under the stated moderate noise conditions.
  2. [FitQSD and hybrid-objective framework] FitQSD and hybrid framework sections: while the convex-program formulations are standard, the paper should supply explicit approximation-quality bounds or numerical validation showing that the optimized outcome distribution remains close to the noiseless case when moderate noise is present; the current description leaves the quantitative reliability of the error-tolerance claim under-specified.
minor comments (2)
  1. [Abstract] Abstract and introduction: the first use of the acronym QSD is parenthesized but the surrounding sentence would benefit from a brief parenthetical expansion for readers outside the immediate subfield.
  2. [CrossQSD formulation] Notation: the definition of the POVM elements and the precise form of the tunable confidence bounds in CrossQSD could be stated more explicitly with equation numbers on first appearance to improve readability.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the thorough review and constructive feedback on our manuscript. The comments identify areas where additional detail will improve rigor and clarity. We respond to each major comment below, indicating the specific revisions we will implement in the next version.

read point-by-point responses

  1. Referee: [Circuit synthesis framework] Synthesis section (modified Naimark dilation and isometry synthesis): the central claim of substantially reduced qubit and gate resources is load-bearing for the hardware-facing contribution, yet the manuscript provides neither explicit before-and-after resource counts nor a proof that the modification remains an exact dilation of the target POVM or that any introduced approximation error is bounded independently of the noise level. Without these, it is unclear whether the synthesized circuits preserve the performance of the convex-optimized measurements under the stated moderate noise conditions.

    Authors: We agree that explicit resource counts and a formal guarantee of exactness would strengthen the hardware contribution. In the revised manuscript we will add a dedicated subsection containing (i) a table of qubit and gate counts for representative QSD instances before and after the modified Naimark-plus-isometry synthesis, and (ii) a lemma establishing that the modified dilation realizes the target POVM exactly, with the only approximation error arising from the isometry synthesis tolerance and bounded independently of the discrimination noise level. These additions will be supported by the existing open-source toolkit. revision: yes

  2. Referee: [FitQSD and hybrid-objective framework] FitQSD and hybrid framework sections: while the convex-program formulations are standard, the paper should supply explicit approximation-quality bounds or numerical validation showing that the optimized outcome distribution remains close to the noiseless case when moderate noise is present; the current description leaves the quantitative reliability of the error-tolerance claim under-specified.

    Authors: We acknowledge that the quantitative reliability of FitQSD under noise could be made more explicit. In the revision we will insert (i) numerical experiments comparing the optimized outcome distributions to the ideal noiseless distributions for depolarizing noise strengths p = 0.01–0.05, and (ii) a simple total-variation-distance bound between the noisy and ideal distributions expressed in terms of the noise parameter. These results will be placed in the FitQSD section and will directly support the error-tolerance claims. revision: yes

Circularity Check

0 steps flagged

No significant circularity; derivation relies on standard convex optimization and established dilation techniques

full rationale

The paper formulates error-tolerant QSD as convex programs solved via disciplined convex programming or semidefinite programming, which are standard external methods not derived from the paper's own results. CrossQSD generalizes unambiguous discrimination with tunable bounds, FitQSD optimizes outcome distributions to match noiseless cases, and the hybrid framework interpolates between MED and FitQSD; these are presented as new formulations without self-definitional reductions or predictions that equal fitted inputs by construction. The circuit synthesis uses a modified Naimark dilation plus isometry synthesis to claim resource reduction, but this is introduced as a framework without equations showing equivalence to prior inputs or self-citation chains that bear the central load. The overall chain remains self-contained against external benchmarks like SDP solvers and Naimark's theorem.

Axiom & Free-Parameter Ledger

1 free parameters · 2 axioms · 0 invented entities

The work relies on standard assumptions from convex optimization and quantum information theory, with some tunable parameters for trade-offs but no major invented entities.

free parameters (1)
  • tunable confidence bounds
    Introduced in CrossQSD to balance accuracy and efficiency under noise.
axioms (2)
  • domain assumption Convex optimization problems can be efficiently solved using disciplined convex programming or semidefinite programming for the QSD objectives.
    Invoked for formulating and solving the optimization problems in the abstract.
  • domain assumption Modified Naimark dilation enables hardware-efficient isometry synthesis with reduced resources.
    Basis for the circuit synthesis framework.

pith-pipeline@v0.9.0 · 5698 in / 1372 out tokens · 41606 ms · 2026-05-21T13:45:45.373831+00:00 · methodology

discussion (0)

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

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

What do these tags mean?
matches
The paper's claim is directly supported by a theorem in the formal canon.
supports
The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends
The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses
The paper appears to rely on the theorem as machinery.
contradicts
The paper's claim conflicts with a theorem or certificate in the canon.
unclear
Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

26 extracted references · 26 canonical work pages · 2 internal anchors

  1. [1]

    Advances in neural information processing systems32(2019)

    Agrawal, A., Amos, B., Barratt, S., Boyd, S., Diamond, S., Kolter, J.Z.: Differ- entiable convex optimization layers. Advances in neural information processing systems32(2019)

    work page 2019

  2. [2]

    com/11.0/pythonapi/index.html

    ApS, M.: MOSEK Optimizer API for Python 11.0.29 (2025), https://docs.mosek. com/11.0/pythonapi/index.html

    work page 2025

  3. [3]

    Araujo, I.F., Araújo, I.C.S., da Silva, L.D., Blank, C., da Silva, A.J.: Quantum computing library (February 2023), https://github.com/qclib/qclib

    work page 2023

  4. [4]

    Physical Review A6(6), 2211 (1972)

    Arecchi, F.T., Courtens, E., Gilmore, R., Thomas, H.: Atomic coherent states in quantum optics. Physical Review A6(6), 2211 (1972)

    work page 1972

  5. [5]

    New Journal of Physics15(7), 073037 (2013)

    Bae, J.: Structure of minimum-error quantum state discrimination. New Journal of Physics15(7), 073037 (2013)

    work page 2013

  6. [6]

    Journal of Physics A: Mathematical and Theoretical48(8), 083001 (2015)

    Bae, J., Kwek, L.C.: Quantum state discrimination and its applications. Journal of Physics A: Mathematical and Theoretical48(8), 083001 (2015)

    work page 2015

  7. [7]

    Physical Review A—Atomic, Molecular, and Optical Physics86(4), 040303 (2012)

    Bagan, E., Muñoz-Tapia, R., Olivares-Rentería, G., Bergou, J.: Optimal discrim- ination of quantum states with a fixed rate of inconclusive outcomes. Physical Review A—Atomic, Molecular, and Optical Physics86(4), 040303 (2012)

    work page 2012

  8. [8]

    Advances in Optics and Photonics1(2), 238–278 (2009)

    Barnett, S.M., Croke, S.: Quantum state discrimination. Advances in Optics and Photonics1(2), 238–278 (2009)

    work page 2009

  9. [9]

    Theoretical Computer Science560, 7–11 (2014)

    Bennett, C.H., Brassard, G.: Quantum cryptography: Public key distribution and coin tossing. Theoretical Computer Science560, 7–11 (2014). https://doi.org/10. 1016/j.tcs.2014.05.025

    work page 2014

  10. [10]

    Journal of Modern Optics57(3), 160–180 (2010)

    Bergou, J.A.: Discrimination of quantum states. Journal of Modern Optics57(3), 160–180 (2010)

    work page 2010

  11. [11]

    Cambridge university press (2004)

    Boyd, S.P., Vandenberghe, L.: Convex optimization. Cambridge university press (2004)

    work page 2004

  12. [12]

    Contemporary Physics41(6), 401–424 (2000)

    Chefles, A.: Quantum state discrimination. Contemporary Physics41(6), 401–424 (2000)

    work page 2000

  13. [13]

    Physical Review Letters96(7) (2006)

    Croke, S., Andersson, E., Barnett, S.M., Gilson, C.R., Jeffers, J.: Maximum con- fidence quantum measurements. Physical Review Letters96(7) (2006). https: //doi.org/ARTN07040110.1103/PhysRevLett.96.070401

    work page arXiv 2006

  14. [14]

    IEEE Transactions on Information Theory49(2), 446–456 (2003)

    Eldar, Y.C.: A semidefinite programming approach to optimal unambiguous dis- crimination of quantum states. IEEE Transactions on Information Theory49(2), 446–456 (2003). https://doi.org/10.1109/TIT.2002.807291

    work page doi:10.1109/tit.2002.807291 2003

  15. [15]

    Wiley Online Library (2009)

    Gazeau, J.P.: Coherent states in quantum physics. Wiley Online Library (2009)

    work page 2009

  16. [16]

    In: Global optimiza- tion: From theory to implementation, pp

    Grant, M., Boyd, S., Ye, Y.: Disciplined convex programming. In: Global optimiza- tion: From theory to implementation, pp. 155–210. Springer (2006)

    work page 2006

  17. [17]

    Physical Review A—Atomic, Molecular, and Optical Physics86(3), 032314 (2012)

    Herzog, U.: Optimal state discrimination with a fixed rate of inconclusive results: Analytical solutions and relation to state discrimination with a fixed error rate. Physical Review A—Atomic, Molecular, and Optical Physics86(3), 032314 (2012)

    work page 2012

  18. [18]

    Physical Review A93(3), 032318 (2016)

    Iten, R., Colbeck, R., Kukuljan, I., Home, J., Christandl, M.: Quantum circuits for isometries. Physical Review A93(3), 032318 (2016). https://doi.org/10.1103/ PhysRevA.93.032318

    work page 2016

  19. [19]

    PRX Quantum5(3), 030315 (2024)

    Ivashkov, P., Uchehara, G., Jiang, L., Wang, D.S., Seif, A.: High-fidelity, mul- tiqubit generalized measurements with dynamic circuits. PRX Quantum5(3), 030315 (2024). https://doi.org/10.1103/PRXQuantum.5.030315

    work page doi:10.1103/prxquantum.5.030315 2024

  20. [20]

    Quantum Information Processing17(1) (2018)

    Ko, H., Choi, B.S., Choe, J.S., Youn, C.J.: Advanced unambiguous state dis- crimination attack and countermeasure strategy in a practical B92 QKD system. Quantum Information Processing17(1) (2018). https://doi.org/ARTN1710.1007/ s11128-017-1784-7 20 C.-K. Ma, B.-H. Chen, T.-F. Chen, D.-W. Chiou, J.-H. R. Jiang

    work page arXiv 2018

  21. [21]

    Kosut, R.L., Walmsley, I., Eldar, Y., Rabitz, H.: Quantum state detector de- sign: Optimal worst-case a posteriori performance (2004), https://arxiv.org/abs/ quant-ph/0403150

    work page internal anchor Pith review Pith/arXiv arXiv 2004

  22. [22]

    Lambert, N., Giguère, E., Menczel, P., Li, B., Hopf, P., Suárez, G., Gali, M., Lish- man,J.,Gadhvi,R.,Agarwal,R.,Galicia,A.,Shammah,N.,Nation,P.,Johansson, J.R., Ahmed, S., Cross, S., Pitchford, A., Nori, F.: QuTiP 5: The quantum toolbox in Python (2024), https://arxiv.org/abs/2412.04705

    work page internal anchor Pith review Pith/arXiv arXiv 2024

  23. [23]

    In: CR (Doklady) Acad

    Naımark, M.: On the representations of additive operator set functions. In: CR (Doklady) Acad. Sci. USSR. vol. 41, pp. 359–361 (1943)

    work page 1943

  24. [24]

    Physical Review A—Atomic, Molecular, and Optical Physics77(1), 012328 (2008)

    Qiu, D.: Minimum-error discrimination between mixed quantum states. Physical Review A—Atomic, Molecular, and Optical Physics77(1), 012328 (2008)

    work page 2008

  25. [25]

    Physical Review Letters92(5) (2004)

    Scarani, V., Acín, A., Ribordy, G., Gisin, N.: Quantum cryptography protocols robust against photon number splitting attacks for weak laser pulse implemen- tations. Physical Review Letters92(5) (2004). https://doi.org/ARTN05790110. 1103/PhysRevLett.92.057901

    work page 2004

  26. [26]

    SIAM review38(1), 49–95 (1996) A Proofs A.1 Proof of Theorem 1 Proof.For the given{ρ 1, ρ2,

    Vandenberghe, L., Boyd, S.: Semidefinite programming. SIAM review38(1), 49–95 (1996) A Proofs A.1 Proof of Theorem 1 Proof.For the given{ρ 1, ρ2, . . . , ρk}and{p 1, p2, . . . , pk}, letKandK + denote the collections of all feasible POVMs that satisfy the constraints of MED and MED+, respectively, regardless of optimality. For anyK≡ {Π1, Π2, . . . , Πk} ∈...

    work page 1996