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.16012

Data Processing Inequality for The Quantum Guesswork

Ilyass Mejdoub, Julien Béguinot, Olivier Rioul

Published Jul 22, 2024• 0 citations
arXivHTMLPDF

Abstract

Non-orthogonal quantum states pose a fundamental challenge in quantum information processing, as they cannot be distinguished with absolute certainty. Conventionally, the focus has been on minimizing error probability in quantum state discrimination tasks. However, another criterion known as quantum guesswork has emerged as a crucial measure in assessing the distinguishability of non-orthogonal quantum states, when we are allowed to query a sequence of states. In this paper, we generalize well known properties in the classical setting that are relevant for the guessing problem. Specifically, we establish the pre and post Data Processing Inequalities. We also derive a more refined lower bound on quantum guesswork.

DOI
10.48550/arxiv.2407.16012

Related papers

Data Processing Inequalities for the Quantum Guesswork

Ilyass Mejdoub, Julien Béguinot, Olivier Rioul

Quantum guesswork has emerged as a crucial measure in assessing the distinguishability of nonorthogonal quantum states. In this paper, we review and compare previous definitions of the quantum guesswork, and establish the pre and post data processing inequalities (DPIs) that are relevant for the guessing problem. We also derive improved lower and upper bounds on the quantum guesswork in terms of the Shannon entropy and Holevo's information.

•Nov 1, 2026•0 citations

On the Measurement Attaining the Quantum Guesswork

Michele Dall’Arno

The guesswork quantifies the minimum cost incurred in guessing the state of an ensemble, when only one state can be queried at a time. In the classical case, it is well known that the optimal strategy trivially consists of querying the states in their non-increasing order of posterior probability. In the quantum case, on the other hand, the most general strategy to obtain the optimal ordering in which to perform the queries consist of a quantum measurement. Here, we solve such an optimization problem by deriving the quantum measurement attaining the guesswork for a broad class of ensembles and cost functions.

arXiv:2302.06783•IEEE Transactions on Information Theory•Dec 15, 2023•2 citations

Structure of minimum-error quantum state discrimination

Joonwoo Bae

Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.

arXiv:1210.2845•New Journal of Physics•Jul 18, 2013•89 citations

Minimum-error state discrimination and Fano's inequality

Georgios M. Nikolopoulos

The discrimination between non-orthogonal quantum states plays a pivotal role in quantum information processing and quantum technology. Strategies that minimize the error probability are of particular importance, but they are only known for special classes of problems. Certain forms of Fano's inequality yield a bound on the error probability, but it is not known how close this bound is to the minimum-error probability achieved by means of optimal measurements. In this work, we discuss how the minimum-error probability compares to the error bound obtained through the Fano's inequality for several scenarios, some of which are amenable to analytic treatments.

arXiv:2505.10042•American Journal of Physics•Jun 20, 2025•1 citation

Perfect Discrimination of Non-Orthogonal Quantum States via Adaptive Post-Measurement Queries

Hanwool Lee, Teiko Heinosaari

A set of pairwise non-orthogonal quantum states cannot be perfectly discriminated, and this remains true even when one bit of classical partial information is available prior to the measurement. Contrary to the usual intuition that earlier information is at least as valuable as later information, we show that the same bit can be more useful when it arrives after the measurement. We present a framework for state discrimination in which the sender provides classical information in response to a request from the receiver, which we refer to as a query. In some cases, pairwise non-orthogonal states can be perfectly discriminated when the query is allowed to depend on the measurement outcome. We give a general method for finding the optimal strategy in this setting, which turns out to be the standard minimum-error discrimination problem for an auxiliary ensemble.

quant-pharXiv:2608.01167•Aug 4, 2026•0 citations

Sequential Discrimination Between Non-Orthogonal Quantum States

Dov Fields

The problem of discriminating between non-orthogonal states is one that has generated a lot of interest. This basic formalism is useful in many areas of quantum information. It serves as a fundamental basis for many quantum key distribution schemes, it functions as an integral part of other quantum algorithms, and it is useful in experimental settings where orthogonal states are not always possible to generate. Additionally, the discrimination problem reveals important fundamental properties, and is intrinsically related to entanglement. In this thesis, the focus is on exploring the problem of sequentially discriminating between non-orthogonal states. In the simplest version these schemes, Alice sends one of two known pure states to Bob who performs a non-optimal discrimination procedure such that the post measurement states resulting from his measurement can then be discriminated by a third participant, Charlie. In these schemes, the goal is to optimize the joint probability of both Bob and Charlie succeeding. In devising such a scheme, there are several different criteria that can be prioritized. The most basic scheme, referred to as Minimum Error (ME) discrimination, prioritizes Bob's and Charlie's abilities to successfully determine which state was sent by Alice. In this scheme, Bob and Charlie each set up two detectors and based on the result from the detector they make a guess as to which state was sent. For instance, if Bob registers a click in his first detector, he concludes that Alice sent the first state. As each detector has some probability to produce a result for either incoming result, Bob and Charlie optimize their joint probability of success by optimizing the probability that each detector will fire when the correlated state is sent by Alice. Another possible scheme, referred to as Unambiguous Discrimination (UD), prioritizes Bob's and Charlie's ability to correctly determine the state sent by Alice. In this scheme, Bob and Charlie each set up three detectors, where if a result is obtained from the first two detectors Bob or Charlie can determine with certainty which state was sent by Alice. One final setup, referred to as Discrimination with a Fixed Rate of Inconclusive Outcome, is a combination of the previous two schemes, where Bob and Charlie maximize their probability of successfully determining the state sent by Alice where they allow some fixed probability that they will not be able to determine which state Alice sent. This fixed inconclusive probability allows Bob and Charlie to control how much they prioritize correctly determining the state that was sent, as in the Unambiguous Discrimination, versus prioritizing successfully determining the state sent by Alice, as in Minimum Error discrimination. One final topic that will be discussed by this thesis is Quantum Retrodiction. Quantum Retrodiction applies an alternate perspective on the communication protocol between Alice and Bob. In the predictive model, Alice calculates the probability that Bob gets a specific measurement result given that she prepares her system in a specific state. In the retrodictive model, Bob calculates the probability that Alice prepared her system in a specific state given the result of his measurement. This alternate perspective on the communication procedure gives new a new understanding and new tools for approaching the problem of state discrimination, as exemplified by applying the retrodictive formalism to unambiguous discrimination.

•Jan 1, 2019•0 citations
Non-orthogonal quantum states pose a fundamental challenge in quantum information processing, as they cannot be distinguished with absolute certainty. Conventionally, the focus has been on minimizing error probability in quantum state discrimination tasks. However, another criterion known as quantum guesswork has emerged as a crucial measure in assessing the distinguishability of non-orthogonal quantum states, when we are allowed to query a sequence of states. In this paper, we generalize well known properties in the classical setting that are relevant for the guessing problem. Specifically, we establish the pre and post Data Processing Inequalities. We also derive a more refined lower bound on quantum guesswork.
The guesswork quantifies the minimum cost incurred in guessing the state of an ensemble, when only one state can be queried at a time. In the classical case, it is well known that the optimal strategy trivially consists of querying the states in their non-increasing order of posterior probability. In the quantum case, on the other hand, the most general strategy to obtain the optimal ordering in which to perform the queries consist of a quantum measurement. Here, we solve such an optimization problem by deriving the quantum measurement attaining the guesswork for a broad class of ensembles and cost functions.
Distinguishing different quantum states is a fundamental task having practical applications in information processing. Despite the effort devoted so far, however, strategies for optimal discrimination are known only for specific examples. In this paper we consider the problem of minimum-error quantum state discrimination where one attempts to minimize the average error. We show the general structure of minimum-error state discrimination as well as useful properties to derive analytic solutions. Based on the general structure, we present a geometric formulation of the problem, which can be applied to cases where quantum state geometry is clear. We also introduce equivalent classes of sets of quantum states in terms of minimum-error discrimination: sets of quantum states in an equivalent class that share the same guessing probability. In particular, for qubit states where the state geometry is found with the Bloch sphere, we illustrate that for an arbitrary set of qubit states, the minimum-error state discrimination with equal prior probabilities can be analytically solved, that is, optimal measurement and the guessing probability are explicitly obtained.
The discrimination between non-orthogonal quantum states plays a pivotal role in quantum information processing and quantum technology. Strategies that minimize the error probability are of particular importance, but they are only known for special classes of problems. Certain forms of Fano's inequality yield a bound on the error probability, but it is not known how close this bound is to the minimum-error probability achieved by means of optimal measurements. In this work, we discuss how the minimum-error probability compares to the error bound obtained through the Fano's inequality for several scenarios, some of which are amenable to analytic treatments.
A set of pairwise non-orthogonal quantum states cannot be perfectly discriminated, and this remains true even when one bit of classical partial information is available prior to the measurement. Contrary to the usual intuition that earlier information is at least as valuable as later information, we show that the same bit can be more useful when it arrives after the measurement. We present a framework for state discrimination in which the sender provides classical information in response to a request from the receiver, which we refer to as a query. In some cases, pairwise non-orthogonal states can be perfectly discriminated when the query is allowed to depend on the measurement outcome. We give a general method for finding the optimal strategy in this setting, which turns out to be the standard minimum-error discrimination problem for an auxiliary ensemble.
The problem of discriminating between non-orthogonal states is one that has generated a lot of interest. This basic formalism is useful in many areas of quantum information. It serves as a fundamental basis for many quantum key distribution schemes, it functions as an integral part of other quantum algorithms, and it is useful in experimental settings where orthogonal states are not always possible to generate. Additionally, the discrimination problem reveals important fundamental properties, and is intrinsically related to entanglement. In this thesis, the focus is on exploring the problem of sequentially discriminating between non-orthogonal states. In the simplest version these schemes, Alice sends one of two known pure states to Bob who performs a non-optimal discrimination procedure such that the post measurement states resulting from his measurement can then be discriminated by a third participant, Charlie. In these schemes, the goal is to optimize the joint probability of both Bob and Charlie succeeding. In devising such a scheme, there are several different criteria that can be prioritized. The most basic scheme, referred to as Minimum Error (ME) discrimination, prioritizes Bob's and Charlie's abilities to successfully determine which state was sent by Alice. In this scheme, Bob and Charlie each set up two detectors and based on the result from the detector they make a guess as to which state was sent. For instance, if Bob registers a click in his first detector, he concludes that Alice sent the first state. As each detector has some probability to produce a result for either incoming result, Bob and Charlie optimize their joint probability of success by optimizing the probability that each detector will fire when the correlated state is sent by Alice. Another possible scheme, referred to as Unambiguous Discrimination (UD), prioritizes Bob's and Charlie's ability to correctly determine the state sent by Alice. In this scheme, Bob and Charlie each set up three detectors, where if a result is obtained from the first two detectors Bob or Charlie can determine with certainty which state was sent by Alice. One final setup, referred to as Discrimination with a Fixed Rate of Inconclusive Outcome, is a combination of the previous two schemes, where Bob and Charlie maximize their probability of successfully determining the state sent by Alice where they allow some fixed probability that they will not be able to determine which state Alice sent. This fixed inconclusive probability allows Bob and Charlie to control how much they prioritize correctly determining the state that was sent, as in the Unambiguous Discrimination, versus prioritizing successfully determining the state sent by Alice, as in Minimum Error discrimination. One final topic that will be discussed by this thesis is Quantum Retrodiction. Quantum Retrodiction applies an alternate perspective on the communication protocol between Alice and Bob. In the predictive model, Alice calculates the probability that Bob gets a specific measurement result given that she prepares her system in a specific state. In the retrodictive model, Bob calculates the probability that Alice prepared her system in a specific state given the result of his measurement. This alternate perspective on the communication procedure gives new a new understanding and new tools for approaching the problem of state discrimination, as exemplified by applying the retrodictive formalism to unambiguous discrimination.