Next Article in Journal
Artificial Intelligence for Modeling Real Estate Price Using Call Detail Records and Hybrid Machine Learning Approach
Previous Article in Journal
Time Delay Complex Chen Chaotic System and Secure Communication Scheme for Wireless Body Area Networks
Previous Article in Special Issue
The Triangle Wave Versus the Cosine: How Classical Systems Can Optimally Approximate EPR-B Correlations
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Understanding of Various Type of Unambiguous Discrimination in View of Coherence Distribution

1
School of Applied Mathematics, National Research University Higher School of Economics, 101000 Moscow, Russia
2
Department of Applied Physics, Hanyang University, Ansan, Kyunggi-Do 425-791, Korea
*
Author to whom correspondence should be addressed.
Entropy 2020, 22(12), 1422; https://doi.org/10.3390/e22121422
Submission received: 16 November 2020 / Revised: 11 December 2020 / Accepted: 12 December 2020 / Published: 16 December 2020
(This article belongs to the Special Issue Foundations of Quantum Mechanics and Quantum Information Theory)

Abstract

:
Unambiguous quantum state discrimination is a strategy where the conclusive result can always be trusted. This strategy is very important, since it can be used for various quantum information protocols, including quantum key distribution. However, in the view of quantumness, it is not clear what is going on in performing unambiguous quantum state discrimination. To answer the question, we investigate coherence distribution when unambiguous discrimination is performed by generalized measurement. Specially, we study coherence distribution in three cases, which consist of unambiguous quantum state discrimination, sequential quantum state discrimination, and assisted optimal discrimination, which are considered to be a family of unambiguous quantum state discrimination. In this investigation, we show that the structure of generalized measurements performing various types of unambiguous quantum state discrimination can be understood in terms of coherence distribution. Our result is not limited to the discrimination of two pure quantum states, but it is extended to the discrimination of two mixed states.

1. Introduction

Unambiguous quantum state discrimination (UD) is a strategy for discriminating quantum states without an error. The errorless results in UD require of containing the inconclusive result. Even though many successful applications of UD have been known, it is not clear what can make UD successful. It is known that UD can be constructed in terms of generalized measurement [1,2,3,4,5,6,7]. Because generalized measurement performing UD should consist of preparing an auxiliary(or ancilla) system and interacting with a given quantum system [8,9], understanding what is going on in the interaction of UD is very important.
One can regard UD as a game between a sender called Alice and a receiver called Bob. When the interaction is terminated, there can be many choices for Bob in generalized measurement, according to whether Bob’s measurement is optimal or not and which systems Bob measures on. The first choice is that Bob only performs a local projective measurement on his auxiliary system. If Bob performs non-optimal unambiguous discrimination, which means that Bob’s measurement does not optimize average success probability, then one can obtain partial information from Bob’s post-measurement state [10]. It leads to sequential state discrimination (SSD) [10,11,12,13,14,15,16,17,18]. The second choice is that Bob performs local projective measurement on both Alice and his system. This choice leads to assisted optimal state discrimination (AOSD) [19,20,21,22]. In fact, AOSD is classified into two cases, such as AOSD1 and AOSD2. In AOSD1, Bob discriminates one out of Alice’s two quantum states. Meanwhile, in AOSD2, Bob discriminates every Alice’s quantum state.
Quantum coherence [23] is an important feature in revealing the quantum nature of a system. It is known to help us to understand the concept of wave-particle duality [24,25,26]. Not only that, it is suggested that quantum coherence can be related to a various quantum information processings [27,28,29,30,31]. Additionally, quantum coherence has an advantage in that it can be studied in a single system as well as in a multipartite system. Further, it can be used to unify various quantum characteristics. Additionally, it can help to understand the behavior of quantum operation [32].
Therefore, in this work, using coherence, we study what is going on when the generalized measurement is performed for various types of UD. To do it, we investigate how coherence is distributed in performing generalized measurements for UD, SSD, and AOSD. For the purpose, we consider relative quantum coherence (RQC), as a coherence measure [33]. Further, in order to understand the behavior of coherence distribution, we need to study the localization of relative quantum coherence (RQC). For the measure of localization of relative quantum coherence (RQC), we consider entropic quantum discord [34,35,36,37,38,39,40] and symmetrized discord [11,15].
Our investigation tells that the unitary operator in generalized measurement for UD moves the localization of RQC in Alice’s initial ensemble(or average state) into Bob’s auxiliary system. Meanwhile, the unitary operator in generalized measurement for SSD distributes RQC in Alice’s initial ensemble to both Alice’s and Bob’s systems. Further, the unitary operator in generalized measurement for AOSD1 moves the localization of RQC in Alice’s initial ensemble into Bob’s auxiliary system. Meanwhile, the unitary operator in generalized measurement for AOSD2 distributes RQC in Alice’s initial ensemble to both Alice’s and Bob’s systems.
In an operational view, our result implies that coherence distribution depends on the way where Bob constructs his generalized measurement. As known, UD, SSD, AOSD1, and AOSD2 performs unambiguous discrimination. Because coherence is regarded as a resource for quantum operation, understanding how coherence distribution occurs in these scenarios is an important subject of investigation. We show that the feature of coherence distribution in these scenarios depends on the characteristic of each scenario’s measurement. Further, we show that our argument could be extended to cases, including two mixed states. In other words, our arguments listed above is not limited to discrimination of two pure states. In terms of entropic quantum discord and symmetrized discord as witnesses of RQC localization, our result can help to understand the quantum correlations.
Furthermore, our result consistently reveals a relation between quantumness and unambiguous quantum state discrimination. It is well known that AOSD requires partially quantum dissonance, which is defined as quantum discord in separable state [41]. Meanwhile, our result explains the relationship between coherence distribution and AOSD. Additionally, it should be noted that we could extend our argument successfully to two mixed states case.
This paper is organized. as follows. In Section 2, we briefly review RQC and RQC localization. Additionally, we show that entropic quantum discord and symmetrized discord can be applied for witnesses of RQC localization. In Section 3, we explain four strategies (UD, SSD, AOSD1, and AOSD2), which can be understood as a deformed structure of UD. (Actually, AOSD1 and AOSD2) have an equivalent structure as AOSD. In Section 4, we analyze coherence distribution in generalized measurements for four cases when every two quantum state of Alice is pure. In Section 5, we extend our argument in Section 4 to mixed states case. Finally, we conclude and discuss our result in Section 6. Because UD based algorithms can be applied to quantum random number generation [42], quantum key distribution [43,44], and quantum state tomography [45], our result can contribute to understanding how coherence distribution is essential in quantum information protocols.

2. Preliminaries

2.1. Definition of RQC

Although superposition is one of the fundamental concepts in quantum physics, it is difficult to rigorously define the notion of superposition. Despite this, the state of a system without superposition is expressed as a classical probability distribution, which is equivalent to the diagonal density operator. This state is known as the incoherent state. Additionally, the incoherent operation is defined as a completely positive map (CP map), which maps the set of incoherent state onto itself. In this way, coherence can be defined as a quantity in which incoherent operation does not increase.
From this, the mathematical conditions of coherence measure C ( · ) can be provided, as follows [23]:
  • (C1) Assume that I is the set of incoherent states. Then, C ( δ ) = 0 if and only if δ I .
  • (C2) Assume that incoherent operation is expressed as a set of Kraus operators { K 1 , , K n | K i I K i I i } .
    • −Given the incoherent CPTP map, C satisfies C ( ρ ) C ( Φ ( ρ ) ) , where Φ ( ρ ) = i = 1 n K i ρ K i .
    • −For the post-measurement state ρ i = K i ρ K i / p i and the corresponding probability p i = Tr [ K i ρ K i ] , C satisfies C ( ρ ) i = 1 n p i C ( ρ i ) .
  • (C3) C is convex, meaning that C satisfies i = 1 n p i C ( ρ i ) C ( i = 1 n p i ρ i ) .
According to Baumgratz, Cramer, and Plenio [23], the relative entropy of coherence satisfies the above three conditions and it is defined as
C rel . ent ( ρ ) = S ( ρ diag ) S ( ρ ) .
Example 1.
(Role of coherence in BB84 protocol) Most of quantum key distribution protocol uses a superposed state as an information carrier, which has nonzero coherence, in order to provide security between a sender and a receiver. Here, we introduce a BB84 protocol [43], which is described in Figure 1. In Figure 1a, Alice produces a qubit | x { | 0 , | 1 } , and performs a unitary operator U a , depending on her random bit a { 0 , 1 } . Here, U a is an identity if a = 0 and a Hadamard gate if a = 1 . Subsequently, Alice sends one out of four qubits { | 0 , | 1 , | + , | } . After Alice sends a qubit to Bob, Bob performs a unitary operator U b , depending on his random bit b { 0 , 1 } . Here, U b is an identity if b = 0 and a Hadamard gate if b = 1 . Subsequently, Bob performs a projective measurement { | 0 0 | , | 1 1 | } and obtains a measurement outcome of y { 0 , 1 } .
We assume that a and b are randomly choosen as a = 1 and b = 1 , as in Figure 1b. Additionally, we assume that Alice prepares a qubit | 0 . Subsequently, Alice’s unitary operator U a = 1 = H transforms | 0 into | + , which has nonzero coherence in the fixed basis { | 0 , | 1 } . Because Bob’s unitary operator U b = 1 = H transforms | + into | 0 , Bob always obtains the measurement outcome of y = 0 , when Alice prepares | 0 .
In Figure 1c, Eve performs eavesdropping between Alice and Bob. Here, we assume that Eve performs a strategy that, after performing her measurement, she sends the qubit | z corresponding to the measurement outcome of z { 0 , 1 } to Bob. Note that Eve’s post-measurement state can be incoherent. Subsequently, there is a possibility that Bob obtains a measurement outcome of y = 1 , which is different from x = 0 . Thus, Alice and Bob can notice Eve’s presence by comparing their list of a and b.
Consequently, it implies that coherence can be a resource for security of BB84.
Additionally, M.-L. Hu and H. Fan [33] defined the basis-dependent measure of coherence as
C rel . ent ( ρ , σ ) = i ψ i | ρ | ψ i log 2 ψ i | ρ | ψ i S ( ρ ) .
where { | ψ i } i is a fixed basis, consisting of σ . This coherence measure is also known as the relative quantum coherence(RQC). If σ is degenerate, then the basis that consists of σ is not unique [33]. Therefore, the suprenum of the RQC under every basis of σ is considered to be
C rel . ent ( ) ( ρ , σ ) = sup { | ψ i } i C rel . ent ( ρ , σ ) .
This measure of coherence is also called the maximum RQC [33]. It is well known that RQC is applicable for bipartite system, where it can be related to various quantum correlations, including quantum discord, measurement-induced disturbance, and nonlocality. Particularly, entropic quantum discord has a close relationship with RQC localization.

2.2. Definition of RQC Discrepancy and Localization

In order to define the RQC of a bipartite state ρ A B , the construction of a fixed basis for systems A and B is required. Assume that both the fixed orthonormal basis { Π i ( P ) } i and { Π i ( Q ) } i consist of each system A and B. The incoherent state ρ P Q , which corresponds to ρ A B , is then given as ρ P Q = i , j Π i ( P ) Π j ( Q ) ρ A B Π i ( P ) Π j ( Q ) . Likewise, the incoherent state ρ P ( ρ Q ), which corresponds to the partial state ρ A ( ρ B ), is given as ρ P = Tr Q ρ P Q ( ρ Q = Tr P ρ P Q ). Therefore, the RQCs of the states ρ A B , ρ A , and ρ B are defined as [33]
C rel . ent ( ρ A B , ρ P Q ) = S ( ρ P Q ) S ( ρ A B ) , C rel . ent ( ρ A , ρ P ) = S ( ρ P ) S ( ρ A ) , C rel . ent ( ρ B , ρ Q ) = S ( ρ Q ) S ( ρ B ) .
Because RQC is not increased under the trace out, C rel . ent ( ρ A B , ρ P Q ) must be greater than or equal to both C rel . ent ( ρ A , ρ P ) and C rel . ent ( ρ B , ρ Q ) . From an operational viewpoint, not every bipartite system ρ A B is guaranteed to be localized into a certain subsystem localized. In order to deal with this argument quantitively, the nonlocalized quantities of RQC are defined as
δ A ( ρ A B ) C rel . ent ( ρ A B , ρ P Q ) C rel . ent ( ρ A , ρ P ) , δ B ( ρ A B ) C rel . ent ( ρ A B , ρ P Q ) C rel . ent ( ρ B , ρ Q ) .
δ A ( δ B ) is also known as the RQC discrepancy. If δ A ( δ B ) is equal to zero, C rel . ent ( ρ A B , ρ P Q ) is equal to C rel . ent ( ρ A , ρ P ) ( C rel . ent ( ρ B , ρ Q ) ). This means that the RQC of ρ A B is localized into system A(B). However, if δ A ( δ B ) is nonzero, then the RQC of ρ A B is not localized into system A(B).

2.3. Entropic Quantum Discord as a Witness of RQC Localization

According to a study that was scarried out by M.-L. Hu and H. Fan [33], the discrepancy in the RQC is lower bounded by entropic quantum discord [34]
D A ( ρ A B ) δ A ( ρ A B ) , D B ( ρ A B ) δ B ( ρ A B ) .
where D A ( ρ A B ) and D B ( ρ A B ) describe the entropic quantum discord, which is defined as
D A ( ρ A B ) = I ( ρ A B ) max { M k ( A ) } k = 1 N A J ( { M k ( A ) } k = 1 N A | B ) , D B ( ρ A B ) = I ( ρ A B ) max { M k ( B ) } k = 1 N B J ( { M k ( B ) } k = 1 N B | A ) .
Here, I ( ρ A B ) is the von Neumann mutual information between systems A and B. Additionally, J ( { M k ( A ) } k = 1 N A | B ) ( J ( { M k ( B ) } k = 1 N B ) | A ) is the classical part of the mutual information between system A and B, where the local measurement that is expressed as POVM { M k ( A ) } k = 1 N A ( { M k ( B ) } k = 1 N B ) is performed on system A(B) [46]. Equation (1) implies that entropic quantum discord is applicable as a witness for RQC localization. If the entropic quantum discord D A ( ρ A B ) ( D B ( ρ A B ) ) is nonzero, then the RQC of ρ A B is not localized into system A(system B).
The witness in Equation (1) is asymmetric under a change in the lower index. In order to investigate RQC localization, the witness for system A and B should be simultaneously tested. Hence, if a witness is symmetrical under a change in the lower index, we can simultaneously investigate the RQC localization by testing one witness. Fortunately, symmetrized discord can be exploited [11]:
D A B ( ρ A B ) = D A ( ρ A B ) D B ( ρ A B ) ,
Substituting Equation (1) into Equation (2), an inequality is obtained as
D A B ( ρ A B ) δ A ( ρ A B ) δ B ( ρ A B ) .
If D A B ( ρ A B ) is nonzero, the RQC of ρ A B is not localized into A or B. Moreover, if the RQC of ρ A B is localized into either system A or B, the symmetrized discord is equal to zero. Hence, the symmetrized discord can be applied as a witness in a similar that is manner to symmetric discord [33].
Example 2.
(RQC localization during CNOT operation) By using the formula that is proposed in Ref. [36], the entropic quantum discord of the maximally entangled state is evaluated as D A ( | ψ ψ | ) = D B ( | ψ ψ | ) = 1 . Therefore, the symmetrized discord is nonzero. This implies that RQC of the maximally entangled state is not localized in either the system A or the system B. Additionally, the RQC of the maximally entangled state is C r e l . e n t ( | ψ ψ | , ρ P Q ) = 1 , where the fixed basis is { | 0 , | 1 } and ρ P Q is 0.5 | 01 01 | + 0.5 | 10 10 | .
After CNOT operation, the composite state is transformed into | 0 . Because this state is a product state, the entropic quantum discord is zero. This implies that the RQC is localized in either the system A or the system B. Because the RQC of the system A is evaluated as C r e l . e n t ( | | , ρ P ) = 1 , where ρ P is a maximally mixed state, we can conclude that the RQC of the maximally entangled state is localized in the system A by the CNOT gate. It implies that RQC localization may be understood as a resource for implementing CNOT operation (Figure 2).

3. Structure of Various Protocols Based on Unambiguous Discrimination

Suppose that unambiguous discrimination is performed by Alice and Bob. Subsequently, one can assume that Alice prepares a pure state | ψ i { | ψ 1 , | ψ 2 } , with a prior probability q i . Here, | ψ 1 is not orthogonal to | ψ 2 . Alice sends a pure state | ψ i to Bob through a quantum channel. Subsequently, Bob can discriminate Alice’s pure state without any error. Mathematically, Bob’s measurement is expressed as three elements POVM { M 0 , M 1 , M 2 } . Here, M i is an element that corresponds to a measurement outcome i { 0 , 1 , 2 } . If i 0 , then Bob can conclude that Alice’s pure state is | ψ i without any error. In this case, the outcome of measurement i is considered as a conclusive outcome. Meanwhile, if i = 0 , Bob cannot conclude which of Alice’s pure states is prepared. In this case, the measurement outcome i = 0 is considered as the inconclusive outcome.
If the possibility that Bob obtains an inconclusive outcome is excluded, then Bob cannot carry out the measurement which discriminates Alice’s pure states without an error. This is because nonorthogonal pure states cannot be perfectly discriminated, according to quantum theory.
When the generalized measurement is considered, Bob needs to extend the Hilbert space, where Alice’s pure state resides. If the Hilbert space of Alice (Bob) is denoted as H A ( H B ), the task of generalized measurement should consider a unitary operator U A B : H A H B H A H B , where Alice’s pure state resides in H A and the state of Bob’s auxiliary system is found in H B .
After the unitary operator U A B is performed, Bob’s composite state is measured via a projective measurement. Bob then discriminates Alice’s pure states without any error, which is obtained by the projective measurement. The structure of U A B depends on how Bob constructs the projective measurement.

3.1. The Structure of Unambiguous Discrimination (UD) and Sequential State Discrimination (SSD)

First, if Bob only performs a local projective measurement on his ancilla system, the structure of U A B is:
U A B | ψ i A | b B = α i | ϕ i A | i B + 1 α i | ϕ 0 A | 0 B .
Bob’s local projective measurement is expressed as { | i i | } i = 0 2 . The non-negative real value α i is the probability that Bob obtains the conclusive outcome i, and 1 α i is the probability that Bob obtains the inconclusive outcome (see Figure 3). A controlled-unitary operator U c performs | ϕ 0 | 0 | ϕ i | 0 and | ϕ i | i | ϕ i | i . Therefore, we can consider U A B as U c U A B U A B , without any loss of generality. Therefore, Equation (3) can also be expressed as
U A B | ψ i A | b B = | ϕ i A { α i | i B + 1 α i | 0 B } .
The necessary and sufficient condition for global unitary operator of Equations (3) and (4) can be obtained by the following Lemma [47].
Lemma 1.
Consider two sets { | ψ 1 , , | ψ N } and { | ϕ 1 , , | ϕ N } , which consist of finite vectors. For i { 1 , , N } , the necessary and sufficient condition for global unitary operator performing U | ψ i = | ϕ i is that for i , j { 1 , , N } , one has ψ i | ψ j = ϕ i | ϕ j .
Applying this Lemma to Equations (3) and (4), the necessary and sufficient condition for U A B and U A B is given, as follows:
ψ i | ψ j = ( 1 α i ) ( 1 α j ) ϕ i | ϕ j .
In other words, the strategy of quantum state discrimination when considering Equations (3) and (4) has the identical constraint. This implies that, without losing consistency, one can choose the formalism of Equation (4). (If the post-measurement state of Bob is given by one of the set { | ϕ 1 , | ϕ 2 } , then Charlie can discriminate the post-measurement state of Bob without any error. Therefore, the formalism of Equation (4) provides sequential state discrimination (SSD) of Bob and Charlie.)
Suppose that Alice prepares one of two pure states | ψ 1 , | ψ 2 . Here, let us assume that ψ 1 | ψ 2 is a real number. Subsequently, the explicit form of U A B is expressed as [11]
U A B = 1 1 s 2 | ϕ 1 ψ ˜ 1 | A | η 1 b | B + | ϕ 2 ψ ˜ 2 | A | η 2 b | B + V .
Here, s = ψ 1 | ψ 2 , | ψ ˜ i = | ψ i | ψ j ψ j | ψ i and | η i = α i | i + 1 α i | 0 . V is an operator, which acts on the subspace of { | 1 , | 2 } . This explicitly means that V | ψ i A | b B = 0 for all i { 1 , 2 } . When Equation (5) is satisfied, the structure of U A B provides various explicit forms of two input state | ψ 1 , | ψ 2 and post-measurement states | ϕ 1 , | ϕ 2 . For instance, an explicit form of | ψ 1 , | ψ 2 can be given by
| ψ j = 1 + s 2 | 0 + ( 1 ) j + 1 1 s 2 | 1 .
Afterwards, the explicit form of post-measurement states is provided by
| ϕ j = 1 + s 2 | 0 + ( 1 ) j + 1 1 s 2 | 1 , s = s ( 1 α 1 ) ( 1 α j ) .
When explicit forms of input states and post-measurement states are provided, U A B is determined. In UD, Bob discriminates pure states of Alice optimally. Therefore, the post-measurement states of Bob are completely overlapped ( s = 1 ). According to explicit form of Equation (6), the post-measurement states become | ϕ 1 = | ϕ 2 = | 0 , which are identical. (Suppose that | ϕ 1 = | ϕ 2 = | + . Because there exists an incoherent unitary operator performing | + | 0 , the explicit form of post-measurement states cannot be fixed. In fact, the incoherent unitary operator acts on Alice’s system and it does not affect the optimal success probability and optimal conditions.) This implies that, in UD, the coherence of Alice’s ensemble is localized in Bob’s ancilla system.
In Equation (4), the unitary operator U A B generates a post-measurement state | ϕ i , which corresponds to the measurement outcome i. Therefore, there is a subsequent measurement, which can extract an information from Bob’s post-measurement state, if Bob performs a nonoptimal unambiguous discrimination. If Charlie constructs a subsequent measurement, Alice, Bob and Charlie can perform sequential state discrimination [10]. In this case, Charlie’s measurement includes the unitary operator U A C : H A H C H A H C , which is expressed as
U A C | ϕ i A | c C = | χ i A { α i | i C + 1 α i | 0 } C .
Charlie’s local projective measurement is expressed as { | i i | } i = 0 2 . The non-negative real value α i is the probability that Charlie obtains a conclusive result i, and 1 α i is the probability that Charlie obtains a inconclusive result. The structure of sequential state discrimination (SSD) consists of U A B in Equation (4) and U A C in Equation (7). The structure of Charlie’s measurement depends on the setting of Bob’s measurement [10]. From Bob’s viewpoint, whether his measurement has structure of UD or SSD depends only on whether he performs an optimal discrimination or not. Because UD does not include Charlie, Bob has to optimally discriminate Alice’s states. However, in SSD, Bob should not perform optimal discrimination. If Bob performs the optimal unambiguous discrimination, then Charlie cannot perform unambiguous discrimination on Bob’s post-measurement states.

3.2. Structure of Assisted Optimal State Discrimination (AOSD)

Second, if Bob performs a projective measurement on both Alice’s system and his own, the unitary operator V A B is in the form [22]
V A B | ψ 1 A | 0 B = 1 | α 1 | 2 | 0 A | 0 B + α 1 | Φ A | 1 B , V A B | ψ 2 A | 0 B = 1 | α 2 | 2 | 1 A | 0 B + α 2 | Φ A | 1 B ,
where { | 0 , | 1 } is the orthonormal basis which consists of H A and H B . It is also apparent that | Φ = cos β | 0 + sin β e i δ | 1 . Here, the inner product ψ 1 | ψ 2 is expressed as α 1 * α 2 = | ψ 1 | ψ 2 | e i δ .
Bob performs a local projective measurement { | i i | } i = 0 1 on each system X { A , B } (See Figure 4). Here, | α i | is the probability that Bob obtains the conclusive result i, and 1 | α i | 2 is the probability that Bob obtains the inconclusive result. If Bob obtains a conclusive result “0” by measuring system B, then he can discriminate Alice’s pure state, from the measurement outcome on system A. If the measurement outcome of system A is i, then, without any error, Bob can conclude that Alice’s pure state is | ψ i . Meanwhile, if Bob obtains the conclusive result “1” by measuring system B, he cannot discriminate Alice’s pure states. Hence, the measurement outcome on system B informs Bob as to whether the measurement outcome is conclusive or not, and the result on system A tells Bob which pure state Alice has prepared.
This structure is known as assisted optimal state discrimination (AOSD). However, every case of AOSD uses both of the local projective measurements. Suppose that Bob discriminates one of Alice’s pure states(in this case, it is called AOSD1). Bob then only needs the measurement outcome on system B. Meanwhile, if Bob discriminates every pure state of Alice (in this case, it is called AOSD2), Bob should consider every measurement outcome.

4. Investigating Coherence Distribution in Various Protocols

4.1. Coherence Distribution in UD and SSD

Because the unitary operators of UD and SSD have the same structure, the coherence distribution of UD and SSD can be analyzed while using the same geometric structure. This geometric structure comes from the necessary and sufficient condition that the unitary operator U A B exists. Because U A B preserves the inner product between two pure states, the necessary and sufficient conditon that U A B exists is expressd as [14,16]
( 1 α 1 ) ( 1 α 2 ) s 2 .
Here, s | ψ 1 | ψ 2 | . In Equation (8), it is assumed that, for post-measurement states | ϕ 1 and | ϕ 2 , | ϕ 1 | ϕ 2 | 1 . The set of two-dimensional real vectors ( α 1 , α 2 ) , which satisfies Equation (8), can be geometrically expressed, as seen in Figure 5. Here, Bob’s measurement setting has one-to-one correspondence with a real vector ( α 1 , α 2 ) . Additionally Bob’s optimal measurement corresponds to a tangential point between the curve Q 1 P Q 2 and the line P s ( B ) = q 1 α 1 + q 2 α 2 (here, P s ( B ) is the average success probability of Bob).
In many discrimination strategies, Alice informs Bob of her prior probability distribution. This means that, from the viewpoint of Bob, Alice’s state is expressed as the initial ensemble (or average state) q 1 | ψ 1 ψ 1 | + q 2 | ψ 2 ψ 2 | [11,22]. Therefore, the unitary operator U A B will produce an average state, expressed as
ρ A B = U A B ( q 1 | ψ 1 ψ 1 | + q 2 | ψ 2 ψ 2 | ) A | b b | B U A B = i { 1 , 2 } q i | ϕ i ϕ i | A { α i | i + 1 α i | 0 } { α i i | + 1 α i 0 | } B .
In UD, the post-measurement states become identical, which means that | ϕ 1 = | ϕ 2 . Therefore, ρ A ( = Tr B ρ A B ) is an incoherent state. Meanwhile, in SSD, | ϕ 1 and | ϕ 2 are neither orthogonal nor identical. Therefore, ρ A = q 1 | ϕ 1 ϕ 1 | + q 1 | ϕ 2 ϕ 2 | has nonzero coherence. Therefore, UD and SSD have a difference in coherence distribution.
Now, let us evaluate coherence distribution of UD and SSD by using measure of coherence. Because Alice’s two pure states are non-orthogonal, the initial ensemble consists of nonzero coherence. Now, we investigate how the unitary operator U A B distributes the coherence of the initial ensemble. First, let us consider the maximum RQC of system B. The maximum RQC of system B is expressed, as [15,33]
C rel . ent ( ) ( ρ B ) = 1 H ( 4 q 1 q 2 { 1 ( 1 α 1 ) ( 1 α 2 ) } ) .
Hence, C rel . ent ( ) ( ρ B ) is expressed as a function of ( α 1 , α 2 ) . Here, H ( x ) is a function of entropy: H ( x ) = k = 0 1 1 + ( 1 ) k 1 x 2 log 2 1 + ( 1 ) k 1 x 2 , where x [ 0 , 1 ] . According to Equation (9), as ( 1 α 1 ) ( 1 α 2 ) becomes closer to s 2 , C rel . ent ( ) ( ρ B ) becomes closer to the maximum. This implies that if Bob performs an optimal unambiguous discrimination, then C rel . ent ( ) ( ρ B ) will reach the maximum.
Furthermore, when ( α 1 , α 2 ) corresponds to the optimal measurement that exists on curve Q 1 P Q 2 , two post-measurement states | ϕ 1 and | ϕ 2 overlap completely [14,16]. This implies that, in UD, the coherence in Alice’s initial ensemble is localized to Bob’s auxiliary system via unitary operator U A B .
In this time, let us assume that Bob and Charlie perform sequential state discrimination. If vector ( α 1 , α 2 ) that correponds to Bob’s measurement is on curve Q 1 P Q 2 , then Charlie cannot perform unambiguous discrimination. Therefore, the vector ( α 1 , α 2 ) should be inside sector Q 1 O Q 2 . Because the success probability of sequential state discrimination is given as function P s ( B , C ) ( α 1 , α 2 ) , the optimal vector ( α 1 , α 2 ) always satisfies the equality P s ( B , C ) ( α 1 , α 2 ) = 0 . We can numerically verify that a vector, satisfying a zero-gradient condition, will always be on curve B 1 A 1 A 2 B 2 . Every vector on this curve satisfies:
( 1 α 1 ) ( 1 α 2 ) = s ( = ( s ) 2 ) .
Equation (10) is equivalent to an argument proposed by J. A. Bergou et al. [10].
Next, we investigate symmetrized discord to understand the RQC localization in SSD. Here, entropic quantum discord is derived as [11,15]
D A ( ρ A B ) = H ( τ A ) H ( τ E ) + H ( τ B τ A B E ) , D B ( ρ A B ) = H ( τ B ) H ( τ E ) + H ( τ A τ A B E ) .
Here, the tangles τ A , τ B , τ E , τ A B E are given as
τ A = 4 q 1 q 2 { 1 s 2 ( 1 α 1 ) ( 1 α 2 ) } , τ B = 4 q 1 q 2 { 1 ( 1 α 1 ) ( 1 α 2 ) } , τ E = 4 q 1 q 2 ( 1 s 2 ) , τ A B E = 4 q 1 q 2 { 1 s 2 ( 1 α 1 ) ( 1 α 2 ) } { 1 ( 1 α 1 ) ( 1 α 2 ) } .
Because ρ A B is rank-2, Equation (11) is derived from the Koashi–Winter formula [48].
According to Equation (11) and Equation (12), symmetrized discord is also given as a function of ( α 1 , α 2 ) . Therefore, we numerically find an optimal vector that maximizes the symmetrized discord. Consequently, we can see that the optimal vector ( α 1 , α 2 ) always exists on a curve A 1 B 1 B 2 A 2 . This implies that, in SSD, the coherence in Alice’s initial ensemble is distributed to both system A and B. In other words, the coherence of ρ A B is localized to neither system A nor B.
Observation 1.
Suppose that Alice prepares one of two pure states. In UD, the unitary operator U A B localizes the coherence in Alice’s initial ensemble into system B. Meanwhile, in SSD, U A B distributes the coherence in Alice’s initial ensemble to both systems A and B.
From Observation 1, we propose that coherence distribution obviously depends on which strategy Bob chooses. If Bob chooses UD, the coherence in the initial ensemble is localized in the ancilla system. If Bob chooses SSD, the coherence in the initial ensemble is not localized in B.

4.2. Coherence Distribution in AOSD1 and AOSD2

Here, we investigate the coherence distribution in the unitary operator V A B , where assisted optimal state discrimination is performed.
The unitary operator V A B transforms Alice’s initial ensemble into the following:
ω A B = V A B ( q 1 | ψ 1 ψ 1 | + q 2 | ψ 2 ψ 2 | ) A | b b | B V A B .
According to Zhang, Chen, Kwek, and Vedral [22], zero concurrence in the average state σ A B is analytically expressed as
δ = θ , β = tan 1 q 1 | α 1 | 1 | α 1 | 2 q 2 | α 2 | 1 | α 2 | 2 .
Because the success probability is not affected by the two parameters δ and θ , we can assume that δ = θ = 0 without any loss of generality. δ and θ do not affect the success probability. In other words, ψ 1 | ψ 2 can be considered as a real number.
Assume that q 1 q 2 holds. When ψ 1 | ψ 2 q 1 / q 2 , Bob’s optimal strategy is described as AOSD2. In this case, ρ A B is given, as follows [22]:
ω A B = | ξ 1 ξ 1 | A | 0 0 | B + | Φ Φ | A | ξ 2 ξ 2 | B .
Here, | ξ i is provided, as follows:
| ξ 1 = q 1 q 2 q 1 | α 1 | 2 + q 1 | α 2 | 2 1 | α 1 | 2 α 2 | 0 1 | α 2 | 2 α 1 | 1 , | ξ 2 = ( 1 | α 1 | 2 ) | α 1 | 2 p 1 2 + ( 1 | α 2 | 2 ) | α 2 | 2 p 2 2 q 1 | α 1 | 2 + q 1 | α 2 | 2 | 0 + q 1 | α 1 | 2 + q 1 | α 2 | 2 α 1 | α 1 | | 1 .
According to Ref. [22], D B ( ω A B ) is nonzero. This implies that the RQC in ω A B is not localized in system B. According to structure of ω A B , the partial state ω A is an ensemble that is composed of two nonorthogonal pure states. Hence, RQC is not localized in system B.
Meanwhile, if q 1 / q 2 ψ 1 | ψ 2 1 , Bob’s optimal strategy is described as AOSD1. In this case, ω A B is given, as follows [22]:
ω A B = | 1 1 | A { p 1 | 1 1 | + p 2 | μ μ | } B .
Here, | μ becomes
| μ = 1 s 2 | 0 + α 2 e i δ | 1 .
Clearly, ρ A is an incoherent state. Furthermore, D B ( ω A B ) is obviously zero, since ω A B is a product state. This implies that the RQC in ω A B has the potential to be localized in system B. According to Zhang, Chen, Kwek, and Vedral [22], the partial state ω A is given as a pure incoherent state. Therefore, the RQC shown in ω A B is obviously localized in system B.
Observation 2.
Suppose that Alice prepares one of two pure states. In AOSD2, the coherence in ω A B is not localized in system B. Meanwhile, in AOSD1, the coherence in ω A B is localized in system B.
From Observation 2, we can tell that the coherence distribution in AOSD also depends on which strategy Bob chooses. If Bob chooses AOSD2, the coherence is distributed to both system A and B. If Bob chooses AOSD1, the coherence is localized in system B. These results imply that the structure of generalized measurements performing unambiguous discrimination, sequential state discrimination, and assisted optimal state discrimination can be understood by coherence distribution.
Zhang, Chen, Kwek, and Vedral [22] attempted to explain the structure of AOSD in terms of quantum discord (or dissonance) However, if there is significant overlap between two pure states, the entropic quantum discord becomes zero. In other words, the relationship between AOSD and entropic quantum discord holds only when specific constraints concerning overlap are imposed. Meanwhile, According to Figure 6, the RQC of system B is nonzero in the region q 1 / q 2 ψ 1 | ψ 2 1 , where it is assumed that q 1 < q 2 . Therefore, Observation 2 implies that there is a consistent relationship between coherence distribution and AOSD.

5. Generalization of Coherence Distribution to 2 Mixed States Discrimination

Here, let us suppose that Alice prepares a mixed state ρ i { ρ 1 , ρ 2 } , with a prior probability q i . If the support of ρ 1 and ρ 2 do not ovelap completely, then Bob’s measurement can discriminate Alice’s mixed state without any error [49,50]. Additionally, the POVM element M 1 ( M 2 ) consists of the kernel of ρ 2 ( ρ 1 ). Unfortunately, the general structure of POVM, which can discriminate a general mixed state without an error, has been unknown yet. However, if Alice’s Hilbert space has a special form in H A = H A ( 1 ) H A ( 2 ) H A ( R ) , the structure of POVM for unambiguous discrimination is well known [51]. If we assume that the state space S ( H A ) is constructed from this form of Hilbert space, then Alice’s mixed state can be expressed as
ρ i = r i ( 1 ) | r i ( 1 ) r i ( 1 ) | r i ( R ) | r i ( R ) r i ( R ) | .
Here, R is maximum rank of ρ i . If | r 1 ( Q ) | r 2 ( Q ) | < 1 holds for all of Q { 1 , 2 , , R } , then Bob can discriminate Alice’s mixed states without any error. Fortunately, Bob’s POVM consists of R sub-POVMs, where each sub-POVM discriminates | r i ( Q ) , | r i ( Q ) H A ( Q ) ( Q { 1 , 2 , , R } ) without any error. This implies that we can consistently substitute our argument of pure states into that of mixed states (the detailed evaluation can be found in Appendix A and Appendix B).

5.1. Generalized Witness of RQC Localization

Now, let us consider ρ i S ( H A ( 1 ) H A ( R ) ) . That is, unitary operator U A B { U A B , V A B } maps S ( H A ( 1 ) H A ( R ) H B ) onto itself. This unitary operator U A B transforms Alice’s initial ensemble into an average state expressed as
ρ A B = U A B ( q 1 ρ 1 + q 2 ρ 2 ) A | b b | B U A B = Q = 1 R σ A B ( Q ) = Q = 1 R ( Tr σ A B ( Q ) ) σ A B ( Q ) .
Here, σ A B ( Q ) = σ A B ( Q ) / Tr σ A B ( Q ) S ( H A ( Q ) H B ) is a normalized positive-semidefinite operator. Because every σ A B ( Q ) is of rank-2, then the Koashi–Winter formula can be used in order to obtain a lower bound for the entropic quantum discord and symmetrized discord:
D A ( ρ A B ) Q = 1 R ( Tr σ A B ( Q ) ) D A ( σ A B ( Q ) ) W A ( ρ A B ) , D B ( ρ A B ) Q = 1 R ( Tr σ A B ( Q ) ) D B ( σ A B ( Q ) ) W A ( ρ A B ) , D A B ( ρ A B ) Q = 1 R ( Tr σ A B ( Q ) ) D A B ( σ A B ( Q ) ) W A B ( ρ A B ) .
Because δ X ( σ A B ( Q ) ) D X ( σ A B ( Q ) ) holds for all of Q { 1 , 2 , , R } and X { A , B } , the lower bound of the RQC discrepancy in ρ A B becomes:
δ A ( ρ A B ) = Q = 1 R ( Tr σ A B ( Q ) ) δ A ( σ A B ( Q ) ) W A ( ρ A B ) , δ B ( ρ A B ) = Q = 1 R ( Tr σ A B ( Q ) ) δ B ( σ A B ( Q ) ) W B ( ρ A B ) , δ A ( ρ A B ) δ B ( ρ A B ) W A B ( ρ A B ) .
In Equation (15), W A ( ρ A B ) , W B ( ρ A B ) , and W A B ( ρ A B ) describe the generalized RQC discrepancy in ρ A B . If R = 1 , the generalized RQC discrepancy is equivalent to the entropic quantum discord and symmetrized discord of pure states. Equation (15) implies that the generalized RQC discrepancy can be a witness of RQC localization.

5.2. Generalization of Coherence Distribution in UD and SSD

In cases of UD and SSD, unitary operator U A B has the specific form of U A B = U A B ( 1 ) U A B ( R ) . Here, U A B ( Q ) is sub-unitary and it is defined as
U A B ( Q ) | r i ( Q ) A | b B = | s i ( Q ) A { α i ( Q ) | i B + 1 α i ( Q ) | 0 B } .
After U A B is terminated, then Bob’s local projective measurement { | i i | } i = 0 2 is performed on system B.
The necessary and sufficient condition that U A B ( Q ) must exist is expressed in a similar manner while using Equation (10). This implies that Bob’s measurement consists of R real vectors ( α 1 ( Q ) , α 2 ( Q ) ) C ( Q ) . Here, each convex set C ( Q ) has the same structure as that seen in Figure 5. Therefore, we can apply our argument of SSD to cases, including mixed states [14].
From the structure of Equation (14), the maximum RQC of ρ A B is explicitly derived as
C rel . ent ( ) ( ρ B ) = Q = 1 R ( Tr σ A B ( Q ) ) { 1 H ( τ B ( Q ) ) } = 1 Q = 1 R ( Tr σ A B ( Q ) ) H ( τ B ( Q ) ) .
If the prior probabilities of the two mixed states ρ 1 and ρ 2 are given as q 1 and q 2 , respectively, then the entire unambiguous discrimination consists of R discrimination problems, where the pure state | r i ( Q ) { | r 1 ( Q ) , | r 2 ( Q ) } is prepared with the prior probability q i r i ( Q ) / Tr [ σ A B ( Q ) ] . Hence, tangle τ B ( Q ) is given as
τ B ( Q ) = 4 q 1 r 1 ( Q ) Tr σ A B ( Q ) q 2 r 2 ( Q ) Tr σ A B ( Q ) { 1 ( 1 α 1 ( Q ) ) ( 1 α 2 ( Q ) ) } .
For all of Q { 1 , 2 , , R } , if ( α 1 ( Q ) , α 2 ( Q ) ) is on the boundary of the convex set C ( Q ) , the maximum RQC of ρ B becomes maximized. Meanwhile, the support between the two post-measurement states is completely overlapped. Therefore, system A does not contain coherence. In conclusion, we can successfully extend Observation 1 to cases of mixed states.
Observation 3.
Suppose that Alice prepares one out of two mixed state. In UD, the unitary operator U A B localizes the coherence in Alice’s initial ensemble into system B. In SSD, U A B distributes the coherence in Alice’s initial ensemble to both system A and B.

5.3. Generalization of Coherence Distribution in AOSD1 and AOSD2

Likewise, the unitary operator V A B also has a specific form of V A B = V A B ( 1 ) V A B ( R ) . Here, V A B ( Q ) performs
V A B ( Q ) | r 1 ( Q ) A | 0 B = 1 | α 1 ( Q ) | 2 | 0 ( Q ) A | 0 B + α 1 ( Q ) | ϕ ( Q ) A | 1 B , V A B ( Q ) | r 2 ( Q ) A | 0 B = 1 | α 2 ( Q ) | 2 | 1 ( Q ) A | 0 B + α 1 ( Q ) | ϕ ( Q ) A | 1 B .
Here, { | 0 ( Q ) , | 1 ( Q ) } is an orthonormal basis consisting of H A ( Q ) . Moreover, | ϕ ( Q ) = cos β Q | 0 ( Q ) + sin β Q e i δ Q | 1 ( Q ) . The inner product between two vectors r 1 ( Q ) | r 2 ( Q ) is expressed as α 1 ( Q ) α 2 ( Q ) = | r 1 ( Q ) | r 2 ( Q ) | e i δ Q . After V A B is terminated, Bob performs the projective measurement { | 0 0 | , | 1 1 | } on his system.
Likewise, in UD and SSD, in AOSD, V A B maps S ( H A ( 1 ) H A ( R ) H B ) to itself.
Therefore, we can successfully extend Observation 2 to instances of mixed states.
Observation 4.
Suppose that Alice prepares one out of two mixed states. Subsequently, In AOS12, the coherence of an initial bipartite ensemble is localized in system B. Meanwhile, in an AOSD2, the coherence of in an initial bipartite ensemble is not localized in system B.

6. Conclusions and Future Work

In this paper, we investigated how the distribution of coherence occurs when generalized measurement performs various types of unambiguous discrimination. By investigating the RQC localization, we showed that the coherence distribution depends on the types of quantum unambiguous discrimination (See Figure 7). In other words, we found that the types of quantum unambiguous discrimination determine how coherence is distributed in performing unambiguous discrimination. Further, we showed that our argument could be extended to cases, including two mixed states.
In fact, generalized measurement can be applied to performing not only unambiguous discrimination, but also minimum error discrimination [52,53,54,55,56,57,58] and the fixed rate of inconclusive result [59,60]. Therefore, while using the argument provided in this work, it is interesting to investigate whether coherence distribution can explain the structure of generalized measurements performing other quantum state discriminations. In other words, it can be important to study coherence distribution in various quantum state discrimination strategies.
Beyond the discrimination tasks, a generalized measurement can be applied to various quantum information and computation tasks. The quantum classifier [32], whose efficiency is given as O ( N ) for the number of data N, can be a good example. In training a quantum classifier, which is composed of (a), a parametric multilayer quantum circuit performed on both feature register and index register (b) local projective measurements performed on index register, it is shown that the successfully trained parametric multilayer quantum circuit distributes coherence in the index register [61]. It can be understood that, in the generalized measurement of the problem, the measurement on the index register is important. Further, in the quantum classifier, the Grover algorithm depletes the index register’s coherence as a resource [28,30]. Therefore, investigating coherence distribution in generalized measurement may provide a clue for quantum advantage in quantum tasks.

Author Contributions

Conceptualization, M.N. and Y.K.; Methodology, M.N.; Investigation, M.N.; Software, M.N.; Writing–first draft, M.N. and Y.K.; Revision, Y.K. All authors have read and agreed to the published version of the manuscript.

Funding

This work is supported by the Basic Science Research Program through the National Research Foundation of Korea funded by the Ministry of Education, Science and Technology (NRF2018R1D1A1B07049420) and Institute of Information & communications Technology Planning & Evaluation(IITP) grant funded by the Korea government(MSIT) (No.2020001343, Artificial Intelligence Convergence Research Center (Hanyang University ERICA)).

Conflicts of Interest

The authors declare no conflict of interest.

Appendix A. Deriving the Relationship between Discord and Generalized Witness in the Case of Two Mixed States

Firstly, the rank-2 state is considered to be
ρ A B = q 1 r 1 | s 1 s 1 | A | B 1 B 1 | B q 2 r 2 | s 2 s 2 | A | B 2 B 2 | B + q 1 r ¯ 1 | s ¯ 1 s ¯ 1 | A | B ¯ 1 B ¯ 1 | B q 2 r ¯ 2 | s ¯ 2 s ¯ 2 | A | B ¯ 2 B ¯ 2 | B = σ A B σ ¯ A B .
Although we consider the case in which the states are rank-2, our method can be extended to the rank-N states case. Obviously, the bipartite state ρ A B resides in state space S ( H A B H ¯ A B ) . Here, let us consider the entropic quantum discord D A ( ρ A B ) . Since Equation (A1) is decomposed as a direct sum between the two rank-2 positive semidefinite operator, POVM { M k } k = 1 N can also be expressed as
M k ( A ) = [ Π k Γ k Γ k Π ¯ k ] .
Here, Π k ( Π ¯ k ) is a positive semidefinite operator defined over Hilbert space H ( H ¯ ) and Γ k ( Γ ¯ k ) is a linear map in which H H ¯ ( H ¯ H ).
As M k is positive semidefinite, v | M k | v is also positive semidefinite for all | v H H ¯ . Obviously, | x | 0 ¯ and | 0 | x ¯ are also elements of H H ¯ . Here, | 0 ( | 0 ¯ ) is zero vector in sub Hilbert space H ( H ¯ ). Thus, ( x | 0 ¯ | ) M k ( | x | 0 ¯ ) = x | Π k | x and ( 0 | x ¯ | ) M k ( | 0 | x ¯ ) = x ¯ | Π ¯ k | x ¯ are also positive semidefinite for all | x H and | x ¯ H ¯ . In other words, if M k is positive semidefinite, then Π k and Π ¯ k are also positive semidefinite.
The completeness of two sub-POVMs { Π k } k = 1 N , { Π ¯ k } k = 1 N is directly checked as
k = 1 N M k ( A ) = k = 1 N [ Π k Γ k Γ k Π ¯ k ] = [ k = 1 N Π k k = 1 N Γ k k = 1 N Γ k k = 1 N Π ¯ k ] = [ I A O O I ¯ A ] = I A .
Here, O is the null operator. I A is an identity operator over Hilbert space H A B . I A ( I ¯ A ) is an identity operator over Hilbert space H A ( H ¯ A ). Therefore, if k M k = I A , then the equalities k Π k = I A , k Π ¯ k = I ¯ A , k Γ k = O automatically hold. Without loss of generality, we can assume that every nonzero operator Γ k satisfies k Γ k = O . That is, because the explicit form of Γ k does not affect the expression for the lower bound of quantum discord. Therefore, two sub-POVMs { Π k } k = 1 N and { Π ¯ k } k = 1 N also satisfy completeness condition.
Substituting Equation (A2) into Equation (A1), we obtain the expression for p k and ρ B | k :
p k = Tr ( σ A B Π k I B ) + Tr ( σ ¯ A B Π ¯ k I B ) , ρ B | k = Tr A ( σ A B Π k I B ) + Tr A ( σ ¯ A B Π ¯ k I B ) p k .
Using concavity of von Neumann entropy, we derive the inequality of conditional entropy as
k = 1 N p k S ( ρ B | k ) = k = 1 N { Tr ( σ A B Π k I B ) + Tr ( σ ¯ A B Π ¯ k I B ) } S Tr A ( σ A B Π k I B ) + Tr A ( σ ¯ A B Π ¯ k I B ) Tr ( σ A B Π k I B ) + Tr ( σ ¯ A B Π ¯ k I B ) k = 1 N Tr ( σ A B Π k I B ) S Tr A ( σ A B Π k I B ) Tr ( σ A B Π k I B ) + Tr ( σ ¯ A B Π ¯ k I B ) S Tr A ( σ ¯ A B Π ¯ k I B ) Tr ( σ ¯ A B Π ¯ k I B ) = ( Tr σ A B ) k = 1 N p k S ( σ B | k ) + ( Tr σ ¯ A B ) k = 1 N p ¯ k S ( σ ¯ B | k ) .
Here, we define σ A B and σ ¯ A B as σ A B : = σ A B / Tr [ σ A B ] and σ ¯ A B := σ ¯ A B / Tr [ σ ¯ A B ] .
In order that the quantum discord is evaluated, we minimize the conditional entropy under every POVM { M k ( A ) } k = 1 N [34]. Since POVM element M k ( A ) consists of Π k , Γ k and Π ¯ k , the minimum conditional entropy satisfies
min { M k ( A ) } k = 1 N k = 1 N p k S ( ρ B | k ) = min { Π k } k = 1 N , { Γ k } k = 1 N , { Π ¯ k } k = 1 N k = 1 N p k S ( ρ B | k ) = min { Π k } k = 1 N , { Π ¯ k } k = 1 N k = 1 N p k S ( ρ B | k ) min { Π k } k = 1 N ( Tr σ A B ) k = 1 N p k S ( σ B | k ) + min { Π ¯ k } k = 1 N ( Tr σ ¯ A B ) k = 1 N p k S ( σ ¯ B | k ) .
As p k and ρ B | k are independent on Γ k , conditional entropy is also independent on { Γ k } k = 1 N . Therefore, the second equality holds. Inequality can be derived from the convexity of von Neumann entropy. We apply the Koashi-Winter formula [48] to final expression. The purification of σ A B and σ ¯ A B is expressed as
| ψ A B E = q 1 r 1 q 1 r 1 + q 2 r 2 | s 1 A | B 1 B | e 1 E + q 2 r 2 q 1 r 1 + q 2 r 2 | s 2 A | B 2 B | e 2 E , | ψ ¯ A B E ¯ = q 1 r ¯ 1 q 1 r ¯ 1 + q 2 r ¯ 2 | s ¯ 1 A | B ¯ 1 B | e ¯ 1 E ¯ + q 2 r ¯ 2 q 1 r ¯ 1 + q 2 r ¯ 2 | s ¯ 2 A | B ¯ 2 B | e ¯ 2 E ¯ .
Here, { | e 1 , | e 2 } ( { | e ¯ 1 , | e ¯ 2 } ) is orthonormal basis constructing system E(system E ¯ ). According to the Koashi-Winter formula, we can derive the inequality as [11,15]
min { M k ( A ) } k = 1 N k = 1 N p k S ( ρ B | k ) ( Tr σ A B ) E f ( σ B E ) + ( Tr σ ¯ B E ¯ ) E f ( σ ¯ B E ¯ ) ,
where E f ( · ) is entanglement of formation [62]. We can easity derive the equality S ( ρ A ) S ( ρ A B ) = ( Tr σ A B ) { S ( σ A ) S ( σ A B ) } ( Tr σ ¯ A B ) { S ( σ ¯ A ) S ( σ ¯ A B ) } . Hence, we obtain the inequality:
D A ( ρ A B ) = S ( ρ A ) S ( ρ A B ) + min { M k ( A ) } k = 1 N k = 1 N p k S ( ρ B | k ) ( Tr σ A B ) { S ( σ A ) S ( σ A B ) + E f ( σ B E ) } + ( Tr σ ¯ A B ) { S ( σ ¯ A ) S ( σ ¯ A B ) + E f ( σ ¯ B E ) } = ( Tr σ A B ) D A ( σ A B ) + ( Tr σ ¯ A B ) D A ( σ ¯ A B ) = W A ( ρ A B ) .
A.2 Deriving the relationship between discord D B ( ρ A B ) and generalized witness W B ( ρ A B ) Likewise, we can obtain the expression for p k and ρ A | k as
p k = Tr ( σ A B I A M k ( B ) ) + Tr ( σ ¯ A B I ¯ A M k ( B ) ) , ρ A | k = Tr B ( σ A B I A M k ( B ) ) Tr B ( σ ¯ A B I ¯ A M k ( B ) ) p k .
Here, ρ A | k is decomposed as direct sum between the two positive semidefinite operators. Therefore, von Neumann entropy S ( ρ A | k ) satisfies
S ( ρ A | k ) = S ( Tr ( σ A B I A M k ( B ) ) Tr ( σ A B I A M k ( B ) ) + Tr ( σ ¯ A B I ¯ A M k ( B ) ) Tr B ( σ A B I A M k ( B ) ) Tr ( σ A B I A M k ( B ) ) + Tr ( σ ¯ A B I ¯ A M k ( B ) ) Tr ( σ A B I A M k ( B ) ) + Tr ( σ ¯ A B I ¯ A M k ( B ) ) Tr B ( σ ¯ A B I ¯ A M k ( B ) ) Tr ( σ ¯ A B I ¯ A M k ( B ) ) ) = S Tr ( σ A B I A M k ( B ) ) Tr ( σ A B I A M k ( B ) ) + Tr ( σ ¯ A B I ¯ A M k ( B ) ) σ A | k + Tr ( σ ¯ A B I ¯ A M k ( B ) ) Tr ( σ A B I A M k ( B ) ) + Tr ( σ ¯ A B I ¯ A M k ( B ) ) σ ¯ A | k Tr ( σ A B I A M k ( B ) ) Tr ( σ A B I A M k ( B ) ) + Tr ( σ ¯ A B I ¯ A M k ( B ) ) S ( σ A | k ) + Tr ( σ ¯ A B I ¯ A M k ( B ) ) Tr ( σ A B I A M k ( B ) ) + Tr ( σ ¯ A B I ¯ A M k ( B ) ) S ( σ ¯ A | k ) .
Hence, conditional entropy satisfies
k = 1 N p k S ( ρ A | k ) k = 1 N Tr ( σ A B I A M k ( B ) ) S ( σ A | k ) + k = 1 N Tr ( σ ¯ A B I A M k ( B ) ) S ( σ ¯ A | k ) .
Also, minimum of conditional entropy also satisfies
min { M k ( B ) } k = 1 N p k S ( ρ A | k ) min { M k ( B ) } ( Tr σ A B ) k = 1 N p k S ( σ A | k ) + ( Tr σ ¯ A B ) k = 1 N p ¯ k S ( σ ¯ A | k ) Problem   I ( Tr σ A B ) min { M k ( B ) } k = 1 N p k S ( σ A | k ) + ( Tr σ ¯ A B ) min { M ¯ k ( B ) } k = 1 N p ¯ k S ( σ ¯ A | k ) Problem   II = ( Tr σ A B ) E f ( σ A E ) + ( Tr σ ¯ A B ) E f ( σ ¯ A E ¯ ) .
This inequality consists of two optimization problems (Problem I and Problem II). The Problem I contains additional equality constraint M k ( B ) = M ¯ k ( B ) ( k ) , but this constraint is not included in the Problem II. Therefore, minimum of the Problem I is not smaller than that of the Problem II. Finally, we obtain the lower bound of quantum discord as
D B ( ρ A B ) = S ( ρ B ) S ( ρ A B ) + min { M k ( B ) } k = 1 N p k S ( ρ A | k ) S ( ρ B ) S ( ρ A B ) + ( Tr σ A B ) E f ( σ A E ) + ( Tr σ ¯ A B ) E f ( σ ¯ A E ¯ ) = ( Tr σ A B ) D B ( σ A B ) + ( Tr σ ¯ A B ) D B ( σ ¯ A B ) = W B ( ρ A B ) .
A.3 Deriving the relationship between discord D A B ( ρ A B ) and generalized witness W A B ( ρ A B ) .
In this case, derivation is more straightforward. Substituting D A ( ρ A B ) and D B ( ρ A B ) into D A B ( ρ A B ) , we obtain
D A B ( ρ A B ) = D A ( ρ A B ) D B ( ρ A B ) ( Tr σ A B ) D A ( σ A B ) + ( Tr σ ¯ A B ) D A ( σ ¯ A B ) × ( Tr σ A B ) D B ( σ A B ) + ( Tr σ ¯ A B ) D B ( σ ¯ A B ) = ( Tr σ A B ) D A ( σ A B ) , ( Tr σ ¯ A B ) D A ( σ ¯ A B 2 ( Tr σ A B ) D B ( σ A B ) , ( Tr σ ¯ A B ) D B ( σ ¯ A B 2 ( Tr σ A B ) D A ( σ A B ) , ( Tr σ ¯ A B ) D A ( σ ¯ A B ) · ( Tr σ A B ) D B ( σ A B ) , ( Tr σ ¯ A B ) D B ( σ ¯ A B ) = ( Tr σ A B ) D A ( σ A B ) D B ( σ A B ) + ( Tr σ ¯ A B ) D A ( σ ¯ A B ) D B ( σ ¯ A B ) = ( Tr σ A B ) D A B ( σ A B ) + ( Tr σ ¯ A B ) D A B ( σ ¯ A B ) = W A B ( ρ A B ) .
In second inequality, the Cauchy Schwarz inequality is used: | | u | | 2 | | v | | 2 u · v (for all real vectors u , v ).

Appendix B. Deriving the Generalized RQC Discrepancy

In this Appendix, we derive the generalized RQC discrepancy. Two positive semidefinite operators σ A B and σ ¯ A B in Equation (A1) are defined over sub-Hilbert space H and H ¯ . Therefore, the entire Hilbert space H H ¯ consists of orthonormal basis { | v i ( A ) | v j ( B ) } i , j and { | v ¯ i ( A ) | v ¯ j ( B ) } i , j . Here, sub-Hilbert space H ( H ¯ ) is composed of { | v i ( A ) | v j ( B ) } i , j ( { | v ¯ i ( A ) | v ¯ j ( B ) } i , j ). Using this property of Hilbert space, we can evaluate von Neumann entropy of the incoherent state ρ P Q as [33]
S ( ρ P Q ) = i , j v i ( A ) v j ( B ) | ρ A B | v i ( A ) v j ( B ) log 2 v i ( A ) v j ( B ) | ρ A B | v i ( A ) v j ( B ) i , j v ¯ i ( A ) v ¯ j ( B ) | ρ A B | v ¯ i ( A ) v ¯ j ( B ) log 2 v ¯ i ( A ) v ¯ j ( B ) | ρ A B | v ¯ i ( A ) v ¯ j ( B ) = ( Tr σ A B ) i , j v i ( A ) v j ( B ) | σ A B Tr σ A B | v i ( A ) v j ( B ) log 2 v i ( A ) v j ( B ) | σ A B Tr σ A B | v i ( A ) v j ( B ) + log 2 ( Tr σ A B ) ( Tr σ ¯ A B ) i , j v ¯ i ( A ) v ¯ j ( B ) | σ ¯ A B Tr σ ¯ A B | v ¯ i ( A ) v ¯ j ( B ) log 2 v ¯ i ( A ) v ¯ j ( B ) | σ ¯ A B Tr σ ¯ A B | v ¯ i ( A ) v ¯ j ( B ) + log 2 ( Tr σ ¯ A B ) = ( Tr σ A B ) S ( σ P Q ) + ( Tr σ ¯ A B ) S ( σ ¯ P Q ) ( Tr σ A B ) log 2 ( Tr σ A B ) ( Tr σ ¯ A B ) log 2 ( Tr σ ¯ A B ) .
Also, the RQC of ρ A B is evaluated as
C rel . ent ( ρ A B , ρ P Q ) = S ( ρ P Q ) S ( ρ A B ) = ( Tr σ A B ) { S ( σ P Q ) S ( σ A B ) } + ( Tr σ ¯ A B ) { S ( σ ¯ P Q ) S ( σ ¯ A B ) } = ( Tr σ A B ) C rel . ent ( σ A B , σ P Q ) + ( Tr σ ¯ A B ) C rel . ent ( σ ¯ A B , σ ¯ P Q ) .
Next, we evaluate the RQC of system A and B. First, we consider the partial state ρ A :
ρ A = q 1 r 1 | s 1 s 1 | + q 2 r 2 | s 2 s 2 | + q 1 r ¯ 1 | s ¯ 1 s ¯ 1 | + q 2 r ¯ 2 | s ¯ 2 s ¯ 2 | = σ A + σ ¯ A .
As the supports of σ A and σ ¯ A are orthogonal, von Neumann entropy of ρ A is expressed as
S ( ρ A ) = S ( σ A + σ ¯ A ) = ( Tr σ A ) S ( σ A ) + ( Tr σ ¯ A ) S ( σ ¯ A ) ( Tr σ A ) log 2 ( Tr σ A ) ( Tr σ ¯ A ) log 2 ( Tr σ ¯ A ) = ( Tr σ A ) S ( σ A ) + ( Tr σ ¯ A ) S ( σ ¯ A ) ( Tr σ A B ) log 2 ( Tr σ A ) ( Tr σ ¯ A B ) log 2 ( Tr σ ¯ A ) .
As the partial state ρ P is given as ρ P = σ P σ ¯ P , von Neumann entropy of ρ P is also expressed as
S ( ρ P ) = i v i ( A ) | ρ A | v i ( A ) log 2 v i ( A ) | ρ A | v i ( A ) i v ¯ i ( A ) | ρ A | v ¯ i ( A ) log 2 v ¯ i ( A ) | ρ A | v ¯ i ( A ) = ( Tr σ A ) i v i ( A ) | σ A Tr σ A | v i ( A ) log 2 v i ( A ) | σ A Tr σ A | v i ( A ) + log 2 ( Tr σ A ) ( Tr σ ¯ A ) i v ¯ i ( A ) | σ ¯ A Tr σ ¯ A | v ¯ i ( A ) log 2 v ¯ i ( A ) | σ ¯ A Tr σ ¯ A | v ¯ i ( A ) + log 2 ( Tr σ ¯ A ) = ( Tr σ A ) S ( σ P ) + ( Tr σ ¯ A ) S ( σ ¯ P ) ( Tr σ A ) log 2 ( Tr σ A ) ( Tr σ ¯ A ) log 2 ( Tr σ ¯ A ) = ( Tr σ A B ) S ( σ P ) + ( Tr σ ¯ A B ) S ( σ ¯ P ) ( Tr σ A B ) log 2 ( Tr σ A ) ( Tr σ ¯ A B ) log 2 ( Tr σ ¯ A ) .
Therefore, the RQC of system A is derived as
C rel . ent ( ρ A , ρ P ) = S ( ρ P ) S ( ρ A ) = ( Tr σ A B ) { S ( σ P ) S ( σ A ) } + ( Tr σ ¯ A B ) { S ( σ ¯ P ) S ( σ ¯ A ) } = ( Tr σ A B ) C rel . ent ( σ A , σ P ) + ( Tr σ ¯ A B ) C rel . ent ( σ ¯ A , σ ¯ P ) .
Finally, we derive generalized RQC discrepancy δ A ( ρ A B ) as
δ A ( ρ A B ) = C rel . ent ( ρ A B , ρ P Q ) C rel . ent ( ρ A , ρ P ) = { ( Tr σ A B ) C rel . ent ( σ A B , σ P Q ) + ( Tr σ ¯ A B ) C rel . ent ( σ ¯ A B , σ ¯ P Q ) } { ( Tr σ A B ) C rel . ent ( σ A , σ P ) + ( Tr σ ¯ A B ) C rel . ent ( σ ¯ A , σ ¯ P ) } = ( Tr σ A B ) { C rel . ent ( σ A B , σ P Q ) C rel . ent ( σ A , σ P ) } + ( Tr σ ¯ A B ) { C rel . ent ( σ ¯ A B , σ ¯ P Q ) C rel . ent ( σ ¯ A , σ ¯ P ) } = ( Tr σ A B ) δ A ( σ A B ) + ( Tr σ ¯ A B ) δ A ( σ ¯ A B ) .
In a similar manner, the generalized RQC discrepancy δ B ( ρ A B ) is also derived as
δ B ( ρ A B ) = ( Tr σ A B ) δ B ( σ A B ) + ( Tr σ ¯ A B ) δ B ( σ ¯ A B ) .

References

  1. Ivanovic, I.D. How to differentiate between non-orthogonal states. Phys. Lett. A 1987, 123, 257. [Google Scholar] [CrossRef]
  2. Dieks, D. Overlap and distinguishability of quantum states. Phys. Lett. A 1988, 126, 303. [Google Scholar] [CrossRef]
  3. Peres, A. How to differentiate between non-orthogonal states. Phys. Lett. A 1988, 128, 19. [Google Scholar] [CrossRef]
  4. Jaeger, G.; Shimony, A. Optimal distinction between two non-orthogonal quantum states. Phys. Lett. A 1995, 197, 83. [Google Scholar] [CrossRef]
  5. Pang, S.; Wu, S. Optimum unambiguous discrimination of linearly independent pure states. Phys. Rev. A 2009, 80, 052320. [Google Scholar] [CrossRef] [Green Version]
  6. Bergou, J.A.; Futschik, U.; Feldman, E. Optimal Unambiguous Discrimination of Pure Quantum States. Phys. Rev. Lett. 2012, 108, 250502. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  7. Ha, D.; Kwon, Y. Analysis of optimal unambiguous discrimination of three pure quantum states. Phys. Rev. A 2015, 91, 062312. [Google Scholar] [CrossRef]
  8. Nielson, M.A.; Chuang, I.L. Quantum Computation and Quantum Information: 10th Anniversary Edition; Cambridge University Press: Cambridge, UK, 2010. [Google Scholar]
  9. Zhou, X.-F.; Liu, Q.; Zheng, Y.-S.; Guo, G.-C. Physical accessible transformation on a finite number of quantum states. Phys. Rev. A 2007, 75, 012321. [Google Scholar] [CrossRef] [Green Version]
  10. Bergou, J.A.; Feldman, E.; Hillery, M. Extracting Information from a Qubit by Multiple Observers: Towards a Theory of Sequential State Discrimination. Phys. Rev. Lett. 2013, 111, 100501. [Google Scholar] [CrossRef] [Green Version]
  11. Pang, C.-Q.; Zhang, F.-L.; Liang, M.-L. Sequential state discrimination and requirement of quantum dissonance. Phys. Rev. A 2013, 88, 042331. [Google Scholar] [CrossRef] [Green Version]
  12. Solis-Prosser, M.A.; Gonzalez, P.; Fuenzalida, J.; Gomez, S.; Xavier, G.B.; Delgado, A.; Lima, G. Experimental multiparty SSD. Phys. Rev. A 2016, 94, 042309. [Google Scholar]
  13. Hillery, M.; Mimih, J. Sequential discrimination of qudits by multiple observers. J. Phys. A Math. Theor. 2016, 50, 435301. [Google Scholar] [CrossRef] [Green Version]
  14. Namkung, M.; Kwon, Y. Optimal sequential state discrimination between two mixed quantum states. Phys. Rev. A 2017, 96, 022318. [Google Scholar] [CrossRef]
  15. Zhang, J.-H.; Zhang, F.-L.; Liang, M.-L. Sequential state discrimination with quantum correlation. Quant. Inf. Process. 2018, 17, 260. [Google Scholar] [CrossRef] [Green Version]
  16. Namkung, M.; Kwon, Y. Analysis of Optimal Sequential State Discrimination for Linearly Independent Pure Quantum States. Sci. Rep. 2018, 8, 6515. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  17. Namkung, M.; Kwon, Y. Sequential state discrimination of coherent states. Sci. Rep. 2018, 8, 16915. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  18. Namkung, M.; Kwon, Y. Generalized sequential state discrimination for multiparty QKD and its optical implementation. Sci. Rep. 2020, 10, 8247. [Google Scholar] [CrossRef]
  19. Li, B.; Fei, S.-M.; Wang, Z.-X.; Fan, H. Assisted state discrimination without entanglement. Phys. Rev. A 2012, 85, 022328. [Google Scholar] [CrossRef] [Green Version]
  20. Roa, L.; Retamal, J.C.; Alid-Vaccarezza, M. Dissonance is Required for Assisted Optimal State Discrimination. Phys. Rev. Lett. 2011, 107, 080401. [Google Scholar] [CrossRef]
  21. Xu, L.F.; Zhang, F.L.; Liang, M.L.; Chen, J.L. Assisted optimal state discrimination without entanglement. EPL 2014, 106, 50004. [Google Scholar] [CrossRef] [Green Version]
  22. Zhang, F.-L.; Chen, J.-L.; Kwek, L.C.; Vedral, V. Requirement of Dissonance in Assisted Optimal State Discrimination. Sci. Rep. 2013, 3, 2134. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  23. Baumgratz, T.; Cramer, M.; Plenio, M.B. Quantifying Coherence. Phys. Rev. Lett. 2014, 113, 140401. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  24. Bera, M.N.; Qureshi, T.; Siddiqui, M.A.; Pati, A.K. Duality of quantum coherence and path distinguishability. Phys. Rev. A 2015, 92, 012118. [Google Scholar] [CrossRef] [Green Version]
  25. Bagan, E.; Bergou, J.A.; Cottrell, S.S.; Hillery, M. Relations between Coherence and Path Information. Phys. Rev. Lett. 2016, 116, 160406. [Google Scholar] [CrossRef] [Green Version]
  26. Bagan, E.; Calsamiglia, J.; Bergou, J.A.; Hillery, M. Duality Games and Operational Duality Relation. Phys. Rev. Lett. 2018, 120, 050402. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  27. Hillery, M. Coherence as a resource in decision problems: The Deutsch-Jozsa algorithm and a variation. Phys. Rev. A 2016, 93, 012111. [Google Scholar] [CrossRef] [Green Version]
  28. Shi, H.-L.; Liu, S.-Y.; Wang, X.-H.; Yang, W.-L.; Yang, Z.-Y.; Fan, H. Coherence depletion in the Grover quantum search algorithm. Phys. Rev. A 2017, 95, 032307. [Google Scholar] [CrossRef] [Green Version]
  29. Pan, M.; Qiu, D. Operator coherence dynamics in Grover’s quantum search algorithm. Phys. Rev. A 2019, 100, 012349. [Google Scholar] [CrossRef]
  30. Liu, Y.-C.; Shang, J.; Zhang, X. Coherence Depletion in Quantum Algorithms. Entropy 2019, 21, 260. [Google Scholar] [CrossRef] [Green Version]
  31. Ma, J.; Hakande, A.; Yuan, X.; Ma, X. Coherence as a resource for source-independent quantum random-number generation. Phys. Rev. A 2019, 99, 022328. [Google Scholar] [CrossRef] [Green Version]
  32. Namkung, M.; Kwon, Y. Coherence and Entanglement Dynamics in Training Quantum Perceptron. Entropy 2020, 22, 1277. [Google Scholar] [CrossRef] [PubMed]
  33. Hu, M.-L.; Fan, H. Relative quantum coherence, incompatibility, and quantum correlations of states. Phys. Rev. A 2017, 95, 052106. [Google Scholar] [CrossRef] [Green Version]
  34. Ollivier, H.; Jurek, W.H. Quantum Discord: A Measure of The Quantumness of Correlation. Phys. Rev. Lett. 2001, 88, 017901. [Google Scholar] [CrossRef] [PubMed]
  35. Hamieh, S.; Kobes, R.; Zaraket, H. Positive-operator-valued measure optimization of classical correlations. Phys. Rev. A 2004, 70, 052325. [Google Scholar] [CrossRef]
  36. Luo, S. Quantum discord for two-qubit systems. Phys. Rev. A 2008, 77, 042303. [Google Scholar] [CrossRef]
  37. Ali, M.; Rau, A.R.P.; Alber, G. Quantum discord for two-qubit X states. Phys. Rev. A 2010, 82, 042105. [Google Scholar] [CrossRef] [Green Version]
  38. Chen, Q.; Zhang, C.; Yu, S.; Yi, X.X.; Oh, C.H. Quantum discord of two-qubit X states. Phys. Rev. A 2011, 84, 042313. [Google Scholar] [CrossRef] [Green Version]
  39. Huang, Y. Quantum discord for two-qubit X states: Analytical formula with very small worst-case error. Phys. Rev. A 2013, 88, 014302. [Google Scholar] [CrossRef] [Green Version]
  40. Namkung, M.; Chang, J.; Shin, J.; Kwon, Y. Revisiting Quantum Discord for Two-Qubit X States: The Error Bound to an Analytical Formula. Int. J. Theor. Phys. 2015, 54, 3340. [Google Scholar] [CrossRef] [Green Version]
  41. Modi, K.; Paterek, T.; Son, W.; Vedral, V.; Williamson, M. Unified View of Quantum and Classical Correlations. Phys. Rev. Lett. 2010, 104, 080501. [Google Scholar] [CrossRef] [Green Version]
  42. Brask, J.B.; Martin, A.; Esposito, W.; Houlmann, R.; Bowles, J.; Zbinden, H.; Brunner, N. Megahertz-Rate Semi-Device-Independent Quantum Random Number Generators Based on Unambiguous State Discrimination. Phys. Rev. Appl. 2017, 7, 054108. [Google Scholar] [CrossRef]
  43. Bennett, C.H.; Brassard, G. Quantum cryptography: Public Key distribution and coin tossing. In Proceedings of the International Conference on Computers, Systems and Signal Processing, Bangalore, India, 9–12 December 1984. [Google Scholar]
  44. Bennett, C.H. Quantum Cryptography Using Any Two Nonorthogonal States. Phys. Rev. Lett. 1992, 68, 3121. [Google Scholar] [CrossRef]
  45. Ha, D.; Kwon, Y. A minimal set of measurements for qudit-state tomography based on unambiguous discrimination. Quant. Inf. Process. 2018, 17, 232. [Google Scholar] [CrossRef]
  46. Henderson, L.; Vedral, V. Classical, quantum and total correlations. J. Phys. A Math. Gen. 2001, 34, 6899. [Google Scholar] [CrossRef]
  47. Duan, L.-M.; Guo, G.-C. Probabilistic cloning and identification of linearly independent quantum states. Phys. Rev. Lett. 1998, 80, 4999. [Google Scholar] [CrossRef] [Green Version]
  48. Koashi, M.; Winter, A. Monogamy of quantum entanglement and other correlations. Phys. Rev. A 2004, 69, 022309. [Google Scholar] [CrossRef] [Green Version]
  49. Rudolph, T.; Spekken, R.W.; Turner, P.S. Unambiguous discrimination of mixed states. Phys. Rev. A 2003, 68, 010301. [Google Scholar] [CrossRef] [Green Version]
  50. Raynal, P.; Lutkenhaus, N.; van Enk, S.J. Reduction theorems for optimal unambiguous state discrimination of density matrices. Phys. Rev. A 2003, 68, 022308. [Google Scholar] [CrossRef] [Green Version]
  51. Herzog, U. Optimum unambiguous discrimination of two mixed states and application to a class of similar states. Phys. Rev. A 2007, 75, 052309. [Google Scholar] [CrossRef] [Green Version]
  52. Helstrom, C.W. Quantum Detection and Estimation Theory; Academy Press: New York, NY, USA, 1976. [Google Scholar]
  53. Bae, J. Structure of minimum-error quantum state discrimination. New J. Phys. 2013, 15, 073037. [Google Scholar] [CrossRef] [Green Version]
  54. Ha, D.; Kwon, Y. Complete analysis of three-qubit mixed-state discrimination. Phys. Rev. A 2013, 87, 062302. [Google Scholar] [CrossRef] [Green Version]
  55. Ha, D.; Kwon, Y. Discriminating N-qudit states using geometric structure. Phys. Rev. A 2014, 90, 022330. [Google Scholar] [CrossRef]
  56. Namkung, M.; Kwon, Y. Almost minimum error discrimination of N-ary weak coherent states by Jaynes-Cummings Hamiltonian dynamics. Sci. Rep. 2019, 9, 19664. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  57. Kim, J.; Ha, D.; Kwon, Y. Uniqueness of Minimax Strategy in View of Minimum Error Discrimination of Two Quantum States. Entropy 2019, 21, 671. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  58. Han, R.; Leuchs, G.; Bergou, J.A. The Helstrom measurement: A nondestructive implementation. Phys. Rev. A 2020, 101, 032103. [Google Scholar] [CrossRef] [Green Version]
  59. Ha, D.; Kwon, Y. An optimal discrimination of two mixed qubit states with a fixed rate of inconclusive results. Quant. Inf. Process. 2017, 16, 273. [Google Scholar] [CrossRef] [Green Version]
  60. Zhang, W.-H.; Ren, G. State discrimination of two pure states with a fixed rate of inconclusive answer. J. Mod. Opt. 2018, 65, 192. [Google Scholar] [CrossRef]
  61. Du, Y.; Hsieh, M.-H.; Liu, T.; Tao, D. Implementable Quantum Classifier for Nonlinear Data. arXiv 2018, arXiv:1809.06056. [Google Scholar]
  62. Wootters, W.K. Entanglement of formation of an arbitrary state of two qubits. Phys. Rev. Lett. 1998, 80, 2245. [Google Scholar] [CrossRef] [Green Version]
Figure 1. Description of BB84 protocol and coherence therein. In (a), Alice prepares a qubit | x { 0 , 1 } , and Bob performs a projective measurement { | 0 0 | , | 1 1 | } . Here, Alice (Bob) performs a unitary operator U a ( U b ), depending on a random bit a { 0 , 1 } ( b = { 0 , 1 } ). Here, U x is an identity if x = 0 , and U x is a Hadamard if x = 1 . In (b), we assume that Alice prepares | x = | 0 , and a is given as a = 1 . Subsequently, U a = H transforms | 0 into | + , which has nonzero coherence. If b = 1 , Bob obtains a measurement outcome y = 0 which is same as x = 0 . In (c), Eve appears between Alice and Bob. Eve uses a strategy to measure Alice’s qubit and sends | z , which corresponds to her outcome z, to Bob. Suppose that x = 0 and a = 1 . Subsequently, Eve’s operation can be incoherent, since it transforms the coherent state | + into the noncoherent state, on a fixed basis. Because of this, there is a possibility that Bob obtains y = 1 , even if x = 0 .
Figure 1. Description of BB84 protocol and coherence therein. In (a), Alice prepares a qubit | x { 0 , 1 } , and Bob performs a projective measurement { | 0 0 | , | 1 1 | } . Here, Alice (Bob) performs a unitary operator U a ( U b ), depending on a random bit a { 0 , 1 } ( b = { 0 , 1 } ). Here, U x is an identity if x = 0 , and U x is a Hadamard if x = 1 . In (b), we assume that Alice prepares | x = | 0 , and a is given as a = 1 . Subsequently, U a = H transforms | 0 into | + , which has nonzero coherence. If b = 1 , Bob obtains a measurement outcome y = 0 which is same as x = 0 . In (c), Eve appears between Alice and Bob. Eve uses a strategy to measure Alice’s qubit and sends | z , which corresponds to her outcome z, to Bob. Suppose that x = 0 and a = 1 . Subsequently, Eve’s operation can be incoherent, since it transforms the coherent state | + into the noncoherent state, on a fixed basis. Because of this, there is a possibility that Bob obtains y = 1 , even if x = 0 .
Entropy 22 01422 g001
Figure 2. Relative quantum coherence (RQC) localization in CNOT operation. When the input is a maximally entangled state | ψ = ( | 01 | 10 ) 2 , RQC of it is not localized in either a system A or a system B. However, after the CNOT operation, the RQC is localized in a system A.
Figure 2. Relative quantum coherence (RQC) localization in CNOT operation. When the input is a maximally entangled state | ψ = ( | 01 | 10 ) 2 , RQC of it is not localized in either a system A or a system B. However, after the CNOT operation, the RQC is localized in a system A.
Entropy 22 01422 g002
Figure 3. (a) Unambiguous discrimination between Alice and Bob, where Bob’s measurement is expressed as POVM { M 0 , M 1 , M 2 } . (b) The structure of unambiguous quantum state discrimination (UD), where Bob performs a local projective measurement on his auxiliary system. In this structure, the unitary operator generates a post-measurement state that corresponds to a specific measurement outcome. If Bob carries out a non-optimal unambiguous discrimination, Charlie can discriminate Bob’s post-measurement states. In this case, (b) is obviously in the form of sequential state discrimination (SSD).
Figure 3. (a) Unambiguous discrimination between Alice and Bob, where Bob’s measurement is expressed as POVM { M 0 , M 1 , M 2 } . (b) The structure of unambiguous quantum state discrimination (UD), where Bob performs a local projective measurement on his auxiliary system. In this structure, the unitary operator generates a post-measurement state that corresponds to a specific measurement outcome. If Bob carries out a non-optimal unambiguous discrimination, Charlie can discriminate Bob’s post-measurement states. In this case, (b) is obviously in the form of sequential state discrimination (SSD).
Entropy 22 01422 g003
Figure 4. The structure of assisted optimal state discrimination (AOSD), where using a projective measurement, Bob measures both his system and Alice’s system. After the unitary operation is terminated, Bob performs local projective measurements on a system A and his auxiliary system B, respectively. Bob’s measurement outcome is expressed in the measurement table. Let each outcome of the projective measurements be denoted as j and k. If k = 1 , then Bob’s outcome is inconclusive, regardless of j. Meanwhile, if k = 0 , Bob can guess that Alice prepared | ψ j without an error.
Figure 4. The structure of assisted optimal state discrimination (AOSD), where using a projective measurement, Bob measures both his system and Alice’s system. After the unitary operation is terminated, Bob performs local projective measurements on a system A and his auxiliary system B, respectively. Bob’s measurement outcome is expressed in the measurement table. Let each outcome of the projective measurements be denoted as j and k. If k = 1 , then Bob’s outcome is inconclusive, regardless of j. Meanwhile, if k = 0 , Bob can guess that Alice prepared | ψ j without an error.
Entropy 22 01422 g004
Figure 5. Geometric representation of the structures of UD and SSD. In (a), Bob’s POVM corresponds to a real vector ( α 1 , α 2 ) in a set S S , where S represents an interior of a circular sector O Q 1 Q 2 and S represents a curve Q 1 Q 2 (solid black line). In (b), Bob’s POVM of optimal UD correponds to a real vector ( α 1 , α 2 ) on the S . In (c), Bob’s POVM used for SSD corresponds to the interior or the surface of a closed convex set S ˜ (solid red line). That is because, if ( α 1 , α 2 ) is included in S S ˜ , one of Charlie’s POVM element is negative definite. In (d), Bob’s POVM of optimal SSD corresponds to a real vector ( α 1 , α 2 ) on the curve B 1 A 1 A 2 B 2 (solid blue line).
Figure 5. Geometric representation of the structures of UD and SSD. In (a), Bob’s POVM corresponds to a real vector ( α 1 , α 2 ) in a set S S , where S represents an interior of a circular sector O Q 1 Q 2 and S represents a curve Q 1 Q 2 (solid black line). In (b), Bob’s POVM of optimal UD correponds to a real vector ( α 1 , α 2 ) on the S . In (c), Bob’s POVM used for SSD corresponds to the interior or the surface of a closed convex set S ˜ (solid red line). That is because, if ( α 1 , α 2 ) is included in S S ˜ , one of Charlie’s POVM element is negative definite. In (d), Bob’s POVM of optimal SSD corresponds to a real vector ( α 1 , α 2 ) on the curve B 1 A 1 A 2 B 2 (solid blue line).
Entropy 22 01422 g005
Figure 6. RQC of system B in AOSD. The black, dark-blue, light-blue, purple and red solid lines correspond to q 1 = 1 / 4 , 1 / 5 , 1 / 6 , 1 / 7 , and 1 / 8 , respectively. This figure implies that RQC is nonzero when inner product ψ 1 | ψ 2 satisfies q 1 / q 2 ψ 1 | ψ 2 1 . In this region, the optimal strategy of Bob is to discriminate only | ψ 2 out of two pure states of Alice. In this case, AOSD is equivalent to AOSD1.
Figure 6. RQC of system B in AOSD. The black, dark-blue, light-blue, purple and red solid lines correspond to q 1 = 1 / 4 , 1 / 5 , 1 / 6 , 1 / 7 , and 1 / 8 , respectively. This figure implies that RQC is nonzero when inner product ψ 1 | ψ 2 satisfies q 1 / q 2 ψ 1 | ψ 2 1 . In this region, the optimal strategy of Bob is to discriminate only | ψ 2 out of two pure states of Alice. In this case, AOSD is equivalent to AOSD1.
Entropy 22 01422 g006
Figure 7. The coherence distribution in UD, SSD, AOSD1, and AOSD2. In UD, the unitary operator localizes the coherence in Alice’s initial ensemble ( ρ A ) into Bob’s auxiliary system. In SSD, the unitary operator distributes the coherence in Alice’s initial ensemble into both Alice and Bob’s systems. In AOSD1, the unitary operator localizes the coherence in Alice’s initial ensemble into Bob’s system. In AOSD2, the unitary operator distributes the coherence in Alice’s initial ensemble to both Alice’s and Bob’s systems. This figure shows that the way where coherence distribution occurs depends on the structure of Bob’s measurement.
Figure 7. The coherence distribution in UD, SSD, AOSD1, and AOSD2. In UD, the unitary operator localizes the coherence in Alice’s initial ensemble ( ρ A ) into Bob’s auxiliary system. In SSD, the unitary operator distributes the coherence in Alice’s initial ensemble into both Alice and Bob’s systems. In AOSD1, the unitary operator localizes the coherence in Alice’s initial ensemble into Bob’s system. In AOSD2, the unitary operator distributes the coherence in Alice’s initial ensemble to both Alice’s and Bob’s systems. This figure shows that the way where coherence distribution occurs depends on the structure of Bob’s measurement.
Entropy 22 01422 g007
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Namkung, M.; Kwon, Y. Understanding of Various Type of Unambiguous Discrimination in View of Coherence Distribution. Entropy 2020, 22, 1422. https://doi.org/10.3390/e22121422

AMA Style

Namkung M, Kwon Y. Understanding of Various Type of Unambiguous Discrimination in View of Coherence Distribution. Entropy. 2020; 22(12):1422. https://doi.org/10.3390/e22121422

Chicago/Turabian Style

Namkung, Min, and Younghun Kwon. 2020. "Understanding of Various Type of Unambiguous Discrimination in View of Coherence Distribution" Entropy 22, no. 12: 1422. https://doi.org/10.3390/e22121422

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop