Efficient quantum communications with multiplexed coherent state fingerprints
Abstract
We provide the first example of a communication model and a distributed task, for which there exists a realistic quantum protocol which is asymptotically more efficient than any classical protocol, both in the communication and the information resources. For this, we extend a recently proposed coherent state mapping for quantum communication protocols, introduce the notion of multiplexed coherent state fingerprints and show how to use them to design an efficient quantum protocol for estimating the Euclidean distance of two real vectors within a constant factor.
pacs:
03.67.-a, 03.67.Ac, 03.67.Hk, 42.50.Ex, 89.70.HjQuantum information processing harnesses the power of quantum mechanics in order to enhance the efficiency and security of information and communication technologies. The main goal is to find tasks for which it is possible to prove theoretically the superiority of quantum information compared to classical information and to verify it experimentally. This is illustrated, for instance, in nonlocal games, where experiments have confirmed the violation of Bell inequalities that correspond to the CHSH and other games Hensen et al. (2015); Matsukevich et al. (2008); Ansmann et al. (2009); Pappa et al. (2015). Another prominent example is quantum cryptography, where many protocols with unconditionally stronger security than classically possible have been demonstrated, including quantum key distribution, digital signatures or coin flipping Scarani et al. (2009); Donaldson et al. (2016); Pappa et al. (2014). Unlike the above mentioned cases, most quantum algorithms are far from been implementable with current technologies, with the exception of non-universal boson sampling machines that have been realized for small inputs Tillmann et al. (2013); Crespi et al. (2013); Spagnolo et al. (2014).
Communication complexity is an ideal model for testing quantum mechanics and for understanding the efficiency of quantum networks. This model studies the amount of communication required by separate parties to jointly compute a task. There are several examples where communicating quantum information can result in considerable savings in the communication overhead Buhrman et al. (2001, 1998); Raz (1999); Bar-Yossef et al. (2004); Gavinsky et al. (2007); Gavinsky (2016); Regev and Klartag (2011). Nevertheless, it is in general difficult to test these results experimentally and demonstrate quantum superiority in practice since the quantum protocols typically necessitate large, highly entangled states, which are out of reach of current photonic technologies.
Recently, Arrazola and Lütkenhaus proposed a mapping for encoding quantum communication protocols involving pure states of many qubits, unitary operations and projective measurements to protocols based on coherent states of light in a superposition of optical modes, linear optics operations and single-photon detection Arrazola and Lütkenhaus (2014a). This powerful model was used to propose the practical implementation of coherent state quantum fingerprints Arrazola and Lütkenhaus (2014b), leading to two experimental demonstrations: a proof-of-principle use of such fingerprints for solving the communication task of Equality asymptotically better than the best known classical protocol with respect to the transmitted information Xu et al. (2015); and a subsequent implementation beating the classical lower bound for the transmitted information Guan et al. (2016). Following these demonstrations that have focused on Equality and on transmitted information, an important question remains: is there a realistic model for proving and testing in practice that quantum information is asymptotically better than classical for communication tasks with respect to all important communication and information resources?
We answer in the affirmative by proposing a communication model and a distributed task for which we prove that quantum mechanics allows for a considerably more efficient protocol in all relevant resources. We do this by building upon the mapping of Arrazola and Lütkenhaus (2014a) to introduce multiplexed coherent state fingerprints and show how to use them for solving efficiently a task that is at the foundation of many applications in Machine Learning, namely estimating the Euclidean distance of two real vectors within a constant factor. Our results show that, in principle, it is possible to demonstrate quantum superiority for advanced communication tasks in quantum networks using photonic technologies within experimental reach.
Communication resources. We start by defining the simultaneous message passing model and the resources that we are trying to optimize. In this model, two players, Alice and Bob, receive inputs and respectively from an input set . Their task is to use some private coins and send a single and smallest possible message to a Referee, who should be able to compute the value of a function with a small error .
The communication cost of the protocol is defined as the number of bits the two players have to send to the Referee and the communication complexity of the task is defined as the minimum communication cost over all protocols that solve the task. In real world communication networks, very often the cost is rather calculated as the time one uses the communication channel, for example on the phone network. We note that these costs are interchangeable, provided that the communication channel has a specific maximum rate. We define the time unit as the time to send a single bit over the communication channel, and then, in an optimal protocol, bits and communication time are equal, since one will always send one bit per time unit. As custom, the time for local computations is ignored. Another resource one can study is the transmitted information, which instead of the number of bits sent, calculates the real bits of information about the inputs that the messages carry. For example, if Alice always sends the same, long message, independent of her input, then the communication time will be large, while the transmitted information will be zero, since no information about the input has been transmitted. Transmitted information is a resource that is important for privacy, when on top of having an efficient protocol, we want the Referee to solve the task without learning much about the players’ inputs. One can define the transmitted information as the mutual information between the messages and the inputs and can upper bound it with the logarithm of the number of different messages the players send. In any protocol, the transmitted information is at most the communication time, since one bit cannot carry more than one bit of information, and hence, the bottleneck is always the time, as the largest quantity.
We can similarly define the resources for quantum protocols. The communication time is again the number of time units the protocol takes, where in a time unit at most one qubit can be sent in expectation. Here, we have added the “in expectation” since typically in quantum communications the qubits are realized by photons emitted by practical light sources and hence their mean number follows a Poisson distribution Scarani et al. (2009). In the following, we also make this change to the classical model to make a more correct comparison, i.e., we allow one bit in expectation per time unit, which does not change the order of the communication time. We will also upper bound the transmitted information as the logarithm of the minimum dimension of the Hilbert space that contains all the possible quantum messages that are sent in the protocol. For example, if in a protocol Alice has as input an -bit string and sends a message that contains qubits of the form and another qubits in the state , then the communication time is , while the transmitted information is .
Euclidean distance of real vectors. We now describe a fundamental communication task. Alice and Bob possess large data sets and respectively, which are unit vectors in . They would like to allow a Referee to check how similar their data is by estimating the Euclidean distance (for simplicity we define its square), (or equivalently the inner product, since ). We call this problem Euclidean Distance or ED.
Alice and Bob can transmit their entire data to the Referee, but this is non-optimal. The idea is to send fingerprints of the data, which are much shorter but still allow the Referee to approximate their Euclidean distance within some additive constant. Classically, this problem requires Alice and Bob to send fingerprints of size Ambainis (1996); Babai and Kimmel (1997); Newman (1991); Newman and Szegedy (1996). We consider here that Alice and Bob do not have access to any shared randomness, otherwise the problem can be solved with only constant communication Kremer et al. (1999). It is natural that parties do not a priori have such shared resources, especially in large networks where the communication is between many different pairs of parties.
Quantum fingerprints can be exponentially shorter than the classical ones in this case. In particular, Alice and Bob create and send quantum fingerprints, namely and , respectively. The Referee then estimates the Euclidean distance by performing a controlled swap operation on the fingerprints which outputs “1” with probability Buhrman et al. (2001). The Referee estimates this probability, and hence the Euclidean distance, within an additive constant with probability at least , using a constant number of fingerprints equal to . The communication time is , since Alice and Bob send a constant number of fingerprints and each fingerprint consists of qubits and can be sent in time units. The transmitted information is also , equal to the communication time. Hence, if we look at the ratio of the quantum over the classical resources, then both resources asymptotically go to zero as grows. Unfortunately, implementing these fingerprints with qubit systems is out of reach for current technologies for large .
The notion of quantum fingerprints has been used in practice for the Equality problem Arrazola and Lütkenhaus (2014b); Xu et al. (2015); Guan et al. (2016), where the inputs are binary strings and the Referee checks whether they are exactly the same or not. The Equality problem can be reduced with the help of error correcting codes to approximating the Euclidean distance between the two vectors within a constant factor and hence the previous protocol solves Equality with the same resources. Since most real data is represented as real-valued vectors, the Euclidean Distance problem is more pertinent than Equality, since it is rather improbable that two different sets of real-valued data will be exactly equal. Hence, here, we extend the use of the term quantum fingerprints to real-valued inputs, where we ask that fingerprints can be used to approximate the distance of the inputs and not check whether they are exactly equal or not.
Coherent state fingerprints for Euclidean Distance. The coherent state mapping of Arrazola and Lütkenhaus (2014a) led to a protocol for Equality with communication time and transmitted information . This protocol therefore provides an exponential advantage in the transmitted information, at the expense of a quadratically worse performance in communication time compared to the classical protocol, for which the order of both resources is .
A schematic of the corresponding protocol for Euclidean Distance is shown in Fig. 1. Alice and Bob’s fingerprints are trains of coherent states sent to the Referee. Alice’s state, , is prepared by the displacement operator applied to the vacuum state, where is the annihilation operator of the fingerprint mode Arrazola and Lütkenhaus (2014b), and is the photon annihilation operator of the time mode. Hence,
(1) |
where is a coherent state with amplitude occupying the mode. The mean photon number for the state is , independent of the input size. Bob similarly creates the fingerprint .
As shown in Fig. 1, the Referee uses a beam splitter (BS) to interfere the incoming coherent states. This yields the output state for the time unit
(2) |
where the subscripts and denote the single-photon detectors placed at the output arms of the BS.
In previous works on Equality, the clicks of have been used for estimating how different the two fingerprints are. Then, since the expected number of clicks of the detector depends directly on its dark count probability, it is crucial to keep this probability very low. Here, we try to deal with this problem, by using the clicks from both detectors to construct a more robust estimator for the Euclidean distance that can also be used for Equality.
More precisely, let and be the binary random variables that are 1 with the probability with which and clicks respectively at the time unit, namely , and . Here, the approximation holds because we take to be typically small, and and are unit vectors in and for large the terms and are typically in the order of . The Euclidean distance () is equal to
(3) |
The advantage of using statistics from both detectors comes from the fact that the Euclidean distance estimator depends now on the difference of the clicks of the detectors, and hence on expectation the number of dark counts cancels out, when we assume the dark count probabilities are the same for both detectors. We remark that this can be enforced by symmetrization procedures Pappa et al. (2015), although in practice, since the symmetrization will not be perfect, the estimator will in fact depend on the square of the dark count probability, which is easier to keep low.
By Chernoff bounds, to estimate within a constant factor with constant probability at least , the number of fingerprints required is Upfal and Mitzenmacher (2005). Hence, the overall communication time of the protocol is while the transmitted information is . Note that in each time unit, photons are sent in expectation, thus satisfying our model’s criterion of no more than one photon in each time unit.
In Table I we summarize in the first two rows the resources of the two protocols we have described for ED. The performance achieved with the coherent state fingerprint protocol is the same as the one achieved for Equality, i.e., exponentially better in transmitted information but quadratically worse in communication time. We describe now a quantum protocol that can perform better than a classical protocol in both resources.
Comm. Time | Trans. Info. | |
---|---|---|
Classical | ||
Coherent | ||
Mux Classical | ||
Mux Coherent |
Multiplexed coherent state fingerprints. We extend both the classical and quantum communication models to allow Alice and Bob to have multiple communication channels with the Referee. In particular, Alice and Bob can use different channels, where in every communication time unit, they can send in expectation at most one bit or one photon in total over all channels.
First, the multiple channels reduce the classical communication by at most a factor, since we can simulate any multiple channel protocol with a single channel one with a overhead: for every bit sent through one of the channels, we send the same bit and the index of the channel in bits through the single channel.
In the quantum case, we take better advantage of the multiple channels and have an ED protocol with communication time of order , while the transmitted information remains of order . The underlying reason is that most of the pulses sent are empty of photons and hence we can use the multiple channels to send in parallel many pulses, without sending more than one photon in expectation per time unit. More precisely, Alice and Bob divide their bit input into substrings, each of length . They create coherent state fingerprints for each of the substrings and at each time unit they send pulses through the channels, one from each of the fingerprints. The Referee interferes the corresponding pulses as in the initial protocol, either by using sets of BS and detectors, or by time ordering the pulses and using a single set of BS and detectors. The communication time is now reduced by a factor of . By choosing to be , we can make both resources of the quantum protocol asymptotically smaller than the best classical protocol. The expected number of photons in each time unit is , which for large enough and since is asymptotically smaller than can be made , hence satisfying the no more than one photon per time unit constraint.
One way to implement the above protocol is by using physical channels. This is the case for backbone communication networks, where nodes are connected via a large number of channels. Another way could be to employ all-optical orthogonal frequency division multiplexing (OFDM), an advanced classical multiplexing technique that has recently been adapted for performing high-rate quantum key distribution Bahrani et al. (2015) (details in Appendix).
Figure 2 illustrates an abstract implementation based on multiplexing. Alice and Bob create coherent state fingerprints for each of the substrings and at each time unit they multiplex the corresponding set of pulses and send the output signal to the Referee. The Referee demultiplexes the signals from Alice and Bob and then interferes each pair of pulses through a BS. The protocol proceeds similarly for all time units and the Referee estimates the Euclidean distance as described before.
The last two rows of Table I compare the classical and quantum multiplexed protocols for ED. This is the first example of a communication model and a task, for which an in principle realistic quantum protocol is asymptotically more efficient both in the communication time and the transmitted information than any classical protocol.
Performance analysis. We consider some standard experimental imperfections, including BS interferometer visibility and detector dark count probability . Errors may be due to multiplexing and demultiplexing as well but as these depend on the specific implementation we do not consider them here. Moreover, we assume that all of Referee’s detectors have the same parameters, in particular that they have equal dark count probabilities.
With the above imperfections we recalculate the probability of a click in and and show in Appendix that
(4) |
The main source of error comes from the error in estimating the expectation of the detectors clicking. This error is handled by repeating the protocol a constant number of times and using Chernoff bounds. Another source of error comes from estimating the experimental parameters, i.e. the BS visibility and the mean photon number. Note that the expectation of the difference in counts of the two detectors does not depend on the dark count probability, provided it is the same for 0 and 1.
In Fig. 3 we show the transmitted information and communication time as a function of , for our multiplexed protocol with of the order of , and compare its performance with the classical lower bound as well as with the best known classical protocol for Equality. The analytical expressions for all protocols are provided in Appendix. We see first, that if we are only interested in the communication time, which is often the case, then our protocol outperforms the classical limit even for small and by consequence for small number of multiplexed channels which can be feasible in practice. Moreover, for large enough , our protocol outperforms the classical limit for both resources. For current parameters, the number of channels needed is in the order of , which may not be realistic. By improving the experimental parameters it may be possible to decrease this number.
Discussion. A noteworthy feature of our protocol is that Alice and Bob do not need a memory to store their inputs and they do not perform global operations on them. In other words, our protocol works also in the streaming scenario, where Alice and Bob receive their inputs one bit at a time Noga Alon and Szegedy (1999). We note that this is not the case neither for the Equality protocol, where an error correcting code needs to be applied to the entire input string, nor for the qubit protocol where the fingerprint is encoded in a superposition of qubits. It will be interesting to further explore this scenario for efficient quantum communications. More generally, expanding the family of distributed tasks in the coherent state communication model studied in this work is important for demonstrating in practice quantum superiority in a network setting.
We thank Juan-Miguel Arrazola for useful discussions. We acknowledge financial support by the ERC project QCC, the ANR projects COMB and QRYPTOS, the Region Ile-de-France DIM Nano-K project QUIN, and the Partner University Fund project CRYSP.
Appendix
Description of OFDM approach for multiplexed coherent state Euclidean distance. We provide some details for employing all-optical orthogonal frequency division multiplexing (OFDM) in our multiplexed coherent state fingerprint framework. In this case, Alice and Bob create coherent state fingerprints for each of their substrings in orthogonal frequency subcarrier modes that are generated using frequency offset locked laser diodes (alternatively, a pulsed laser source such as a mode-locked laser can be used for this purpose, as shown in Bahrani et al. (2015)). At every time unit, the corresponding pulse from each of the fingerprints is multiplexed in a OFDM encoder and the output signal is sent to the Referee.
The frequency separation between any two adjacent subcarriers in the OFDM scheme is and the encoded OFDM signal has a pulse width of T = . At the first time unit , Alice’s coherent pulses for each of the substrings are . They get encoded in the OFDM signal (subscript denotes time):
for T, with the subcarrier frequency given by = + 2. Bob employs the same multiplexing technique to prepare his OFDM signal.
Once the OFDM signals from Alice and Bob for the time step reaches the Referee, he decodes them via an Optical Discrete Fourier Transform (ODFT) on the input signal . The output circuit to decode the subcarrier signal (for ) at time step is:
where and we used the orthogonality condition = . A typical duration for the OFDM signal is T = 100 ps Bahrani et al. (2015).
The advantage of this technique is that because of the orthogonality of the employed subcarriers, these do not interfere with each other despite overlapping sidebands between adjacent carriers, leading to an efficient demultiplexing; however, the number of supported subcarriers in practice currently remains quite low.
Euclidean distance expression with experimental imperfections. The Euclidean distance between the data sets and is . We prove directly the case with interferometer visibility . Let be the binary random variables that take the value 1 with probability and respectively, for the time unit. We have assumed that all detectors have the same parameters so even in the case the Referee uses a different set of detectors for each time unit , the probabilities are the same. These probabilities are ; and , where is the dark count probability for both detectors. The expectation value of their difference over is,
(5) |
From this expression and using the fact that , we obtain
(6) |
Equation (6) shows that the error in the estimation of the Euclidean distance comes from two different sources: first, the estimation of the mean value of the sum . For this, using the Chernoff bound, we can deduce that if the Referee wants to estimate this within a small constant factor with probability at least , the number of samples required is Upfal and Mitzenmacher (2005); second, the error in the parameter estimation of and , which in general depends on the experimental setup but can be considered very small.
Details of performance analysis. The plot in Fig. 3 compares the transmitted information and communication time vs. the data input size for the classical lower bound; the best classical protocol; and the quantum multiplexed coherent state protocol. We fix that the protocol estimates ED within a constant factor with error probability .
Classical lower bound: We use the lower bounds for the Equality problem (Ambainis, 1996; Babai and Kimmel, 1997; Newman and Szegedy, 1996) to provide a lower bound for ED.
Suppose we have a classical ED protocol for input size that approximates the distance within a fixed with probability at least . To construct a protocol for Equality, we choose the error-correcting code (ECC) that amplifies the -bit inputs and to -bit codewords and respectively, with the minimum distance across being . Then, we use the ED protocol on the codewords and , and have:
(7) |
Hence, this guarantees solving the Equality on and with probability .
Hence we get a lower bound for ED as Babai and Kimmel (1997); Guan et al. (2016), which is shown in Fig. 3.
Classical protocol for Equality: Here we also plot the best classical protocol that solves Equality, which uses bits and succeeds with probability . To get the desired , the protocol is repeated 10 times. Thus Babai and Kimmel (1997).
Quantum multiplexed coherent state protocol: Our protocol bounds the ED within with probability and has transmitted information ; and communication time
In order to provide an advantage both in the transmitted information and the communication time, we take . Hence, the number of channels scales as . For the plot, we consider and the experimental parameters to be and Xu et al. (2015).
References
- B. Hensen, H. Bernien, A. Dréau, A. Reiserer, N. Kalb, M. Blok, J. Ruitenberg, R. Vermeulen, R. Schouten, C. Abellán, et al., Nature 526, 682 (2015).
- D. Matsukevich, P. Maunz, D. Moehring, S. Olmschenk, and C. Monroe, Phys. Rev. Lett. 100, 150404 (2008).
- M. Ansmann, H. Wang, R. C. Bialczak, M. Hofheinz, E. Lucero, M. Neeley, A. O’Connell, D. Sank, M. Weides, J. Wenner, et al., Nature 461, 504 (2009).
- A. Pappa, N. Kumar, T. Lawson, M. Santha, S. Zhang, E. Diamanti, and I. Kerenidis, Phys. Rev. Lett. 114, 020401 (2015).
- V. Scarani, H. Bechmann-Pasquinucci, N. J. Cerf, M. Dušek, N. Lütkenhaus, and M. Peev, Rev. Mod. Phys. 81, 1301 (2009).
- R. J. Donaldson, R. J. Collins, K. Kleczkowska, R. Amiri, P. Wallden, V. Dunjko, J. Jeffers, E. Andersson, and G. S. Buller, Phys. Rev. A. 93, 012329 (2016).
- A. Pappa, P. Jouguet, T. Lawson, A. Chailloux, M. Legré, P. Trinkler, I. Kerenidis, and E. Diamanti, Nature Commun. 5 (2014).
- M. Tillmann, B. Dakić, R. Heilmann, S. Nolte, A. Szameit, and P. Walther, Nature Photon. 7, 540 (2013).
- A. Crespi, R. Osellame, R. Ramponi, D. J. Brod, E. F. Galvão, N. Spagnolo, C. Vitelli, E. Maiorino, P. Mataloni, and F. Sciarrino, Nature Photon. 7, 545 (2013).
- N. Spagnolo, C. Vitelli, M. Bentivegna, D. J. Brod, A. Crespi, F. Flamini, S. Giacomini, G. Milani, R. Ramponi, P. Mataloni, et al., Nature Photon. 8, 615 (2014).
- H. Buhrman, R. Cleve, J. Watrous, and R. De Wolf, Phys. Rev. Lett. 87, 167902 (2001).
- H. Buhrman, R. Cleve, and A. Wigderson, in Proceedings of the thirtieth annual ACM symposium on Theory of computing (1998), pp. 63–68.
- R. Raz, in Proceedings of the thirty-first annual ACM symposium on Theory of computing (1999), pp. 358–367.
- Z. Bar-Yossef, T. S. Jayram, and I. Kerenidis, in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004), pp. 128–137.
- D. Gavinsky, J. Kempe, I. Kerenidis, R. Raz, and R. De Wolf, in Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007), pp. 516–525.
- D. Gavinsky, arXiv preprint arXiv:1602.05059 (2016).
- O. Regev and B. Klartag, in Proceedings of the forty-third annual ACM symposium on Theory of computing (2011), pp. 31–40.
- J. M. Arrazola and N. Lütkenhaus, Phys. Rev. A 90, 042335 (2014a).
- J. M. Arrazola and N. Lütkenhaus, Phys. Rev. A 89, 062305 (2014b).
- F. Xu, J. M. Arrazola, K. Wei, W. Wang, P. Palacios-Avila, C. Feng, S. Sajeed, N. Lütkenhaus, and H.-K. Lo, Nature Commun. 6, 8735 (2015).
- J.-Y. Guan, F. Xu, H.-L. Yin, Y. Li, W.-J. Zhang, S.-J. Chen, X.-Y. Yang, L. Li, L.-X. You, T.-Y. Chen, et al., Phys. Rev. Lett. 116, 240502 (2016).
- A. Ambainis, Algorithmica 16, 298 (1996).
- L. Babai and P. G. Kimmel, in Computational Complexity, 1997. Proceedings., Twelfth Annual IEEE Conference on (Formerly: Structure in Complexity Theory Conference) (IEEE, 1997), pp. 239–246.
- I. Newman, Information Processing Letters 39, 67 (1991).
- I. Newman and M. Szegedy, in Proceedings of the twenty-eighth annual ACM symposium on Theory of computing (1996), pp. 561–570.
- I. Kremer, N. Nisan, and D. Ron, Computational Complexity 8, 21 (1999).
- E. Upfal and M. Mitzenmacher, Probability and computing: Randomized algorithms and probabilistic analysis (2005).
- S. Bahrani, M. Razavi, and J. A. Salehi, Journal of Lightwave Technology 33, 4687 (2015).
- Y. M. Noga Alon and M. Szegedy, Journal of Computer and System Sciences 58(1), 137 (1999).