Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Investigation of the influence of measurement imperfections on quantum communication complexity superiority for the Clauser-Horne-Shimony-Holt game

Open Access Open Access

Abstract

Demonstrating quantum communication complexity superiority non-trivially with currently available experimental systems is of utmost importance in quantum information science. Here, we propose a generalized entanglement-assisted communication complexity reduction protocol and analyze the robustness of its quantum superiority against the measurement imperfections, such as measurement basis deviation and choice probability bias, a common problem rarely studied before. We find that the quantum superiority can be obtained in a specific entangled state in a suitable range of measurement basis and basis choice parameters. And the quantum superiority strengthens with the increase of the entanglement degree of quantum states. By using the maximum entangled state and its corresponding optimal measurement, the result we obtained violated the optimal classical bound by 239 standard deviations. Besides, the robustness of effective measurement basis in dephasing and depolarizing quantum channels is also investigated. These results not only make a step forward in investigating sufficient experimental conditions to unambiguously demonstrate the superiority of quantum communication complexity but also help to develop relevant practical applications.

© 2022 Optica Publishing Group under the terms of the Optica Open Access Publishing Agreement

Corrections

10 November 2022: A typographical correction was made to the author listing. A typographical correction was made to the funding section.

1. Introduction

Communication complexity studies the amount of communication required to solve a global computational task when the inputs are distributed locally between two or among more remote participants [1]. A typical instance of a communication complexity problem features two participants, Alice and Bob, who are given binary input strings $x$ and $y$, respectively. Their common goal is to obtain the value of some function or relation $f(x,y)$. As initially neither participants have any knowledge of the other’s input, some communication will have to take place between the participants to achieve their goal. From both a practical and a conceptual point of view, there is an urgent need to develop effective communication protocols to reduce complexity, i.e., either by minimizing the amount of information exchange necessary to reach the correct value of $f(x,y)$ certainly [24], or by maximizing the probability of guessing $f(x,y)$ correctly with a restricted amount of communication [5,6]. Such studies have wide applications in speeding up distributed computing or optimizing very-large-scale interaction circuits and data structures [7].

Depending on the resources available to the participants, their communication may involve sending classical messages or quantum information. It is known that quantum protocols with quantum resources, such as entanglement and quantum channel, can be superior to the corresponding classical counterparts in communication and computing [8,9]. The quantum communication complexity protocol was first introduced by Yao, where the remote participants are allowed to send information to each other in the form of the qubits [10], then developed to entanglement bits by Cleve and Buhrman [11]. They found that using quantum entanglement can save one bit out of classical communication. In order to extend quantum-classical separation, lots of multi-party high-dimensional complex communication protocols have been proposed [1215]. And the exponential quantum superiority can be observed when the given communication problem is a Boolean function [1621].

Considering the different communication scenarios in practice, the reduction of quantum communication complexity has been experimentally demonstrated in the one-way protocol, where the involved participants are only allowed to send messages in one direction, after which the last participant announces the output [2225]; in the two-way protocol where the involved participants take turns sending messages to each other [2628]; and in the simultaneous protocol where the involved participants cannot communicate directly with each other but send messages to a "referee" instead, who announces the output based on the received messages [29,30]. However, these reported works are mainly discussed under the error-free condition. The laboratory demonstrations so far only take the non-maximally entangled state and limited detection efficiency into account [3133]. Experimentalists, on the other hand, know that even the simplest quantum communication complexity protocols involve inefficiencies in state preparation, transmission and measurement. Unfortunately, most quantum communication complexity protocols are extremely sensitive to noise; thus, any imperfections in these processes need to be considered, especially the commonly existing measurement imperfections: measurement basis deviation and choice probability bias [34,35].

Many protocols have been developed to improve the precision of quantum measurement [3638], to address measurement basis mismatch [39], and to improve the overall robustness [4044]. These approaches, however, require entanglement sources or well-established technology, which have certain limitations in practical applications. In this paper, we mainly investigate how measurement imperfections affect the quantum communication complexity superiority. We propose a generalized entanglement-assisted communication complexity protocol based on a biased Clauser-Horne-Shimony-Holt (CHSH) game [45,46], then theoretically and experimentally investigate the effects of measurement imperfections on the performance of the protocol in terms of the deviated measurement basis and biased basis choice probability. The dependence of the success probability on the measurement basis and basis choice parameters is analyzed. And the optimal parameters are discovered, which make the quantum communication complexity superiority decreases slowest. The robustness of effective measurement were also investigated by considering the effects of imperfect entangled state as well as dephasing and depolarizing quantum channels. Our work may promote a deeper understanding of the relationship between quantum communication complexity superiority and measurement, and could even find some relevant real-world applications. The structure of the rest of this paper is as follows. In Sec. II, we present the generalized entanglement-assisted communication complexity protocol. The experimental details and results are present in Sec. III. Finally, we present the conclusion and some discussion in Sec. IV

2. Generalized entanglement-assisted communication complexity protocol

Consider the following two-participant communication complexity protocol based on a biased Clauser-Horne-Shimony-Holt (CHSH) game [45,46]. A two-qubit entangled state $\vert \psi (\theta )\rangle ={\rm cos}\theta \vert HH\rangle +{\rm sin}\theta \vert VV\rangle$ is shared between Alice and Bob. They are remote enough so that no signal can travel while the experiment is being performed. Alice receives a biased binary input string $x=x_{0}x_{1}\in \lbrace 0,1 \rbrace ^{2}$ with probability distribution $P(x_{0}=0)=p$ $( 0\leq p\leq 1)$ and $P(x_{0}=1)=(1-p)$. Similarly, Bob receives another biased binary input string $y=y_{0}y_{1}\in \lbrace 0,1 \rbrace ^{2}$ with probability distribution $P(y_{0}=0)=q$ $( 0\leq q\leq 1)$ and $P(y_{0}=1)=(1-q)$. Their task is to collectively determine the value of the Boolean function

$$f(x,y)=x_{1}\oplus y_{1}\oplus (x_{0}\wedge y_{0}),$$
while exchanging only two bits of information. $\oplus$ denotes logical XOR (addition modulo 2), $\wedge$ denotes logical AND. Clearly, without any prior information, three bits of communication are necessary to obtain the correct value, i.e., Alice sends all her two bits $x_{0}$ and $x_{1}$ to Bob, then Bob computes $f(x,y)$ and sends the one-bit answer to Alice, and vice versa. Otherwise, they can only accomplish the task with certain probability.

To increase the success probability, they can use the following measuring strategy: If $x_{0}=0$, Alice measures $A_{0}$; otherwise, she measures $A_{1}$. The identifications are similar for Bob’s measurements $B_{0}$ and $B_{1}$. Suppose the measurement outputs of Alice and Bob are denoted as $a\in \lbrace 0,1 \rbrace$ and $b\in \lbrace 0,1 \rbrace$. After each round of measurement, Alice sends $x_{1} \oplus a$ to Bob and receives $y_{1}\oplus b$ from him. Then, each of them can determine the value of $(x_{1} \oplus a)\oplus (y_{1}\oplus b)$ which equals to $f(x,y)$ as long as $a\oplus b=x_{0}\wedge y_{0}$. Therefore, in this protocol, Alice and Bob can successfully accomplish the task mentioned above with probability

$$\begin{aligned} & P_{Q}= \sum \limits_{x_{0},y_{0}}\sum\limits_{a,b}P(x_{0})P(y_{0})P(a\oplus b=x_{0}\wedge y_{0}),\\ & P(a\oplus b=x_{0}\wedge y_{0})= \begin{cases} (1+\langle A_{0}\otimes B_{0}\rangle)/2 & {x_{0}=0,y_{0}=0},\\ (1+\langle A_{0}\otimes B_{1}\rangle)/2 & {x_{0}=0,y_{0}=1},\\ (1+\langle A_{1}\otimes B_{0}\rangle)/2 & {x_{0}=1,y_{0}=0},\\ (1-\langle A_{1}\otimes B_{1}\rangle)/2 & {x_{0}=1,y_{0}=1}. \end{cases} \end{aligned}$$
$\langle A_{i}\otimes B_{j} \rangle$ denotes the expected value of the product of the outcomes of the measurements $A_{i}$ and $B_{j}$, where $i,j=1, 2$. In the biased CHSH game, the CHSH function can be expressed as ${\rm \langle CHSH\rangle }_{Q}=pq\langle A_{0}\otimes B_{0}\rangle +p(1-q)\langle A_{0}\otimes B_{1}\rangle +(1-p)q\langle A_{1}\otimes B_{0}\rangle -(1-p)(1-q)\langle A_{1}\otimes B_{1}\rangle$[45,46]. And the average success probability can be rewritten as
$$\begin{aligned} P_{Q}= \dfrac{1}{2}+\dfrac{1}{2}{\rm \langle CHSH\rangle}_{Q}. \end{aligned}$$
Similarly, the corresponding classical average success probability can be expressed as $P_{C}= (1+{\rm \langle CHSH\rangle }_{C})/2$. Obviously, the quantum communication complexity superiority can be observed by the violation of corresponding CHSH inequality. And the average success probability depends on the settings of measurement.

In the case of unbiased choice probability measurements where $p=q=1/2$, for an arbitrary entangled state in the form of $\vert \psi (\theta )\rangle$, the success probability can achieve the maximum value $(2+\sqrt {1+C^{2} })/4$ with $\theta \in [ 0, \pi /2]$ and

$$\begin{aligned} A_{0} & ={\rm sin}2\eta_{1}\sigma_{1}+{\rm cos}2\eta_{1}\sigma_{3},\\ A_{1} & ={\rm sin}2\eta_{2}\sigma_{1}+{\rm cos}2\eta_{2}\sigma_{3},\\ B_{0} & ={-}{\rm sin}2\eta_{1}\sigma_{1}+{\rm cos}2\eta_{1}\sigma_{3},\\ B_{1} & ={-}{\rm sin}2\eta_{2}\sigma_{1}+{\rm cos}2\eta_{2}\sigma_{3}. \end{aligned}$$
Here $C={\rm sin}2\theta$ denotes the concurrence of state $\vert \psi (\theta )\rangle$, $\sigma _{1}$ and $\sigma _{3}$ represent the first and third Pauli matrices, $\eta _{1}=-\dfrac {1}{4}{\rm arccos}(\dfrac {1+C-T}{1-C})$, $\eta _{2}=\dfrac {1}{4}{\rm arccos}(\dfrac {1+C+T}{1-C })$, $T=2C/\sqrt {1+C^{2}}$ [31]. It can be treated similarly when $\theta$ is located in other quadrants, as is expected the situation exhibits high symmetry illustrated in Fig. 4. And the optimal classical bound of average success probability in this case is $3/4$.

While in the case of biased choice probability measurement where $p\neq 1/2$ or $q\neq 1/2$, the maximum average success probability equals to $(1/2+ \sqrt {(q^{2}+(1-q)^{2})(p^{2}+(1-p)^{2})/2}$ for $1/2\leq (2q)^{-1} \leq p\leq 1$; and equals to $1-(1-p)(1-q)$ for $1\geqslant p\geqslant 1/(2p)\geqslant 1/2$. Both of them are achieved at $\theta =\pi /4$ and

$$\begin{aligned} A_{0} & =\dfrac{\sigma_{1}(q+(1-q){\rm cos}\beta)+\sigma_{3} (1-q){\rm sin}\beta }{\sqrt{ (q+(1-q){\rm cos}\beta)^{2}+((1-q){\rm sin}\beta)^{2} }},\\ A_{1} & =\dfrac{\sigma_{1}(q-(1-q){\rm cos}\beta)+\sigma_{3} (1-q){\rm sin}\beta }{\sqrt{ (q-(1-q){\rm cos}\beta)^{2}-((1-q){\rm sin}\beta)^{2} }},\\ B_{0} & = \sigma_{1}, \quad \quad\quad\quad\quad B_{1}= \sigma_{1} {\rm cos}\beta+\sigma_{3} {\rm sin}\beta, \end{aligned}$$
where ${\rm cos}\beta =\dfrac {1}{2}{\rm min}\lbrace 2,\dfrac {(q^{2}+(1-q)^{2})(p^{2}-(1-p)^{2})}{q (1-q)(p^{2}+(1-p)^{2})}\rbrace$ [45,46]. It can be treated similarly when one or both of $p$ and $q$ is less than one half; as is expected the situation exhibits high symmetry illustrated in the Fig. 1. The maximum classical average success probability in this case is given by $1-(1-p)(1-q)$.

 figure: Fig. 1.

Fig. 1. Generalized entanglement-assisted communication complexity protocol. Alice and Bob receive biased input strings $x=x_{0}x_{1}\in \lbrace 0,1 \rbrace ^{2}$ and $y=y_{0}y_{1}\in \lbrace 0,1 \rbrace ^{2}$ to decide their specific measurement. After each round of measurement, they send one bit information $x_{1}\oplus a$ and $y_{1} \oplus b$ to each other to check whether the relation $a\oplus b=(x_{0}\wedge y_{0})$ is satisfied. If the relation is satisfied, they can successfully determine the correct value of the function $f(x,y)=x_{1}\oplus y_{1}\oplus (x_{0}\wedge y_{0})$; otherwise, they can not. The entangled state shared between them is used to improve the success probability.

Download Full Size | PDF

3. Experimental setup and results

Figure 2 shows our experimental setup. A 405 nm continuous-wave diode laser is used to pump a 10 mm long periodically poled potassium titanyl phosphate (PPKTP) crystal inside a polarization Sagnac interferometer clockwise and counter-clockwise to generate a class of two-qubit polarization-entangled states ${\rm cos}\theta \vert HH\rangle +{\rm sin}\theta \vert VV\rangle$ [47]. The parameter $\theta$ is flexibly controlled by the half-wave plate (HWP, H0) after the first polarization beam splitter (PBS). The generated photons are filtered by an interference filter centered at 810 nm with a bandwidth of 3 nm (IF@810), then separated by a PBS.The signal photon is sent to Alice. The idler photon passes through a qubit Pauli channel for state preparation and is sent to Bob. The qubit Pauli channel consists of two semi-circular HWPs (H1 and H1). By changing the axes and action time of these HWPs, we can simulate the noiseless, dephasing or depolarizing quantum channel as desired. To accomplish the communication complexity task, Alice and Bob select some measurements acting on their own photon, which can be easily realized by using the combination of motorized wave plates (quarter-wave plate (QWP), HWP) and PBS. Two single-mode fibers collect the photons and bring them to the single-photon avalanche diodes. The detected electronic signals are sent to a coincidence logic unit within a 3 ns window and integrated over an exposure time of 3 s. The total number of coincidences in this time and for each measurement choice is approximate $3\times 10^{6}$, sufficient to make the statistical errors small.

 figure: Fig. 2.

Fig. 2. (a). Experimental setup. A pair of photons in a state $\vert \psi (\theta )\rangle$ is generated via the spontaneous parametric down-conversion process by pumping a type-II cut PPKTP crystal located in a Sagnac interferometer with an ultraviolet laser at 405 nm. A half-wave plate (HWP, H0) in front of the laser is used to control the parameter $\theta$. These two photons are filtered by interference filters (IFs). One of the photons is sent to Alice directly, the other to Bob through a qubit Pauli channel. The polarization analyzer consisting of motorized wave plates and a polarization beam splitter (PBS) on both sides is used for different measurement settings. The photons are detected by single-photon detectors, and the signals are sent for coincidence. (b). The structure of H1 and H2. (c). Implementation of qubit Pauli channel. $T$ is the repetition time, $\tau _{1}$, $\tau _{2}$ and $\tau _{3}$ represent the time intervals of $\sigma _{1}$, $\sigma _{2}$ and $\sigma _{3}$ activation, respectively. The total Pauli operator time $\tau =0$ corresponds to noiseless channel ($I$), $\tau _{1} =\tau _{2} =0$ and $\tau _{3}>0$ corresponds to dephasing channel, $0<\tau _{1} =\tau _{2} =\tau _{3}<T/3$ corresponds to depolarizing channel.

Download Full Size | PDF

First, we investigate the effect of measurement basis deviation on the performance of quantum complexity protocol in the unbiased choice probability case. We measure the success probability $P_{Q}$ for several values of measurement basis parameters $\eta _{1}$ and $\eta _{2}$ with the maximally entangled state. Experimentally, we increase $\eta _{1}$ and $\eta _{2}$ from $0$ to $\pi$ at intervals of $\pi /16$. As shown in Fig. 3 (a) and Fig. 3 (b), the experimental data (dots) are compared with theoretical expectations (surfaces and lines), showing a good agreement. Obviously, the success probability can outperform the optimal classical bound for certain region of measurement basis (the red region above the yellow plane). And the maximum success probability is expected to be $(2+\sqrt {2})/4$ in the maximally entangled state case, which can be obtained by adopting some optimal measurement parameters, such as $\eta _{1}=7\pi /16$ and $\eta _{2}=11\pi /16$ (marked as a green star in (b)). As the measurement basis parameters $\eta _{1}$ and $\eta _{2}$ deviate from the optimal setting, the success probability $P_{Q}$ decreases and reaches the minimum value $1/4$ at some worst measurement parameters, such as $\eta _{1}=3\pi /16$ and $\eta _{2}=7\pi /16$ (marked as a blue square in (b)). Since the line segment between two points is the shortest, the rate of change in that direction is the largest. Therefore, we chose $\eta _{2}$ as the linear function of $\eta _{1}$ to study the effect of measurement basis deviation on the average success probability. Figure 3 (c) and Fig. 3 (d) respectively present the variation of the corresponding maximum and minimum success probability with the basis parameter $\eta _{1}$, where $\eta _{2}=K*\eta _{1}+B$. The brown, orange and red lines correspond to $K=5$, $K=1$, and $K=1/5$. It clearly shows the $K$ gets smaller, the success probability changes slower. And the situation is similar when the measurement basis deviates located in the region close to the extreme value. Since entanglement is a fragile resource, we first analyze the robustness of the effective measurement basis by changing the degree of entanglement of the shared state. Figure 4 (a) presents the distribution of $P_{Q}$ with different values of $\eta _{1}$ and $\eta _{2}$ in a period when the shared state is a non-maximally entangled pure state. Here, we use concurrence as a measure of entanglement, which can be obtained by quantum state tomography. The regions enclosed by the red curve and blue curve correspond to the effective range of $\eta _{1}$ and $\eta _{2}$ that can obtain higher-than-classical success probability when state concurrence $C=0.5358\pm 0.004$ and $C=0.9729\pm 0.003$, respectively. The light yellow region represents the disappearance of quantum superiority in both cases. In our experiment, $\eta _{1}$ increases from $4\pi /16$ to $12\pi /16$ and $\eta _{2}$ increases from $3\pi /16$ to $13\pi /16$, with an interval of $\pi /16$. The experimental data are marked as blue dots, red dots, and black stars in the corresponding regions, respectively. It is clear that, for a given concurrence, it is possible to obtain success probability beating the classical limit for certain region of measurement basis parameters. And the larger concurrence, the wider is the effective measurement basis parameters region, the stronger the robustness. In addition, with the optimal measurement setting described by Eq. (4), we can obtain the maximum quantum success probability, which is marked as the blue dot in Fig. 4(b). It clearly shows the superiority of communication complexity emerges when the shared state is entangled, increasing with state concurrence. For the maximum experimental entangled state $C=0.9729\pm 0.003$, the success probability $P_{Q}$ reaches the maximum value $0.8456\pm 0.0004$, about $239$ standard deviations above the optimal classical bound. We also investigate the robustness of the effective measurement basis by considering the effects of dephasing channel and depolarizing channel, respectively. These noise channels can be simulated by a sequence of two semi-circular HWPs (H1 and H2), as shown in Fig. 2(b). By a suitable control of their axes, H1 and H2 are set to act either as $\sigma _{1}$, $\sigma _{2}$ or $\sigma _{3}$. And we could also adjust the activation time $\tau _{1}$, $\tau _{2}$ and $\tau _{3}$ of the corresponding Pauli operators through remote control, as shown in Fig. 2(c). The condition $\tau _{1}= \tau _{2}=0$ corresponds to the depolarizing channel with the noise parameter $p_{d}=\tau _{3} /T$, $T$ represents the repetition time. It maps the initial state $\rho (\theta )= \vert \psi (\theta )\rangle \langle \psi (\theta ) \vert$ into $\varepsilon (\rho (\theta ))=(1-\dfrac {p_{d}}{2})\rho (\theta )+\dfrac {p_{d}}{2} (I\otimes \sigma _{3})\rho (\theta )(I\otimes \sigma _{3})$. And the condition $\tau _{1}= \tau _{2}= \tau _{3}$ corresponds to the depolarizing channel with $p_{d}=(\tau _{1}+\tau _{2}+ \tau _{3}) /T=\tau /T$, it maps the initial state $\rho (\theta )$ into $\varepsilon (\rho (\theta ))=(1-p_{d})\rho (\theta )+\dfrac {p_{d}}{3}((I\otimes \sigma _{1})\rho (\theta )(I\otimes \sigma _{1})+(I\otimes \sigma _{2})\rho (\theta )(I\otimes \sigma _{2})+(I\otimes \sigma _{3})\rho (\theta )(I\otimes \sigma _{3}))$. We increase $p_{d}$ from $0$ to $1$ with an interval of $0.1$ by fixing the Pauli operator activation time and varying the repetition time. The maximum quantum success probability $P_{Q}$ and concurrence $C$ of state $\varepsilon (\rho (\theta ))$ as function of $p_{d}$ in the case of $\theta =\pi /4$ is shown in Fig. 5. It clearly shows with the increase of the noise, the quantum superiority disappears slower in dephasing channel, indicating that the effective measurement basis is more robustness to the dephasing noise. Notably, unlike the entangled pure state case, the quantum superiority in dephasing and depolarizing channels may disappear even the state concurrence greater than zero. This is because there are mixed states that are entangled but do not violate the CHSH inequality.

 figure: Fig. 3.

Fig. 3. The influence of measurement basis on the success probability with the maximally entangled state. (a). The 3D plot of success probability $P_{Q}$ as functions of measurement basis parameters $\eta _{1}$ and $\eta _{2}$. (b). The contour map of (a). (c). $P_{Q}$ varies with $\eta _{1}$, which starts from an optimal measurement setting ($\eta _{1}=7 \pi /16$ and $\eta _{2}=11\pi /16$, marked as a green star in (b)) to other optimal measurement settings along three directions (dotted lines of the same color in (b)). (d). $P_{Q}$ varies with $\eta _{1}$, which starts from a worst measurement setting ($\eta _{1}=3\pi /16$ and $\eta _{2}=7\pi /16$, marked as a blue square in (b)) to other worst measurement settings along three directions (lines of the same color in (b)). The experimentally obtained success probabilities are shown as markers, while the theoretical predictions are also represented as surfaces and lines. The errors in $P_{Q}$ are obtained by performing 50 Monte Carlo simulation runs by taking into account of the Poisson photon counting statistics. The error bars are too small to be visible.

Download Full Size | PDF

 figure: Fig. 4.

Fig. 4. The influence of measurement basis deviation on the success probability with different entangled pure states. (a). The success probability distribution as functions of measurement basis parameters $\eta _{1}$, $\eta _{2}$ and state concurrence $C$. The light red region represents the success probabilities larger than the optimal classical bound when $C =0.5358\pm 0.004$. It extended to the light blue region when $C$ increased to $C= 0.9729\pm 0.003$. The light yellow region represents the case for which the success probability is smaller than the optimal classical bound even $C= 0.9729\pm 0.003$. The blue dots, red dots, and black stars in the corresponding regions are the experimental success probabilities. (b). The maximum success probability $P_{Q}$ as a function of state concurrence $C$. Red line and blue dots are theoretical and experimentally obtained values, respectively. The horizontal yellow dashed line denotes the optimal classical bound. Error bars are estimated by the Poissonian statistics of two-photon coincidences, which are too small to be visible.

Download Full Size | PDF

 figure: Fig. 5.

Fig. 5. The robustness of effective measurement basis in dephasing channel (a) and depolarizing channel (b). Red and purple lines and markers are theoretical and experimentally obtained values of maximum success probability $P_{Q}$ and state concurrence $C$, respectively. The horizontal yellow dashed line denotes the optimal classical bound. Error bars are estimated by the Poissonian statistics of two-photon coincidences, which are too small to be visible.

Download Full Size | PDF

We further measure the influence of biased measurement choice probability on the success probability with the maximally entangled state. As shown in Fig. 6(a), there is good agreement between the experimental result of success probabilities and the theoretical predictions. The quantum superiority can be observed inside the region enclosed by the black dashed curves, and the maximum success probability can be achieved when Alice and Bob adopt unbiased choice measurements, i.e., $p=q=1/2$. Figure 6(b) plots the difference between quantum and classical success probability $\Delta P= P_{Q} -P_{C}$ as functions of $p$ and $q$. It clearly shows that with the increase of the biasness of the measurement basis choice probability, both the quantum and classical success probability increase, but the value of the quantum-classical difference decreases. And the quantum superiority disappears slowest when $p=1/2$ or $q=1/2$ and fastest when $p=q$.

 figure: Fig. 6.

Fig. 6. The influence of biased measurement basis choice probability on the success probability. (a). The contour plot of success probability $P_{Q}$ as functions of measurement basis choice probability parameters $p$ and $q$. (b). The 3D plot of the difference between the quantum and classical success probability $\Delta P= P_{Q} -P_{C}$ versus $p$ and $q$. The black dashed curves in (a) and the white curves in (b) represent the boundary of existing quantum superiority, inside which quantum strategy can perform better than the best classical strategy. Experimentally obtained success probabilities are shown as dots. Theoretical predictions are also represented as surface plots and curves compared with the experimental data. Error bars are estimated by the Poissonian statistics of two-photon coincidences, which are too small to be visible.

Download Full Size | PDF

4. Conclusions

In conclusion, we propose a generalized entanglement-assisted communication complexity reduction protocol and comprehensively investigate the effects of measurement basis deviation and choice probability bias on quantum superiority. We find that when the participants share a specific entangled state, the quantum success probability is not always greater than the maximum classical success probability. The maximum quantum success probability can be achieved by using an optimal measurement setting and increases as the entanglement degree of the shared state increases. In addition, we find the measurement basis approximates the optimal measurement region, or the biased basis choice probability appeared only on one side; the quantum superiority is relatively insensitive to such imperfections. These results can enhance the test of quantum communication complexity, and can also be applied to other scientific experiments, such as the fundamental tests of nonlocal correlation [48,49] and quantum random access code [50,51].

Funding

National Natural Science Foundation of China (12004358); National Natural Science Foundation Regional Innovation and Development Joint Fund (U19A2075); Fundamental Research Funds for the Central Universities (201961010, 841912027, 202041012); Young Talents Project at Ocean University of China (861901013107).

Disclosures

The authors declare no conflicts of interest.

Data Availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

References

1. A. C. C. Yao, “Some complexity questions related to distributive computing,” in Proceedings of the 11th Annual ACM Symposium on Theory of Computing (ACM Press, 1979), pp. 209–213.

2. H. Buhrman, R. Cleve, and A. Wigderson, “Quantum vs. classical communication and computation,” In Proceedings of the 30th Annual ACM Symposium on Theory of Computing (ACM Press, 1998), pp. 63–68.

3. H. Buhrman, W. van Dam, P. Høyer, and A. Tapp, “Multiparty quantum communication complexity,” Phys. Rev. A 60(4), 2737–2741 (1999). [CrossRef]  

4. R. Cleve, D. Gottesman, and H. K. Lo, “How to share a quantum secret,” Phys. Rev. Lett. 83(3), 648–651 (1999). [CrossRef]  

5. H. Buhrman, R. Cleve, and W. van Dam, “Quantum entanglement and communication complexity,” SIAM J. Comput. 30(6), 1829–1841 (2001). [CrossRef]  

6. E. F. Galva o, “Feasible quantum communication complexity protocol,” Phys. Rev. A 65(1), 012318 (2001). [CrossRef]  

7. E. Kushilevitz and N. Nisan, Communication complexity, (Cambridge University Press, 1997).

8. M. A. Nielsen and I. L. Chuang, Quantum computation and quantum information, (Cambridge University Press, 2000).

9. H. Buhrman, R. Cleve, S. Massar, and R. de Wolf, “Nonlocality and communication complexity,” Rev. Mod. Phys. 82(1), 665–698 (2010). [CrossRef]  

10. A. C. C. Yao, “Quantum circuit complexity,” in Proceedings of the 34th IEEE Annual Symposium on Foundations of Computer Science (IEEE, 1993), pp. 352–361.

11. R. Cleve and H. Buhrman, “Substituting quantum entanglement for communication,” Phys. Rev. A 56(2), 1201–1204 (1997). [CrossRef]  

12. P. Xue, Y. S. Zhang, C. F. Li, and G. C. Guo, “Three-party quantum communication complexity via entangled tripartite pure states,” J. Opt. B: Quantum Semiclass. Opt. 3(4), 219–222 (2001). [CrossRef]  

13. C. Brukner, M. Zukowski, J.-W. Pan, and A. Zeilinger, “Bell’s inequalities and quantum communication complexity,” Phys. Rev. Lett. 92(12), 127901 (2004). [CrossRef]  

14. C. Brukner, M. Zukowski, and A. Zeilinger, “Quantum communication complexity protocol with two entangled qutrits,” Phys. Rev. Lett. 89(19), 197901 (2002). [CrossRef]  

15. A. Tavakoli and M. Źukowski, “Higher-dimensional communication complexity problems: Classical protocols versus quantum ones based on Bell’s theorem or prepare-transmit-measure schemes,” Phys. Rev. A 95(4), 042305 (2017). [CrossRef]  

16. R. Raz, “Exponential separation of quantum and classical communication complexity, in Proceedings of 31st Annual ACM Symposium on the Theory of Computing (ACM Press, 1999), pp. 358–367.

17. O. Regev and B. Klartag, “Quantum one-way communication can be exponentially stronger than classical communication, in Proceedings of the 43th Annual ACM Symposium on Theory of Computing (ACM Press, 2011), pp. 31–40.

18. D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. de Wolf, “Exponential separation for one-way quantum communication complexity, with applications to cryptography,” in Proceedings of the 39th Annual ACM Symposium on Theory of Computing (ACM Press, 2007), pp. 516–525.

19. Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis, “Exponential separation of quantum and classical one-way communication complexity,” in Proceedings of the 36th Annual ACM Symposium on Theory of Computing (ACM Press, 2004), pp. 128–137.

20. A. Anshu, D. Touchette, P. Yao, and N. Yu, “Exponential separation of quantum communication and classical information,” in Proceedings of the 49th Annual ACM Symposium on Theory of Computing (ACM Press, 2017), pp. 277–288.

21. P. A. Guérin, A. Feix, M. Araújo, and Č. Brukner, “Exponential communication complexity advantage from quantum superposition of the direction of communication,” Phys. Rev. Lett. 117(10), 100502 (2016). [CrossRef]  

22. P. Trojek, C. Schmid, M. Bourennane, Č. Brukner, M. Źukowski, and H. Weinfurter, “Experimental quantum communication complexity,” Phys. Rev. A 72(5), 050305 (2005). [CrossRef]  

23. M. Smania, A. M. Elhassan, A. Tavakoli, and M. Bourennane, “Experimental quantum multiparty communication protocols,” npj Quantum Inf. 2(1), 16010 (2016). [CrossRef]  

24. P. Trojek, C. Schmid, M. Bourennane, Č. Brukner, M. Źukowski, and H. Weinfurter, “Experimental multipartner quantum communication complexity employing just one qubit,” Nat. Comput. 12(1), 19–26 (2013). [CrossRef]  

25. N. Kumar, I. Kerenidis, and E. Diamanti, “Experimental demonstration of quantum advantage for one-way communication complexity surpassing best-known classical protocol,” Nat. Commun. 10(1), 4152 (2019). [CrossRef]  

26. H. Buhrman, L. Czekaj, A. Grudka, M. Horodecki, P. Horodecki, M. Markiewicz, F. Speelman, and S. Strelchuk, “Quantum communication complexity advantage implies violation of a Bell inequality,” Proc. Natl. Acad. Sci. U. S. A. 113(12), 3191–3196 (2016). [CrossRef]  

27. D. Martínez, A. Tavakoli, M. Casanova, G. Ca nas, B. Marques, and G. Lima, “High-dimensional quantum communication complexity beyond strategies based on Bell’s Theorem,” Phys. Rev. Lett. 121(15), 150504 (2018). [CrossRef]  

28. J. Ho, G. Moreno, S. Brito, F. Graffitti, C. L. Morrison, R. Nery, A. Pickston, M. Proietti, R. Rabelo, A. Fedrizzi, and R. Chaves, “Entanglement-based quantum communication complexity beyond Bell nonlocality,” npj Quantum Inf. 8(1), 13 (2022). [CrossRef]  

29. F. Xu, J. M. Arrazola, K. Wei, W. Wang, P. Palacios-Avila, C. Feng, S. Sajeed, N. Lütkenhaus, and H. K. Lo, “Experimental quantum fingerprinting with weak coherent pulses,” Nat. Commun. 6(1), 8735 (2015). [CrossRef]  

30. K. Wei, N. Tischler, S. R. Zhao, Y. H. Li, J. M. Arrazola, Y. Liu, W. Zhang, H. Li, L. You, Z. Wang, Y. A. Chen, B. C. Sanders, Q. Zhang, G. J. Pryde, F. Xu, and J. W. Pan, “Experimental quantum switching for exponentially superior quantum communication complexity,” Phys. Rev. Lett. 122(12), 120504 (2019). [CrossRef]  

31. P. Xue, Y. F. Huang, Y. S. Zhang, C. F. Li, and G. C. Guo, “Reducing the communication complexity with quantum entanglement,” Phys. Rev. A 64(3), 032304 (2001). [CrossRef]  

32. J. Zhang, X. H. Bao, T. Y. Chen, T. Yang, A. Cabello, and J. W. Pan, “Experimental quantum Guess my Number protocol using multiphoton entanglement,” Phys. Rev. A 75(2), 022302 (2007). [CrossRef]  

33. P. Xue, C. F. Li, and G. C. Guo, “A two-party probabilistic communication complexity scenario via Werner states,” Chin. Phys. Lett. 18(10), 1305–1307 (2001). [CrossRef]  

34. M. Zhang, L. Zhang, J. Wu, S. Yang, X. Wan, Z. He, J. Jia, D. S. Citrin, and J. Wang, “Detection and compensation of basis deviation in satellite-to-ground quantum communications,” Opt. Express 22(8), 9871 (2014). [CrossRef]  

35. Y. Cao, H. Liang, J. Yin, H. L. Yong, F. Zhou, Y. Pi. Wu, J. G. Ren, Y. H. Li, G. S. Pan, T. Yang, X. F. Ma, C. Z. Peng, and J. W. Pan, “Entanglement-based quantum key distribution with biased basis choice via free space,” Opt. Express 21(22), 27260 (2013). [CrossRef]  

36. M. A. C. Rossi and M. G. A. Paris, “Entangled quantum probes for dynamical environmental noise,” Phys. Rev. A 92(1), 010302 (2015). [CrossRef]  

37. B. Teklu, S. Olivares, and M. G. A. Paris, “Bayesian estimation of one-parameter qubit gates,” J. Phys. B: At. Mol. Opt. Phys. 42(3), 035502 (2009). [CrossRef]  

38. G. M. D’Ariano, P. L. Presti, and M. G. A. Paris, “Using entanglement improves the precision of quantum measurements,” Phys. Rev. Lett. 87(27), 270404 (2001). [CrossRef]  

39. C. Agnesi, M. Avesani, L. Calderaro, A. Stanco, G. Foletto, M. Zahidy, A. Scriminich, F. Vedovato, G. Vallone, and P. Villoresi, “Simple quantum key distribution with qubit-based synchronization and a self-compensating polarization encoder,” Optica 7(4), 284–290 (2020). [CrossRef]  

40. J. Trapani, B. Teklu, S. Olivares, and M. G. A. Paris, “Quantum phase communication channels in the presence of static and dynamical phase diffusion,” Phys. Rev. A 92(1), 012317 (2015). [CrossRef]  

41. B. Teklu, M. G. Genoni, S. Olivares, and M. G. A. Paris, “Phase estimation in the presence of phase diffusion: the qubit case,” Phys. Scr. T140, 014062 (2010). [CrossRef]  

42. H. Adnane, B. Teklu, and M. G. A. Paris, “Quantum phase communication channels assisted by non-deterministic noiseless amplifiers,” J. Opt. Soc. Am. B 36(11), 2938–2945 (2019). [CrossRef]  

43. M. Rosati, A. Mari, and V. Giovannetti, “Coherent-state discrimination via nonheralded probabilistic amplification,” Phys. Rev. A 93(6), 062315 (2016). [CrossRef]  

44. M. K. Riahi, J. Salomon, S. J. Glaser, and D. Sugny, “Fully efficient time-parallelized quantum optimal control algorithm,” Phys. Rev. A 93(4), 043410 (2016). [CrossRef]  

45. T. Lawson, N. Linden, and S. Popescu, “Biased nonlocal quantum games,” arXiv:1011.6245 (2010).

46. A. Dey, T. Pramanik, and A. S. Majumdar, “Fine-grained uncertainty relation and biased nonlocal games in bipartite and tripartite systems,” Phys. Rev. A 87(1), 012120 (2013). [CrossRef]  

47. A. Fedrizzi, T. Herbst, A. Poppe, T. Jennewein, and A. Zeilinger, “A wavelength-tunable fiber-coupled source of narrowband entangled photons,” Opt. Express 15(23), 15377–15386 (2007). [CrossRef]  

48. T. Pramanik, M. Kaplan, and A. S. Majumdar, “Fine-grained Einstein-Podolsky-Rosen–steering inequalities,” Phys. Rev. A 90(5), 050305 (2014). [CrossRef]  

49. G. Cavalcanti Eric, “Classical causal models for Bell and Kochen-Specker inequality violations require fine-tuning,” Phys. Rev. X 8(2), 021018 (2018). [CrossRef]  

50. S. Muhammad, A. Tavakoli, M. Kurant, M. Pawłowski, M. K. Zukowski, and M. Bourennane, “Quantum bidding in bridge,” Phys. Rev. X 4(2), 021047 (2017). [CrossRef]  

51. Y. Xiao, X. H. Han, X. Fan, H. C. Qu, and Y. J. Gu, “Widening the sharpness modulation region of an entanglement-assisted sequential quantum random access code: Theory, experiment, and application,” Phys. Rev. Res. 3(2), 023081 (2021). [CrossRef]  

Data Availability

Data underlying the results presented in this paper are not publicly available at this time but may be obtained from the authors upon reasonable request.

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (6)

Fig. 1.
Fig. 1. Generalized entanglement-assisted communication complexity protocol. Alice and Bob receive biased input strings $x=x_{0}x_{1}\in \lbrace 0,1 \rbrace ^{2}$ and $y=y_{0}y_{1}\in \lbrace 0,1 \rbrace ^{2}$ to decide their specific measurement. After each round of measurement, they send one bit information $x_{1}\oplus a$ and $y_{1} \oplus b$ to each other to check whether the relation $a\oplus b=(x_{0}\wedge y_{0})$ is satisfied. If the relation is satisfied, they can successfully determine the correct value of the function $f(x,y)=x_{1}\oplus y_{1}\oplus (x_{0}\wedge y_{0})$ ; otherwise, they can not. The entangled state shared between them is used to improve the success probability.
Fig. 2.
Fig. 2. (a). Experimental setup. A pair of photons in a state $\vert \psi (\theta )\rangle$ is generated via the spontaneous parametric down-conversion process by pumping a type-II cut PPKTP crystal located in a Sagnac interferometer with an ultraviolet laser at 405 nm. A half-wave plate (HWP, H0) in front of the laser is used to control the parameter $\theta$ . These two photons are filtered by interference filters (IFs). One of the photons is sent to Alice directly, the other to Bob through a qubit Pauli channel. The polarization analyzer consisting of motorized wave plates and a polarization beam splitter (PBS) on both sides is used for different measurement settings. The photons are detected by single-photon detectors, and the signals are sent for coincidence. (b). The structure of H1 and H2. (c). Implementation of qubit Pauli channel. $T$ is the repetition time, $\tau _{1}$ , $\tau _{2}$ and $\tau _{3}$ represent the time intervals of $\sigma _{1}$ , $\sigma _{2}$ and $\sigma _{3}$ activation, respectively. The total Pauli operator time $\tau =0$ corresponds to noiseless channel ( $I$ ), $\tau _{1} =\tau _{2} =0$ and $\tau _{3}>0$ corresponds to dephasing channel, $0<\tau _{1} =\tau _{2} =\tau _{3}<T/3$ corresponds to depolarizing channel.
Fig. 3.
Fig. 3. The influence of measurement basis on the success probability with the maximally entangled state. (a). The 3D plot of success probability $P_{Q}$ as functions of measurement basis parameters $\eta _{1}$ and $\eta _{2}$ . (b). The contour map of (a). (c). $P_{Q}$ varies with $\eta _{1}$ , which starts from an optimal measurement setting ( $\eta _{1}=7 \pi /16$ and $\eta _{2}=11\pi /16$ , marked as a green star in (b)) to other optimal measurement settings along three directions (dotted lines of the same color in (b)). (d). $P_{Q}$ varies with $\eta _{1}$ , which starts from a worst measurement setting ( $\eta _{1}=3\pi /16$ and $\eta _{2}=7\pi /16$ , marked as a blue square in (b)) to other worst measurement settings along three directions (lines of the same color in (b)). The experimentally obtained success probabilities are shown as markers, while the theoretical predictions are also represented as surfaces and lines. The errors in $P_{Q}$ are obtained by performing 50 Monte Carlo simulation runs by taking into account of the Poisson photon counting statistics. The error bars are too small to be visible.
Fig. 4.
Fig. 4. The influence of measurement basis deviation on the success probability with different entangled pure states. (a). The success probability distribution as functions of measurement basis parameters $\eta _{1}$ , $\eta _{2}$ and state concurrence $C$ . The light red region represents the success probabilities larger than the optimal classical bound when $C =0.5358\pm 0.004$ . It extended to the light blue region when $C$ increased to $C= 0.9729\pm 0.003$ . The light yellow region represents the case for which the success probability is smaller than the optimal classical bound even $C= 0.9729\pm 0.003$ . The blue dots, red dots, and black stars in the corresponding regions are the experimental success probabilities. (b). The maximum success probability $P_{Q}$ as a function of state concurrence $C$ . Red line and blue dots are theoretical and experimentally obtained values, respectively. The horizontal yellow dashed line denotes the optimal classical bound. Error bars are estimated by the Poissonian statistics of two-photon coincidences, which are too small to be visible.
Fig. 5.
Fig. 5. The robustness of effective measurement basis in dephasing channel (a) and depolarizing channel (b). Red and purple lines and markers are theoretical and experimentally obtained values of maximum success probability $P_{Q}$ and state concurrence $C$ , respectively. The horizontal yellow dashed line denotes the optimal classical bound. Error bars are estimated by the Poissonian statistics of two-photon coincidences, which are too small to be visible.
Fig. 6.
Fig. 6. The influence of biased measurement basis choice probability on the success probability. (a). The contour plot of success probability $P_{Q}$ as functions of measurement basis choice probability parameters $p$ and $q$ . (b). The 3D plot of the difference between the quantum and classical success probability $\Delta P= P_{Q} -P_{C}$ versus $p$ and $q$ . The black dashed curves in (a) and the white curves in (b) represent the boundary of existing quantum superiority, inside which quantum strategy can perform better than the best classical strategy. Experimentally obtained success probabilities are shown as dots. Theoretical predictions are also represented as surface plots and curves compared with the experimental data. Error bars are estimated by the Poissonian statistics of two-photon coincidences, which are too small to be visible.

Equations (5)

Equations on this page are rendered with MathJax. Learn more.

f ( x , y ) = x 1 y 1 ( x 0 y 0 ) ,
P Q = x 0 , y 0 a , b P ( x 0 ) P ( y 0 ) P ( a b = x 0 y 0 ) , P ( a b = x 0 y 0 ) = { ( 1 + A 0 B 0 ) / 2 x 0 = 0 , y 0 = 0 , ( 1 + A 0 B 1 ) / 2 x 0 = 0 , y 0 = 1 , ( 1 + A 1 B 0 ) / 2 x 0 = 1 , y 0 = 0 , ( 1 A 1 B 1 ) / 2 x 0 = 1 , y 0 = 1 .
P Q = 1 2 + 1 2 C H S H Q .
A 0 = s i n 2 η 1 σ 1 + c o s 2 η 1 σ 3 , A 1 = s i n 2 η 2 σ 1 + c o s 2 η 2 σ 3 , B 0 = s i n 2 η 1 σ 1 + c o s 2 η 1 σ 3 , B 1 = s i n 2 η 2 σ 1 + c o s 2 η 2 σ 3 .
A 0 = σ 1 ( q + ( 1 q ) c o s β ) + σ 3 ( 1 q ) s i n β ( q + ( 1 q ) c o s β ) 2 + ( ( 1 q ) s i n β ) 2 , A 1 = σ 1 ( q ( 1 q ) c o s β ) + σ 3 ( 1 q ) s i n β ( q ( 1 q ) c o s β ) 2 ( ( 1 q ) s i n β ) 2 , B 0 = σ 1 , B 1 = σ 1 c o s β + σ 3 s i n β ,
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.