Quantum fingerprinting allows two remote parties to determine whether their datasets are identical or different by sending exponentially less information compared to the classical protocol with equivalent performance. Optical implementations of the quantum protocol based on weak coherent states have been proposed and realized. However, in these realizations phase stability between the sending parties is required. Here we analyze the practical feasibility of the recently introduced quantum fingerprinting protocol based on higher-order interference, which does not require a phase lock between transmitters. We show that an experimental demonstration of a quantum fingerprinting protocol beating the known bound on the performance of classical schemes should be possible using currently available technology.
Quantum fingerprinting allows two remote parties to determine whether their datasets are identical or different by sending exponentially less information compared to the classical protocol with equivalent performance. Optical implementations of the quantum protocol based on weak coherent states have been proposed and realized. However, in these realizations phase stability between the sending parties is required. Here we analyze the practical feasibility of the recently introduced quantum fingerprinting protocol based on higher-order interference, which does not require a phase lock between transmitters. We show that an experimental demonstration of a quantum fingerprinting protocol beating the known bound on the performance of classical schemes should be possible using currently available technology.
We present a quantum fingerprinting protocol relying on two-photon interference which does not require a shared phase reference between the parties preparing optical signals carrying data fingerprints. We show that the scaling of the protocol, in terms of transmittable classical information, is analogous to the recently proposed and demonstrated scheme based on coherent pulses and first-order interference, offering comparable advantage over classical fingerprinting protocols without access to shared prior randomness. We analyze the protocol taking into account non-Poissonian photon statistics of optical signals and a variety of imperfections, such as transmission losses, dark counts, and residual distinguishability. The impact of these effects on the protocol performance is quantified with the help of Chernoff information.
One of the standard communication complexity problems is deciding whether bit strings held by two separate parties Alice (A) and Bob (B) are equal or different. In the simultaneous message passing model, A and B send certain information to a Referee, who makes the decision. The overall goal is to minimize the amount of communication involved while not exceeding desired error probability. This is achieved by sending only fingerprints of the original n-bit strings. In the best classical protocols, these scale as O(√n) if A and B have no access to shared randomness [1]. The recently proposed [2] and demonstrated quantum fingerprinting [3], exploiting phase-modulated weak coherent pulses, provides O(log2n) scaling in the number of used qubits, but needs phase stability between A and B. Here we introduce and analyse a quantum fingerprinting protocol based on two-photon interference which does require a shared phase reference and works in scenarios when the global phase of transmitted signals becomes completely random. Interestingly, the performance of this protocol, quantified in terms of the Chernoff information [4], is enhanced through the use of non-classical single-photon states, even in the regime of high transmission loss.
Quantum communication holds the promise of creating disruptive technologies that will play an essential role in future communication networks. For example, the study of quantum communication complexity has shown that quantum communication allows exponential reductions in the information that must be transmitted to solve distributed computational tasks. Recently, protocols that realize this advantage using optical implementations have been proposed. Here we report a proof-of-concept experimental demonstration of a quantum fingerprinting system that is capable of transmitting less information than the best-known classical protocol. Our implementation is based on a modified version of a commercial quantum key distribution system using off-the-shelf optical components over telecom wavelengths, and is practical for messages as large as 100 Mbits, even in the presence of experimental imperfections. Our results provide a first step in the development of experimental quantum communication complexity.
Quantum fingerprinting (QF) promises exponential reduction of information transmission in executing communication complexity tasks. Practicality and quantum advantage of this novel protocol has been recently demonstrated using weak coherent pulses to carry the fingerprinting information. However, all coherent QF implementations rely upon a direct optical link to maintain coherence between the users, which does not comply with the protocol's rule that the users must not have any access to a shared randomness. To close this loophole, we propose, and experimentally demonstrate, a novel protocol based on asynchronous coincidence pairing from the interference result between coherent optical fields that are remotely and independently prepared. Over a length of 20 km telecom fiber, our QF setup has outperformed the best-known classical algorithm, for the first time without being susceptible to shared randomness. Our result paves the way toward practical applications of QF in communication complexity.
We present a protocol for quantum fingerprinting that is ready to be implemented with current technology and is robust to experimental errors. The basis of our scheme is an implementation of the signal states in terms of a coherent state in a superposition of time-bin modes. Experimentally, this requires only the ability to prepare coherent states of low amplitude and to interfere them in a balanced beam splitter. The states used in the protocol are arbitrarily close in trace distance to states of O(log2n) qubits, thus exhibiting an exponential separation in abstract communication complexity compared to the classical case. The protocol uses a number of optical modes that is proportional to the size n of the input bit strings but a total mean photon number that is constant and independent of n. Given the expended resources, our protocol achieves a task that is provably impossible using classical communication only. In fact, even in the presence of realistic experimental errors and loss, we show that there exist a large range of input sizes for which our quantum protocol transmits an amount of information that can be more than two orders of magnitude smaller than a classical fingerprinting protocol.
Abstract Quantum communication has been leading the way of many remarkable theoretical results and experimental tests in physics. In this context, quantum communication complexity (QCC) has recently drawn earnest research attention as a tool to optimize the amounts of transmitted qubits and energy that are required to implement distributed computational tasks. On this matter, we introduce a novel multi-user quantum fingerprinting (QF) protocol that is ready to be implemented with existing technology. Particularly, we extend to the multi-user framework a well-known two-user coherent-state fingerprinting scheme. This generalization is highly non-trivial for a twofold reason, as it requires not only to extend the set of protocol rules but also to specify a procedure for designing the optical devices intended for the generalized protocol. Much of the importance of our work arises from the fact that the obtained QCC figures of merit allow direct comparison with the best-known classical multi-user fingerprinting protocol, of significance in the field of computer technologies and networking. Furthermore, as one of the main contributions of the manuscript, we deduce innovative analytical upper bounds on the amount of transmitted quantum information that are even valid in the two-user protocol as a particular case. These original analytical bounds are of interest for estimating the realistic protocol performance prior to experimental realizations. Ultimately, comparative results are provided to contrast different protocol implementation strategies and, importantly, to show that, under realistic circumstances, the multi-user protocol can achieve tasks that are impossible by using classical communication alone. Our work provides relevant contributions towards understanding the nature and the limitations of QF and, on a broader scope, also the limitations and possibilities of quantum-communication networks embracing a node that is accessed by multiple users at the same time.