Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2407.05392

Multiple-shot labeling of quantum observables

Seyed Arash Ghoreishi, Nidhin Sudarsanan Ragini, Sazim, Sk, Mário Ziman

Published Jul 7, 2024• 2 citations
arXivHTMLPDF

Abstract

Quantum labeling tasks ask one to recover the missing associations between classical outcome labels and the effects forming the POVM. We study labeling in the multiple-shot regime, allowing a finite number of uses of the device and the most general tester-based strategies, including adaptivity. For binary observables, we show that if perfect labeling is impossible in a single shot, then it remains impossible with any finite number of shots. In particular, we derive the formula for minimum-error performance and highlight its ``even-odd" behavior. For non-binary observables, we derive the optimal single-shot minimum-error success probability in closed form, and show that entanglement assistance does not improve this optimum. We also provide finite-shot schemes for (perfect or partial) labeling and give illustrative examples, including the qubit trine POVM where the optimal two-shot success probability is computed explicitly.

DOI
10.48550/arxiv.2407.05392

Related papers

Multiple-shot and unambiguous discrimination of von Neumann measurements

Zbigniew Puchała, Łukasz Pawela, Aleksandra Krawiec +2 more

We present an in-depth study of the problem of multiple-shot discrimination of von Neumann measurements in finite-dimensional Hilbert spaces. Specifically, we consider two scenarios: minimum error and unambiguous discrimination. In the case of minimum error discrimination, we focus on discrimination of measurements with the assistance of entanglement. We provide an alternative proof of the fact that all pairs of distinct von Neumann measurements can be distinguished perfectly (i.e. with the unit success probability) using only a finite number of queries. Moreover, we analytically find the minimal number of queries needed for perfect discrimination. We also show that in this scenario querying the measurements in parallel gives the optimal strategy, and hence any possible adaptive methods do not offer any advantage over the parallel scheme. In the unambiguous discrimination scenario, we give the general expressions for the optimal discrimination probabilities with and without the assistance of entanglement. Finally, we show that typical pairs of Haar-random von Neumann measurements can be perfectly distinguished with only two queries.

arXiv:1810.05122•Quantum•Apr 6, 2021•20 citations

Multiple Quantum Hypothesis Testing: One-Shot Pairwise Bounds and Sharp Asymptotics

Hao-Chung Cheng, Po-Chieh Liu

We consider Bayesian discrimination among multiple quantum states and establish a dimension-free one-shot upper bound on the minimum probability of error in terms of the sum of pairwise errors. This resolves a conjecture of Audenaert and Mosonyi [J. Math. Phys. 55 (2014)] and improves the multiple quantum Chernoff bound of Li [Ann. Statist. 44 (2016)] by removing its dimension-dependent prefactor. In the asymptotic many-copy regime, our bound proves the achievability of the multiple quantum Chernoff distance for arbitrary separable Hilbert spaces, thereby settling the previously open infinite-dimensional case, and further yields constant-factor sharp asymptotics for the optimal error probability. In binary quantum hypothesis testing, we prove that the minimum error probability is characterized, up to universal constants, by a trace harmonic-mean quantity. Consequently, the optimal binary quantum error probability is within a factor of two of the optimal classical error probability for the associated Nussbaum-Szkoła distributions, complementing the lower bound of Nussbaum and Szkoła [Ann. Statist. 37 (2009)].

quant-pharXiv:2606.06246•Jun 5, 2026•5 citations

Single-shot labeling of quantum observables

Nidhin Sudarsanan Ragini, Mário Ziman

We identify and study a particular class of distinguishability problems for quantum observables (positive-operator-valued measures), in which observables with permuted effects are involved, which we call the labeling problem. Consequently, we identify binary observables, which can be labeled perfectly. In this work, we study these problems in the single-shot regime.

arXiv:2407.05351•Physical Review A•May 9, 2024•3 citations

Finite-classical-record quantum state reconstruction: one-shot bounds and acquisition limits

Wahyu Rahmaniar

Abstract We study the one-shot reconstruction of a quantum state when a single copy of the source is measured, the outcome is stored in a classical record of fixed finite dimension, and a state is prepared at the destination from the record. This acquisition-limited problem is distinguished from a visible benchmark in which the source label is available to the encoder. For a finite ensemble we derive finite-record bounds on the visible distortion in terms of the cumulative prior mass covered by the record and the optimal discrimination probability, identify the regimes in which they are exact, and solve the two-state visible problem at every record dimension. For pure-state ensembles, exact acquisition-limited reconstruction is possible if and only if the states are perfectly distinguishable, so nonorthogonal targets retain a positive error at every record dimension. For two equiprobable nonorthogonal pure states we derive the optimal trace-distance distortion within the reflection-symmetric two-outcome class in closed variational form and find that unrestricted numerical optimization with up to six outcomes attains the same value; the resulting symmetric value lies strictly below the guess-and-prepare, unambiguous-discrimination, fidelity-optimal, and Haar-random strategies and is realized by one classical bit and one feed-forward rotation. Every classical-record reconstruction is shown to be entanglement breaking, with a quantitative bound on the loss of entanglement with an inaccessible reference, and the record dimension is related to the spectral rank of an energy-constrained memory. These results quantify the separation between a finite classical description and the information obtainable from a single quantum system. MSC Classification: 81P15 , 81P17 , 81P45 , 81P47

•Sep 24, 2026•0 citations

Optimal entanglement-assisted one-shot classical communication

Brett Hemenway, Carl A. Miller, Yaoyun Shi +1 more

The one-shot success probability of a noisy classical channel for transmitting one classical bit is the optimal probability with which the bit can be successfully sent via a single use of the channel. Prevedel et al. [Phys. Rev. Lett. 106, 110505 (2011)] recently showed that for a specific channel, this quantity can be increased if the parties using the channel share an entangled quantum state. In this paper, we characterize the optimal entanglement-assisted protocols in terms of the radius of a set of operators associated with the channel. This characterization can be used to construct optimal entanglement-assisted protocols for a given classical channel and to prove the limits of such protocols. As an example, we show that the Prevedel et al. protocol is optimal for two-qubit entanglement. We also prove some tight upper bounds on the improvement that can be obtained from quantum and nonsignaling correlations.

arXiv:1201.1521•Physical Review A•Jun 3, 2013•5 citations

Qubit-Wise Majority Vote: Maximum Likelihood Quantum Error Mitigation for Algorithms with a Single Correct Output

Dror Baron, Hrushikesh Pramod Patil, Huiyang Zhou

Quantum error mitigation is an important technique to reduce the impact of noise in quantum computers. With more and more qubits being supported on quantum computers, there are two emerging fundamental challenges. First, the number of shots required for quantum algorithms with large numbers of qubits needs to increase in order to obtain a meaningful distribution or expected value of an observable. Second, although steady progress has been made in improving the fidelity of each qubit, circuits with a large number of qubits are likely to produce erroneous results. This low-shot, high-noise regime calls for highly scalable error mitigation techniques. In this paper, we propose a simple and effective mitigation scheme, qubit-wise majority vote, for quantum algorithms with a single correct output. We show that our scheme produces the maximum likelihood (ML) estimate under certain assumptions and bound the number of shots required. Our experimental results on real quantum devices confirm that our proposed approach requires fewer shots than existing ones, and can sometimes recover the correct answers even when they are not observed from the measurement results.

arXiv:2402.11830•IEEE International Conference on Quantum Computing and Engineering (QCE)•Sep 15, 2024•5 citations
Quantum labeling tasks ask one to recover the missing associations between classical outcome labels and the effects forming the POVM. We study labeling in the multiple-shot regime, allowing a finite number of uses of the device and the most general tester-based strategies, including adaptivity. For binary observables, we show that if perfect labeling is impossible in a single shot, then it remains impossible with any finite number of shots. In particular, we derive the formula for minimum-error performance and highlight its ``even-odd" behavior. For non-binary observables, we derive the optimal single-shot minimum-error success probability in closed form, and show that entanglement assistance does not improve this optimum. We also provide finite-shot schemes for (perfect or partial) labeling and give illustrative examples, including the qubit trine POVM where the optimal two-shot success probability is computed explicitly.
We present an in-depth study of the problem of multiple-shot discrimination of von Neumann measurements in finite-dimensional Hilbert spaces. Specifically, we consider two scenarios: minimum error and unambiguous discrimination. In the case of minimum error discrimination, we focus on discrimination of measurements with the assistance of entanglement. We provide an alternative proof of the fact that all pairs of distinct von Neumann measurements can be distinguished perfectly (i.e. with the unit success probability) using only a finite number of queries. Moreover, we analytically find the minimal number of queries needed for perfect discrimination. We also show that in this scenario querying the measurements in parallel gives the optimal strategy, and hence any possible adaptive methods do not offer any advantage over the parallel scheme. In the unambiguous discrimination scenario, we give the general expressions for the optimal discrimination probabilities with and without the assistance of entanglement. Finally, we show that typical pairs of Haar-random von Neumann measurements can be perfectly distinguished with only two queries.
We consider Bayesian discrimination among multiple quantum states and establish a dimension-free one-shot upper bound on the minimum probability of error in terms of the sum of pairwise errors. This resolves a conjecture of Audenaert and Mosonyi [J. Math. Phys. 55 (2014)] and improves the multiple quantum Chernoff bound of Li [Ann. Statist. 44 (2016)] by removing its dimension-dependent prefactor. In the asymptotic many-copy regime, our bound proves the achievability of the multiple quantum Chernoff distance for arbitrary separable Hilbert spaces, thereby settling the previously open infinite-dimensional case, and further yields constant-factor sharp asymptotics for the optimal error probability. In binary quantum hypothesis testing, we prove that the minimum error probability is characterized, up to universal constants, by a trace harmonic-mean quantity. Consequently, the optimal binary quantum error probability is within a factor of two of the optimal classical error probability for the associated Nussbaum-Szkoła distributions, complementing the lower bound of Nussbaum and Szkoła [Ann. Statist. 37 (2009)].
Abstract We study the one-shot reconstruction of a quantum state when a single copy of the source is measured, the outcome is stored in a classical record of fixed finite dimension, and a state is prepared at the destination from the record. This acquisition-limited problem is distinguished from a visible benchmark in which the source label is available to the encoder. For a finite ensemble we derive finite-record bounds on the visible distortion in terms of the cumulative prior mass covered by the record and the optimal discrimination probability, identify the regimes in which they are exact, and solve the two-state visible problem at every record dimension. For pure-state ensembles, exact acquisition-limited reconstruction is possible if and only if the states are perfectly distinguishable, so nonorthogonal targets retain a positive error at every record dimension. For two equiprobable nonorthogonal pure states we derive the optimal trace-distance distortion within the reflection-symmetric two-outcome class in closed variational form and find that unrestricted numerical optimization with up to six outcomes attains the same value; the resulting symmetric value lies strictly below the guess-and-prepare, unambiguous-discrimination, fidelity-optimal, and Haar-random strategies and is realized by one classical bit and one feed-forward rotation. Every classical-record reconstruction is shown to be entanglement breaking, with a quantitative bound on the loss of entanglement with an inaccessible reference, and the record dimension is related to the spectral rank of an energy-constrained memory. These results quantify the separation between a finite classical description and the information obtainable from a single quantum system. MSC Classification: 81P15 , 81P17 , 81P45 , 81P47
The one-shot success probability of a noisy classical channel for transmitting one classical bit is the optimal probability with which the bit can be successfully sent via a single use of the channel. Prevedel et al. [Phys. Rev. Lett. 106, 110505 (2011)] recently showed that for a specific channel, this quantity can be increased if the parties using the channel share an entangled quantum state. In this paper, we characterize the optimal entanglement-assisted protocols in terms of the radius of a set of operators associated with the channel. This characterization can be used to construct optimal entanglement-assisted protocols for a given classical channel and to prove the limits of such protocols. As an example, we show that the Prevedel et al. protocol is optimal for two-qubit entanglement. We also prove some tight upper bounds on the improvement that can be obtained from quantum and nonsignaling correlations.
Quantum error mitigation is an important technique to reduce the impact of noise in quantum computers. With more and more qubits being supported on quantum computers, there are two emerging fundamental challenges. First, the number of shots required for quantum algorithms with large numbers of qubits needs to increase in order to obtain a meaningful distribution or expected value of an observable. Second, although steady progress has been made in improving the fidelity of each qubit, circuits with a large number of qubits are likely to produce erroneous results. This low-shot, high-noise regime calls for highly scalable error mitigation techniques. In this paper, we propose a simple and effective mitigation scheme, qubit-wise majority vote, for quantum algorithms with a single correct output. We show that our scheme produces the maximum likelihood (ML) estimate under certain assumptions and bound the number of shots required. Our experimental results on real quantum devices confirm that our proposed approach requires fewer shots than existing ones, and can sometimes recover the correct answers even when they are not observed from the measurement results.