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

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

Discrimination of quantum states and probabilistic quantum algorithms

János A. Bergou

Published May 25, 2004• 0 citations
Publisher

Abstract

In quantum information and quantum computing, the carrier of information is some quantum system and information is encoded in its state. The state, however, is not an observable in quantum mechanics, thus a fundamental problem arises: after processing the information it has to be read out or, in other words, the state of the system must be determined. When the possible target states are orthogonal, this is a relatively simple task, provided the set of possible target states is known. But when the possible target states are not orthogonal their discrimination is far from being trivial even if their set is known. Thus the problem of discriminating among non-orthogonal states is ubiquitous in quantum information and quantum computing, underlying all communication and computing schemes. It is the subject of this talk to review recent theoretical and experimental advances in this field.

DOI
10.1117/12.547198

Related papers

Programmable state discriminators for the optimum discrimination of unknown quantum states (Invited Paper)

János A. Bergou

In quantum information and quantum computing, the carrier of information is some quantum system and information is encoded in its state. After processing the state in the quantum processor, the information has to be read out. Clearly, this task is equivalent to determining the final state of the system. We begin by briefly reviewing various possible state discrimination strategies that are optimal with respect to some reasonable criteria and report on recent advances in the unambiguous discrimination of mixed quantum states. This strategy has been successfully applied to devise a class of novel probabilistic quantum algorithms and has been demonstrated experimentally, using a linear optical implementation via generalized interferometers. In the second part we present a scheme for communication via completely unknown quantum states. In this context we discuss programmable quantum state discriminators that are universal, i.e. perform optimally on average, independently of the actual states used for the communication scheme. We conclude with a discussion of possible experimental implementations of the proposed device.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•May 23, 2005•0 citations

Discrimination of Quantum States with selected Applications

János A. Bergou

In quantum information processing and quantum computing protocols information is encoded in the state of a quantum system. After processing the information it has to be read out which is equivalent to determining the final state of the system. When the possible final states are not orthogonal this is a highly nontrivial task that constitutes the general area of what is known as quantum state discrimination. It consists in finding measurement schemes that, according to some figure of merit, will determine the state of the system. Optimized measurement schemes often lead to generalized measurements (Positive Operator Valued Measures, POVMs). In this tutorial review we begin with a brief introduction to the theory of generalized measurements and illustrate the power of the concept on examples relevant to applications in quantum cryptography.

The Rochester Conferences on Coherence and Quantum Optics and the Quantum Information and Measurement meeting•Jan 1, 2007•4 citations

Discrimination of quantum states

János A. Bergou

In quantum information processing and quantum computing protocols the carrier of information is a quantum system and information is encoded in the state of a quantum system. After processing the information it has to be read out what is equivalent to determining the final state of the system. When the possible final states are not orthogonal this is a highly nontrivial task that constitutes the general area of what is known as quantum state discrimination. It consists in finding measurement schemes that, according to some figure of merit, will determine the state of the system. Optimized measurement schemes often lead to generalized measurements (Positive Operator Valued Measures [POVMs]). In this tutorial review we illustrate the power of the POVM concept on examples relevant to applications in quantum cryptography. In order to keep the flow of the presentation we give a brief introduction to the quantum theory of measurements, including generalized measurements (POVMs), in the Appendices.

Journal of Modern Optics•Jan 7, 2010•218 citations

The Role Of Noise In Quantum Communication

János A. Bergou

In quantum information and quantum computing, the carrier of information is a quantum system and information is encoded in its state. Secure communication schemes employ non‐orthogonal states that can not be discriminated with 100% probability of success. We briefly review various possible optimized state discrimination strategies since they provide a quantitative figure of merit for the acceptable noise level in quantum communication. We also report on recent results in two special areas. First, we consider discrimination between mixed quantum states. Second, we show that communication via completely unknown quantum states is possible and discuss programmable quantum state discriminators that accomplish this task optimally.

AIP conference proceedings•Jan 1, 2005•0 citations

Characterization of quantum computable decision problems by state discrimination

Karl Svozil

One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed in terms of quantum state identification problems based on a proper partitioning of mutually orthogonal sets of states. The question arises whether or not it is possible to encode equibalanced decision problems into quantum systems, so that a single invocation of a filter used for state discrimination suffices to obtain the result.

arXiv:quant-ph/0505129•AIP conference proceedings•Jan 1, 2006•9 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
In quantum information and quantum computing, the carrier of information is some quantum system and information is encoded in its state. The state, however, is not an observable in quantum mechanics, thus a fundamental problem arises: after processing the information it has to be read out or, in other words, the state of the system must be determined. When the possible target states are orthogonal, this is a relatively simple task, provided the set of possible target states is known. But when the possible target states are not orthogonal their discrimination is far from being trivial even if their set is known. Thus the problem of discriminating among non-orthogonal states is ubiquitous in quantum information and quantum computing, underlying all communication and computing schemes. It is the subject of this talk to review recent theoretical and experimental advances in this field.
In quantum information and quantum computing, the carrier of information is some quantum system and information is encoded in its state. After processing the state in the quantum processor, the information has to be read out. Clearly, this task is equivalent to determining the final state of the system. We begin by briefly reviewing various possible state discrimination strategies that are optimal with respect to some reasonable criteria and report on recent advances in the unambiguous discrimination of mixed quantum states. This strategy has been successfully applied to devise a class of novel probabilistic quantum algorithms and has been demonstrated experimentally, using a linear optical implementation via generalized interferometers. In the second part we present a scheme for communication via completely unknown quantum states. In this context we discuss programmable quantum state discriminators that are universal, i.e. perform optimally on average, independently of the actual states used for the communication scheme. We conclude with a discussion of possible experimental implementations of the proposed device.
In quantum information processing and quantum computing protocols information is encoded in the state of a quantum system. After processing the information it has to be read out which is equivalent to determining the final state of the system. When the possible final states are not orthogonal this is a highly nontrivial task that constitutes the general area of what is known as quantum state discrimination. It consists in finding measurement schemes that, according to some figure of merit, will determine the state of the system. Optimized measurement schemes often lead to generalized measurements (Positive Operator Valued Measures, POVMs). In this tutorial review we begin with a brief introduction to the theory of generalized measurements and illustrate the power of the concept on examples relevant to applications in quantum cryptography.
In quantum information processing and quantum computing protocols the carrier of information is a quantum system and information is encoded in the state of a quantum system. After processing the information it has to be read out what is equivalent to determining the final state of the system. When the possible final states are not orthogonal this is a highly nontrivial task that constitutes the general area of what is known as quantum state discrimination. It consists in finding measurement schemes that, according to some figure of merit, will determine the state of the system. Optimized measurement schemes often lead to generalized measurements (Positive Operator Valued Measures [POVMs]). In this tutorial review we illustrate the power of the POVM concept on examples relevant to applications in quantum cryptography. In order to keep the flow of the presentation we give a brief introduction to the quantum theory of measurements, including generalized measurements (POVMs), in the Appendices.
In quantum information and quantum computing, the carrier of information is a quantum system and information is encoded in its state. Secure communication schemes employ non‐orthogonal states that can not be discriminated with 100% probability of success. We briefly review various possible optimized state discrimination strategies since they provide a quantitative figure of merit for the acceptable noise level in quantum communication. We also report on recent results in two special areas. First, we consider discrimination between mixed quantum states. Second, we show that communication via completely unknown quantum states is possible and discuss programmable quantum state discriminators that accomplish this task optimally.
One advantage of quantum algorithms over classical computation is the possibility to spread out, process, analyse and extract information in multipartite configurations in coherent superpositions of classical states. This will be discussed in terms of quantum state identification problems based on a proper partitioning of mutually orthogonal sets of states. The question arises whether or not it is possible to encode equibalanced decision problems into quantum systems, so that a single invocation of a filter used for state discrimination suffices to obtain the result.
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.