The discrimination of coherent states is a crucial component in quantum communication with continuous variables, especially in quantum key distribution protocols (CV-QKD), which rely on the ability to distinguish among different coherent states to establish a shared secret key between two parties. Here, we propose and analyze a strategy for distinguishing among N phase-symmetric coherent states, which optimally takes unambiguous discrimination (UD) to the deterministic regime, at the inevitable cost of having non-zero probability of error. Despite the disturbance introduced by the separation map used in the UD process, we show that for N > 2, the "failure" states of UD retain residual information about the original input states, which can be further used for discrimination. Rather than discarding inconclusive outcomes as in conventional UD, we show that the "failure" states of UD can be optimally recycled by performing a sequential minimum-error discrimination (MED). This strategy, which we call information recycling (IR), combines the benefits of both MED and optimal UD: It always provides conclusive results while allowing for a subset of those results to be error-free, which are identifiable by an ancillary system. We characterize the disturbance introduced by the state separation map by the infidelity between input and failure states, demonstrating that it lower bounds the error probability in the recycling stage. Furthermore, in the low-amplitude regime-relevant for long-distance CV-QKD applications-we show that the state separation achieves significant success while introducing relatively low disturbance to the input states after failed events. Our results open up new possibilities for adaptive and sequential discrimination protocols in continuous-variable settings, and could potentially be used in the design of next-generation receivers in quantum communication.
The discrimination of coherent states is a crucial component in quantum communication with continuous variables, especially in quantum key distribution protocols (CV-QKD), which rely on the ability to distinguish among different coherent states to establish a shared secret key between two parties. Here, we propose and analyze a strategy for distinguishing among N phase-symmetric coherent states, which optimally takes unambiguous discrimination (UD) to the deterministic regime, at the inevitable cost of having non-zero probability of error. Despite the disturbance introduced by the separation map used in the UD process, we show that for N > 2, the "failure" states of UD retain residual information about the original input states, which can be further used for discrimination. Rather than discarding inconclusive outcomes as in conventional UD, we show that the "failure" states of UD can be optimally recycled by performing a sequential minimum-error discrimination (MED). This strategy, which we call information recycling (IR), combines the benefits of both MED and optimal UD: It always provides conclusive results while allowing for a subset of those results to be error-free, which are identifiable by an ancillary system. We characterize the disturbance introduced by the state separation map by the infidelity between input and failure states, demonstrating that it lower bounds the error probability in the recycling stage. Furthermore, in the low-amplitude regime-relevant for long-distance CV-QKD applications-we show that the state separation achieves significant success while introducing relatively low disturbance to the input states after failed events. Our results open up new possibilities for adaptive and sequential discrimination protocols in continuous-variable settings, and could potentially be used in the design of next-generation receivers in quantum communication.
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.
We studied the mutual information and quantum discord that Alice and Bob share when Bob implements a discrimination with a fixed rate of inconclusive outcomes (FRIO) onto two pure non-orthogonal quantum states, generated with arbitrary a priori probabilities. FRIO discrimination interpolates between minimum error (ME) and unambiguous state discrimination (UD). ME and UD are well known discrimination protocols with several applications in quantum information theory. FRIO discrimination provides a more general framework where the discrimination process together with its applications can be studied. In this setting, we compared the performance of optimum probability of discrimination, mutual information, and quantum discord. We found that the accessible information is obtained when Bob implements the ME strategy. The most (least) efficient discrimination scheme is ME (UD), from the point of view of correlations that are lost in the initial state and remain in the final state, after Bob's measurement.
Abstract The impossibility of deterministic and error-free discrimination among nonorthogonal quantum states lies at the core of quantum theory and constitutes a primitive for secure quantum communication. Demanding determinism leads to errors, while demanding certainty leads to some inconclusiveness. One of the most fundamental strategies developed for this task is the optimal unambiguous measurement. It encompasses conclusive results, which allow for error-free state retrodictions with the maximum success probability, and inconclusive results, which are discarded for not allowing perfect identifications. Interestingly, in high-dimensional Hilbert spaces the inconclusive results may contain valuable information about the input states. Here, we theoretically describe and experimentally demonstrate the discrimination of nonorthogonal states from both conclusive and inconclusive results in the optimal unambiguous strategy, by concatenating a minimum-error measurement at its inconclusive space. Our implementation comprises four- and nine-dimensional spatially encoded photonic states. By accessing the inconclusive space to retrieve the information that is wasted in the conventional protocol, we achieve significant increases of up to a factor of 2.07 and 3.73, respectively, in the overall probabilities of correct retrodictions. The concept of concatenated optimal measurements demonstrated here can be extended to other strategies and will enable one to explore the full potential of high-dimensional nonorthogonal states for quantum communication with larger alphabets.
The optimal measurement that discriminates nonorthogonal quantum states with fixed rates of inconclusive outcomes (FRIO) can be decomposed into an assisted separation of the inputs, yielding conclusive and inconclusive outputs, followed by a minimum-error (ME) measurement for the conclusive ones (standard FRIO) or both ones (concatenated FRIO). The implementation of these measurements is underpinned by quantum resources, and here we investigate coherence based on positive operator-valued measures (POVMs) as a resource for both strategies in discriminating equally probable symmetric states of arbitrary dimension. First, we show that the POVM coherence in the assisted separation stage decomposes into the coherence of the ancillary state and the quantum discord between the system and the ancilla, evidencing coherence as a more elementary resource than quantum correlations. Next, it is demonstrated that the POVM coherence for standard and concatenated FRIO decomposes into the POVM coherence measures for state separation and ME measurement, weighted by the probabilities of occurrence of each event. Due to the ME discrimination of inconclusive states, the coherence required for the concatenated scheme is shown to be greater than that of the standard one. We discuss other general aspects of our results by characterizing the POVM coherence in the discrimination of qutrit states, with respect to the distinguishability of the inputs and the inconclusive rate. Finally, by exploiting POVM-based coherence as a quantifier of cryptographic randomness gain, we discuss the standard and concatenated FRIO strategies from the perspective of generating random bits that are secret to an eavesdropper.
We present the solution to the problem of optimally discriminating among quantum states, i.e., identifying the states with maximum probability of success when a certain fixed rate of inconclusive answers is allowed. By varying the inconclusive rate, the scheme optimally interpolates between unambiguous and minimum error discrimination, the two standard approaches to quantum state discrimination. We introduce a very general method that enables us to obtain the solution in a wide range of cases and give a complete characterization of the minimum discrimination error as a function of the rate of inconclusive answers. A critical value of this rate is identified that coincides with the minimum failure probability in the cases where unambiguous discrimination is possible and provides a natural generalization of it when states cannot be unambiguously discriminated. The method is illustrated on two explicit examples: discrimination of two pure states with arbitrary prior probabilities and discrimination of trine states.
Near-optimal binary coherent state discrimination can be achieved by performing a displacement operation followed by photon detection. This displacement serves as a control parameter that can be tuned to optimize a chosen figure of merit, which makes such receivers attractive beyond state discrimination. Here, we turn this discrimination strategy into a complete continuous-variable quantum key distribution (CV-QKD) protocol based on a binary alphabet of noisy coherent states (displaced thermal states) and displacement receivers. We develop a strategy for estimating the channel parameters with the same displacement receiver, since standard quadrature-based methods do not apply. While a key map can be obtained with on/off detection, we demonstrate that reliable parameter estimation requires photon-number-resolving detection with sufficient resolution. Finite detector resolution underestimates the observed noise and constitutes a potential security loophole, which we quantify and show to be mitigable with modest resolution. We analyze the protocol's security against entangling-cloner collective attacks in the asymptotic regime, for both direct and reverse reconciliation, and show that it can generate secret keys even under noisy state preparation and imperfect detection. Interestingly, we find that the displacement that minimizes the discrimination error probability also performs well for key generation, thus providing a useful and analytically tractable tuning strategy for the CV-QKD receiver. We evaluate the protocol's performance over a range of transmittances and noise parameters, showing that the displacement receiver can outperform conventional homodyne detection in experimentally relevant regimes. Together, our results point to displacement receivers as a promising alternative for CV-QKD implementations.