Abstract
We discuss dense coding with n copies of a specific preshared state between the sender and the receiver when the encoding operation is limited to the application of group representation. Typically, to act on multiple local copies of these preshared states, the receiver needs quantum memory, because in general the multiple copies will be generated sequentially. Depending on available encoding unitary operations, we investigate what preshared state offers an advantage of using quantum memory on the receiver’s side.
Similar content being viewed by others
Avoid common mistakes on your manuscript.
1 Introduction
Quantum dense coding is a key subroutine in many quantum information processing tasks. Dense coding utilizes preshared entanglement among the sender and receiver to communicate more classical bits than the number of quantum bits sent from the sender to receiver [1,2,3,4,5,6,7,8,9,10,11,12,13]. It is well known that one preshared maximally entangled qubit together with one bit of quantum communication admits communicating two bits of classical information. Although it is evident that preshared entanglement is a necessary resource to enable dense coding, how entanglement helps the enhancement is still unclear—the presence of entanglement in a preshared state does not necessarily guarantee to enhance classical communication for a given encoding strategy. It is therefore important to characterize when entanglement indeed becomes helpful for dense coding.
This question can be approached by observing that holding entanglement during communication requires the receiver to store the preshared state in a quantum memory. If the receiver is not in possession of quantum memory but instead makes a measurement right after the preshared state is provided, entanglement is broken before the communication is completed. Therefore, characterizing when quantum memory enhances the classical communication rate gives insights into the role genuinely played by quantum entanglement. This question also has practical relevance, as preparing a long-term quantum memory may come with much technical difficulty [14, 15].
As the simplest setting, we restrict our encoding operations to a certain subgroup under the presence of preshared states [13]—we assume that the encoding operation is given as a (projective) unitary representation U of a group G on \(\mathcal {H}_A\). When the preshared entangled state is written as \(\rho _{AB}\) and our coding operation is restricted to these unitaries, our channel can be written as the classical-quantum (cq) channel \(g \mapsto U_g \rho _{AB} U_g^\dagger \). Since this cq channel has a symmetric property for the group G, we say that it is a cq-symmetric channelFootnote 1. Recently, Ref. [16] studied such a model in the context of the resource theory of asymmetry without considering shared entanglement. Reference [13] applied cq-symmetric channel to the above setting under the presence of shared entanglement.
In Ref. [13], two scenarios are considered; the first where Bob has to wait for the quantum communication from Alice before he can perform a global measurement on all systems, and a second where Bob is allowed to apply a global measurement on his local part of the shared states before he receives Alice’s communication. While the second system reduces memory requirements at Bob, Bob still requires quantum memory when the preshared states are generated one by one.
In this work, in order to model the lack of quantum memory, we consider a third case where Bob measures his local part of the entangled states one by one and investigate when the capacities of these three cases coincide. The practical meaning of the first and third cases are compared in Sect. 2.3.1, Remark 1. In particular, we study the conditions for a preshared entangled state when the capacities for the second and third case differ under which quantum memory becomes helpful in dense coding, whose encoding is realized by the action of a given group representation. We also relate our setting to private dense coding with the existence of an eavesdropper, extending the private capacity characterized for the first model, i.e., the case when the receiver is allowed to make a collective measurement on the joint system [23].
We begin by studying the setting involving an arbitrary preshared state and an arbitrary group representation, where we provide necessary (and sufficient) conditions for a quantum memory to be useful. Using a necessary condition, we show an example of an entangled state, in which the capacities are equal and quantum memory is useless in this sense. We then focus on pure preshared states and give an explicit structure of the preshared state such that the receiver does not need to hold a quantum memory to realize the optimal decoding. Imposing the multiplicity-free condition on the group representation, we establish a novel connection between dense coding and the resource theory of speakable coherence [24]—equivalent to the resource theory of asymmetry with U(1) group with a multiplicity-free representation—which brings us a further characterization of such pure preshared states.
In fact, the resource theory of asymmetry is a topic to study physical resources for information processing and has been under active investigation [12, 25,26,27,28,29,30,31,32,33,34]. In the context of quantum hypothesis testing, the references [35] and [36, Theorem 2.9] considered the difference with respect to the relative entropy between a state and the averaged state under a certain group action, where the averaged state is the output of the noisy channel composed of a random unitary application. This relative entropy shows the difficulty of distinguishing the noiseless state and the noisy averaged state under a certain group action. Here, we discuss this type of discrimination as a modification of quantum illumination, which was originally introduced for enhancing the capability of detecting a target object with low reflectivity using entanglement [37, 38]. In particular, we apply our conditions to characterize when the entanglement in a given input state enhances the performance in guessing whether the noiseless or the group twirling channel acted on the entanglement half. We find that in the case of asymmetric discrimination with an abelian group, the performance with a maximally entangled input cannot be enhanced by local quantum memory, which can be contrasted to the conventional quantum illumination, in which quantum memory is essential when the input is a two-mode squeezing vacuum state [39].
The remainder of this paper is organized as follows. Section 2 formulates the two cases of interest for quantum dense coding. Section 2.1 formulates the case with quantum memory allowing for the global measurement, and Sect. 2.3 formulates the case without quantum memory after Sect. 2.2 prepares the notations for group representation. Section 3 discusses when quantum memory is useless for a general preshared state and presents several examples of such entangled states. Section 4 investigates simpler conditions for pure states and presents relevant examples. This analysis reveals the relation between the usefulness of quantum memory and the genuinely incoherent operations (GIO), a class of operations introduced in the resource theory of speakable coherence [40]. Section 5 applies obtained results to the case of the maximally entangled states. Section 6 applies our results to a modified version of quantum illumination. Section 7 provides discussion for our results and suggests future studies.
2 Dense coding with a preshared state
2.1 Dense coding with quantum memory
2.1.1 Standard capacity
We formulate dense coding with a preshared state as in Ref. [13], which is based on a cq-symmetric channel [16]. Assume that Alice and Bob share n copies of the quantum state \(\rho _{AB}\) on the system \(\mathcal{H}:=\mathcal {H}_A \otimes \mathcal {H}_B \), where \(\mathcal {H}_B \) is a \(d_B\)-dimensional system. We consider a (projective) unitary group representation of a group G on \(\mathcal {H}_A\). That is, for each \(g \in G\), we have a unitary operator \(U_g\) on \(\mathcal {H}_A\) such that for \(g,g'\in G\), there exists a unit complex number \(c(g,g')\) satisfying
When \(c(g,g')\) is 1, \(\{U_g\}_{g\in G}\) is called a unitary group representation. Otherwise, it is called a projective unitary group representation. We also define the group twirling channel \(\mathcal{G}(\rho ):= \sum _{g \in G}\frac{1}{\vert G\vert }U_g \rho U_g^\dagger \).
Consider the case when encoding operation is given as an application of unitary. In practical scenario, due to the device condition, available unitaries are limited to a subset of unitaries. Since any combination of available unitaries is also available, it is natural to assume that the set of available unitaries is given as a (projective) unitary group representation of a group G on \(\mathcal {H}_A\). In this scenario, we cannot exclude the case that \(c(g,g')\) takes a non-identical element in general. For example, when the X and Z operations are available on a qubit system, \(c(g,g')\) may take a non-identical element. Thus, our problem is formulated as channel coding for the cq-channel \(g (\in G)\mapsto U_g \rho _{AB} U_g^\dagger \). Since this cq-channel has a group covariant form, the channel capacity \(C_\textrm{c}(\rho _{AB})\) of this channel is calculated as [41, 42]
where \(H(\rho ):= -{{\,\textrm{Tr}\,}}\rho \log \rho \), \(D(\rho \Vert \sigma )={{\,\textrm{Tr}\,}}\rho (\log \rho - \log \sigma )\). In the following, we use the word “capacity” to denote the channel capacity. Here, we used the following relation.
We describe here the first case with quantum memory mentioned above. In this case, Alice transmits a message to Bob with n uses of this cq-channel. The set of available encoding operations is characterized by the product group \(G^n=\overbrace{G\times \cdots \times G}^n\). The n-tensor product representation of U is given as \(U_{(g_1, \ldots , g_n)}:= U_{g_1} \otimes \cdots \otimes U_{g_n}\) for \((g_1, \ldots , g_n) \in G^n\). By using the n-tensor product representation, a classical message \(k\in \mathcal {K}_n\) is encoded by using an encoder
and applying \(U_{\phi _{\textrm{e},n}(k)}\) to her local copies and sending them to Bob, thus producing the state
at Bob, effectively producing the cq channel from Alice to Bob. Using quantum memories to store the whole state, Bob then decodes the message using a decoder POVM
on \(\mathcal {H}_A \otimes \mathcal {H}_B\).
A pair of an encoder \(\phi _{\textrm{e},n}\) and a decoder \(\phi _{\textrm{d},n}\) is called a code \(\Phi _n\). The performance of a code \(\Phi _n\) is evaluated by the size of \(\mathcal {K}_n\) denoted by \(\vert \mathcal {K}_n\vert \) and the averaged decoding error probability \(\epsilon (\Phi _n)\) given as
Then, the channel coding theorem for cq-channels [43, 44] states that the quantity in (2) gives the operational capacity, i.e.,
2.1.2 Private capacity
In addition, the recent paper [23] considers private dense coding that covers a risk that the eavesdropper, Eve, might intercept the transmitted state and thus obtain (a part of) the information for the transmitted message. In this case, if Eve wants to hide her attack, she applies another quantum channel to the intercepted system, sends the output to Bob, and keeps its environment system. However, if she does not need to hide her attack, she does not need to send the output to Bob. We also assume that Eve has the environment system of the state \(\rho _{AB}\), i.e., the joint state among Alice, Bob, and Eve is a pure state \(\rho _{ABE}\). In this case, the following two conditions are required.
- (1):
-
When Eve does not intercept the transmitted state, Bob recovers the message with a probability of almost 1.
- (2):
-
Even when Eve intercepts the transmitted state, Eve obtains no information about the message.
This problem was studied in the case with a preshared maximally entangled state [45] and a general noisy preshared state [23]. When Alice and Bob share the maximally entangled state, Eve obtains no information about the message even when Eve intercepts the transmitted state [45]. In this case, the conventional dense coding satisfies the above two conditions. In the general noisy case with a general state \(\rho _{AB}\), the reference [23] derived the following lower bound \(\underline{C}_\textrm{c}^\textrm{p}\) of the private capacity \(C_\textrm{c}^\textrm{p}\) as
In particular, it is known that the above value gives the private capacity when \(\rho _{AB}\) is a maximally correlated state [23, Appendix A].
2.2 Notations for group representation
For further study on the capacity \(C_\textrm{c}(\rho _{AB})\) under the given symmetry, we prepare several notations for group representation. We let \(\hat{G}\) denote a set of irreducible projective unitary representations of G. For all irreducible representations \(\lambda \in \hat{G}\), let \(\mathcal {H}_\lambda \) be the projective representation space and \(d_\lambda \) be its dimension. In general, the representation space \(\mathcal{H}_A\) can be written as
where \(\mathcal{M}_\lambda = \mathbb {C}^{n_\lambda }\) expresses the multiplicity space of the irreducible projective unitary presentation \(\lambda \), the integer \(n_\lambda \) is the multiplicity, and \(\hat{G}'\subset \hat{G}\) is the set of irreducible representations with \(n_\lambda >0\) for \(\mathcal {H}_A\). Since our representation is unitary, vectors in different irreducible components are orthogonal to each other. Hence, we can write our space in the above way. Therefore, recalling \(\mathcal {H}_B=\mathbb {C}^{d_B}\), the joint system \(\mathcal{H}_A\otimes \mathcal{H}_B \) is written as
Let \(\Pi _\lambda \) be the projection to \(\mathcal{H}_{\lambda } \otimes \mathcal{M}_\lambda = \mathcal{H}_{\lambda } \otimes \mathbb {C}^{n_\lambda }\). Defining the probability distribution \(P_\Lambda (\lambda ):= {{\,\textrm{Tr}\,}}(\Pi _\lambda \otimes I_B) \rho _{AB}\) where we denote by \(\Lambda \) the corresponding random variable and the state \( \rho _{\lambda }:= \frac{1}{P_\Lambda (\lambda )} (\Pi _\lambda \otimes I_B) \rho _{AB}(\Pi _\lambda \otimes I_B)\), we have
where \(I_B\) and \(I_\lambda \) are the identity operators acting on \(\mathcal {H}_B\) and \(\mathcal {H}_\lambda \), respectively. This gives
Therefore, the capacity \(C_\textrm{c}(\rho _{AB})\) admits the following form.
When \(\rho _{AB}\) is a pure state, this reduces to [13]
where the second equality (changing the system of the trace) follows because \(\rho _{\lambda }\) is also a pure state.
To simplify our analysis, let us introduce the following condition on a unitary representation.
Definition 1
(Multiplicity-free condition) We say that a unitary representation U of G on \(\mathcal {H}\) is multiplicity-free when there exists a subset \(\hat{G}' \subset \hat{G}\) such that the unitary representation U is equivalent to
namely, when all multiplicities are either 0 or 1, and \(\hat{G}'\) is the set of all irreducible representations such that \(n_\lambda =1\).
2.3 Dense coding without quantum memory
2.3.1 Standard capacity
To achieve the capacity \(C_\textrm{c}(\rho _{AB})\), Bob needs to keep his state in his quantum memory while first \(\mathcal {H}_B^{\otimes n}\) and then \(\mathcal {H}_A^{\otimes n}\) are collected. Since the cost to keep quantum memory is expensive, it is practical to replace it with classical memory by performing a projective measurement on each system \(\mathcal {H}_B\) as they are received. To this end, let \(\mathcal{B}:=\{ \vert k\rangle \}_{k=1}^{d_B}\) be Bob’s measurement basis on \(\mathcal {H}_B\). We also let \(\mathcal{B}\) denote the measurement channel with respect to the basis \(\mathcal {B}\). When Bob applies the measurement \(\mathcal{B}\), the initial preshared state is given by
where
When Bob makes a measurement with the basis \(\mathcal{B}\) on every quantum system \(\mathcal{H}_B\) in advance, the capacity of (2) satisfies (notice that \(\mathcal {G}\) acts on A and thus commutes with B)
Here, since the support of \(\mathcal{B}\circ \mathcal{G}(\rho _{AB})\) contains the support of \(\mathcal{B}(\rho _{AB})\), the above quantity does not diverge.
Indeed, even when Bob sends his measurement outcome to Alice before Alice sends her message, the capacity has the same value because it does not distinguish whether k is at Alice or Bob, as can be seen in the following. We have the capacity of this setting as
The data-processing inequality for the relative entropy implies that for all measurements \(\mathcal {B}\)
When the equality in (20) holds with a measurement \(\mathcal {B}\), Bob’s quantum memory is useless with respect to the measurement \(\mathcal {B}\). We call such a state \(\rho _{AB}\) \(\mathcal{B}\)-q-memory useless. In particular, when there exists such a measurement \(\mathcal {B}\), we call such a state \(\rho _{AB}\) q-memory useless. Otherwise, we call the state \(\rho _{AB}\) q-memory useful. Our aim is to characterize the condition when the equality holds.
Here, it is instructive to clarify the difference between the setting in Ref. [13] and ours. Reference [13] discussed the channel capacity when Bob is allowed to make a measurement across n-tensor product space \(\mathcal {H}_{B}^{\otimes n}\) before Bob receives the transmitted systems. In contrast, we allow Bob to apply a measurement only on a single system \(\mathcal {H}_{B}\) n times. That is, in our setting, Bob is not allowed to apply quantum measurements over multiple copies of preshared states on Bob’s side before the communication. The measurement in Ref. [13] is called a collective measurement and our measurement here is called an individual measurement. Reference [13] studied the setting with a collective measurement at the asymptotic limit \(n \rightarrow \infty \). They showed that the optimal transmission rate under their setting becomes \(C_\textrm{c}(\rho _{AB})\) when the group G is abelian, the representation U is multiplicity-free, and the state \(\rho _{AB}\) is pure. Although their setting does not ask Bob to keep the quantum system before receiving the other parts from Alice, it still requires quantum memory in Bob’s system. This is because when Bob receives these n quantum systems one by one, he needs to store these n quantum systems before making a measurement across his n quantum systems \(\mathcal {H}_{B}^{\otimes n}\). On the other hand, our setting described above prohibits the use of quantum memory.
Remark 1
In our setting, we allow a collective measurement across many quantum systems received by Alice at the decoding stage, although a collective measurement is not allowed on shared quantum systems distributed to Bob. This assumption is justified by considering the situation where the communication from Alice to Bob is done within a short period of time while it takes much longer for quantum systems to be distributed to Bob before the communication. Indeed, if the use of the quantum communication channel is expensive, this scenario is reasonable for the following reasons. The distribution step (before the communication) can take a longer time because it is a preparation for the communication between Alice and Bob. Since fast communication channels are expensive, it is reasonable to use slower channels for distributing shared quantum systems. In such a case, to make a collective measurement on shared quantum systems distributed to Bob, Bob needs to have a quantum memory to keep his quantum systems for a long time. On the other hand, the communication from Alice to Bob typically needs to be accomplished quickly, where they are expected to use faster communication channels. There, Bob does not need to hold a good quantum memory lasting for a long time to make a collective measurement over the quantum systems received in a short period of time from Alice.
2.3.2 Private capacity
Next, we discuss the private dense coding when Bob makes a measurement with the basis \(\mathcal{B}\). We have the following lower bound for the private capacity [23]
The difference between \(\underline{C}_\textrm{c}^\textrm{p}(\rho _{AB})\) and \(\underline{C}_\textrm{c}^\textrm{p}(\rho _{AB},\mathcal{B})\) is given by
Therefore, the equality condition in (20) is useful for comparing the lower bounds for these two private capacities.
3 General preshared states
3.1 Conditions for q-memory uselessness
We begin our investigation of conditions for q-memory uselessness with a general mixed preshared resource state. We denote with \(\rho ^{-1}\) the pseudoinverse of an operator \(\rho \) on \(\mathcal {H}\) and its support \(\mathcal {H}_\rho \). For the general case, we consider \(\left[ \mathcal{G}\circ \mathcal{B}(\rho _{AB})\right] ^{-1}\) of \(\mathcal{G}\circ \mathcal{B}(\rho _{AB})\) and denote the support of the operator \(\mathcal{G}\circ \mathcal{B}(\rho _{AB})\) as \(\mathcal{H}_{\mathcal{B},\mathcal {G},\rho _{AB}}\). Then, the supports of \(\mathcal{B}(\rho _{AB})\), \(\mathcal{G}(\rho _{AB})\), and \(\rho _{AB} \) are included in \(\mathcal{H}_{\mathcal{B},\mathcal {G},\rho _{AB}}\). Applying the equality condition for the information processing inequality for relative entropy [46] to (20), we have the following characterizations.
Theorem 1
Given a preshared state \(\rho _{AB}\) and the basis \(\mathcal{B}\), the following conditions are equivalent.
- (A1):
-
The equality in (20) holds, i.e., \(\rho _{AB}\) is \(\mathcal {B}\)-q-memory useless.
- (A2):
-
The following relation holds as an operator on \(\mathcal{H}_{\mathcal{B},\mathcal {G},\rho _{AB}}\).
$$\begin{aligned} \rho _{AB}= \sqrt{ \mathcal{G}(\rho _{AB})} \sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1} \mathcal{B}(\rho _{AB}) \sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1} \sqrt{ \mathcal{G}(\rho _{AB})} . \end{aligned}$$(23) - (A3):
-
There exists a CPTP map \(\Gamma \) such that
$$\begin{aligned} \Gamma (\mathcal{B}(U_g \rho _{AB} U_g^\dagger ))=U_g\rho _{AB} U_g^\dagger \end{aligned}$$(24)for \(g \in G\).
Proof
The equivalence between (A1) and (A2) follows from [47, Theorem 3]. The relation (A3) \(\Rightarrow \) (A1) is trivial. Assume (A2). We have \(U_g\mathcal{G}(\rho _{AB})=\mathcal{G}(\rho _{AB})U_g\) and \(U_g\mathcal{G}\circ \mathcal{B}(\rho _{AB})=\mathcal{G}\circ \mathcal{B}(\rho _{AB})U_g\). We denote the space orthogonal to \(\mathcal{H}_{\mathcal{B},\mathcal {G},\rho _{AB}}\) by \(\mathcal{H}_{\mathcal{B},\rho _{AB}}^{\perp }\). We denote the projection to \(\mathcal{H}_{\mathcal{B},\rho _{AB}}^{\perp }\) by \(I^\perp \). We consider \(\sqrt{ \mathcal{G}(\rho _{AB})} \sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1}\) as a map on \(\mathcal{H}_{\mathcal{B},\mathcal {G},\rho _{AB}}\). Then, we can define the map \(T:= \sqrt{ \mathcal{G}(\rho _{AB})} \sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1} \oplus I^\perp \) on \(\mathcal{H}\).
Since \( U_g\sqrt{ \mathcal{G}(\rho _{AB})} U_g^{-1} =\sqrt{ \mathcal{G}(\rho _{AB})} \) and \(U_g\sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1}U_g^{-1} =\sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1}\), we have \( \sqrt{ \mathcal{G}(\rho _{AB})} \sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1} U_g=U_g \sqrt{ \mathcal{G}(\rho _{AB})} \sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1}\). Thus, we have
where the final equation follows from the condition (A2). Defining \(\Gamma (\rho ):= T\rho T^\dagger \), we have (A3). \(\square \)
We remark that the above results can be extended to a general quantum channel \(\mathcal {B}\) following the same proof. Apart from (23), we obtain an alternative necessary and sufficient condition for a general resource state \(\rho _{AB}\) using the result in Ref. [47].
Theorem 2
Let \(\tilde{B}\) be a system isomorphic to B and \(\textrm{CX}_{B\rightarrow \tilde{B}}{:}{=}\sum _{k,k'=1}^{d_B} \vert k\rangle \langle k\vert _B\otimes \vert k'+k \rangle \!\langle k'\vert \), where \(k'+k\) is implicitly \(k'+k\ \textrm{mod}\ d_B\), be the CNOT gate with respect to the basis \(\mathcal {B}\) controlled on B. Let \(\rho '_{AB\tilde{B}}\) be the state on \(AB\tilde{B}\) defined as
Then, the condition \(C_\textrm{c}(\rho _{AB})=C_\textrm{c}(\mathcal {B}(\rho _{AB}))\) holds if and only if there exist the following six items satisfying the condition (27).
- (1):
-
an index set \(\mathcal{J}\), which is possibly an infinite set,
- (2):
-
a decomposition \(\mathcal {H}_A\otimes \mathcal {H}_B=\bigoplus _{j \in \mathcal{J}} \mathcal {H}_{L_j}\otimes \mathcal {H}_{R_j}\) for some subspaces \(\mathcal {H}_{L_j}\) and \(\mathcal {H}_{R_j}\),
- (3):
-
states \(\eta _{L_j,g}\) on \(\mathcal {H}_{L_j}\) that can depend on g,
- (4):
-
states \(\eta _{R_j\tilde{B}}\) on \(\mathcal {H}_{R_j}\otimes \mathcal {H}_{\tilde{B}}\) independent of g,
- (5):
-
a probability distribution \(\{p_{j\vert g}\}_j\) for each \(g\in G\),
- (6):
-
a unitary \(V_{AB}\) on AB.
Proof
Step 1. First, we introduce another useful necessary and sufficient condition for the equation \(C_\textrm{c}(\rho _{AB})=C_\textrm{c}(\mathcal {B}(\rho _{AB}))\). Define the classical-quantum state
To take into account the action of Bob’s measurement, we also consider a classical-quantum state
where \(\rho _{AB\tilde{B}}'\) is the state defined in (26). This gives
Note that due to the invariance of the relative entropy under isometries like in (29), we have
On the other hand, Eq. (30) implies that
Therefore, \(C_\textrm{c}(\rho _{AB})=C_\textrm{c}(\mathcal {B}(\rho _{AB}))\) if and only if
Step 2. Next, employing condition (33), we show that the existence of the six items is equivalent to the equation \(C_\textrm{c}(\rho _{AB})=C_\textrm{c}(\mathcal {B}(\rho _{AB}))\). Applying the result from Ref. [47, Theorem 6], we get that (33) holds if and only if there exists a decomposition of Hilbert space \(\mathcal {H}_A\otimes \mathcal {H}_B\) as
such that
for some unitary \(V_{AB}\) on AB and for some states \(\eta _{GL_j}\) on \(\mathcal {H}_G\otimes \mathcal {H}_{L_j}\) and \(\eta _{R_j\tilde{B}}\) on \(\mathcal {H}_{R_j}\otimes \mathcal {H}_{\tilde{B}}\). Since Eq. (34) corresponds to the items (1) and (2), it is sufficient to show the equivalence between (35) and the condition (27) with the items (3), (4), (5), and 6), which does not come with the subsystem G holding a classical state.
Suppose \(\tau _{GAB\tilde{B}}'\) has the form (35). Because of (29), we have
This implies that
This condition requires \(\eta _{GL_j}\) to have classical states on the subsystem G, which has the classical-quantum form
for some coefficient \(c_{j,g}\) and some state \(\eta _{L_j,g}\) on \(\mathcal {H}_{L_j}\). Since \({{\,\textrm{Tr}\,}}\langle g\vert \tau _{GAB\tilde{B}}'\vert g \rangle =1/\vert G\vert \) by (29), we have \(\sum _j q_j c_{j,g}=1/\vert G\vert ,\ \forall g\in G\). Together with the form in (29), we get
where \(p_{j\vert g}{:}{=}\vert G\vert \,q_jc_{j,g}\) constructs a probability distribution labeled by g with \(\sum _j p_{j\vert g}=1\). Since this is the form advertised in (27), we just showed that (35) implies (27).
On the other hand, one can recover the form of (35) by applying \(\frac{1}{\vert G \vert }\sum _g \vert g\rangle \langle g\vert \otimes \) from left in both sides of (27), which means that (27) implies (35). Therefore, (27) and (35) are equivalent, which concludes the proof. \(\square \)
Let us consider a mixed-state example that satisfies the conditions in Theorem 2. Clearly, when the state \(\rho _{AB}\) has the following separable form
we have \(\mathcal{B}(\rho _{AB})=\rho _{AB}\), which implies the equality of the capacities in (20). That is, the state \(\rho _{AB}\) is \(\mathcal{B}\)-q-memory useless. However, a general separable state cannot be written in the form (40) even when the basis \(\{\vert k \rangle \}_{k=1}^{d_B}\) can be freely chosen because a general separable state is written with the sum of non-orthogonal product states. Hence, it is, in general, unclear whether a general separable state \(\rho _{AB}\) is q-memory useless.
Let us now investigate whether there exists an entangled q-memory useless state.
Proposition 3
Let \(\rho _{AB}\) be a state having the following form
where the state \(\vert \Psi _j\rangle \) has the form
and the vector \(\vert \psi _{\lambda ,k}\rangle \in \mathcal{H}_{\lambda } \otimes \mathcal{M}_\lambda \) satisfies
for every \(k,k'\). Then, there is a basis \(\mathcal {B}\) such that the conditions for Theorem 2 hold. That is, the state \(\rho _{AB}\) is q-memory useless.
Proof
Step 1 First, we observe that for each \(\vert \psi _{\lambda ,k} \rangle \) in (42) there exists a Schmidt decomposition
where neither \(c_{\lambda , j}\) nor \(\vert r_{\lambda , j} \rangle \) depends on k. This is because the marginal states for \(\vert \psi _{\lambda ,k} \rangle \) on \(\mathcal {H}_\lambda \) do not depend on k because of (43), and thus we can use the same eigenbasis for \(\mathcal {H}_\lambda \) in the Schmidt decomposition, recalling that any eigenbasis of the marginal state gives a Schmidt basis.
Step 2 Next, employing the form in (44), we show that \(\rho _{AB}\) in (41) satisfies the conditions in Theorem 2. Let us define \(\vert \Psi '_j\rangle \) as
where \(\vert 0 \rangle _{\tilde{B}}\) is a computational basis state on \(\tilde{B}\). Then, using (42) and (44), we can write
Applying \(U_g=\bigoplus _\lambda U_{\lambda , g}\otimes I_{\mathcal {M}_\lambda }\) to \(\vert \Psi ' \rangle \), we get
where \(\vert r_{\lambda , g, l} \rangle {:}{=}U_{\lambda , g}\vert r_{\lambda , l} \rangle \). Let \(V_k{:}{=}\bigoplus _\lambda e^{-i\theta _{\lambda ,k}} I_\mathcal{H_\lambda }\otimes \sum _l \vert m_{\lambda , l} \rangle \!\langle m_{\lambda , k, l}\vert _{\mathcal {M}_\lambda }\) be a unitary on A where \(\{\vert m_{\lambda , l} \rangle \}_l\) is an arbitrary basis independent of k. We then define a controlled unitary \(V_{AB}{:}{=}\sum _{k=1}^{d_B} V_k\otimes \vert k\rangle \langle k\vert _B\). We get
Therefore, we have for the state \(\rho _{AB}=\sum _j P_J(j)\vert \Psi _j\rangle \langle \Psi _j\vert \) that
This is the form in (27), where we choose \(L_j=A\), \(R_j=B\) for item 2) in Theorem 2. This concludes the proof that the state \(\rho _{AB}\) in (41) satisfies the conditions in Theorem 2. \(\square \)
3.2 Examples of entangled q-memory useless state based on Proposition 3
We derive examples of entangled q-memory useless states using Proposition 3. This construction contains mixed states as well as pure states. To simplify the condition in Proposition 3, we assume that our unitary representation \(U_g\) of G on \(\mathcal {H}\) is multiplicity-free. Then, the condition (42) is rewritten as
where \(\hat{G}'\) with \(\vert \hat{G}'\vert =l\) is a subset of irreducible representations. We write the set \(\hat{G}'\) as \(\{\lambda _s\}_{s=1}^l\) and remember that the basis \(\mathcal{B}\) is written as \(\{ \vert k\rangle \}_{k=1}^{d_B} \). As a special case, let \({d_B}=l\), \(P_{K\vert J}(k\vert j)= P_{\Lambda }(\lambda _s)=\frac{1}{l}\), \(\theta _{\lambda _s,k }=\frac{2\pi s k}{l}\), and \(\theta _{k,j }=\frac{2\pi j k}{l}\). The states
form normalized orthogonal vectors. The states \(\vert \Psi _j\rangle \) with \(j=1,\ldots ,l \) are simplified as
We find that the states \(\vert \Psi _j\rangle \) with \(j=1,\ldots ,l \) also form normalized orthogonal vectors and are all examples of entangled q-memory useless states. Then, the state \(\rho _{AB}= \sum _{j=1}^lP_J(j) \vert \Psi _j\rangle \langle \Psi _j\vert \) is separable if and only if \(P_J\) is the uniform distribution on \(\{1, \ldots , l\}\) [48]. In this case, the state \(\rho _{AB}\) is written as
In addition, the state \(\rho _{AB}\) in the example is a maximally correlated state with respect to the basis \(\{\vert \phi _{k} \rangle \otimes \vert k'\rangle \}_{k,k'=1}^l\). Hence, the lower bound \(\underline{C}_\textrm{c}^\textrm{p}(\rho _{AB})\) of the private capacity equals the private capacity in this case [23, Appendix A]. The above example also guarantees that \(\underline{C}_\textrm{c}^\textrm{p}(\rho _{AB})=\underline{C}_\textrm{c}^\textrm{p}(\rho _{AB},\mathcal{B})\). Thus, \(\underline{C}_\textrm{c}^\textrm{p}(\rho _{AB},\mathcal{B})\) also attains the private capacity. In this case, even when Bob makes a measurement in the basis \(\mathcal{B}\), Alice and Bob can attain the private capacity. That is, Bob’s quantum memory is not needed even for private dense coding.
3.3 Examples of entangled q-memory useless state based on Condition (A2)
Let G be commutative and \(\mathcal {H}_A\) be multiplicity free, and consider the maximally entangled state
where the set \(\hat{G}'\) of irreducible representations appearing in \(\mathcal{H}_A\) is given as \(\{\lambda _s\}_{s=1}^l\) and \(\{\vert v_{\lambda _s}\rangle \}_{s=1}^l\) are orthogonal states on \(\mathcal{H}_B\) defined by
Although the previous section shows the fact that the maximally entangled state \(\vert \Phi \rangle \) is q-memory useless by using Proposition 3, this section shows the same fact by using the condition (A2).
Note that
Therefore, defining \(\vert \phi _k \rangle := \frac{1}{\sqrt{l}}\sum _{s=1}^l \vert \psi _{\lambda _s}\rangle \), we obtain the following lemma.
Lemma 4
The maximally entangled state \(\vert \Phi \rangle \) has the following form.
While the capacity is \(\log l\), it can be achieved even when Bob measures the system B with the basis \(\{\vert e_k\rangle \}_k\) because the resultant state on A is \(\vert \phi _k\rangle \) and \(H(\mathcal{G} (\vert \phi _k\rangle \langle \phi _k\vert ))=\log l\). Hence, \(\vert \Phi \rangle \) is q-memory useless.
This q-memory useless property can be seen from the fact that the state \(\vert \Phi \rangle \) satisfies the condition (A2) as follows. We have
The matrices \(l \mathcal{B}(\vert \Phi \rangle \langle \Phi \vert )\) and \(l \mathcal{G}(\vert \Phi \rangle \langle \Phi \vert )\) are projections. The intersection of the range of these projections is the one-dimensional space generated by \(\vert \Phi \rangle \). Hence,
The combination of (61) and (62) guarantees the condition (A2). Therefore, the state \(\vert \Phi \rangle \!\langle \Phi \vert \) is q-memory useless.
This fact can be extended to the dephased state \(\rho _{AB,p} =(1-p)\vert \Phi \rangle \!\langle \Phi \vert +p \mathcal{G}(\vert \Phi \rangle \!\langle \Phi \vert )\) [49] as follows. Instead of (59), we have
Even when \(\rho _{AB,0}\) is replaced by \(\rho _{AB,p}\), the relations (60) and (61) still hold as follows.
Combining (62) and (63) with the above relations, we have
Since the condition (A2) holds, the dephased state \(\rho _{AB}=(1-p)\vert \Phi \rangle \!\langle \Phi \vert +p \mathcal{G}(\vert \Phi \rangle \!\langle \Phi \vert )\) serves as another example of an entangled q-memory useless state.
4 Pure preshared states
4.1 General conditions for q-memory uselessness
Next, we consider the case with a pure state \(\rho _{AB}= \vert \Psi \rangle \langle \Psi \vert \). For \(\mathcal{B}=\{ \vert k\rangle \}_{k=1}^{d_B} \) on \(\mathcal {H}_B \), without loss of generality, we can assume that \( \langle k\vert \rho _B\vert k \rangle > 0\). (Otherwise, we restrict k to the index to satisfy \( \langle k \vert \rho _B\vert k \rangle > 0\).) Then, we have
Theorem 5
Assume that the preshared state \(\rho _{AB}\) is a pure state \(\vert \Psi \rangle \langle \Psi \vert \). Given the basis \(\mathcal{B}\), the following condition is equivalent to Conditions (A1), (A2), and (A3).
-
(C1)
The state \(\vert \Psi \rangle \) has the form as
$$\begin{aligned} \vert \Psi \rangle =\sum _{k=1}^{d_B} \sqrt{P_K(k)}\sum _{\lambda \in \hat{G}'}\sqrt{P_{\Lambda }(\lambda )} e^{i \theta _{\lambda ,k}} \vert \psi _{\lambda ,k}\rangle \otimes \vert k\rangle , \end{aligned}$$(68)where for all \(k,k'\) the vector \(\vert \psi _{\lambda ,k}\rangle \in \mathcal{H}_{\lambda } \otimes \mathcal{M}_\lambda \) satisfies the condition;
$$\begin{aligned} {{\,\textrm{Tr}\,}}_{\mathcal{M}_{\lambda }} \vert \psi _{\lambda ,k}\rangle \langle \psi _{\lambda ,k}\vert ={{\,\textrm{Tr}\,}}_{\mathcal{M}_{\lambda }} \vert \psi _{\lambda ,k'}\rangle \langle \psi _{\lambda ,k'}\vert , \end{aligned}$$(69)and \(P_K\) and \(P_\Lambda \) are independent probability distributions.
When a state \(\rho _{AB}\) is a pure state, Condition (C1) is equivalent to the condition in Proposition 3. That is, the above theorem shows the inverse direction of Proposition 3 in the case with pure states.
Proof
It is sufficient to show the equivalence between (C1) and (A1). Defining
and recalling (13), we have
The final equation follows from the fact that \(\rho _{\lambda ,k}\) is a pure state because \(\rho _{AB}\) is pure.
In this case, by comparing (14) and (71), Condition (A1), i.e., \(C_\textrm{c}(\rho )=C_\textrm{c}(\mathcal {B}(\rho ))\), is equivalent to
Since \(P_{\Lambda }= \sum _{k=1}^{d_B} P_K(k) P_{\Lambda \vert k}\) and \({{\,\textrm{Tr}\,}}_{M_{\lambda }} \rho _{\lambda } =\sum _{k=1}^{d_B} P_{K\vert \lambda }(k) {{\,\textrm{Tr}\,}}_{M_{\lambda }} \rho _{\lambda ,k}\), the concavity of entropy implies that
and therefore, (72) is equivalent to
for all k and \(\lambda \). Since the condition (75) is equivalent to Condition (C1), we obtain the equivalence between (C1) and (A1). \(\square \)
Although we have already proven the equivalence between (C1) and all the conditions in Theorem 1, it may not be immediately clear how the form of (C1) can induce the form in (A2). In Appendix, we explicitly derive how the form in (A2) can be reached starting from the form in (C1).
Theorem 1 and the proof of Proposition 3 give the following characterization for pure resource states. The following is a summary of the results for general pure states.
Theorem 6
For an arbitrary pure resource state \(\rho _{AB}=\vert \Psi \rangle \langle \Psi \vert \), the following are equivalent.
-
(D1)
The equality in (20) holds, i.e., \(\rho _{AB}\) is \(\mathcal {B}\)-q-memory useless.
- (D2)
-
(D3)
The following relation holds.
$$\begin{aligned} \rho _{AB}=&\sqrt{ \mathcal{G}(\rho _{AB})} \sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1} \mathcal{B}(\rho _{AB})\sqrt{\mathcal{G}\circ \mathcal{B}(\rho _{AB})}^{-1} \sqrt{ \mathcal{G}(\rho _{AB})}. \end{aligned}$$(76) -
(D4)
There exists a controlled unitary \(V_{AB}=\sum _{k=1}^{d_B} V_k\otimes \vert k\rangle \langle k\vert _B\) and a set \(\{\vert \eta _g \rangle _A\}_g\) of states on \(\mathcal {H}_{A}\) and some state \(\vert \phi \rangle _B\) on \(\mathcal {H}_{B}\) such that
$$\begin{aligned} \begin{aligned} V_{AB}\,U_g\vert \Psi \rangle = \vert \eta _g \rangle _A\otimes \vert \phi \rangle _B, \forall g\in G. \end{aligned}\end{aligned}$$(77)
To obtain a further characterization, we recall the multiplicity-free condition. When the multiplicity-free condition is satisfied, (68) and (69) can be represented by the following single form
for some vector \(\vert \psi _{\lambda }\rangle \in \mathcal{H}_{\lambda }\) independent of k. On the other hand, if G is abelian (but not necessarily multiplicity-free), then \(\dim \mathcal{H}_\lambda = 1\) for all \(\lambda \in \hat{G}'\), implying that (69) is always satisfied and thus the condition (68) solely serves as the necessary and sufficient condition for Bob’s quantum memory to be useless.
Therefore, we obtain the following corollary.
Corollary 7
Let the preshared state \(\rho _{AB}\) be a pure state given by \(\vert \Psi \rangle =\sum _{\lambda \in \hat{G}'}\sqrt{P_\Lambda (\lambda )}\vert \psi _\lambda \rangle \vert v_\lambda \rangle \), where \(\hat{G}'\) with \(\vert \hat{G}'\vert =l\) is a subset of irreducible representations for which \(P_\Lambda (\lambda )\ne 0\ \forall \lambda \in \hat{G}'\), and \(\vert v_1 \rangle , \ldots , \vert v_l \rangle \) are some quantum states on \(\mathcal {H}_B\). Suppose also that the multiplicity-free condition holds. Then, the following conditions are equivalent.
-
(E1)
The state \(\vert \Psi \rangle \) is q-memory useless.
-
(E2)
There exist a basis \(\{\vert k\rangle \}_{k=1}^{d_B}\) of \(\mathcal{H}_B\), a probability distribution \(P_K\) on \(\{1,\dots ,d_B\}\) independent of \(\lambda \), and real numbers \(\{\theta _{\lambda ,k}\}_{\lambda ,k}\) such that
$$\begin{aligned} \vert v_\lambda \rangle = \sum _{k=1}^{d_B} \sqrt{P_K(k)}e^{i \theta _{\lambda ,k}}\vert k\rangle . \end{aligned}$$(79)
Since Condition (E2) can be considered as a condition for the l vectors \(V:=(\vert v_1 \rangle ,\dots ,\vert v_l \rangle )\) in \(\mathcal{H}_B\), the problem of q-memory uselessness is reduced to the analysis for the l vectors V.
For example, when the vectors \(\vert v_1 \rangle , \ldots , \vert v_l \rangle \) are orthogonal, Condition (E2) holds by choosing the basis \(\{\vert k\rangle \}_{k=1}^{d_B}\) of \(\mathcal{H}_B\) as follows. The orthogonality guarantees that \(l \le d_B\). We set \(\vert 1\rangle , \ldots , \vert l\rangle \) as
and \(\vert l+1\rangle , \ldots , \vert r\rangle \) to be vectors orthogonal to \(\vert v_1 \rangle , \ldots , \vert v_l \rangle \). Equation (79) is then satisfied by choosing \(P_K(k)=1/l\) for \(k=1,\dots ,l\) and \(\theta _{\lambda ,k}=-2\pi \lambda k/l\).
The fact that Condition (E2) always holds when \(l=2\) can be seen as follows. We choose \(\theta \) and \(\theta '\) as \(e^{i\theta '}\cos \theta = \langle v_1 \vert v_2\rangle \). Then, we choose the basis \(\{\vert 1\rangle ,\vert 2\rangle \}\) to satisfy
4.2 Characterization by genuinely incoherent operations
Under the multiplicity-free condition, we characterize our conditions for q-memory uselessness for pure states by using genuinely incoherent operations (GIO) [40], one of the major classes of operations considered in the resource theory of coherence [24]. The GIO, which we denote as \(\mathcal {O}_\textrm{GIO}\), is defined as the set of operations that preserve all incoherent states, \(\Gamma _\textrm{GIO}(\sigma )=\sigma \) for every incoherent state \(\sigma \), where a state is called incoherent when it is diagonal with a given preferred orthogonal basis. Then, it was shown in [40, Thm.2] that \(\Gamma \) is in \(\mathcal {O}_\textrm{GIO}\) if and only if \(\Gamma \) can be written as \(\Gamma (\rho ) = A\odot \rho \) with some positive semidefinite matrix A with \(A_{\lambda \lambda }=1\,\forall \lambda \), where \((X\odot Y)_{\lambda \eta }:=X_{\lambda \eta }Y_{\lambda \eta }\) is the Hadamard product.
We find that GIO is a useful tool for analyzing the condition (E2) for general l through the Gram matrix of \(V=(\vert v_1 \rangle ,\ldots ,\vert v_l \rangle )\) defined as \(J(V)_{\lambda \eta }{:}{=}\langle v_\lambda \vert v_\eta \rangle \), \(\lambda ,\eta = 1,\ldots , l\), or equivalently, \(J(V){:}{=}V^\dagger V\). Since the diagonal element of the Gram matrix J(V) is 1, the CPTP map \(\Gamma _{J(V)}\) defined as \( \Gamma _{J(V)}(\rho ):= J(V)\odot \rho \) is also in \(\mathcal {O}_\textrm{GIO}\). Then, we have the following characterizations.
Theorem 8
Suppose \(\mathcal {H}_A\) satisfies the multiplicity-free condition. Let \(\vert \Psi \rangle =\sum _{\lambda \in \hat{G}'}\sqrt{P_\Lambda (\lambda )}\vert \psi _\lambda \rangle \vert v_\lambda \rangle \) be a given resource state shared by Alice and Bob, where \(\hat{G}'\) with \(\vert \hat{G}'\vert =l\) is a subset of irreducible representations for which \(P_\Lambda (\lambda )\ne 0\ \forall \lambda \in \hat{G}'\). The following conditions for l vectors \(V :=(\vert v_1 \rangle ,\dots ,\vert v_l \rangle )\) in \(\mathcal{H}_B\) are equivalent.
-
(F1)
The state \(\vert \Psi \rangle \) is q-memory useless.
-
(F2)
There exist a basis \(\{\vert k \rangle \}_{k=1}^{d_B}\) of \(\mathcal{H}_B\), a probability distribution \(P_K\) on \(\{1,\dots ,d_B\}\), and real numbers \(\{\theta _{\lambda ,k}\}_{\lambda ,k}\) that satisfy (79).
-
(F3)
There exist a basis \(\{\vert k \rangle \}_{k=1}^{d_B}\) of \(\mathcal{H}_B\), a probability distribution \(P_K\) on \(\{1,\dots ,d_B\}\), and real numbers \(\{\theta _{\lambda ,k}\}_{\lambda ,k}\) that satisfy
$$\begin{aligned} J(V)=J(U) \end{aligned}$$(83)where l vectors \(U:=(\vert u_1 \rangle ,\dots ,\vert u_l \rangle )\) are defined as
$$\begin{aligned} \vert u_\lambda \rangle {:}{=}\sum _{k=1}^{d_B}\sqrt{P_K(k)}e^{i \theta _{\lambda ,k}}\vert k\rangle \end{aligned}$$(84)for \(\lambda =1,\dots , l\).
-
(F4)
There exist a probability distribution \(P_K\) on \(\{1,\dots ,d_B\}\) and real numbers \(\{\theta _{\lambda ,k}\}_{\lambda ,k}\) that satisfy
$$\begin{aligned} \frac{1}{l}J(V) = \sum _k P_K(k) Z_k \vert + \rangle \langle +\vert Z_k^\dagger , \end{aligned}$$(85)where \(\vert + \rangle {:}{=}\frac{1}{\sqrt{l}}\sum _{\lambda =1}^l\vert \lambda \rangle \) is the maximally coherent state and
$$\begin{aligned} \begin{aligned} Z_k{:}{=}\sum _\lambda e^{i\theta _{\lambda ,k}}\vert \lambda \rangle \langle \lambda \vert \end{aligned}\end{aligned}$$(86)is an (incoherent) diagonal unitary.
-
(F5)
There exist a probability distribution \(P_K\) on \(\{1,\dots ,d_B\}\) and real numbers \(\{\theta _{\lambda ,k}\}_{\lambda ,k}\) such that \(\Gamma _{J(V)}\in \mathcal {O}_\textrm{GIO}\) can be written as
$$\begin{aligned} \begin{aligned} \Gamma _{J(V)}(\rho )=\sum _{k} P_K(k) Z_k \rho Z_k^\dagger . \end{aligned}\end{aligned}$$(87)
For Condition (F4), Reference [40, Thm.3] found that, for \(l=2, 3\), any genuinely incoherent operation can be written as a probabilistic incoherent diagonal unitary, while for every \(l\ge 4\), there exists a genuinely incoherent operation that cannot be written as a probabilistic incoherent diagonal unitary. In addition, for any \(\Gamma \in \mathcal {O}_\textrm{GIO}\), there exist l vectors \(V :=(\vert v_1 \rangle ,\dots ,\vert v_l \rangle )\) such that \( \Gamma = \Gamma _{J(V)}\). Therefore, we obtain the following result.
Corollary 9
For every choice of \(\vert v_1 \rangle ,\dots ,\vert v_l \rangle \), there exist a basis \(\{\vert k \rangle \}_{k=1}^{d_B}\), a probability distribution \(\{P_K(k)\}_{k=1}^{d_B}\), and real numbers \(\{\theta _{\lambda ,k}\}_{\lambda ,k}\) that satisfy (79) for \(l=2,\, 3\). On the other hand, for every l with \(l\ge 4\), there exist \(\vert v_1 \rangle ,\dots ,\vert v_l \rangle \) for which there is no choice of \(\{\vert k \rangle \}_{k=1}^{d_B}\), \(\{P_K(k)\}_{k=1}^{d_B}\), and \(\{\theta _{\lambda ,k}\}_{\lambda ,k}\) that satisfies (79). In other words, Bob’s quantum memory is not useful to achieve the capacity \(C_\textrm{c}(\vert \Phi \rangle )\) for \(l=2,3\). However, when \(l \ge 4\), there exists a state \(\vert \Phi \rangle \) such that Bob’s quantum memory is useful to achieve the capacity \(C_\textrm{c}(\vert \Phi \rangle )\).
Therefore, when the preshared state \(\rho _{AB}\) is a pure state \(\vert \Psi \rangle \langle \Psi \vert \) as in Theorem 8, the multiplicity-free condition holds, and \(\vert \hat{G}'\vert \) is 2 or 3, the quantum memory \(\mathcal{H}_B\) can be replaced by a classical memory. However, when \(\vert \hat{G}'\vert >3\) there is a pure state \(\vert \Psi \rangle \langle \Psi \vert \) even with the multiplicity-free condition such that the quantum memory \(\mathcal{H}_B\) enhances the communication speed.
Proof of Theorem 8
Corollary 7 shows the equivalence between Conditions (F1) and (F2). Since the application of a unitary operator to a basis does not change the Gram matrix, Conditions (F2) and (F3) are equivalent.
Next, we show the equivalence between (F3) and (F4). Since the Gram matrix J(U) can be written by
it is written as
where we define \(\vert w_k \rangle =\frac{1}{\sqrt{l}}\sum _{\lambda =1}^{l} e^{i\theta _{\lambda ,k}}\vert \lambda \rangle \) for every k. We further note that \(\vert w_k \rangle \) can be written by \(\vert w_k \rangle =Z_k \vert + \rangle \), This fact implies
which shows the equivalence between (F3) and (F4).
Next, we show the equivalence between (F4) and (F5). We assume Condition (F5). Then, we have
which implies Condition (F4).
We assume Condition (F4). Then, the GIO \(\Gamma _{J(V)}\) satisfies
which implies Condition (F5). \(\square \)
4.3 Construction of q-memory useful pure state
We provide a systematic method to construct a q-memory useful pure state by using the results of GIO. Since an arbitrary \(\frac{1}{l} J(\textbf{v})\) can be obtained by applying some genuinely incoherent operation to \(\vert + \rangle _l\), our problem is reduced to finding whether such an operation in \(\mathcal {O}_\textrm{GIO}\) can be implemented by a probabilistic incoherent unitary. The following result, which gives the extremality condition for \(\mathcal {O}_\textrm{GIO}\), is useful to present examples for which quantum memory is useful for all Bob’s bases.
Lemma 10
([40, Proof of Theorem 21]) Let \(\Gamma \in \mathcal {O}_\textrm{GIO}\) be represented by a set \(\{K_t\}_{t=1}^{r'}\) of Kraus operators with \(r'>1\). Then, \(\Gamma \) cannot be realized by a probabilistic incoherent unitary if \({r'}^2\) operators \(\{K^\dagger _t K_s\}_{t,s=1}^{r'}\) are linearly independent.
Kraus operators of a channel \(\Gamma _{J(V)}\in \mathcal {O}_\textrm{GIO}\) are given as follows.
Lemma 11
Given l vectors \(V:=(\vert v_1 \rangle ,\dots ,\vert v_l \rangle )\) in \(\mathcal{H}_B\) with the form \(\vert v_j \rangle =\sum _{k=1}^{d_B} v_{j,k}\vert k \rangle \), the operators \(K_k=\textrm{diag}(\vert \tilde{a}_k \rangle )\) for vectors \(\vert \tilde{a}_k \rangle =\sum _{j=1}^lv_{j,k} \vert j \rangle \) with \(k=1, \ldots , d_B\) form Kraus operators \(\{K_t\}_{t=1}^{d_B}\) of a channel \(\Gamma _{J(V)}\in \mathcal {O}_\textrm{GIO}\).
Proof
Since the relation
holds, we have
\(\square \)
The above lemma shows that Kraus operators of any genuinely incoherent operation \(\Gamma _{J(V)}\in \mathcal {O}_\textrm{GIO}\) are given as diagonal operators. More generally, the following lemma is known.
Lemma 12
([40, Theorem 2]) A channel is GIO if and only if all Kraus operators are diagonal.
Combining Lemmas 10 and 11 with the statement (F5) implies the following. When the \(d_B^2\) vectors \(\{ ( \overline{v_{j,t}} v_{j,s} )_{j=1}^l \}_{t,s=1}^{d_B}\) are linearly independent, the genuinely incoherent operation \(\Gamma _{J(V)}\in \mathcal {O}_\textrm{GIO}\) cannot be realized by a probabilistic incoherent unitary. Then, a state \(\vert \Psi \rangle \) constructed by the set \(\{\vert v_j \rangle \}_{j=1}^l\) serves as a resource state, for which quantum memory is useful for all Bob’s bases. To satisfy this condition, \({d_B}^2\) needs to be smaller than l.
A protocol to find such a resource state is as follows.
-
(1)
Given \(l \le \vert \hat{G} \vert \), we choose \({d_B}\) such that \(1<{d_B}^2\le l\).
-
(2)
Pick l states \(\vert v_j \rangle =\sum _{k=1}^{d_B} v_{j,k}\vert k \rangle \in \mathbb {C}^{d_B}\) for \(j=1,\dots ,l\).
-
(3)
Check whether the \({d_B}^2\) vectors \(\{ ( \overline{v_{j,t}} v_{j,s})_{j=1}^l \}_{t,s=1}^{d_B}\) are linearly independent. If not, go back to the previous step and try another set of \(\{\vert v_j \rangle \}_j\).
-
(4)
Choose an arbitrary subset of irreps \(\hat{G}'\subset \hat{G}\) such that \(\vert \hat{G}' \vert =l\). Choose an arbitrary state \(\vert \psi _\lambda \rangle \in \mathcal {H}_\lambda \) for each \(\lambda \in \hat{G}'\) and an arbitrary probability distribution \(P_\Lambda (\lambda )\) over \(\lambda \in \hat{G}'\) with \(P_\Lambda (\lambda )>0\) \(\forall \lambda \in \hat{G}'\).
-
(5)
Define \(\vert \Psi \rangle =\sum _{j=1}^l\sqrt{P_\Lambda (\lambda _j)}\vert \psi _{\lambda _j} \rangle \otimes \vert v_j \rangle =\sum _{j=1}^l\sum _{k=1}^{d_B}\sqrt{P_\Lambda (\lambda _j)} v_{j,k} \vert \psi _{\lambda _j} \rangle \otimes \vert k \rangle \), where \(\lambda _j\) refers to the j th irrep in \(\hat{G}'\).
The final state \(\vert \Psi \rangle \) is a state for which quantum memory is useful for all Bob’s bases. For \(1<{d_B}^2\le l\), a randomly chosen \(\{\vert v_j \rangle \}_{j=1}^l\) usually satisfies the linear independence condition in Step 3. As an analytical example, we find an instance for \(\{\vert v_j \rangle \}_{j=1}^l\) for \(l\ge 4\) and \({d_B}=2\) discussed in Ref. [40], which is defined as
One can then check that four vectors \(\{ ( \overline{v_{j,t}} v_{j,s} )_{j=1}^l \}_{t,s=1}^2\) are linearly independent. We then prepare \(\{\vert v_j \rangle \}_{j=1}^l\) as \(v_{j,1} \vert 1 \rangle +v_{j,2} \vert 2 \rangle \).
The states constructed by the above procedure Steps 1–5 provide situations where Bob wants to hold local quantum memory and make a collective measurement on his side before communication. Notice that, as shown in Ref. [13], the capacity \(C_\textrm{c}(\rho _{AB})\) for the pure state case can be achieved by applying collective measurement across n Bob’s local systems of the preshared state.
5 Case with maximally entangled state
5.1 Commutative group
Similarly to Sect. 3.3, we assume that the group G is commutative. For simplicity, we assume the multiplicity-free condition to the space \(\mathcal{H}_A\). We use the same notations as the ones used in Sect. 3.3. We assume that the preshared entangled state \(\vert \Psi \rangle \) is a maximally entangled state \(\vert \Phi \rangle \). Thus, due to the relations (55) and (56), the condition (79) in Corollary 7 holds. In this case, the condition (79) in Corollary 7 shows that the maximally entangled state \(\vert \Phi \rangle \) is q-memory useless in a simpler way than Condition (A2) does. This is also a special case of the examples presented in Sect. 3.2.
Next, we proceed to the case when the multiplicity-free condition does not hold. Using an orthogonal basis \(\{\vert e_{j,\lambda }\rangle \}_{j=1}^{l(\lambda )}\) where \(l(\lambda ){:}{=}\dim \mathcal {M}_\lambda \) and an orthogonal basis \(\{\vert v_{j}\rangle \}_{j=1}^{r}\) with \(r=\sum _{\lambda =1}^l l(\lambda )\), the maximally entangled state \(\vert \Phi \rangle \) is written as \(\frac{1}{\sqrt{r}} \sum _{\lambda =1}^l \vert \psi _\lambda \rangle \sum _{j=1}^{l(\lambda )} \vert e_{j,\lambda }\rangle \vert v_{j+\sum _{\lambda '=1}^\lambda l(\lambda ') }\rangle \). We choose \(\vert e_{B,k}\rangle \) as
Then, we have
Hence, by choosing \(\vert \psi _\lambda \rangle \Big (\frac{1}{\sqrt{l(\lambda )}} \sum _{j=1}^{l(\lambda )} e^{-2\pi k j i/r } \vert e_{j,\lambda }\rangle \Big )\) as \( \vert \psi _{\lambda ,k} \rangle \), Condition (C1) holds in Theorem 5. That is, the quantum memory is not needed even in this case.
In particular, when the set \(\hat{G}'\) is the whole set \(\hat{G}\) of irreducible representations of G, the entropy of \(\sum _{g \in G}\frac{1}{\vert G \vert } U_g \vert \Phi \rangle \langle \Phi \vert U_g^\dagger \) is \(\log \vert G \vert \). This means that the action of G can be distinguished perfectly even when Bob measures his memory in advance. In other words, the states \(\{ U_g \vert \Phi \rangle \}_{g \in G}\) can be distinguished perfectly by one-way local measurements. For example, given Weyl–Heisenberg representation of \(\mathbb {Z}_d \times \mathbb {Z}_d\), the action of the commutative subgroup of \(\mathbb {Z}_d \times \mathbb {Z}_d\) can be distinguished perfectly by one-way local measurements. As another example, given Weyl–Heisenberg representation of \(\mathbb {F}_p^n \times \mathbb {F}_p^n\), the action of the commutative subgroup of \(\mathbb {F}_p^n \times \mathbb {F}_p^n\) can be distinguished perfectly by one-way local measurements. In fact, this kind of state discrimination has been discussed in the context of local discrimination of generalized Bell states in [50,51,52,53,54,55,56,57].
While the classification of a commutative subgroup in \(\mathbb {Z}_d \times \mathbb {Z}_d\) is not easy [55,56,57], a commutative subgroup in \(\mathbb {F}_p^n \times \mathbb {F}_p^n\) can be easily classified as follows. Commutativity can be characterized by the orthogonality under the symplectic inner product. The set of m-dimensional orthogonal subspace can be considered as an orthogonal version of Grassmannian over finite fields, whose classification is well known [58, Proposition 1.7.2]. For the identification of m-dimensional orthogonal subspace, it is sufficient to choose m independent commutative vectors in \(\mathbb {F}_p^n \times \mathbb {F}_p^n\). The choice of the first nonzero vector has \(p^{2n}-1\) cases. The choice of the second nonzero vector has \(p^{2(n-1)}-1\) cases due to the commutativity with the first vector. The commutativity with the first vector is equivalent to the orthogonal property to the first vector for the symplectic inner product. Therefore, in the case of m-dimensional subgroups, we have \((p^{2n}-1)(p^{2(n-1)}-1)\cdots (p^{2(n-m+1)}-1)\) cases. Since \((p^m-1)(p^{m-1}-1)\cdots (p-1)\) choices of m independent commutative vectors correspond to the same m-dimensional subgroup, we have \(\frac{(p^{2n}-1)(p^{2(n-1)}-1)\cdots (p^{2(n-m+1)}-1)}{(p^m-1)(p^{m-1}-1)\cdots (p-1)}\) commutative m-dimensional subgroup in total. When \(m=n\), this number is simplified to \((p^{n}+1)(p^{n-1}+1)\cdots (p+1)\).
5.2 General group
Next, we observe how the above fact can be generalized to a general group G. When G is not a commutative group, the irreducible representation is not one-dimensional. Hence, this case cannot be considered as a special case of the examples presented in Section 3.2.
We have the following lemma for a general group with respect to the relation between Condition (C1) and a maximally entangled state \(\vert \Phi \rangle \) when the set \(\hat{G}'\) of irreducible representations appearing in \(\mathcal{H}_A\) is given as \(\{1, \ldots , l\}\).
Lemma 13
A maximally entangled state \(\vert \Phi \rangle \) satisfies Condition (C1) in Theorem 5 if and only if the relation \(\dim \mathcal{M}_{\lambda } \ge \dim \mathcal{H}_{\lambda }\) holds for \(\lambda \in \hat{G}'\).
This lemma guarantees the following. When the preshared entangled state \(\vert \Psi \rangle \) is a maximally entangled state \(\vert \Phi \rangle \) and the relation \(\dim \mathcal{M}_{\lambda } \ge \dim \mathcal{H}_{\lambda }\) holds for \(\lambda \in \hat{G}'\), the states \(\{ U_g \vert \Phi \rangle \}_{g \in G}\) can be distinguished perfectly by one-way local measurements.
Proof
The “only if” part. We assume that a maximally entangled state \(\vert \Phi \rangle \) satisfies the condition (69). Then, the condition (69) implies \({{\,\textrm{Tr}\,}}_{\mathcal{M}_{\lambda }} \vert \psi _{\lambda ,k}\rangle \langle \psi _{\lambda ,k}\vert \) is \({{\,\textrm{Tr}\,}}_{\mathcal{M}_{\lambda }} \rho _{A}\). Hence, \({{\,\textrm{Tr}\,}}_{\mathcal{M}_{\lambda }} \vert \psi _{\lambda ,k}\rangle \langle \psi _{\lambda ,k}\vert \) is the completely mixed state. Thus, \(\dim \mathcal{M}_{\lambda } \ge \dim \mathcal{H}_{\lambda }\).
The “if” part. We assume that \(\dim \mathcal{M}_{\lambda } \ge \dim \mathcal{H}_{\lambda }\) for \(\lambda \in \hat{G}'\). When two entangled states have the same reduced density matrix on \(\mathcal{H}_A\), these two entangled states can be converted to each other via a local unitary on \(\mathcal{H}_B\). It is sufficient to show the existence of the choice of \(\{\vert k\rangle \}\) and \(\{\vert \psi _{\lambda ,k}\rangle \}\) to satisfy Condition (C1).
We denote the dimension of \(\mathcal{M}_\lambda \) by \(d_\lambda '\). We choose an orthogonal basis \(\{ \vert e_{\lambda ,A,j}\rangle \}_{j=0}^{d_\lambda -1}\) of \(\mathcal{H}_\lambda \), and an orthogonal basis \(\{ \vert e_{\lambda ,A,j'}'\rangle \}_{j'=0}^{d_\lambda '-1}\) of \(\mathcal{M}_\lambda \). We define the operators \(Z:= \sum _{j=0}^{d_\lambda -1} e^{2\pi ij/d_\lambda } \vert e_{\lambda ,A,j}\rangle \langle e_{\lambda ,A,j}\vert \) on \(\mathcal{H}_\lambda \), and \(X:= \sum _{j'=0}^{d_\lambda '-1} \vert e_{\lambda ,A,j'+1}'\rangle \langle e_{\lambda ,A,j'}'\vert \) on \(\mathcal{M}_\lambda \), where modulo \(d_\lambda '\) is applied in the definition of X. For \((k_\lambda ,k_\lambda ') \in \{0, 1,\ldots ,d_{\lambda }-1\} \times \{0, 1,\ldots ,d_{\lambda }'-1\}\), we define the vectors \(\vert \psi _{\lambda ,k,k'}\rangle :=Z^k \otimes X^{k'} \frac{1}{\sqrt{d_\lambda }}\sum _{j=0}^{d_\lambda -1} \vert e_{\lambda ,A,j}\rangle \vert e_{\lambda ,A,j}'\rangle \) in \(\mathcal{H}_\lambda \otimes \mathcal{M}_\lambda \), which forms an orthogonal basis of \(\mathcal{H}_\lambda \otimes \mathcal{M}_\lambda \).
For \((k_\lambda ,k_\lambda ') \in \{0, 1,\ldots ,d_{\lambda }-1\} \times \{0, 1,\ldots ,d_{\lambda }'-1\} \) with \(\lambda \in \hat{G}'=\{1,2, \ldots , l\}\), we define the vector \(\vert e_{B, k_1,k_1', \ldots , k_l,k_l'},\lambda \rangle \) in \(\mathcal{H}_B\). Then, we define the vector
which satisfies Condition (C1).
The reduced density matrix of
on \(\mathcal{H}_A\) is
Therefore, the reduced density matrix of the vector (99) on \(\mathcal{H}_A\) is
which is the completely mixed state on \(\mathcal{H}_A\). Therefore, a maximally entangled state \(\vert \Phi \rangle \) has the form to satisfy Condition (C1). Hence, we obtain the “if” part. \(\square \)
6 Implications to quantum illumination
As one of the settings of physical significance, quantum illumination investigates whether a low-reflective target object is present by shooting light and collecting the signal. The problem of target detection can be reduced to the channel discrimination problem to identify whether the given channel is a replacement channel that prepares the thermal state or a thermal attenuator channel. In this scenario, it has been shown that entanglement in the input state can enhance the discrimination performance in symmetric and asymmetric channel discrimination settings [37,38,39].
Here, we consider a variant of quantum illumination, where instead of detecting the thermal noise, we are to detect the existence of a certain noise channel.Footnote 2 Namely, we consider the asymmetric channel discrimination task where the null hypothesis is error-free, i.e., \(\Gamma _1=\text {id}\), and the alternative hypothesis is to have a group twirling channel as noise, i.e., \(\Gamma _2=\mathcal {G}\). One can then ask whether entanglement in a given input state \(\psi \) helps the hypothesis testing, i.e., whether one would like to hold a local quantum memory to utilize the entanglement in \(\psi \).
This problem is formulated as follows. Let \(\eta _{j}:=\Gamma _{j}\otimes \text {id}(\psi )\) be the output states with an input state \(\psi \) for \(j=1,2\). In general, one is allowed to make a collective POVM measurement \(\{E_n,I-E_n\}\) on multiple copies \(\eta _{j}^{\otimes n}\) of output states. We define the type-I error by \(\alpha _n(E):={{\,\textrm{Tr}\,}}((I-E)\,\eta _1^{\otimes n})\) and type-II error by \(\beta _n(E):={{\,\textrm{Tr}\,}}(E\,\eta _2^{\otimes n})\). In the asymmetric channel discrimination task, we aim to minimize the type-II error under the condition that type-I error is upper bounded by a constant \(\epsilon \). The Stein’s lemma [35, 60] tells that for all \(0<\epsilon <1\), the error exponent of the type-II error is characterized by the relative entropy between two output states, i.e.,
We can address this question for the case of asymmetric channel discrimination by employing the framework established above. Since Stein’s lemma assures that the performance of the hypothesis testing is characterized by the relative entropy as in (102), entanglement in \(\psi \) is helpful (one would like to retain local quantum memory) if and only if the equality in (20) with \(\rho _{AB}=\psi \) holds. We can also carry over the characterization of the resource state in Theorem 8 and Corollary 9 for the local memory to be useless.
As a typical example, we choose \(G=\mathbb {Z}_d\) with a representation \(U_g=\sum _{t=0}^{d-1}\vert t+g\ \textrm{mod}\ d \rangle \!\langle t\vert \). This representation can be decomposed into \(U_g = \bigoplus _{\lambda =0}^{d-1} U_{\lambda , g}\) where \(U_{\lambda , g}:= e^{2\pi i g\lambda /d}\vert +_\lambda \rangle \langle +_\lambda \vert \) and \(\vert +_\lambda \rangle := \frac{1}{\sqrt{d}}\sum _{j=0}^{d-1} e^{2\pi ij \lambda /d}\vert j \rangle \). Then, Theorem 8, as well as a consequence from Sect. 5.1, implies that the maximally entangled input \(\vert \psi \rangle =\frac{1}{\sqrt{d}}\sum _{t=0}^{d-1}\vert tt \rangle =\frac{1}{\sqrt{d}}\sum _{\lambda =0}^{d-1}\vert +_\lambda \rangle \vert +_{d-\lambda -1} \rangle \) does not require the local quantum memory to achieve the optimal performance for the noise detection task. Indeed, the Gram matrix \(J(\textbf{v})\) in Theorem 8 is the \(d\times d\) identity matrix, as \(\{\vert +_\lambda \rangle \}_{\lambda }\) constructs an orthonormal basis. Therefore, by taking \(P_K(k) = 1/d\) and \(\theta _{\lambda ,k}=2\pi \lambda k/d\) in (F4) of Theorem 8, we can check that (85) is indeed satisfied. This makes a stark contrast to the case of the original quantum illumination, in which the two-mode squeezed state, which is the infinite-dimensional correspondence of the maximally entangled state, serves as the optimal input with the help of quantum memory [39].
7 Discussion
We have introduced the new concept of q-memory uselessness and usefulness of a preshared bipartite state in the dense-coding task based on a given group representation. We have derived various conditions for q-memory uselessness for general mixed and pure states. Using our general conditions, we have presented an example of a mixed entangled state that is q-memory useless. In addition, we have revealed a notable relation between q-memory uselessness of pure states and the resource theory of coherence. This relation is useful when the state is pure, the group is abelian, and the representation is multiplicity-free. Under this condition, we have shown that any pure state is q-memory useless when the given group representation consists of at most three irreducible representations. We also have presented a systematic way to construct a pure q-memory useful state when the group representation consists of more than three irreducible representations. Finally, we have discussed the relations between our framework and quantum illumination. We have considered a variant of quantum illumination that aims to distinguish the noiseless and the group twirling channels and employed our conditions to characterize the usefulness of quantum memory in enhancing the performance.
An interesting future direction is to find whether there exists a separable q-memory useful state. The class of q-memory useless states represented by the form in (40) is known to have zero quantum discord [61]. This implies that q-memory useful separable states, if any, should have nonzero quantum discord. Establishing the quantitative relation between quantum discord and q-memory usefulness may provide further insights into the role of quantum correlation in dense coding.
Data availability
Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.
Notes
The class of cq-symmetric channels has been studied well in the literature [16]. It is a quantum generalization of a regular channel [17], which was introduced as a useful class of channels in classical information theory. This class of classical channels has various names, such as generalized additive [18, Section V] and conditional additive [18, Section 4] channels. The class of additive channels is contained in the regular channels as a subclass. The reference [19, Section VII-A-2] studied its quantum extension with an additive group and discussed the capacity and the wire-tap capacity with semantic security. Since this class has a good symmetric property, it is known that algebraic codes achieve the capacity [17, 19,20,21,22].
Our setting can also be considered as a variant of quantum reading [59] in the sense that the reflectivity of the target is not small.
References
Bennett, C.H., Wiesner, S.J.: Communication via one- and two-particle operators on Enstein–Podolsky–Rosen states. Phys. Rev. Lett. 69, 2881–2884 (1992). https://doi.org/10.1103/PhysRevLett.69.2881
Hiroshima, T.: Optimal dense coding with mixed state entanglement. J. Phys. A: Math. Gen. 34(35), 6907 (2001). https://doi.org/10.1088/0305-4470/34/35/316
Bowen, G.: Classical information capacity of superdense coding. Phys. Rev. A 63, 022302 (2001). https://doi.org/10.1103/PhysRevA.63.022302
Horodecki, M., Horodecki, P., Horodecki, R., Leung, D., Terhal, B.: Classical capacity of a noiseless quantum channel assisted by noisy entanglement. Quantum Inf. Comput. 1, 70 (2001)
Winter, A.: Scalable programmable quantum gates and a new aspect of the additivity problem for the classical capacity of quantum channels. J. Math. Phys. 43(9), 4341–4352 (2002) https://pubs.aip.org/aip/jmp/article-pdf/43/9/4341/8171944/4341_1_online.pdf. https://doi.org/10.1063/1.1498489
Bruß, D., D’Ariano, G.M., Lewenstein, M., Macchiavello, C., Sen(De), A., Sen, U.: Distributed quantum dense coding. Phys. Rev. Lett. 93, 210501 (2004). https://doi.org/10.1103/PhysRevLett.93.210501
Beran, M.R., Cohen, S.M.: Nonoptimality of unitary encoding with quantum channels assisted by entanglement. Phys. Rev. A 78, 062337 (2008). https://doi.org/10.1103/PhysRevA.78.062337
Horodecki, M., Piani, M.: On quantum advantage in dense coding. J. Phys. A: Math. Theor. 45(10), 105306 (2012). https://doi.org/10.1088/1751-8113/45/10/105306
Datta, N., Leditzky, F.: Second-order asymptotics for source coding, dense coding, and pure-state entanglement conversions. IEEE Trans. Inf. Theory 61(1), 582–608 (2015). https://doi.org/10.1109/TIT.2014.2366994
Das, S., Wilde, M.M.: Quantum rebound capacity. Phys. Rev. A 100, 030302 (2019). https://doi.org/10.1103/PhysRevA.100.030302
Laurenza, R., Lupo, C., Lloyd, S., Pirandola, S.: Dense coding capacity of a quantum channel. Phys. Rev. Res. 2, 023023 (2020). https://doi.org/10.1103/PhysRevResearch.2.023023
Wakakuwa, E.: Superdense coding in the resource theory of asymmetry. Phys. Rev. A 104, 042413 (2021). https://doi.org/10.1103/PhysRevA.104.042413
Hayashi, M., Wang, K.: Dense coding with locality restriction on decoders: Quantum encoders versus superquantum encoders. PRX Quantum 3, 030346 (2022). https://doi.org/10.1103/PRXQuantum.3.030346
Zhao, R., Dudin, Y.O., Jenkins, S.D., Campbell, C.J., Matsukevich, D.N., Kennedy, T. a B., Kuzmich, A.: Long-lived quantum memory. Nature Phys. 5(2), 100–104 (2009). https://doi.org/10.1038/nphys1152
Heshami, K., England, D.G., Humphreys, P.C., Bustard, P.J., Acosta, V.M., Nunn, J., Sussman, B.J.: Quantum memories: emerging applications and recent advances. J. Mod. Opt. 63(20), 2005–2028 (2016). https://doi.org/10.1080/09500340.2016.1148212
Korzekwa, K., Puchała, Z., Tomamichel, M., Życzkowski, K.: Encoding classical information into quantum resources. IEEE Trans. Inf. Theory 68(7), 4518–4530 (2022). https://doi.org/10.1109/TIT.2022.3157440
Delsarte, P., Piret, P.: Algebraic constructions of shannon codes for regular channels. IEEE Trans. Inf. Theory 28(4), 593–599 (1982). https://doi.org/10.1109/TIT.1982.1056525
Hayashi, M.: Exponential decreasing rate of leaked information in universal random privacy amplification. IEEE Trans. Inf. Theory 57(6), 3989–4001 (2011). https://doi.org/10.1109/TIT.2011.2110950
Hayashi, M.: Quantum wiretap channel with non-uniform random number and its exponent and equivocation rate of leaked information. IEEE Trans. Inf. Theory 61(10), 5595–5622 (2015). https://doi.org/10.1109/TIT.2015.2464215
Dobrushin, R.: Asymptotic optimality of group and systematic codes for some channels. Theory Prob. Appl. 8(1), 47–60 (1963)
Elias, P.: Coding for noisy channels. IRE Conv. Rec. 3, 37–46 (1955)
Hayashi, M., Watanabe, S.: Finite-length analyses for source and channel coding on markov chains. Entropy 22(4) (2020). https://doi.org/10.3390/e22040460
Wu, J., Long, G.-L., Hayashi, M.: Quantum secure direct communication with private dense coding using a general preshared quantum state. Phys. Rev. Appl. 17, 064011 (2022). https://doi.org/10.1103/PhysRevApplied.17.064011
Streltsov, A., Adesso, G., Plenio, M.B.: Colloquium: Quantum coherence as a resource. Rev. Mod. Phys. 89, 041003 (2017). https://doi.org/10.1103/RevModPhys.89.041003
Bartlett, S.D., Rudolph, T., Spekkens, R.W.: Reference frames, superselection rules, and quantum information. Rev. Mod. Phys. 79, 555–609 (2007). https://doi.org/10.1103/RevModPhys.79.555
Gour, G., Spekkens, R.W.: The resource theory of quantum reference frames: manipulations and monotones. New J. Phys. 10(3), 033023 (2008). https://doi.org/10.1088/1367-2630/10/3/033023
Gour, G., Marvian, I., Spekkens, R.W.: Measuring the quality of a quantum reference frame: The relative entropy of frameness. Phys. Rev. A 80, 012307 (2009). https://doi.org/10.1103/PhysRevA.80.012307
Bartlett, S.D., Rudolph, T., Spekkens, R.W., Turner, P.S.: Quantum communication using a bounded-size quantum reference frame. New J. Phys. 11(6), 063013 (2009). https://doi.org/10.1088/1367-2630/11/6/063013
Marvian Mashhad, I.: Symmetry, asymmetry and quantum information. PhD Thesis (2012)
Marvian, I., Spekkens, R.W.: The theory of manipulations of pure state asymmetry: I. basic tools, equivalence classes and single copy transformations. New J. Phys. 15(3), 033001 (2013). https://doi.org/10.1088/1367-2630/15/3/033001
Marvian, I., Spekkens, R.W.: Asymmetry properties of pure quantum states. Phys. Rev. A 90, 014102 (2014). https://doi.org/10.1103/PhysRevA.90.014102
Marvian, I., Spekkens, R.W.: Extending noether’s theorem by quantifying the asymmetry of quantum states. Nat. Commun. 5(1), 1–8 (2014). https://doi.org/10.1038/ncomms4821
Marvian, I., Spekkens, R.W.: Modes of asymmetry: The application of harmonic analysis to symmetric quantum dynamics and quantum reference frames. Phys. Rev. A 90, 062110 (2014). https://doi.org/10.1103/PhysRevA.90.062110
Wakakuwa, E.: Symmetrizing cost of quantum states. Phys. Rev. A 95, 032328 (2017). https://doi.org/10.1103/PhysRevA.95.032328
Hiai, F., Petz, D.: The proper formula for relative entropy and its asymptotics in quantum probability. Commun. Math. Phys. 143(1), 99–114 (1991). https://doi.org/10.1007/BF02100287
Hayashi, M.: A Group Theoretic Approach to Quantum Information. Springer, Switzerland (2017). https://doi.org/10.1007/978-3-319-45241-8
Lloyd, S.: Enhanced sensitivity of photodetection via quantum illumination. Science 321(5895), 1463–1465 (2008). https://doi.org/10.1126/science.1160627
Tan, S.-H., Erkmen, B.I., Giovannetti, V., Guha, S., Lloyd, S., Maccone, L., Pirandola, S., Shapiro, J.H.: Quantum illumination with gaussian states. Phys. Rev. Lett. 101, 253601 (2008). https://doi.org/10.1103/PhysRevLett.101.253601
De Palma, G., Borregaard, J.: Minimum error probability of quantum illumination. Phys. Rev. A 98, 012101 (2018). https://doi.org/10.1103/PhysRevA.98.012101
de Vicente, J.I., Streltsov, A.: Genuine quantum coherence. J. Phys. A: Math. Theor. 50(4), 045301 (2016). https://doi.org/10.1088/1751-8121/50/4/045301
Holevo, A.S.: The capacity of the quantum channel with general signal states. IEEE Trans. Inf. Theory 44(1), 269–273 (1998). https://doi.org/10.1109/18.651037
Schumacher, B., Westmoreland, M.D.: Sending classical information via noisy quantum channels. Phys. Rev. A 56, 131–138 (1997). https://doi.org/10.1103/PhysRevA.56.131
Holevo, A.S.: The capacity of the quantum channel with general signal states. IEEE Trans. Inf. Theory 44(1), 269–273 (1998). https://doi.org/10.1109/18.651037
Schumacher, B., Westmoreland, M.D.: Sending classical information via noisy quantum channels. Phys. Rev. A 56, 131–138 (1997). https://doi.org/10.1103/PhysRevA.56.131
Deng, F.-G., Long, G.L., Liu, X.-S.: Two-step quantum direct communication protocol using the Einstein–Podolsky–Rosen pair block. Phys. Rev. A 68, 042317 (2003). https://doi.org/10.1103/PhysRevA.68.042317
Petz, D.: Sufficient subalgebras and the relative entropy of states of a von Neumann algebra. Commun. Math. Phys. 105(1), 123 (1986). https://doi.org/10.1007/BF01212345
Hayden, P., Jozsa, R., Petz, D., Winter, A.: Structure of states which satisfy strong subadditivity of quantum entropy with equality. Commun Math. Phys 246(2), 359 (2004). https://doi.org/10.1007/s00220-004-1049-z
Rains, E.M.: Bound on distillable entanglement. Phys. Rev. A 60, 179–184 (1999). https://doi.org/10.1103/PhysRevA.60.179
Devetak, I., Shor, P.W.: The capacity of a quantum channel for simultaneous transmission of classical and quantum information. Commun. Math. Phys. 256(2), 287–303 (2005). https://doi.org/10.1007/s00220-005-1317-6
Walgate, J., Short, A.J., Hardy, L., Vedral, V.: Local distinguishability of multipartite orthogonal quantum states. Phys. Rev. Lett. 85, 4972–4975 (2000). https://doi.org/10.1103/PhysRevLett.85.4972
Ghosh, S., Kar, G., Roy, A., Sen(De), A., Sen, U.: Distinguishability of bell states. Phys. Rev. Lett. 87, 277902 (2001). https://doi.org/10.1103/PhysRevLett.87.277902
Nathanson, M.: Distinguishing bipartitite orthogonal states using LOCC: Best and worst cases. J. Math. Phys. 46(6), 062103 (2005). https://doi.org/10.1063/1.1914731
Owari, M., Hayashi, M.: Local copying and local discrimination as a study for nonlocality of a set of states. Phys. Rev. A 74, 032108 (2006). https://doi.org/10.1103/PhysRevA.74.032108
Fan, H.: Distinguishability and indistinguishability by local operations and classical communication. Phys. Rev. Lett. 92, 177905 (2004). https://doi.org/10.1103/PhysRevLett.92.177905
Hashimoto, T., Horibe, M., Hayashi, A.: Simple criterion for local distinguishability of generalized bell states in prime dimension. Phys. Rev. A 103, 052429 (2021). https://doi.org/10.1103/PhysRevA.103.052429
Li, M.-S., Shi, F., Wang, Y.-L.: Local discrimination of generalized bell states via commutativity. Phys. Rev. A 105, 032455 (2022). https://doi.org/10.1103/PhysRevA.105.032455
Yang, Y.-H., Yan, R.-Y., Wang, X.-L., Yuan, J.-T., Zuo, H.-J.: Novel method for one-way local distinguishability of generalized bell states in arbitrary dimension. J. Phys. A: Math. Theor. 55(1), 015301 (2021). https://doi.org/10.1088/1751-8121/ac38ed
Stanley, R.P.: Enumerative Combinatorics, vol. 1, 2nd edn. Cambridge University Press, Cambridge (2011)
Pirandola, S.: Quantum reading of a classical digital memory. Phys. Rev. Lett. 106, 090504 (2011). https://doi.org/10.1103/PhysRevLett.106.090504
Ogawa, T., Nagaoka, H.: Strong converse and stein’s lemma in quantum hypothesis testing. IEEE Trans. Inf. Theory 46(7), 2428–2433 (2000). https://doi.org/10.1109/18.887855
Modi, K., Brodutch, A., Cable, H., Paterek, T., Vedral, V.: The classical-quantum boundary for correlations: Discord and related measures. Rev. Mod. Phys. 84, 1655–1707 (2012). https://doi.org/10.1103/RevModPhys.84.1655
Acknowledgements
M.H. is very grateful to Dr. Jiawei Wu for helpful discussions for the usefulness of quantum memory in private dense coding. We also thank an anonymous reviewer for suggesting a simpler Proof of Proposition 3. R.T. acknowledges the support of the Lee Kuan Yew Postdoctoral Fellowship at Nanyang Technological University Singapore. M.H. is supported in part by the National Natural Science Foundation of China (Grant No. 62171212).
Author information
Authors and Affiliations
Corresponding authors
Ethics declarations
Conflict of interest
There are no conflict of interest.
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Derivation from (C1) to (A2)
Derivation from (C1) to (A2)
We demonstrate how to derive from (C1) to (A2) in the pure state case. That is, we check that a pure state \(\rho _{AB}=\vert \Psi \rangle \langle \Psi \vert \) that satisfies (68) and (69) indeed satisfies (23) as follows.
Let \(\vert \psi _{\lambda ,k} \rangle =\sum _j \sqrt{c_{\lambda ,k,j}}\vert r_{\lambda , k, j} \rangle _\mathcal{H_\lambda }\vert m_{\lambda , k, j} \rangle _{\mathcal {M}_\lambda }\) be a Schmidt decomposition of \(\vert \psi _{\lambda ,k} \rangle \), where \(\left\{ \vert r_{\lambda , k,i} \rangle \right\} _i\) and \(\left\{ \vert m_{\lambda , k, i} \rangle \right\} _i\) are orthonormal bases on \(\mathcal{H_\lambda }\) and \(\mathcal {M}_\lambda \). Then, the condition (69) ensures that
Substituting this into the form (68) yields
Using this expression, we can write
We then have
where \(\vert \tilde{\Phi }_{\lambda ,k} \rangle {:}{=}\sum _{j:c_{\lambda ,k,j}\ne 0}\vert r_{\lambda , k, j} \rangle \vert m_{\lambda , k, j} \rangle \).
We also have
and
where \(\vert \phi _{\lambda } \rangle {:}{=}\sum _k \sqrt{P_{K}(k)}e^{i\theta _{\lambda ,k}}\sum _j \sqrt{c_{\lambda ,k,j}}\vert r_{\lambda , k, j} \rangle _\mathcal{H_\lambda }\vert m_{\lambda , k, j} \rangle _{\mathcal {M}_\lambda }\vert k \rangle _B\).
The fact that
can be seen as follows. The square of the right-hand side becomes
Taking the matrix power in both sides of (A1) results in
for every real number a. This implies
Substituting (A12) into (A10) gives
which confirms (A9).
Combining this with (A6) and noting that
we get
where in the second equality we used (A11). This confirms (23).
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Takagi, R., Hayashi, M. When quantum memory is useful for dense coding. Lett Math Phys 114, 88 (2024). https://doi.org/10.1007/s11005-024-01831-x
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s11005-024-01831-x