Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1712.02895 · Physical Review A

Families of quantum fingerprinting protocols

Benjamin Lovitz, Norbert Lütkenhaus

Published Mar 28, 2018• 7 citations
arXivHTMLPDF

Abstract

We introduce several families of quantum fingerprinting protocols to evaluate the equality function on two $n$-bit strings in the simultaneous message passing model. The original quantum fingerprinting protocol uses a tensor product of a small number of $O(logn)$-qubit high-dimensional signals [H. Buhrman et al., Phys. Rev. Lett. 87, 167902 (2001)], whereas a recently proposed optical protocol uses a tensor product of $O(n)$ single-qubit signals, while maintaining the $O(logn)$ information leakage of the original protocol [J. M. Arazola and N. L\"utkenhaus, Phys. Rev. A 89, 062305 (2014)]. We find a family of protocols which interpolate between the original and optical protocols while maintaining the $O(logn)$ information leakage, thus demonstrating a tradeoff between the number of signals sent and the dimension of each signal. There has been interest in experimental realization of the recently proposed optical protocol using coherent states [F. Xu et al., Nat. Commun. 6, 8735 (2015); J.-Y. Guan et al., Phys. Rev. Lett. 116, 240502 (2016)], but as the required number of laser pulses grows linearly with the input size $n$, eventual challenges for the long-time stability of experimental setups arise. We find a coherent state protocol which reduces the number of signals by a factor $\frac{1}{2}$ while also reducing the information leakage. Our reduction makes use of a simple modulation scheme in optical phase space, and we find that more complex modulation schemes are not advantageous. Using a similar technique, we improve a recently proposed coherent state protocol for evaluating the Euclidean distance between two real unit vectors [N. Kumar et al., Phys. Rev. A 95, 032337 (2017)] by reducing the number of signals by a factor $\frac{1}{2}$ and also reducing the information leakage.

DOI
10.1103/physreva.97.032340

Related papers

Quantum fingerprinting without a shared phase reference

Michał Lipka, Marcin Jarzyna, Michał Jachura +1 more

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.

Conference on Lasers and Electro-Optics Europe & European Quantum Electronics Conference (CLEO/Europe-EQEC)•Jun 1, 2017•0 citations

Quantum fingerprinting with coherent states and a constant mean number of photons

Juan Miguel Arrazola, Norbert Lütkenhaus

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({log}_{2}n)$ 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.

arXiv:1309.5005•Physical Review A•Jun 4, 2014•62 citations

Optical Quantum Communication & Cryptography with Temporarily Trusted Parties

Ashutosh S. Marwah

The work in this thesis can be divided into three parts. The first two parts deal with optical quantum communication protocols and the third part deals with quantum cryptography. The first part of the thesis is a step towards reformulating quantum protocols in terms of coherent states. Quantum communication protocols are typically formulated in terms of abstract qudit states and operations. This leaves the question of an experimental realization open. Direct translation of these protocols, say into single photons with some d-dimensional degree of freedom, are typically challenging to realize. Multi-mode coherent states, on the other hand, can be easily generated experimentally. Reformulation of protocols in terms of these states has been a successful strategy for implementation of quantum protocols. Quantum key distribution and the quantum fingerprinting protocol have both followed this route. In Chapter 3, we characterize the Gram matrices of multi-mode coherent states in an attempt to understand the class of communication protocols, which can be implemented using these states. We also derive the closure of the Gram matrices, which can be implemented in this way, so that we also characterize those matrices, which can be approximated arbitrarily well using multi-mode coherent states. \n \nIn the second part of the thesis, Chapter 4, we describe our collaboration with an experimental group to implement the quantum fingerprinting protocol and examine the tradeoffs between the resources required to implement such protocols. It is seen that it is difficult to implement the quantum fingerprinting protocol experimentally for large input sizes. This leads us to study the tradeoff between the two resources expended during optically implemented simultaneous message passing communication protocols: the duration of the protocol and the energy required to run it. We derive general bounds on the growth of these quantities which are valid for all optical protocols. We also develop tighter bounds for the growth of these resources for protocols implementing quantum fingerprinting with coherent states. \n \nFinally in Chapter 5, we venture into quantum cryptography. We introduce a new setting for two-party cryptography with temporarily trusted third parties. In this setting, in addition to Alice and Bob, there are third parties, which Alice and Bob both trust to be honest during the course of the protocol. However, once the protocol concludes, there is no guarantee over the behaviour of these third parties. It is possible that they collaborate and act adversarially against the honest parties. We implement a variant of bit commitment in this setting, which we call erasable bit commitment. In this primitive, Alice has the choice of either opening or erasing her commitment after the commit phase. The ability to ask for an erasure allows Alice to ask the trusted nodes to erase her commitment in case the trust period is about to expire. However, this ability also makes erasable bit commitment weaker than the standard version of bit commitment. In addition to satisfying the security requirements of bit commitment, our protocol also does not reveal any information about the commitment to the third parties. Lastly, our protocol for this primitive requires a constant number of trusted third parties and can tolerate a small number of dishonest trusted nodes as well as implementation errors.

•Sep 19, 2019•1 citation

Does there exist a quantum fingerprinting protocol without coherent measurements?

Atsuya Hasegawa, Srijita Kundu, François Le Gall +2 more

Buhrman, Cleve, Watrous, and de Wolf (PRL 2001) discovered the quantum fingerprinting protocol, which is the quantum SMP protocol with $O(\log n)$ qubits communication for the equality problem. In the protocol, Alice and Bob create some quantum fingerprints of their inputs, and the referee conducts the SWAP tests for the quantum fingerprints. Since $Ω(\sqrt{n})$ bits communication is required with the classical SMP scheme for the equality problem first shown by Newman and Szegedy (STOC 1996), there exists an exponential quantum advantage in the amount of communication. In this paper, we consider a setting in which the referee can do only incoherent measurements rather than coherent measurements including the SWAP tests. We first show that, in the case of one-way LOCC measurements, $Ω(\sqrt{n})$ qubits communication is required. To prove the result, we derive a new method to replace quantum messages by classical messages and consider a reduction to the optimal lower bound in the hybrid SMP model where one message is quantum and the other is classical, which was first shown by Klauck and Podder (MFCS 2014). Our method uses the result of Oszmaniec, Guerini, Wittek, and Acín (PRL 2017), who showed that general POVM measurements can be simulated by randomized projective measurements with small ancilla qubits, and Newman's theorem. We further investigate the setting of quantum SMP protocols with two-way LOCC measurements, and derive a lower bound against some restricted two-way LOCC measurements. To prove it, we revisit the technique to replace quantum messages by classical deterministic messages introduced by Aaronson (ToC 2005) and generalized by Gavinsky, Regev, and de Wolf (CJTCS 2008), and show that, using the deterministic message, the referee can simulate the two-way LOCC measurements.

arXiv:2502.13427•Feb 19, 2025•0 citations

Experimental demonstration of quantum advantage in communication complexity for Euclidean distance problem

Verena Yacoub, Niraj Kumar, Iordanis Kerenidis +1 more

When considering the complexity of communication protocols, the aim is to perform a certain task with the minimum amount of communication resources, such as time and transmitted information. The use of quantum states may lead to an exponential advantage in the use of such resources. Here, we are interested in the task of calculating the Euclidean distance between two vectors representing real data sets. It has been previously shown that it is possible to obtain an advantage for this task based on quantum fingerprinting. This protocol is defined in the simultaneous message passing model of communication complexity, where the two parties do not communicate with each other but send data to a third party, and exploits practical fingerprints generated using trains of coherent state pulses instead of highly entangled qubit states that are hard to generate for large input sizes needed to demonstrate an exponential advantage. We perform a proof-of-principle experimental demonstration of the Euclidean distance protocol using amplitude modulation techniques for encoding non-binary data sets and high-performance superconducting nanowire single-photon detectors required to increase the accessible input size. We show a quantum advantage in transmitted information surpassing the best classical protocol for an input size of $10^8$, for diverse types of data sets, including those corresponding to real grayscale images, and with reasonable precision and error bounds. Our results highlight the potential of quantum communication complexity for use in a broad set of applications.

quant-pharXiv:2605.31516•Jun 1, 2026•0 citations

Feasibility of quantum fingerprinting using optical signals with random global phase

Konrad Banaszek, Michał Lipka, Marcin Jarzyna

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.

SPIE Quantum Information Science and Technology•Oct 8, 2018•1 citation
We introduce several families of quantum fingerprinting protocols to evaluate the equality function on two nnn-bit strings in the simultaneous message passing model. The original quantum fingerprinting protocol uses a tensor product of a small number of O(logn)O(logn)O(logn)-qubit high-dimensional signals [H. Buhrman et al., Phys. Rev. Lett. 87, 167902 (2001)], whereas a recently proposed optical protocol uses a tensor product of O(n)O(n)O(n) single-qubit signals, while maintaining the O(logn)O(logn)O(logn) information leakage of the original protocol [J. M. Arazola and N. L"utkenhaus, Phys. Rev. A 89, 062305 (2014)]. We find a family of protocols which interpolate between the original and optical protocols while maintaining the O(logn)O(logn)O(logn) information leakage, thus demonstrating a tradeoff between the number of signals sent and the dimension of each signal. There has been interest in experimental realization of the recently proposed optical protocol using coherent states [F. Xu et al., Nat. Commun. 6, 8735 (2015); J.-Y. Guan et al., Phys. Rev. Lett. 116, 240502 (2016)], but as the required number of laser pulses grows linearly with the input size nnn, eventual challenges for the long-time stability of experimental setups arise. We find a coherent state protocol which reduces the number of signals by a factor 12\frac{1}{2}21​ while also reducing the information leakage. Our reduction makes use of a simple modulation scheme in optical phase space, and we find that more complex modulation schemes are not advantageous. Using a similar technique, we improve a recently proposed coherent state protocol for evaluating the Euclidean distance between two real unit vectors [N. Kumar et al., Phys. Rev. A 95, 032337 (2017)] by reducing the number of signals by a factor 12\frac{1}{2}21​ and also reducing the information leakage.
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.
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)O({log}_{2}n)O(log2​n) 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 nnn of the input bit strings but a total mean photon number that is constant and independent of nnn. 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.
The work in this thesis can be divided into three parts. The first two parts deal with optical quantum communication protocols and the third part deals with quantum cryptography. The first part of the thesis is a step towards reformulating quantum protocols in terms of coherent states. Quantum communication protocols are typically formulated in terms of abstract qudit states and operations. This leaves the question of an experimental realization open. Direct translation of these protocols, say into single photons with some d-dimensional degree of freedom, are typically challenging to realize. Multi-mode coherent states, on the other hand, can be easily generated experimentally. Reformulation of protocols in terms of these states has been a successful strategy for implementation of quantum protocols. Quantum key distribution and the quantum fingerprinting protocol have both followed this route. In Chapter 3, we characterize the Gram matrices of multi-mode coherent states in an attempt to understand the class of communication protocols, which can be implemented using these states. We also derive the closure of the Gram matrices, which can be implemented in this way, so that we also characterize those matrices, which can be approximated arbitrarily well using multi-mode coherent states. \n \nIn the second part of the thesis, Chapter 4, we describe our collaboration with an experimental group to implement the quantum fingerprinting protocol and examine the tradeoffs between the resources required to implement such protocols. It is seen that it is difficult to implement the quantum fingerprinting protocol experimentally for large input sizes. This leads us to study the tradeoff between the two resources expended during optically implemented simultaneous message passing communication protocols: the duration of the protocol and the energy required to run it. We derive general bounds on the growth of these quantities which are valid for all optical protocols. We also develop tighter bounds for the growth of these resources for protocols implementing quantum fingerprinting with coherent states. \n \nFinally in Chapter 5, we venture into quantum cryptography. We introduce a new setting for two-party cryptography with temporarily trusted third parties. In this setting, in addition to Alice and Bob, there are third parties, which Alice and Bob both trust to be honest during the course of the protocol. However, once the protocol concludes, there is no guarantee over the behaviour of these third parties. It is possible that they collaborate and act adversarially against the honest parties. We implement a variant of bit commitment in this setting, which we call erasable bit commitment. In this primitive, Alice has the choice of either opening or erasing her commitment after the commit phase. The ability to ask for an erasure allows Alice to ask the trusted nodes to erase her commitment in case the trust period is about to expire. However, this ability also makes erasable bit commitment weaker than the standard version of bit commitment. In addition to satisfying the security requirements of bit commitment, our protocol also does not reveal any information about the commitment to the third parties. Lastly, our protocol for this primitive requires a constant number of trusted third parties and can tolerate a small number of dishonest trusted nodes as well as implementation errors.
Buhrman, Cleve, Watrous, and de Wolf (PRL 2001) discovered the quantum fingerprinting protocol, which is the quantum SMP protocol with O(log⁡n)O(\log n)O(logn) qubits communication for the equality problem. In the protocol, Alice and Bob create some quantum fingerprints of their inputs, and the referee conducts the SWAP tests for the quantum fingerprints. Since Ω(n)Ω(\sqrt{n})Ω(n​) bits communication is required with the classical SMP scheme for the equality problem first shown by Newman and Szegedy (STOC 1996), there exists an exponential quantum advantage in the amount of communication. In this paper, we consider a setting in which the referee can do only incoherent measurements rather than coherent measurements including the SWAP tests. We first show that, in the case of one-way LOCC measurements, Ω(n)Ω(\sqrt{n})Ω(n​) qubits communication is required. To prove the result, we derive a new method to replace quantum messages by classical messages and consider a reduction to the optimal lower bound in the hybrid SMP model where one message is quantum and the other is classical, which was first shown by Klauck and Podder (MFCS 2014). Our method uses the result of Oszmaniec, Guerini, Wittek, and Acín (PRL 2017), who showed that general POVM measurements can be simulated by randomized projective measurements with small ancilla qubits, and Newman's theorem. We further investigate the setting of quantum SMP protocols with two-way LOCC measurements, and derive a lower bound against some restricted two-way LOCC measurements. To prove it, we revisit the technique to replace quantum messages by classical deterministic messages introduced by Aaronson (ToC 2005) and generalized by Gavinsky, Regev, and de Wolf (CJTCS 2008), and show that, using the deterministic message, the referee can simulate the two-way LOCC measurements.
When considering the complexity of communication protocols, the aim is to perform a certain task with the minimum amount of communication resources, such as time and transmitted information. The use of quantum states may lead to an exponential advantage in the use of such resources. Here, we are interested in the task of calculating the Euclidean distance between two vectors representing real data sets. It has been previously shown that it is possible to obtain an advantage for this task based on quantum fingerprinting. This protocol is defined in the simultaneous message passing model of communication complexity, where the two parties do not communicate with each other but send data to a third party, and exploits practical fingerprints generated using trains of coherent state pulses instead of highly entangled qubit states that are hard to generate for large input sizes needed to demonstrate an exponential advantage. We perform a proof-of-principle experimental demonstration of the Euclidean distance protocol using amplitude modulation techniques for encoding non-binary data sets and high-performance superconducting nanowire single-photon detectors required to increase the accessible input size. We show a quantum advantage in transmitted information surpassing the best classical protocol for an input size of 10810^8108, for diverse types of data sets, including those corresponding to real grayscale images, and with reasonable precision and error bounds. Our results highlight the potential of quantum communication complexity for use in a broad set of applications.
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.