Next Article in Journal
Jaynes-Gibbs Entropic Convex Duals and Orthogonal Polynomials
Next Article in Special Issue
Entanglement-Assisted Joint Monostatic-Bistatic Radars
Previous Article in Journal
Computing Influential Nodes Using the Nearest Neighborhood Trust Value and PageRank in Complex Networks
Previous Article in Special Issue
Quantum Stream Cipher Based on Holevo–Yuen Theory
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Error Performance of Amplitude Shift Keying-Type Asymmetric Quantum Communication Systems

by
Tiancheng Wang
1,2,* and
Tsuyoshi Sasaki Usuda
2,*
1
Faculty of Engineering, Kanagawa University, Yokohama 221-8686, Kanagawa, Japan
2
Graduate School of Information Science and Technology, Aichi Prefectural University, Nagakute 480-1198, Aichi, Japan
*
Authors to whom correspondence should be addressed.
Submission received: 18 March 2022 / Revised: 7 May 2022 / Accepted: 11 May 2022 / Published: 16 May 2022
(This article belongs to the Special Issue Quantum Communication, Quantum Radar, and Quantum Cipher)

Abstract

:
We propose an amplitude shift keying-type asymmetric quantum communication (AQC) system that uses an entangled state. As a first step toward development of this system, we evaluated and considered the communication performance of the proposed receiver when applied to the AQC system using a two-mode squeezed vacuum state (TSVS), the maximum quasi-Bell state, and the non-maximum quasi-Bell state, along with an asymmetric classical communication (ACC) system using the coherent state. Specifically, we derived an analytical expression for the error probability of the AQC system using the quasi-Bell state. Comparison of the error probabilities of the ACC system and the AQC systems when using the TSVS and the quasi-Bell state shows that the AQC system using the quasi-Bell state offers a clear performance advantage under specific conditions. Additionally, it was clarified that there are cases where the universal lower bound on the error probability for the AQC system was almost achieved when using the quasi-Bell state, unlike the case in which the TSVS was used.

1. Introduction

Entanglement [1] is an important phenomenon for quantum protocols. Entanglement is a nonlocal correlation that works with multiple quantum systems. This correlation can be maintained regardless of the distance between these multiple quantum systems. The quantum cryptographic protocol called E91 [2], quantum superdense coding [3], and quantum teleportation [4], which were all proposed in the 1990s, are well known as quantum communication protocols that apply entanglement. In addition, quantum illumination [5] and quantum reading [6], which are quantum metrology protocols based on entanglement and were proposed around 2010, have also been attracting increasing attention in recent years.
Many of the quantum communication protocols described above that use entanglement belong to the class of symmetric communication systems. Symmetric communication systems have the same transmission capability, regardless of the direction of communication. In contrast, asymmetric communication systems have different transmission capabilities that depend on the direction of communication (e.g., [7,8]). The differences in transmission capability in this case are caused by the differences between the physical resources that can be used on the two sides of the communication process. However, as far as we know, there are no asymmetric communication systems which essentially utilize quantum mechanical phenomena such as entanglement. With this in mind, we define the following: asymmetric systems using quantum and classical communication protocols are called asymmetric quantum communication (AQC) systems and asymmetric classical communication (ACC) systems, respectively. In this paper, we consider the quantum communication protocols with entanglement. Typical examples of ACC systems include terrestrial-to-satellite communications, communication between a mobile device and a cellular base station, and communication between an Internet of Things (IoT) device and an IoT base station. For example, in an IoT-based ACC system, there is a major difference between the transmission capabilities of a small battery-driven IoT device—where the battery is replaced once every few years and the microprocessor unit can only perform simple calculation processes—and that of a base station with an abundant power supply and high processing capacity. In this work, the side with the low transmission capability, e.g., satellites, mobile phones, and IoT devices, is called Alice, and the side with the high transmission capability, e.g., ground base stations, mobile phone base stations, and IoT base stations, is called Bob. Taking an IoT-based ACC system as an example, the usage scenario of that is considered as a simple model in this paper follows: (1) Bob (the IoT base station) tells Alice (the IoT device) whether to sense the physical environment; (2) if yes, Alice senses the physical environment and transmits the corresponding data to Bob. In general, information leakage is prone to occur in the channel of (2), and the system must perform some communication protocols, such as lightweight cryptography. One of the security problems for the asymmetric communication system can be described as follows: the low processing capacity struggles to always provide a high security level for the data transmitted from such an IoT device, because the frequency of upgrading the device may be low and the development of code breaking technique is fast. We aimed to develop a new AQC system to improve the reliability and security of communications from Alice to Bob, and also to reduce Alice’s energy costs by introducing entanglement into the asymmetric communication system. This paper represents the first step in this research.
To develop the required AQC system, it will be necessary to clarify the effects of deterioration of the quantum effects in the various channels with respect to the entangled state. Reference [9] dealt with the quantum channel discrimination problem using beam splitters with reflectivities of R 0 and R 1 ( 0 R 0 < R 1 1 ) . In this channel model, a quantum state source (i.e., a light source) produces an entangled state, and these two modes are labeled S (signal mode: mode S) and A (ancilla mode: mode A). Light corresponding to mode S is directed toward one beam splitter with a reflectivity of either R 0 or R 1 ; the subsequently reflected light is then collected using a detector. The other beam, which corresponds to mode A, is sent to the detector directly. The detector then distinguishes the two channels that correspond to R 0 and R 1 by performing optimum quantum measurements (i.e., joint measurements) of the two light beams. In reference [9], the Einstein–Podolsky–Rosen (EPR) state, which consists of the m-fold tensor product of the two-mode squeezed vacuum state (TSVS) [10], was used as the light source, and the performance with regard to the error probability when using the EPR state was evaluated using its upper bound, which is defined by the Chernoff bound [11], and the lower bound, which is defined by the fidelity. As a result, it was found that the lower bound on the error probability when using the EPR state may almost reach the universal lower bound. In fact, if we consider that the communication system is used in such a manner that Alice operates the two beam splitters to transmit binary information to Bob based on differences in reflectivity (i.e., the differences in the amplitudes of the reflected light beams when subjected to different energy attenuation levels), the model in reference [9] would be an amplitude shift keying (ASK)-type AQC system. Therefore, it can be said that the work in this paper uses the same model for a different purpose to that of reference [9].
When considering aspects of the communication performance, it is necessary to perform instantaneous performance evaluations, but not using the Chernoff bound that corresponds to the case in which m-shot optical pulses are applied; instead, the error probability when a one-shot optical pulse is used here. In this case, the TSVS, i.e., the EPR state when m = 1 , is considered, rather than the EPR state. In addition, there is a quasi-Bell state [12] that is constructed using nonorthogonal quantum states such as coherent states, but it becomes the maximum entangled state (maximum quasi-Bell state). It has been shown that the attenuation resistance of this state is strong, depending on application protocols, and it has been studied actively (e.g., [13,14]) since the publication of reference [12]. In addition, study of the application of a quasi-Bell state that is not the maximum entangled state (i.e., a non-maximum quasi-Bell state) has advanced, and it has been reported that the non-maximum quasi-Bell state is superior to the maximum quasi-Bell state for use in certain protocols, such as quantum teleportation [15]. In particular, it was recently clarified that the quasi-Bell state is superior to both the TSVS and conventional laser radar in terms of its performance for quantum illumination with attenuation (i.e., the model used in this paper with R 0 = 0 ) [16,17,18,19].
Based on the discussion above, we aim to clarify Bob’s communication performance based on the error probability criterion as a first step toward development of an ASK-type AQC system (hereinafter referred to simply as the AQC system). Specifically, by using the Schrödinger picture to describe the time evolution of both the quasi-Bell state and the TSVS, we evaluate and compare the error probabilities that occur when using these states, and thus consider the basic characteristics, i.e., the error performance, of the AQC system. We also compare these results with the error probability characteristics of an ACC system which was constructed using a coherent state source and an optimum classical measurement approach, along with the universal lower bound on the error probability when the use of any multimode quantum state is allowed. As the main results of this analysis, we derive an analytical expression for the error probability of the AQC system when using the quasi-Bell state. Then, by investigating the numerical characteristics of the system using this analytical expression with various reflectivities and the average number of photons, we demonstrate that the AQC system using the quasi-Bell state is not only always superior to the ACC system, but also is asymptotically superior to the same AQC system using the TSVS. Additionally, in contrast to reference [9], which shows that using the EPR state asymptotically outperforms using the coherent state, this paper shows that the ACC system asymptotically outperforms the AQC system when using the TSVS. Finally, we show that the AQC system using the quasi-Bell state may almost reach the universal lower bound on the error probability, unlike the AQC system using the TSVS.
The rest of this paper is organized as follows. Section 2 describes the TSVS, the quasi-Bell state, and the ACC system. Section 3 describes the model of the AQC system when using the entangled states, and also provides a description of Bob’s received quantum states in the AQC system. Section 4 presents an analytical expression for the error probability of the AQC system when using the quasi-Bell state. In Section 5, by using the analytical expression obtained in Section 4, the system error performance is given and is compared numerically with the error probabilities of both the ACC system and the AQC system when using the TSVS and the universal lower bound on the error probability.

2. Basic Theory

2.1. Quantum State

The state of a quantum system (i.e., the quantum state ρ ) is expressed using a density operator. This density operator is a nonnegative Hermitian operator on Hilbert space and satisfies
ρ 0 , Tr ρ = 1 .
Originally, ρ was called the density operator of the quantum state, but it has become customary for ρ also to be called a quantum state.

2.2. Photon Number State

The most typical quantum state of light is the photon number state | n , which represents a state in which the number of photons is n, and it forms the following orthonormal basis:
n = 0 | n n | = I , n | m = δ m n ,
where I is the identity operator on Hilbert space, and δ m n is the Kronecker delta.

2.3. Coherent State

This paper considers a quasi-Bell state that has been constructed using coherent states that are nonorthogonal quantum states. The coherent state is known as the most fundamental quantum state of light, and this state is very important because it can be realized approximately using laser light. The coherent state is expressed as
| α = n = 0 α n n ! e 1 2 | α | 2 | n ,
where α is the complex amplitude of the coherent state, and the average number of photons of the state is n Coh = | α | 2 .
The inner product of the two coherent states corresponding to the amplitudes α and β is
α | β = e α β | α | 2 2 | β | 2 2 .
If both α and β are real numbers, then the value of α | β is also a real number. In addition, the coherent state that is reflected from a beam splitter with reflectivity R is subjected to energy attenuation, causing it to become another coherent state, represented by | R α .

2.4. Quasi-Bell State

The quasi-Bell state [12] is an entangled state that is constructed using nonorthogonal quantum states but has maximum entanglement. The two modes of the quasi-Bell state can be labeled S and A. In this paper, we use two coherent states as the nonorthogonal quantum states, where the coherent states with amplitudes α and β are denoted by | α and | β . The quasi-Bell states are represented as the quantum states of the composite system SA as follows:
| Ψ 1 SA = h 1 | α S | β A + | α S | β A ,
| Ψ 2 SA = h 2 | α S | β A | α S | β A ,
| Ψ 3 SA = h 3 | α S | β A + | α S | β A ,
| Ψ 4 SA = h 4 | α S | β A | α S | β A ,
where
h 1 = h 3 = 1 2 1 + κ S κ A ,
h 2 = h 4 = 1 2 1 κ S κ A ,
κ S = α | α = α | α = e 2 | α | 2 ,
κ A = β | β = β | β = e 2 | β | 2 ,
and α and β are nonnegative real numbers.
| Ψ 2 SA has the maximum entanglement, and the amount of entanglement is 1 ebit when α = β . Therefore, we treat | Ψ 2 SA with α = β as the maximum quasi-Bell state in this paper. The average number of photons in mode S is n Max = | α | 2 coth ( 2 | α | 2 ) , and the minimum average number of photons is 0.5 because n Max 0.5 when α 0 . Additionally, we treat | Ψ 1 SA with α = β as the non-maximum quasi-Bell state in this paper. Note that the amount of entanglement in this case is smaller than 1 ebit. The average number of photons in mode S is n NonMax = | α | 2 tanh ( 2 | α | 2 ) , and the minimum average number of photons is 0 because n NonMax 0 when α 0 .

2.5. TSVS

In reference [9], an m-fold tensor product of the following TSVS was used as an EPR state:
| ψ SA = n = 0 N S n ( N S + 1 ) n + 1 | n S | n A ,
where n TSVS = N S represents the average number of photons in mode S. In this paper, we set m = 1 and analyze the TSVS.
The TSVS is one of the most important entangled states and has been discussed in numerous studies as a basic quantum state in both quantum illumination [20] and quantum reading [6] protocols. In particular, the amount of entanglement of the TSVS, which is given by
E TSVS = ( N S + 1 ) log 2 ( N S + 1 ) N S log 2 N S ,
can exceed 1 ebit. A larger average number of photons causes a greater amount of entanglement because lim N S E TSVS = .

2.6. Asymmetric Classical Communication

In this paper, we also compare the proposed system with an ACC system that has no mode A—mode A can be considered to be the vacuum state | 0 A in an AQC system without entanglement. Here, the coherent state | α is prepared by Bob as the light source and is directed toward one of the two beam splitters operated by Alice. By switching the two beam splitters with their reflectivities of R 0 and R 1 ( R 0 < R 1 ) , Alice encodes binary information using the different reflectivities. The reflected light collected by Bob thus becomes the binary coherent state signal { | R 0 α , | R 1 α } , and this can be considered to be an ASK modulation scheme. Assuming that the binary signal has equal a priori probabilities and that the measurement in Bob’s detector, which we call an optimum classical receiver, is a homodyne measurement, the error probability for Bob is then given as follows:
P e ( Hom ) = 1 2 1 + erf R 0 | α | 2 R 1 | α | 2 2 .

3. Model of an ASK-Type AQC System

In this section, we describe the model of the AQC system that is constructed using the entangled states and the description of Bob’s received quantum states in the AQC system.
A diagram of the model of the AQC system using the entangled state is shown in Figure 1. Binary information is sent from Alice to Bob. The dashed and solid arrows in the figure represent mode S and mode A of the entangled state, respectively. The AQC system protocol is given as follows:
  • Protocol of an AQC system (Figure 1).
    1.
    Bob (receiver) inputs the light corresponding to mode A directly into their detector.
    2.
    Bob radiates the light corresponding to mode S toward one of the two beam splitters operated by Alice (sender); Alice then switches the two beam splitters with reflectivities of R 0 and R 1 ( R 0 < R 1 ) to encode the binary information.
    3.
    The subsequently reflected light with reflectivity of either R 0 or R 1 is then collected by Bob’s detector.
    4.
    Bob decodes the binary information received at their detector by performing an optimum quantum measurement, i.e., a joint measurement of both light beams.
In this paper, we use the same model for a different purpose than that of reference [9], and therefore must first clarify the differences in this case when compared with the basic characteristics presented in [9]. We focus on investigation of Bob’s error performance as the basic characteristic of the ASK-type AQC system. In addition, the AQC system is characterized as an "ASK-type" system because Alice encodes information using different reflectivities, i.e., the differences in the amplitude of the reflected light corresponding to mode S.

3.1. Description of Received Quantum State

In this section, we describe the received quantum state corresponding to each entangled state. However, based on consideration of the prospect of the discussion, we analyze the quasi-Bell state using a Stinespring representation, and analyze the TSVS using a Kraus representation. Note that the light that corresponds to mode A is assumed to pass through an ideal channel because it is propagating inside Bob.

3.1.1. Quasi-Bell State with Stinespring Representation

When a Stinespring representation is used, the loss incurred by an attenuated channel can be expressed using the interaction with the vacuum field as an environment mode E. In other words, the unitary evolution of the composite system SE can be described by applying the unitary operator U SE ( η ) to the SE, where the results represent the interaction between modes S and E:
U SE ( η ) | α S | 0 E = | η α S | 1 η α E ,
U SE ( η ) | α S | 0 E = | η α S | 1 η α E ,
where η is the energy transmissivity. The reduced state of the composite system SAE on SA, i.e., the received quantum state, can be acquired by performing a partial trace over mode E, because only the composite system SA is actually measured by the detector.
For the case where b { 0 , 1 } , we now consider the received quantum states Ψ SA ( b ) when the binary information that was recorded using the reflectivities R b is denoted by “0” and “1”. Suppose that the transmitted quantum state at the light source is the maximum quasi-Bell state. Then, the received quantum state Ψ SA ( b ) can be represented by
Ψ SA ( b ) = Tr E ( U SE ( R b ) I A | Ψ 2 SA Ψ 2 | | 0 E 0 | U SE ( R b ) I A ) .
The same supposition can be applied to the non-maximum quasi-Bell state.

3.1.2. TSVS with Kraus Representation

In the TSVS case, a Kraus representation is used to express the attenuation channel. This Kraus representation allows us to describe the relationship between the transmitted and received quantum states, and can be expressed without use of an external system, unlike the Stinespring representation. If the transmitted and received quantum states are ρ ( in ) and ρ ( out ) , respectively, then the Kraus representation of the attenuation channel is given as follows:
ρ ( out ) = k = 0 E k ( η ) ρ ( in ) E k ( η ) ,
where
E k ( η ) = n n k η n k ( 1 η ) k | n k n |
is the Kraus operator [21] for the attenuation channel with respect to the energy transmissivity η .
For the case where b { 0 , 1 } , we now consider the received quantum states ψ SA ( b ) when the binary information recorded using the reflectivities R b is denoted by “0” and “1”. The received quantum state ψ SA ( b ) can then be represented by
ψ SA ( b ) = k = 0 E k ( R b ) S I A | ψ SA ψ | E k ( R b ) S I A .

3.2. Error Probability Determined by Optimum Quantum Measurement

The error probability is an important performance evaluation index for communication systems. In this paper, it is assumed that Bob has no information about the a priori probabilities ξ b { ξ 0 , ξ 1 } that correspond to the binary information b { 0 , 1 } . If the a priori probabilities of the quantum states are unknown, it is known that use of the Bayes decision criterion with equal a priori probabilities under the quantum minimax criterion is the optimum approach from quantum detection theory [22]. If we suppose that the received quantum states are ρ SA ( 0 ) and ρ SA ( 1 ) , and that the corresponding a priori probabilities are equal, i.e., ξ 0 = ξ 1 = 1 / 2 , then the error probability given by the optimum quantum measurement [23] is
P e = 1 2 1 λ i > 0 λ i ,
where { λ i } are the eigenvalues of ρ SA ( 0 ) ρ SA ( 1 ) .

4. Derivation of Analytical Expression for the Error Probability of the Quasi-Bell State

In this section, we derive an analytical expression for the error probability of the AQC system when using the quasi-Bell state. As an example of the quasi-Bell state, we consider the case where the maximum quasi-Bell state is used. To calculate the error probability of given by Equation (22), it is necessary to obtain eigenvalues for the difference between the two received quantum states Ψ SA ( 0 ) Ψ SA ( 1 ) . The coherent state is represented using either an infinite dimensional vector or an infinite matrix (i.e., the density operator). The maximum quasi-Bell state used here is constructed from the coherent states, and its density operator is thus infinite. The eigenvalues of Ψ SA ( 0 ) Ψ SA ( 1 ) also take the form of an infinite matrix and are generally difficult to calculate. However, in this paper, we find that the received quantum states Ψ SA ( 0 ) and Ψ SA ( 1 ) can be represented by an 8 × 8 matrix when a special orthonormal basis is used. Additionally, by deriving the eigenvalues for the 8 × 8 matrix of Ψ SA ( 0 ) Ψ SA ( 1 ) , we can also derive an analytical expression for the error probability of the AQC system using the quasi-Bell state.
There are four steps that must be considered in the derivation of this analytical expression. Each step is explained individually below.

4.1. Step 1: Representation of the Received Quantum States by an 8 × 8 Matrix

First, if we focus on mode A in the received quantum states Ψ SA ( 0 ) and Ψ SA ( 1 ) , we can see that the mode is constructed using the two coherent states { | ± α A } . In the two-dimensional subspace of a Hilbert space that is spanned by { | ± α } , the orthonormal basis { | ω 0 , | ω 1 } used in references [24,25] is the measurement state of the square-root measurement (SRM) [26], which is often applied to the representation of the numerical vector of the quasi-Bell state and to the representation of its density operator. It is known that this approach improves the prospects of the discussion (e.g., [27]). The SRM for { | ± α A } is an optimum quantum measurement that minimizes the error probability, and use of these measurement states means that { | ± α A } can be expressed as:
| ± α A = 1 ε + ε ε ± | ω 0 A ε | ω 1 A .
Therefore, { | ± α A } can be represented by a two-dimensional vector, as follows:
| ± α A = 1 ε + ε ε ± ε ,
where κ A = κ S = : κ and ε ± is given as follows:
ε ± = 1 ± 1 κ 2 2 ( 1 κ 2 ) .
Next, if we focus on mode A in the received quantum states Ψ SA ( 0 ) and Ψ SA ( 1 ) , we can see that the mode is constructed using the following four coherent states: { | R 1 α S , | R 0 α S , | R 0 α S , | R 1 α S } ( = : { | α 0 , | α 1 , | α 2 , | α 3 } ) . In the four-dimensional subspace of a Hilbert space that is spanned by these coherent states, we also consider the measurement state of the SRM to be an orthonormal basis. The representation of a four-dimensional vector of these coherent states in the four-dimensional subspace can be obtained immediately from the square root of their Gram matrix. In general, the Gram matrix for { | α 0 , | α 1 , | α 2 , | α 3 } is constructed as follows [28]:
α 0 | α 0 α 0 | α 1 α 0 | α 2 α 0 | α 3 α 1 | α 0 α 1 | α 1 α 1 | α 2 α 1 | α 3 α 2 | α 0 α 2 | α 1 α 2 | α 2 α 2 | α 3 α 3 | α 0 α 3 | α 1 α 3 | α 2 α 3 | α 3 = 1 b c d b 1 a c c a 1 b d c b 1 ,
where
a = e 2 R 0 | α | 2 , b = e R 0 R 1 | α | 2 1 2 | α | 2 ( R 0 + R 1 ) , c = e R 0 R 1 | α | 2 1 2 | α | 2 ( R 0 + R 1 ) , d = e 2 R 1 | α | 2 .
However, because the representation of the square root of the Gram matrix is complicated, the method described in references [29,30,31] is applied in this paper. In references [29,30,31], the order of these coherent states was rearranged to be { | R 0 α S , | R 0 α S , | R 1 α S , | R 1 α S ( = : { | α 0 , | α 1 , | α 2 , | α 3 ) } to take advantage of the partial symmetry of the coherent state signal, and the Gram matrix Γ then became as follows:
Γ = α 0 | α 0 α 0 | α 1 α 0 | α 2 α 0 | α 3 α 1 | α 0 α 1 | α 1 α 1 | α 2 α 1 | α 3 α 2 | α 0 α 2 | α 1 α 2 | α 2 α 2 | α 3 α 3 | α 0 α 3 | α 1 α 3 | α 2 α 3 | α 3 = 1 a b c a 1 c b b c 1 d c b d 1 .
Through observation of Γ , we found that it can be divided into four blocks using a 2 × 2 real symmetric matrix with the common structure of
M ( 2 ) ( u , v ) = u v v u .
The eigenvalues and corresponding orthonormal eigenvectors of M ( 2 ) ( u , v ) are given by
x 1 = u + v , x 2 = u v
and
| x 1 = 1 2 1 1 , | x 2 = 1 2 1 1 ,
respectively (Although | x 1 and | x 2 are not vectors in the Hilbert space of a quantum system, and in fact are numerical vectors, we use Dirac’s notation for convenience). We then obtain the spectral decomposition form of M ( 2 ) ( u , v ) , which is expressed as
M ( 2 ) ( u , v ) = ( u + v ) | x 1 x 1 | + ( u v ) | x 2 x 2 | .
Using M ( 2 ) ( u , v ) , Γ can then be divided into blocks, as follows:
Γ = M ( 2 ) ( 1 , a ) M ( 2 ) ( b , c ) M ( 2 ) ( b , c ) M ( 2 ) ( 1 , d ) .
By substituting the spectral decomposition form into the equation above, we obtain
Γ = M ( + ) | x 1 x 1 | + M ( ) | x 2 x 2 | ,
where
M ( + ) = 1 + a b + c b + c 1 + d , M ( ) = 1 a b c b c 1 d .
Both M ( + ) and M ( ) have the common structure of
M ( ± ) = p q q r ,
and the eigenvalues λ ± ( p , q , r ) and the corresponding orthonormal eigenvectors | λ ± ( p , q , r ) of this structure can be expressed as:
λ ± ( p , q , r ) = 1 2 p + r ± ( p r ) 2 + 4 q 2
and
| λ ± ( p , q , r ) = | λ ± ( p , q , r ) λ ± ( p , q , r ) | λ ± ( p , q , r ) ,
respectively, where
| λ ± ( p , q , r ) = p r ± ( p r ) 2 + 4 q 2 2 q .
Based on the derivation above, the analytical expressions for the eigenvalues { λ i } and the corresponding orthonormal eigenvectors { λ i } of Γ can be expressed as
λ 1 = λ + ( 1 + a , b + c , 1 + d ) ,
λ 2 = λ ( 1 + a , b + c , 1 + d ) ,
λ 3 = λ + ( 1 a , b c , 1 d ) ,
λ 4 = λ ( 1 a , b c , 1 d )
and
| λ 1 = | λ + ( 1 + a , b + c , 1 + d ) | x 1 ,
| λ 2 = | λ ( 1 + a , b + c , 1 + d ) | x 1 ,
| λ 3 = | λ + ( 1 a , b c , 1 d ) | x 2 ,
| λ 4 = | λ ( 1 a , b c , 1 d ) | x 2 ,
respectively. Therefore, the spectral decomposition form of Γ is given as follows:
Γ = i = 1 4 λ i | λ i λ i | .
Here, { | λ i } forms an orthonormal basis, which means that the square root of the Gram matrix, Γ 1 2 , can be derived immediately as:
Γ 1 2 = i = 1 4 λ i | λ i λ i | = γ 11 ( + ) γ 11 ( ) γ 13 ( + ) γ 13 ( ) γ 11 ( ) γ 11 ( + ) γ 13 ( ) γ 13 ( + ) γ 13 ( + ) γ 13 ( ) γ 33 ( + ) γ 33 ( ) γ 13 ( ) γ 13 ( + ) γ 33 ( ) γ 33 ( + ) ,
where each element of the 4 × 4 matrix Γ 1 2 can be obtained directly via substitution of Equations (40)–(44) into i = 1 4 λ i | λ i λ i | . See Appendix A for details. The four-dimensional vector representation of { | R 0 α S , | R 0 α S , | R 1 α S , | R 1 α S } is given as follows:
| R 0 α S = γ 11 ( + ) γ 11 ( ) γ 13 ( + ) γ 13 ( ) , | R 0 α S = γ 11 ( ) γ 11 ( + ) γ 13 ( ) γ 13 ( + ) , | R 1 α S = γ 13 ( + ) γ 13 ( ) γ 33 ( + ) γ 33 ( ) , | R 1 α S = γ 13 ( ) γ 13 ( + ) γ 33 ( ) γ 33 ( + ) .
Finally, by substituting Equations (24) and (50) into Equation (18), we obtain
Ψ SA ( b ) = Tr E U SE ( R b ) I A | Ψ 2 SA Ψ 2 | | 0 E 0 | U SE ( R b ) I A = h 2 2 | R b α S R b α | | α A α | L b | R b α S R b α | | α A α | L b | R b α S R b α | | α A α | + | R b α S R b α | | α A α | ,
where L b = e 2 ( 1 R b ) | α | 2 , and by taking the difference between the two received quantum states, Ψ SA ( 0 ) Ψ SA ( 1 ) ( = : U ) , we then obtain an 8 × 8 matrix that can be expressed as:
U = Ψ SA ( 0 ) Ψ SA ( 1 ) = A B C D G H I J B E F C K L M N C F E B N M L K D C B A J I H G G K N J O P Q R H L M I P S T Q I M L H Q T S P J N K G R Q P O .
The 8 × 8 matrix U is a real symmetric matrix, and each element of this matrix can be obtained directly by substituting Equations (24) and (50) into Equation (52) and then taking the difference between Ψ SA ( 0 ) and Ψ SA ( 1 ) . See Appendix B for details of this procedure.

4.2. Step 2: Similar Transformation of 8 × 8 Matrix

Next, we consider the derivation of the eigenvalues of the 8 × 8 real symmetric matrix U. In this paper, we derive the eigenvalues for the 8 × 8 real symmetry matrix U by using its symmetrical structure, although there is no general solution for the eigenvalues of a square matrix with an order of five or more because of the Abel–Ruffini theorem. To use the symmetrical structure of U, we must first convert U into a more tractable form.
When the eigenvalues of U and U become equal when U is converted into V 1 U V : = U using a regular matrix V; this is known as similarity transformation. Here, if such a similarity transformation of U is performed using the regular matrix
V = V 1 = 1 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 1 0 0 0 0 0 0 0 0 0 0 1 ,
we then obtain the matrix U after the similarity transformation as follows:
U = V 1 U V = A D C B I H G J D A B C H I J G C B E F L M N K B C F E M L K N I H L M S T Q P H I M L T S P Q G J N K Q P O R J G K N P Q R O .

4.3. Step 3: Spectral Decomposition Form of the 8 × 8 Matrix

Through observation of U , we see that this matrix can be divided into 16 blocks using the 2 × 2 real symmetric matrix (29). We perform a spectral decomposition operation on U in the same manner as Equation (34), and we then obtain
U = U ( + ) | x 1 x 1 | + U ( ) | x 2 x 2 | ,
where
U ( + ) = A + D C + B I + H G + J C + B E + F L + M N + K I + H L + M S + T Q + P G + J N + K Q + P O + R , U ( ) = A D C B I H G J C B E F L M N K I H L M S T Q P G J N K Q P O R
are also real symmetric matrices. Let the eigenvalues and eigenvectors of U ( + ) and U ( ) be written as { τ i ( + ) } , { τ i ( ) } and { | τ i ( + ) } , { | τ i ( ) } , respectively; then, we obtain:
U ( + ) = i = 1 4 τ i ( + ) | τ i ( + ) τ i ( + ) | , U ( ) = i = 1 4 τ i ( ) | τ i ( ) τ i ( ) | ,
because any real symmetric matrix can be spectrally decomposed. Substitution of these expressions into U allows the spectral decomposition form of U to be expressed as
U = i = 1 4 τ i ( + ) | τ i ( + ) τ i ( + ) | | x 1 x 1 | + i = 1 4 τ i ( ) | τ i ( ) τ i ( ) | | x 2 x 2 | ,
where the eigenvalues of U are given as follows:
τ i ( + ) , τ i ( ) , i = { 1 , 2 , 3 , 4 } .

4.4. Step 4: Eigenvalues of 4 × 4 Matrix

To determine the eigenvalues given by Equation (59), we must find the eigenvalues { τ i ( + ) } and { τ i ( ) } of the 4 × 4 real symmetric matrices U ( + ) and U ( ) . All these eigenvalues must be real numbers because U ( + ) and U ( ) are real symmetric matrices. The eigenvalues for U ( + ) and U ( ) can be derived as follows.
The eigenvalues { τ i ( + ) } for the 4 × 4 real symmetric matrix U ( + ) are the solutions to the eigenvalue equation det ( U ( + ) τ i ( + ) I ) = 0 , where I is the identity matrix. We have
det ( U ( + ) τ i ( + ) I ) = τ i ( + ) 2 τ i ( + ) 2 + A τ i ( + ) + B = 0 ,
where U i j ( + ) is element ( i , j ) of U ( + ) , and
A = U 11 ( + ) U 22 ( + ) U 33 ( + ) U 44 ( + ) = ( L 0 + 1 ) ( a κ 1 ) + ( 1 + L 1 ) ( 1 d κ ) 2 ( κ 2 1 ) , B = U 12 ( + ) 2 U 13 ( + ) 2 U 14 ( + ) 2 + U 11 ( + ) U 22 ( + ) U 23 ( + ) 2 U 24 ( + ) 2 + U 11 ( + ) U 33 ( + ) + U 22 ( + ) U 33 ( + ) U 34 ( + ) 2 + U 11 ( + ) U 44 ( + ) + U 22 ( + ) U 44 ( + ) + U 33 ( + ) U 44 ( + )
= ( L 0 + 1 ) ( L 1 + 1 ) { ( a κ 1 ) ( d κ 1 ) ( b c κ ) 2 } 4 ( κ 2 1 ) 2 .
We confirm directly that two of the eigenvalues { τ i ( + ) } are 0, and let τ 3 ( + ) = τ 4 ( + ) = 0 . To determine the signs of the other eigenvalues τ 1 ( + ) and τ 2 ( + ) for τ i ( + ) 2 + A τ i ( + ) + B = 0 , we prove that τ 1 ( + ) τ 2 ( + ) = B < 0 (see Appendix C for this proof), and we then know that these two eigenvalues have opposite signs: τ 1 ( + ) = A + A 2 4 B 2 > 0 , and τ 2 ( + ) = A A 2 4 B 2 < 0 . Note that the corresponding eigenvalues { τ i ( ) } for U ( ) can be obtained in the same manner.

4.5. Derivation of Analytical Expression

The eigenvalues { τ i ( + ) } { τ i ( ) } of U (i.e., U) that were obtained from the analysis above can be substituted into Equation (22). Here, it can be confirmed that τ 1 ( + ) , τ 1 ( ) > 0 , and thus the error probability P e ( Max ) of the AQC system when using the maximum quasi-Bell state is finally given as follows:
P e ( Max ) = 1 2 1 1 2 Λ M ( + ) 2 4 Ξ M ( + ) Λ M ( + ) 1 2 Λ M ( ) 2 4 Ξ M ( ) Λ M ( ) ,
Λ M ( ± ) = ( L 0 ± 1 ) ( a κ 1 ) + ( 1 ± L 1 ) ( 1 d κ ) 2 ( κ 2 1 ) ,
Ξ M ( ± ) = ( L 0 ± 1 ) ( L 1 ± 1 ) { ( a κ 1 ) ( d κ 1 ) ( b c κ ) 2 } 4 ( κ 2 1 ) 2 .
The error probability P e ( NonMax ) for the AQC system when using the non-maximum quasi-Bell state can also be obtained using steps 1 to 4 as per the case for the maximum quasi-Bell state. As a result, the corresponding probability is given by:
P e ( NonMax ) = 1 2 1 1 2 Λ N ( + ) 2 4 Ξ N ( + ) Λ N ( + ) 1 2 Λ N ( ) 2 4 Ξ N ( ) Λ N ( ) ,
Λ N ( ± ) = ( L 0 1 ) ( a κ 1 ) ( 1 L 1 ) ( 1 d κ ) 2 ( κ 2 + 1 ) ,
Ξ N ( ± ) = ( L 0 1 ) ( L 1 1 ) { ( a κ 1 ) ( d κ 1 ) ( b c κ ) 2 } 4 ( κ 2 + 1 ) 2 ,
where
a = e 2 R 0 | α | 2 , b = e R 0 R 1 | α | 2 1 2 | α | 2 ( R 0 + R 1 ) , c = e R 0 R 1 | α | 2 1 2 | α | 2 ( R 0 + R 1 ) , d = e 2 R 1 | α | 2 , κ = e 2 | α | 2 , L 0 = e 2 ( 1 R 0 ) | α | 2 , L 1 = e 2 ( 1 R 1 ) | α | 2 .

5. Error Performance

In this section, we present the results that were obtained numerically when using the error probability (15) for the ACC system and the analytical expression for the error probabilities (63) and (66) for the AQC system when using the quasi-Bell states. When using the TSVS, the calculation of the error probability P e ( TSVS ) in the case in which the average number of photons is small ( n TSVS 5 ) is performed based on the conventional numerical calculation method, i.e., using an equation that approximates Equation (13) to a finite value of n. In other words, as described in references [32,33], the calculation should be performed after suitable truncation of the Hilbert space by taking both the average number of photons and the order of the error probability into consideration. However, in the case where the average number of photons is large (i.e., n TSVS > 5 ), it is difficult to treat the eigenvalue problem in Equation (22) numerically because the dimensions of the received quantum state (i.e., its density operator) are large. Therefore, the AQC system’s performance is evaluated using the upper bound P UB ( TSVS ) and the lower bound P LB ( TSVS ) on the error probability P e ( TSVS ) given in reference [9] when the TSVS is used, as follows:
P LB ( TSVS ) = 1 2 1 1 1 R 0 R 1 ( 1 R 0 ) ( 1 R 1 ) N S + 1 2 ,
P UB ( TSVS ) = 1 2 1 R 0 N S + 1 2 ( R 1 = 1 ) 1 2 Σ σ z Θ θ z 1 ( R 1 1 ) ,
where
σ = ( 1 R 0 ) N S + 1 ( 1 R 1 ) N S + 1 ,
θ = 1 R 0 1 R 1 ,
Σ = 1 R 0 R 1 N S + 1 2 ( 1 R 0 ) N S + 1 ,
Θ = ( 1 R 1 ) N S ,
z = 0 ( Σ Θ ) 2 ( ln θ Θ ln σ Σ ) 0 1 ( Σ Θ ) 2 ( ln θ Θ ln σ Σ ) < 0 .
This paper also provides a comparison with the universal lower bound P U LB on error probability given in reference [9] when the use of any multimode pure input state is permitted, as follows:
P U LB = 1 2 1 1 R 0 R 1 + ( 1 R 0 ) ( 1 R 1 ) 2 N S ,
where n U LB = N S is the average number of photons in mode S.

5.1. Performance Comparison of Use of Maximum and Non-Maximum Quasi-Bell States

Figure 2 plots the error probabilities for the AQC system versus the reflectivities R 0 and R 1 ( R 0 < R 1 ), which are changed from 0 to 1 when the transmitted average number of photons in the maximum and non-maximum quasi-Bell states is fixed at n Max = n NonMax = 1 . The error probability when the maximum quasi-Bell state is used is represented by the green curved surface, and the error probability when the non-maximum quasi-Bell state is used is represented by the orange curved surface.
Figure 2 shows that the error probability P e ( Max ) when the maximum quasi-Bell state is used tends to decrease when R 1 R 0 increases. In particular, the figure shows reasonable results that confirm that the maximum error probability is achieved when R 0 R 1 , and that the minimum error probability is achieved when R 0 = 0 and R 1 = 1 . Comparison of the error probabilities of the AQC system when using the maximum and non-maximum quasi-Bell states shows that the maximum quasi-Bell state is superior in most cases, but there is no significant difference between the two cases. Furthermore, use of the maximum quasi-Bell state does not always provide superior results, because the AQC system using the non-maximum quasi-Bell state is superior to the corresponding system using the maximum quasi-Bell state in the extreme case in which R 1 R 0 is very small and R 0 1 or R 0 0 . The details can be seen in Figure 3 regarding the contour plot of the ratio, P e ( NonMax ) / P e ( Max ) , of the error probability when using the non-maximum state to that when using the maximum quasi-Bell state. Figure 3 shows that the ratio is between 1 and 1.1 in most cases, but the ratio may be less than 1 in the extreme case.
Actually, there are several studies comparing the performance between the maximum and non-maximum quasi-Bell states, such as quantum teleportation [15], quantum superdense coding [34], quantum reading [33], and quantum illumination [18,19]. Reference [15] showed that the non-maximum quasi-Bell state offers an advantage over the maximum quasi-Bell state at small coherent amplitudes, and may offer more resistance to attenuation than the maximum quasi-Bell state. References [18,19,33,34] showed that the non-maximum quasi-Bell state offers more resistance to attenuation and phase noise than the maximum quasi-Bell state, in some special cases, and the result of this paper is one more piece of evidence in terms of that. That evidence also reveals a fact that the maximum quasi-Bell state offers better performance than the non-maximum quasi-Bell state in ideal cases, such as cases with large coherent amplitudes or environments without noise, but the opposite may be true in some unideal cases. Therefore, for some applications using the quasi-Bell state at small coherent amplitudes or environments with noise, the non-maximum quasi-Bell state which offers more resistance to noise may play an important role. We must be careful not to dismiss the value of using the non-maximum quasi-Bell state, although the reason in terms of its superiority has not yet been elucidated. We consider the issue to be an interesting topic that has value as a future subject.

5.2. Performance Comparison Using Each Quantum State

Figure 4a,c,e,g shows the error probabilities obtained when the average number of photons n ( : = n U LB = n TSVS = n Max = n NonMax = n Coh ) , which is regarded as the signal energy, is varied from 0.5 to 5 for the AQC system when using the TSVS, the maximum quasi-Bell state, and the non-maximum quasi-Bell state, and the ACC system using the coherent state, for which the reflectivities { R 0 , R 1 } were fixed at { 0.5 , 1 } , { 0.3 , 0.6 } , { 0.2 , 0.8 } , and { 0 , 0.3 } , respectively. The pink chain line represents the error probability P e ( Hom ) for the ACC system, and the blue and orange dotted lines represent the error probabilities P e ( Max ) and P e ( NonMax ) for the AQC system when using the maximum and non-maximum quasi-Bell states, respectively. The black dashed line represents the error probability P e ( TSVS ) for the AQC system when using the TSVS, and the green and red dashed lines represent the upper bound P UB ( TSVS ) and the lower bound P LB ( TSVS ) , respectively, for P e ( TSVS ) . The gray solid line represents the universal lower bound on the error probability, P U LB . The horizontal axis represents the average number of photons, and the vertical axis represents the error probability in each case. The minimum average number of photons that can be considered is 0.5 because the minimum average number of photons in the maximum quasi-Bell state is n Max = 0.5 , and cases smaller than that are not defined. If the average number of photons is greater than 5, it then becomes difficult to calculate the error probability P e ( TSVS ) ; therefore, only the upper bound P UB ( TSVS ) and the lower bound P LB ( TSVS ) are used for the evaluation of this probability. Figure 4b,d,f,h shows the error performances corresponding to those shown in Figure 4a,c,e,g, respectively, when the average number of photons n is increased from 0.5 to 100.
These figures confirm that the AQC system using the quasi-Bell state always maintains a clear performance advantage over the ACC system, despite increases in the average number of photons n . Although the error probability of the AQC system when using the quasi-Bell state is similar to that of the ACC system, in that it decreases exponentially in tandem with the increase in n , the AQC system can achieve the same error probability when using only half of the average number of photons used by the ACC system. Conversely, Figure 4b,d,f,h shows the error probability for the AQC system using the TSVS approaches that of the ACC system with increasing n . In particular, as shown in Figure 4f, the ACC system provides superior performance to the AQC system using the TSVS when n > 35 . Figure 4g,h shows that the performance of the ACC system exceeds that of the AQC system using the TSVS when the average number of photons is smaller, i.e., when n 5 . This is contrary to the results presented in reference [9], which indicated that the performance obtained when using the m-shot EPR state exceeds that of the coherent state as the average number of photons increases, and this performance is considered to be a characteristic unique to the one-shot pulse case. Consideration of these figures together with Figure 4b,d shows that the ACC system exceeds the performance of the AQC system using the TSVS with smaller average number of photons when R 0 is small or when R 1 R 0 is large. Otherwise, the latter system can maintain its performance superiority over the former within the range of the small average number of photons. In addition, as shown in Figure 4f, the AQC system using the quasi-Bell state demonstrates superior performance to the same system using the TSVS when n > 10 . Figure 4g,h shows that the AQC system using the quasi-Bell state has an error probability that is the same as or lower than that of the system using the TSVS. Consideration of these figures together with Figure 4b,d shows that the performance of the AQC system using the quasi-Bell state exceeds that of the system using the TSVS with smaller average number of photons when R 0 is small or when R 1 R 0 is large. Otherwise, the former system requires a larger average number of photons to surpass the performance of the latter.

5.3. Performance Comparison with Universal Lower Bound

Finally, we consider a performance comparison with the universal lower bound on the error probability. For example, when the average number of photons is small, the AQC system using the TSVS almost reaches the universal lower bound, as illustrated in Figure 4c. However, as Figure 4d shows, the gap between the lower bound on the error probability for the TSVS and the universal lower bound increases when the average number of photons increases. This differs from the results reported in reference [9], which stated that when the m-shot EPR state is used, the universal lower bound is almost always reached, and this is considered to be a characteristic unique to the one-shot pulse case. The characteristics of Figure 4b,f,h become more outstanding and the gap between the lower bound on the error probability for the TSVS and the universal lower bound increases rapidly as the average number of photons increases. In addition, Figure 4b shows that gap between the error probability for the AQC system using the quasi-Bell state and the universal lower bound may also increase rapidly in the same manner as the TSVS. However, Figure 4f shows that the error probability of the AQC system using the quasi-Bell state differs from that of the system using the TSVS in that the gap with respect to the universal lower bound only increases slowly as the average number of photons increases. Furthermore, as shown in Figure 4h, the error probability for the AQC system using the quasi-Bell state almost reaches the universal lower bound even when the average number of photons increases in the case where both R 0 and R 1 are small.
To see these details of this characteristics in greater detail, Figure 5 shows the error performance when { R 0 , R 1 } = { 0 , 0.08 } , { 0 , 0.03 } in addition to that when { R 0 , R 1 } = { 0 , 0.3 } . As shown in Figure 5, R 0 is fixed at 0, and as R 1 decreases, the error probability for the AQC system using the quasi-Bell state becomes closer to the universal lower bound. To clearly demonstrate the trend of the gap between the error probability when using the quasi-Bell state and the universal lower bound, Figure 6 shows the ratio P U LB / P e ( Max ) with respect to R 1 when fixing R 0 at 0. (Note the special case where the maximum quasi-Bell state becomes a Bell state when n Max = 0.5 [13].) As is evident in Figure 6, the ratio approaches 1 as R 1 decreases in spite of increasing n . This performance characteristic makes it possible to use the quasi-Bell state to almost reach the universal lower bound in the AQC system, even if severe attenuation—where energy attenuation in the channel can be considered to be included in R 1 —occurs in an ultra-long distance channel. (If energy attenuation associated with energy transmissivity η occurs in the channel, then just substitute η R b into R b in the results. For an example, Figure 4c expresses the error performance when R 0 = 0.3 , R 1 = 0.6 , and η = 1 ; and when R 0 = 0.5 , R 1 = 0.75 , and η = 0.8 .)

6. Conclusions

In this paper, we have proposed an ASK-type AQC system as a step toward development of a new asymmetric communication system. In this AQC system, Bob, who has a high transmission capability, transmits one of the entangled light beams, which acts as a communication medium, to Alice, who has a low transmission capability; Alice operates on the light beam to encode the information that she wants to send to Bob, and then sends the light beam back to Bob. Bob then decodes the information received from Alice by performing an optimum quantum measurement (i.e., a joint measurement) of the other entangled light beam and the light beam that returned from Alice.
As a first step toward evaluation of the system performance, we focused on the communication performance from Alice to Bob, and investigated the basic performance characteristics based on the error probability criterion. First, using the quasi-Bell state as the light source, we derived an analytical expression for the error probability by using an 8 × 8 matrix representation to express the density operators of the two received quantum states affected by the reflectivities { R 0 , R 1 } , which corresponded to the binary information that Alice wants to send. Then, using this analytical expression, we compared the superior performances of the AQC systems using the TSVS, the maximum quasi-Bell state, and the non-maximum quasi-Bell state with that of the asymmetric classical communication (ACC) system in terms of their error probabilities. As a result, it was clarified that the error probabilities of the AQC systems using the maximum and non-maximum quasi-Bell states differed only slightly. In addition, the error probability of the AQC system using the quasi-Bell state is always lower than that of the ACC system, regardless of the reflectivity setting, and the AQC system using the quasi-Bell state also shows a clear performance advantage over the system using the TSVS when a sufficiently large average number of photons is used. In fact, as described in Section 2, when the average number of photons is large, the amount of entanglement of the TSVS is overwhelmingly greater than that of the quasi-Bell state, but the results in this paper show that the performance of the AQC system using the quasi-Bell state is overwhelmingly better than that of the same system using the TSVS. Therefore, the performance of the AQC system should be determined by selecting a type of entangled state that is suitable for the system, rather than by considering the amount of entanglement. The conclusion above is strengthened by the fact that the performance of the ACC system surpassed that of the AQC system using the TSVS when the average number of photons was sufficiently large. What causes quasi-Bell state to work better than the TSVS? Unfortunately, as far as we know, there are no studies in terms of the comparison between the quasi-Bell state and the TSVS, except for references [18,19], although the reason for the superiority of the quasi-Bell state and some related potential properties of that have not been elucidated. These studies also reveal the fact that there are some entanglement-based systems or protocols that require a suitable entangled state rather than a large amount of entanglement to improve its performance. Additionally, we believe the advantage of the quasi-Bell state over the TSVS comes from the robustness of coherent states against attenuation. However, a perfect explanation is not yet available. We consider the issue to be a very challenging topic that has value as a future subject. Getting back to the main topic, when R 0 is small or when R 1 R 0 is large, the AQC system using the quasi-Bell states shows a clear advantage when only a small average number of photons is used. In particular, when R 0 = 0 , the AQC system using the quasi-Bell state has the same or a lower error probability than the corresponding system using the TSVS. However, when R 1 = 1 , a large average number of photons is required to enable the AQC system using the quasi-Bell state to exceed the performance of the system using the TSVS. Finally, we compared the error probability for the AQC system using the quasi-Bell state, the lower bound on the error probability for the AQC system using the TSVS, and the universal lower bound on the error probability, and found that performance closer to the universal lower bound was achieved using the quasi-Bell state when compared with the system with TSVS in the case when R 0 and R 1 are very small. As a result, it is expected that the AQC system using the quasi-Bell state will be applicable even in ultra-long distance channels, in which severe attenuation can occur.
In this paper, we evaluated the performance based on the error probability results for the AQC system and clarified the basic performance characteristics. In fact, if an eavesdropper Eve was present between Alice and Bob, one of the simplest attack methods for Eve would be to intercept the light corresponding to mode S, which is reflected from Alice. However, Eve cannot access the light corresponding to mode A, which remains inside Bob, and thus there would be a difference in reception performance between Eve and Bob. This reception performance difference creates the security of the AQC system. In addition, the AQC system discussed in this paper is expected to have various security applications, e.g., quantum cryptographic conferencing [35]. Future work will include security evaluation of this system, including the case of information leakage when an eavesdropper is present, and security enhancement for this system by performing some quantum communication protocols.

Author Contributions

Conceptualization, T.W. and T.S.U.; software, T.W.; validation, T.W. and T.S.U.; formal analysis, T.W.; investigation, T.W.; data curation, T.W.; writing—original draft preparation, T.W.; writing—review and editing, T.W. and T.S.U. All authors have read and agreed to the published version of the manuscript.

Funding

This research was funded by JSPS KAKENHI, grant numbers JP20K20397, JP20H00581, and JP21K04064.

Institutional Review Board Statement

Not applicable.

Informed Consent Statement

Not applicable.

Data Availability Statement

Not applicable.

Acknowledgments

This research was funded by the Marubun Research Promotion Foundation and The Nitto Foundation. The authors would like to thank S. Takahira for valuable discussions during this and previous research. We thank David MacDonald from Edanz (https://jp.edanz.com/ac, accessed 10 May 2022) for editing a draft of this manuscript.

Conflicts of Interest

The authors declare no conflict of interest.

Abbreviations

The following abbreviations are used in this manuscript:
AQCAsymmetric quantum communication
ACCAsymmetric classical communication
IoTInternet of Things
EPR stateEinstein–Podolsky–Rosen state
TSVSTwo-mode squeezed vacuum state
ASKAmplitude shift keying
Max Quasi-BellMaximum quasi-Bell state
NonMax Quasi-BellNon-maximum quasi-Bell state
CoherentCoherent state
LBLower bound
UBUpper bound
U-LB or Universal LBUniversal lower bound

Appendix A

The elements { γ 11 ( ± ) , γ 13 ( ± ) , γ 33 ( ± ) } of Γ 1 2 are given as follows:
γ 11 ( ± ) = i = 0 1 ( 1 ) i e + + a + d + 2 ( 1 ) i e + + a d 2 2 2 ( 1 ) i e + + a d 2 + 4 ( b + c ) 2 ± j = 0 1 ( 1 ) j e a d + 2 ( 1 ) j e a + d 2 2 2 ( 1 ) j e a + d 2 + 4 ( b c ) 2 ,
γ 13 ( ± ) = i = 0 1 ( b + c ) ( 1 ) i e + + a + d + 2 ( 1 ) i e + + a d 2 ( 1 ) i e + + a d 2 + 4 ( b + c ) 2 ± j = 0 1 ( b c ) ( 1 ) j e a d + 2 ( 1 ) j e a + d 2 ( 1 ) j e a + d 2 + 4 ( b c ) 2 ,
γ 33 ( ± ) = i = 0 1 2 ( b + c ) 2 ( 1 ) i e + + a + d + 2 ( 1 ) i e + + a d 2 + 4 ( b + c ) 2 ± j = 0 1 2 ( b c ) 2 ( 1 ) j e a d + 2 ( 1 ) j e a + d 2 + 4 ( b c ) 2 ,
e ± = ( ± a d ) 2 + 4 ( b ± c ) 2 .

Appendix B

The elements { A , , T } of U are given as follows:
A = ε ε + γ 13 ( ) γ 13 ( + ) L 1 γ 11 ( ) γ 11 ( + ) L 0 + 1 2 ε + ( γ 11 ( ) γ 13 ( ) ) ( γ 11 ( ) + γ 13 ( ) ) + 1 2 ε ( γ 11 ( + ) γ 13 ( + ) ) ( γ 11 ( + ) + γ 13 ( + ) ) ,
B = 1 2 ε ε + γ 11 ( ) 2 γ 11 ( + ) 2 + γ 13 ( ) 2 + γ 13 ( + ) 2 + ( ε + ε + ) γ 11 ( ) γ 11 ( + ) L 0 γ 13 ( ) γ 13 ( + ) L 1 ,
C = 1 2 ε ε + L 1 γ 13 ( ) 2 + γ 13 ( + ) 2 L 0 γ 11 ( ) 2 + γ 11 ( + ) 2 + ( ε + ε + ) ( γ 11 ( ) γ 11 ( + ) γ 13 ( ) γ 13 ( + ) ) ,
D = 1 2 L 0 γ 11 ( ) 2 ε + + γ 11 ( + ) 2 ε + ε ε + ( γ 13 ( ) γ 13 ( + ) γ 11 ( ) γ 11 ( + ) ) 1 2 L 1 γ 13 ( ) 2 ε + + γ 13 ( + ) 2 ε ,
E = ε ε + γ 13 ( ) γ 13 ( + ) L 1 γ 11 ( ) γ 11 ( + ) L 0 + 1 2 ε ( γ 11 ( ) γ 13 ( ) ) ( γ 11 ( ) + γ 13 ( ) ) + 1 2 ε + ( γ 11 ( + ) γ 13 ( + ) ) ( γ 11 ( + ) + γ 13 ( + ) ) ,
F = 1 2 L 0 γ 11 ( ) 2 ε + γ 11 ( + ) 2 ε + + ε ε + ( γ 13 ( ) γ 13 ( + ) γ 11 ( ) γ 11 ( + ) ) 1 2 L 1 γ 13 ( ) 2 ε + γ 13 ( + ) 2 ε + ,
G = 1 2 ε ε + L 1 ( γ 13 ( ) γ 33 ( + ) + γ 13 ( + ) γ 33 ( ) ) L 0 ( γ 11 ( ) γ 13 ( + ) + γ 11 ( + ) γ 13 ( ) ) + γ 13 ( ) ε + ( γ 11 ( ) γ 33 ( ) ) + γ 13 ( + ) ε ( γ 11 ( + ) γ 33 ( + ) ) ,
H = 1 2 ε ε + ( γ 11 ( ) γ 13 ( ) γ 11 ( + ) γ 13 ( + ) + γ 13 ( ) γ 33 ( ) + γ 13 ( + ) γ 33 ( + ) ) + L 0 ( γ 11 ( ) γ 13 ( + ) ε + + γ 11 ( + ) γ 13 ( ) ε ) L 1 ( γ 13 ( ) γ 33 ( + ) ε + + γ 13 ( + ) γ 33 ( ) ε ) ,
I = 1 2 ε ε + L 1 ( γ 13 ( ) γ 33 ( ) + γ 13 ( + ) γ 33 ( + ) ) L 0 ( γ 11 ( ) γ 13 ( ) + γ 11 ( + ) γ 13 ( + ) ) + γ 11 ( ) γ 13 ( + ) ε + + γ 11 ( + ) γ 13 ( ) ε γ 13 ( ) γ 33 ( + ) ε + γ 13 ( + ) γ 33 ( ) ε ,
J = 1 2 ε ε + ( γ 11 ( ) γ 13 ( + ) γ 11 ( + ) γ 13 ( ) + γ 13 ( ) γ 33 ( + ) + γ 13 ( + ) γ 33 ( ) ) + L 0 ( γ 11 ( ) γ 13 ( ) ε + + γ 11 ( + ) γ 13 ( + ) ε ) L 1 ( γ 13 ( ) γ 33 ( ) ε + + γ 13 ( + ) γ 33 ( + ) ε ) ,
K = 1 2 ε ε + ( γ 11 ( ) γ 13 ( ) γ 11 ( + ) γ 13 ( + ) + γ 13 ( ) γ 33 ( ) + γ 13 ( + ) γ 33 ( + ) ) + L 0 ( γ 11 ( ) γ 13 ( + ) ε + γ 11 ( + ) γ 13 ( ) ε + ) L 1 ( γ 13 ( ) γ 33 ( + ) ε + γ 13 ( + ) γ 33 ( ) ε + ) ,
L = 1 2 ε ε + L 1 ( γ 13 ( ) γ 33 ( + ) + γ 13 ( + ) γ 33 ( ) ) L 0 ( γ 11 ( ) γ 13 ( + ) + γ 11 ( + ) γ 13 ( ) ) + γ 13 ( ) ε ( γ 11 ( ) γ 33 ( ) ) + γ 13 ( + ) ε + ( γ 11 ( + ) γ 33 ( + ) ) ,
M = 1 2 ε ε + ( γ 11 ( ) γ 13 ( + ) γ 11 ( + ) γ 13 ( ) + γ 13 ( ) γ 33 ( + ) + γ 13 ( + ) γ 33 ( ) ) + L 0 ( γ 11 ( ) γ 13 ( ) ε + γ 11 ( + ) γ 13 ( + ) ε + ) L 1 ( γ 13 ( ) γ 33 ( ) ε + γ 13 ( + ) γ 33 ( + ) ε + ) ,
N = 1 2 ε ε + L 1 ( γ 13 ( ) γ 33 ( ) + γ 13 ( + ) γ 33 ( + ) ) L 0 ( γ 11 ( ) γ 13 ( ) + γ 11 ( + ) γ 13 ( + ) ) + γ 11 ( ) γ 13 ( + ) ε + γ 11 ( + ) γ 13 ( ) ε + γ 13 ( ) γ 33 ( + ) ε γ 13 ( + ) γ 33 ( ) ε + ,
O = ε ε + γ 33 ( ) γ 33 ( + ) L 1 γ 13 ( ) γ 13 ( + ) L 0 + 1 2 ε + ( γ 13 ( ) γ 33 ( ) ) ( γ 13 ( ) + γ 33 ( ) ) + 1 2 ε ( γ 13 ( + ) γ 33 ( + ) ) ( γ 13 ( + ) + γ 33 ( + ) ) ,
P = 1 2 ε ε + γ 13 ( ) 2 γ 13 ( + ) 2 + γ 33 ( ) 2 + γ 33 ( + ) 2 + ( ε + ε + ) γ 13 ( ) γ 13 ( + ) L 0 γ 33 ( ) γ 33 ( + ) L 1 ,
Q = 1 2 ε ε + L 1 γ 33 ( ) 2 + γ 33 ( + ) 2 L 0 γ 13 ( ) 2 + γ 13 ( + ) 2 + ( ε + ε + ) ( γ 13 ( ) γ 13 ( + ) γ 33 ( ) γ 33 ( + ) ) ,
R = 1 2 L 0 γ 13 ( ) 2 ε + + γ 13 ( + ) 2 ε + ε ε + ( γ 33 ( ) γ 33 ( + ) γ 13 ( ) γ 13 ( + ) ) 1 2 L 1 γ 33 ( ) 2 ε + + γ 33 ( + ) 2 ε ,
S = ε ε + γ 33 ( ) γ 33 ( + ) L 1 γ 13 ( ) γ 13 ( + ) L 0 + 1 2 ε ( γ 13 ( ) γ 33 ( ) ) ( γ 13 ( ) + γ 33 ( ) ) + 1 2 ε + ( γ 13 ( + ) γ 33 ( + ) ) ( γ 13 ( + ) + γ 33 ( + ) ) ,
T = 1 2 L 0 γ 13 ( ) 2 ε + γ 13 ( + ) 2 ε + + ε ε + ( γ 33 ( ) γ 33 ( + ) γ 13 ( ) γ 13 ( + ) ) 1 2 L 1 γ 33 ( ) 2 ε + γ 33 ( + ) 2 ε + .

Appendix C

The proof that B < 0 is presented as follows:
Proof. 
To prove that B = ( L 0 + 1 ) ( L 1 + 1 ) { ( a κ 1 ) ( d κ 1 ) ( b c κ ) 2 } 4 ( κ 2 1 ) 2 < 0 , it is necessary to prove that
( a κ 1 ) ( d κ 1 ) ( b c κ ) 2 > 0 ,
because ( L 0 + 1 ) ( L 1 + 1 ) 4 ( κ 2 1 ) 2 < 0 . This inequality can be rewritten as follows using a hyperbolic function:
2 e | α | 2 ( 2 + R 0 + R 1 ) W > 0 ,
where
W = cosh | α | 2 ( R 0 R 1 ) cosh | α | 2 ( 2 + R 0 + R 1 ) 1 + cosh 2 | α | 2 ( 1 + R 0 R 1 ) .
We then rewrite W using a sum-to-product formula and we then obtain
W = 2 sinh | α | 2 ( 1 + R 0 ) sinh | α | 2 ( 1 + R 1 ) + 2 sinh 2 | α | 2 ( 1 + R 0 R 1 ) .
The first term on the right-hand side (RHS) is negative, and the second term on the RHS is positive because 0 R 0 < R 1 1 . Furthermore, the absolute value of the first term is greater than that of the second term because ( 1 + R 0 ) ( 1 + R 1 ) > ( 1 + R 0 R 1 ) 2 , and sinh is odd and increases monotonically. Therefore, W < 0 , and thus B < 0 . □

References

  1. Einstein, A.; Podolsky, B.; Rosen, N. Can quantum-mechanical description of physical reality be considered complete? Phys. Rev. 1935, 47, 777–780. [Google Scholar] [CrossRef] [Green Version]
  2. Ekert, A.K. Quantum cryptography based on Bell’s theorem. Phys. Rev. Lett. 1991, 14, 661–663. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  3. Bennett, C.H.; Wiesner, S.J. Communication via 1- and 2-particle operators on Einstein–Podolsky-Rosen states. Phys. Rev. Lett. 1992, 69, 2881–2884. [Google Scholar] [CrossRef] [PubMed] [Green Version]
  4. Bennett, C.H.; Brassard, G.; Crépeau, C.; Jozsa, R.; Peres, A.; Wootters, W.K. Teleporting an unknown quantum state via dual classical and Einstein–Podolsky-Rosen channels. Phys. Rev. Lett. 1993, 70, 1895–1899. [Google Scholar] [CrossRef] [Green Version]
  5. Lloyd, S. Enhanced sensitivity of photodetection via quantum illumination. Phys. Rev. Lett. 2008, 321, 1463–1465. [Google Scholar] [CrossRef] [Green Version]
  6. Pirandola, S. Quantum reading of a classical digital memory. Phys. Rev. Lett. 2011, 106, 090504. [Google Scholar] [CrossRef] [Green Version]
  7. Acharya, S.; Alonso, R.; Franklin, M.; Zdonik, S. Broadcast disks: Data management for asymmetric communication environments. ACM SIGMOD Record 1995, 24, 199–210. [Google Scholar] [CrossRef]
  8. Adler, M.; Maggs, B.M. Protocols for asymmetric communication channels. In Proceedings of the 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280), Palo Alto, CA, USA, 8–11 November 1998. [Google Scholar]
  9. Nair, R. Discriminating quantum-optical beam-splitter channels with number-diagonal signal states: Applications to quantum reading and target detection. Phys. Rev. A 2011, 84, 032312. [Google Scholar] [CrossRef] [Green Version]
  10. Schumaker, B.L.; Caves, C.M. New formalism for two-photon quantum optics. II. Mathematical foundation and compact notation. Phys. Rev. A 1985, 31, 3093–3111. [Google Scholar] [CrossRef]
  11. Audenaert, K.M.R.; Calsamiglia, J.; Munoz-Tapia, R.; Bagan, E.; Masanes, L.; Acin, A.; Verstraete, F. The quantum Chernoff bound. Phys. Rev. Lett. 2007, 98, 160501. [Google Scholar] [CrossRef] [Green Version]
  12. Hirota, O.; Sasaki, M. Entangled state based on nonorthogonal state. In Quantum Communication, Computing, and Measurement 3, Proceedings of the Fifth International Conference on Quantum Communication, Measurement and Computing (QCM&CY2K), Capri, Italy, 3–7 July 2000; Hirota, T., Ed.; Springer: New York, NY, USA, 2001. [Google Scholar]
  13. van Enk, S.J.; Hirota, O. Entangled coherent states: Teleportation and decoherence. Phys. Rev. A 2001, 64, 022313. [Google Scholar] [CrossRef] [Green Version]
  14. Hirota, O. Error free quantum reading by quasi Bell state of entangled coherent states. Quantum Meas. Quantum Metrol. 2017, 4, 70–73. [Google Scholar] [CrossRef]
  15. Prakash, H.; Mishra, M.K. Teleportation of superposed coherent states using nonmaximally entangled resources. J. Opt. Soc. Am. B 2012, 29, 2915–2923. [Google Scholar] [CrossRef]
  16. Yamauchi, J.; Ishikawa, K.; Takahashi, Y.; Wang, T.; Usuda, T.S. On dependence of entangled states for quantum illumination with attenuation. In Proceedings of the 2019 Tokai-Section Joint Conference on Electrical, Electronics, Information, and Related Engineering, Nagoya, Japan, 9–10 September 2019. No. F5-5 (In Japanese). [Google Scholar]
  17. Yamauchi, J.; Takahashi, Y.; Wang, T.; Usuda, T.S. Quantum illumination using quasi-Bell states. In Proceedings of the 2020 International Symposium on Information Theory and Its Applications (ISITA2020), Kapolei, HI, USA, 24–27 October 2020; No. A06-03. pp. 116–120. [Google Scholar]
  18. Wang, T.; Usuda, T.S. Exact solution of error probability for quantum illumination with attenuation using quasi-Bell state. In Proceedings of the 20th Asian Quantum Information Science Conference (AQIS2020), Sydney, Australia, 7–9 December 2020; No. 095. pp. 135–136. [Google Scholar]
  19. Wang, T.; Takahira, S.; Usuda, T.S. Error probabilities of quantum illumination with attenuation using maximum and non-maximum quasi-Bell states. IEEJ Trans. Electron. Inf. Syst. 2022, 142, 151–161. (In Japanese) [Google Scholar] [CrossRef]
  20. 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. 2008, 101, 253601. [Google Scholar] [CrossRef] [Green Version]
  21. Nielsen, M.A.; Chuang, I.L. Quantum Computation and Quantum Information; Cambridge University Press: Cambridge, UK, 2000. [Google Scholar]
  22. Hirota, O.; Ikehara, S. Minimax strategy in the quantum detection theory and its application to optical communication. IEICE Trans. 1982, 65, 627–633. [Google Scholar]
  23. Helstrom, C.W. Quantum Detection and Estimation Theory; Academic Press: New York, NY, USA, 1976. [Google Scholar]
  24. Osaki, M.; Ban, M.; Hirota, O. Derivation and physical interpretation of the optimum detection operators for coherent-state signals. Phys. Rev. A 1996, 54, 1691–1701. [Google Scholar] [CrossRef]
  25. Sasaki, M.; Hirota, O. Two examples of measurement processes illustrating Helstrom’s optimum decision bound. Phys. Lett. A 1996, 210, 21–25. [Google Scholar] [CrossRef]
  26. Hausladen, P.; Jozsa, R.; Schumacher, B.; Westmoreland, M.; Wootters, W.K. Classical information capacity of a quantum channel. Phys. Rev. A 1996, 54, 1869–1876. [Google Scholar] [CrossRef] [Green Version]
  27. Takeuchi, H.; Yamaguchi, S.; Usuda, T.S. Entanglement-assisted classical communication using quasi Bell states. In Proceedings of the 1st International Workshop on Entangled Coherent State and Its Application to Quantum Information Science—Towards Macroscopic Quantum Communications, Tokyo, Japan, 26–28 November 2012; No. 16. pp. 115–119. [Google Scholar]
  28. Kato, K. Quantum detection of quaternary amplitude-shift keying coherent state signal. Tamagawa Univ. Quantum ICT Res. Inst. Bull. 2016, 6, 9–24. [Google Scholar]
  29. Miyazaki, R.; Yoshida, M.; Usuda, T.S. Simplification of calculation of channel matrix for 2m-ary ASK coherent-state signals. In Proceedings of the 2019 Tokai-Section Joint Conference on Electrical, Electronics, Information, and Related Engineering, Nagoya, Japan, 9–10 September 2019. No. F5-4 (In Japanese). [Google Scholar]
  30. Miyazaki, R.; Yoshida, M.; Wang, T.; Usuda, T.S. Simplification of the calculation of the channel matrix for AMPM coherent-state signals. In Proceedings of the 2020 International Symposium on Information Theory and Its Applications (ISITA2020), Kapolei, HI, USA, 24–27 October 2020; No. A06-04. pp. 121–125. [Google Scholar]
  31. Miyazaki, R.; Yoshida, M.; Wang, T.; Takahira, S.; Usuda, T.S. Simplification of calculation of channel matrix for non-symmetric signals. IEICE Trans. Commun. 2022, J105-B, 74–87. (In Japanese) [Google Scholar]
  32. Olivares, S.; Cialdi, S.; Castelli, F.; Paris, M.G.A. Homodyne detection as a near-optimum receiver for phase-shift-keyed binary communication in the presence of phase diffusion. Phys. Rev. A 2013, 87, 050303. [Google Scholar] [CrossRef] [Green Version]
  33. Ishikawa, K.; Wang, T.; Usuda, T.S. Comparison of performances on quantum reading in non-symmetric loss using maximum and non-maximum quasi-Bell states. IEEJ Trans. Electron. Inf. Syst. 2020, 140, 1328–1335. (In Japanese) [Google Scholar] [CrossRef]
  34. Yamaguchi, S.; Takeuchi, H.; Usuda, T.S. Property of a capacity of quantum channel assisted by a non-maximum quasi-Bell state. In Proceedings of the 2012 Tokai-Section Joint Conferrence on Electircal and Related Engineering, Toyohashi, Japan, 24–25 September 2012. No. O1-5 (In Japanese). [Google Scholar]
  35. Fu, Y.; Yin, H.-L.; Chen, T.-Y.; Chen, Z.-B. Long-distance measurement-device-independent multiparty quantum communication. Phys. Rev. Lett. 2015, 114, 090501. [Google Scholar] [CrossRef] [PubMed] [Green Version]
Figure 1. Protocol of an amplitude shift keying-type asymmetric quantum communication system.
Figure 1. Protocol of an amplitude shift keying-type asymmetric quantum communication system.
Entropy 24 00708 g001
Figure 2. Error probability characteristics with respect to the reflectivities { R 0 , R 1 } when using the maximum quasi-Bell state (green curved surface) and the non-maximum quasi-Bell state (orange curved surface). The average number of photons is fixed at 1.
Figure 2. Error probability characteristics with respect to the reflectivities { R 0 , R 1 } when using the maximum quasi-Bell state (green curved surface) and the non-maximum quasi-Bell state (orange curved surface). The average number of photons is fixed at 1.
Entropy 24 00708 g002
Figure 3. Contour plot of the ratio of the error probability when using the non-maximum quasi-Bell state ( P e ( NonMax ) ) to that when using the maximum quasi-Bell state ( P e ( Max ) ). The average number of photons is fixed at 1.
Figure 3. Contour plot of the ratio of the error probability when using the non-maximum quasi-Bell state ( P e ( NonMax ) ) to that when using the maximum quasi-Bell state ( P e ( Max ) ). The average number of photons is fixed at 1.
Entropy 24 00708 g003
Figure 4. Error probabilities with respect to the average number of photons n when using the coherent state (denoted by Coherent), the maximum quasi-Bell state (denoted by Max Quasi-Bell), the non-maximum quasi-Bell state (denoted by NonMax Quasi-Bell), and the two-mode squeezed vacuum state (denoted by TSVS) with reflectivities { R 0 , R 1 } = { 0.5 , 1 } , { 0.3 , 0.6 } , { 0.2 , 0.8 } , { 0 , 0.3 } . n ranges up to either 5 or 100. Universal LB, TSVS UB, and TSVS LB present the universal lower bound on the error probability, the upper bound on the error probability for the TSVS case, and the lower bound on the error probability for the TSVS case, respectively.
Figure 4. Error probabilities with respect to the average number of photons n when using the coherent state (denoted by Coherent), the maximum quasi-Bell state (denoted by Max Quasi-Bell), the non-maximum quasi-Bell state (denoted by NonMax Quasi-Bell), and the two-mode squeezed vacuum state (denoted by TSVS) with reflectivities { R 0 , R 1 } = { 0.5 , 1 } , { 0.3 , 0.6 } , { 0.2 , 0.8 } , { 0 , 0.3 } . n ranges up to either 5 or 100. Universal LB, TSVS UB, and TSVS LB present the universal lower bound on the error probability, the upper bound on the error probability for the TSVS case, and the lower bound on the error probability for the TSVS case, respectively.
Entropy 24 00708 g004
Figure 5. Error probabilities with respect to the average number of photons n when using the maximum quasi-Bell state (denoted by Max Quasi-Bell), the non-maximum quasi-Bell state (denoted by NonMax Quasi-Bell), and the two-mode squeezed vacuum state (denoted by TSVS) with reflectivities of { R 0 , R 1 } = { 0 , 0.3 } , { 0 , 0.08 } , { 0 , 0.03 } . n ranges up to 100. Universal LB and TSVS LB represent the universal lower bound on the error probability and the lower bound on the error probability for TSVS, respectively.
Figure 5. Error probabilities with respect to the average number of photons n when using the maximum quasi-Bell state (denoted by Max Quasi-Bell), the non-maximum quasi-Bell state (denoted by NonMax Quasi-Bell), and the two-mode squeezed vacuum state (denoted by TSVS) with reflectivities of { R 0 , R 1 } = { 0 , 0.3 } , { 0 , 0.08 } , { 0 , 0.03 } . n ranges up to 100. Universal LB and TSVS LB represent the universal lower bound on the error probability and the lower bound on the error probability for TSVS, respectively.
Entropy 24 00708 g005
Figure 6. Ratio of the universal lower bound on the error probability to the error probability when using the maximum quasi-Bell state with respect to reflectivity R 1 , where R 0 is fixed at 0.
Figure 6. Ratio of the universal lower bound on the error probability to the error probability when using the maximum quasi-Bell state with respect to reflectivity R 1 , where R 0 is fixed at 0.
Entropy 24 00708 g006
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Share and Cite

MDPI and ACS Style

Wang, T.; Usuda, T.S. Error Performance of Amplitude Shift Keying-Type Asymmetric Quantum Communication Systems. Entropy 2022, 24, 708. https://0-doi-org.brum.beds.ac.uk/10.3390/e24050708

AMA Style

Wang T, Usuda TS. Error Performance of Amplitude Shift Keying-Type Asymmetric Quantum Communication Systems. Entropy. 2022; 24(5):708. https://0-doi-org.brum.beds.ac.uk/10.3390/e24050708

Chicago/Turabian Style

Wang, Tiancheng, and Tsuyoshi Sasaki Usuda. 2022. "Error Performance of Amplitude Shift Keying-Type Asymmetric Quantum Communication Systems" Entropy 24, no. 5: 708. https://0-doi-org.brum.beds.ac.uk/10.3390/e24050708

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