Pith. Sign in

REVIEW

Programmable quantum state discriminators with simple programs

PaperPDF from arXiv

data files

ReviewThe objections and verdict, as JSON Paper breakdownThe authors' claims, conditions and measurements, as JSON Signed receiptProof this review has not been altered
X Bluesky LinkedIn Reddit Hacker News
Janos A. Bergou, Vladimir Buzek, Edgar Feldman, Ulrike Herzog, Mark Hillery

Quantum Physics · Submitted 20 Feb 2006 · 43 references

Pith's verdict: Solid new results on programmable state discriminators, but the 'universal optimality' claim in Sec. VII is average-case only and should be corrected before publication.

T0 · AI review

How this review was made: An AI referee (deepseek-v4-flash) read the paper on August 28, 2026 and answered a fixed list of questions about it. T0 is the starting level every paper gets. The levels describe how deeply Pith has checked the paper, never the authors.

  1. T0 AI review An AI read the paper and answered a fixed list of questions.
  2. T1 Audit Automatic checks that the references and files the paper relies on exist and match.
  3. T2 Compute The paper's code or calculations re-run with the same results.
  4. T3 Formal statement The claims written out in a formal math language a computer can read.
  5. T4 Proof Those claims proved, and the proof checked by computer.

How Pith checks papers →

· Ask about this paper · The compiled record · Read the full review →
Challenge this review Comment (0) Read on arXiv ↗
Cite ▾
arXiv IDquant-ph/0602164 (version 1)
Pith IDT2ZMU62Z, Pith's permanent record of this paper and its review
CitationEdgar Feldman, Janos A. Bergou, Mark Hillery, Ulrike Herzog, Vladimir Buzek. "Programmable quantum state discriminators with simple programs." arXiv:quant-ph/0602164 (2006). https://pith.science/paper/T2ZMU62Z
Cite this reviewBibTeX for Pith's review of this paper
Claim paper

Why Pith says this

Highlight any text to comment on it.

The paper

The paper claims

Analytic formulas give the optimal success and failure probabilities for programmable quantum state discriminators, covering minimum-error and unambiguous discrimination, with one or many data copies.

The reading

Quantum states are fragile: measuring them often disturbs them, and when two possible states overlap, you cannot always tell which one you have. There are two standard strategies. Minimum-error discrimination always gives an answer, but the answer is sometimes wrong; unambiguous discrimination never gives a wrong answer, but sometimes returns 'I don't know'. This paper studies machines that perform this identification when the states themselves are unknown in advance. The machine receives a few reference copies of the possible states, called the program, and one or more copies of the state to identify, called the data. It then decides which reference the data matches.

The authors treat two situations: both references unknown, and one reference known while the other is unknown. They derive the best possible success probabilities for both error strategies, first for one data copy and then for many data copies. A key assumption is that every unknown state is equally likely, so the machine is optimized to work well on average over all possibilities. The optimal measurement depends only on the structure of the problem, not on the particular unknown states, which is why the same machine works for any pair of states.

The results include explicit formulas for several scenarios, and the authors compare two ways of spending resources: extra data copies versus extra program copies. They claim extra data copies help more, although that comparison is not fully displayed in the paper. The work provides a quantitative language for the trade-off between flexibility and success probability: the more information about the states is carried by the program, the smaller the success probability, but the wider the range of states the device can handle.

Extended reading notes

Core claim

The paper derives exact optimal success and failure probabilities for programmable quantum state discriminators with simple 'quantum list' programs, for both minimum-error and unambiguous discrimination, covering both-states-unknown and one-known-one-unknown cases, for one and n copies of the data state. The authors state in Sec. VII: 'Neither the optimal detection operators nor the boundaries for their region of validity depend on the unknown states. Therefore, these devices are universal, they will perform optimally for any set of unknown states.' If correct, the formulas give the fundamental trade-off between flexibility and discrimination success.

Load-bearing premise

The uniform (Haar) prior over the unknown qubit states, used in Sec. II to average the inputs and obtain the mixed states ρ1 and ρ2 in Eqs. (2.4)-(2.5). If the program states are not uniformly distributed, the summarized mixed states and hence the derived optimal POVMs are not necessarily optimal; the universality claim in Sec. VII depends entirely on this averaging. The paper states the averaging explicitly but does not test sensitivity to other priors.

Original abstract

We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as input, or program, for the two program registers, and the data state, which is guaranteed to be prepared in one of the program states, is fed into the data register of the device. This device will then tell us, in an optimal way, which of the templates stored in the program registers the data state matches. In the second case, we know one of the states while the other is unknown. One copy of the unknown state is fed into the single program register, and the data state which is guaranteed to be prepared in either the program state or the known state, is fed into the data register. The device will then tell us, again optimally, whether the data state matches the template or is the known state. We determine two types of optimal devices. The first performs discrimination with minimum error, the second performs optimal unambiguous discrimination. In all cases we first treat the simpler problem of only one copy of the data state and then generalize the treatment to n copies. In comparison to other works we find that providing n > 1 copies of the data state yields higher success probabilities than providing n > 1 copies of the program states.

The compiled record

The paper's own sentences, arranged, kept beside the review and separate from it. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 8,084 input tokens.

What the abstract itself states, as probabilities: claims first 0.04 · states limitation 0.18 · human participants 0.01 · controlled comparison 0.19 · randomized assignment 0.01 · states quantitative result 0.15 · compares with prior results 0.91 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. In the first, both states are unknown. One copy of each of the unknown states is provided as input, or program, for the two program registers, and the data state, which is guaranteed to be prepared in one of the program states, is fed into the data register of the device. This device will then tell us, in an optimal way, which of the templates stored in the program registers the data state matches. In the second case, we know one of the states while the other is unknown. One copy of the unknown state is fed into the single program register, and the data state which is guaranteed to be prepared in either the program state or the known state, is fed into the data register. The device will then tell us, again optimally, whether the data state matches the template or is the known state. We determine two types of optimal devices. The first performs discrimination with minimum error, the second performs optimal unambiguous discrimination. In all cases we first treat the simpler problem of only one copy of the data state and then generalize the treatment to n copies. In comparison to other works we find that providing n > 1 copies of the data state yields higher success probabilities than providing n > 1 copies of the program states.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 We describe a class of programmable devices that can discriminate between two quantum states. We consider two cases. contribution 0.97 0.84 0.03 asserted 0.94
s1 In the first, both states are unknown. method 0.45 0.21 0.02 asserted 0.89
s2 One copy of each of the unknown states is provided as input, or program, for the two program registers, and the data state, which is guaranteed to be prepared in one of the program states, is fed into the data register of the device. method 0.95 0.43 0.04 asserted 0.97
s3 This device will then tell us, in an optimal way, which of the templates stored in the program registers the data state matches. method 0.57 0.55 0.08 asserted 0.99
s4 In the second case, we know one of the states while the other is unknown. contribution 0.40 0.32 0.02 asserted 0.97
s5 One copy of the unknown state is fed into the single program register, and the data state which is guaranteed to be prepared in either the program state or the known state, is fed into the data register. method 0.96 0.50 0.04 asserted 0.97
s6 The device will then tell us, again optimally, whether the data state matches the template or is the known state. method 0.68 0.75 0.07 asserted 1.00
s7 We determine two types of optimal devices. contribution 0.91 0.91 0.05 asserted 0.99
s8 The first performs discrimination with minimum error, the second performs optimal unambiguous discrimination. contribution 0.77 0.90 0.09 asserted 1.00
s9 In all cases we first treat the simpler problem of only one copy of the data state and then generalize the treatment to n copies. method 0.97 0.90 0.09 asserted 0.98
s10 In comparison to other works we find that providing n > 1 copies of the data state yields higher success probabilities than providing n > 1 copies of the program states. result 0.99 0.92 0.51 asserted 1.00

What kind of paper the classifier reports this is: theoretical result 0.64 · evidence from proof or derivation 1.00.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

Figures
Figure 1. FIG. 1: Comparison of the optimum performances of the er
Figure 2. FIG. 2: Failure and error probabilities for the various stra
Figure 3. FIG. 3: Comparison of the optimum performances of the
Figure 4. FIG. 4: The difference between the upper curve and the lower

Figures reproduced from arXiv:quant-ph/0602164 by the authors.

Human review

How Pith checks papers → · Full audit of this paper →

References

Discussion

Disagree with the review, or know something it missed? Leave a comment, highlight any passage above to comment on it, or challenge this review formally.