The purpose of fingerprinting is to compare long messages with low communication complexity. Compared with its classical version, the quantum fingerprinting can realize exponential reduction in communication complexity. Recently, the multi-party quantum fingerprinting is studied on whether the messages from many parties are the same. However, sometimes it is not enough just to know whether these messages are the same, we usually need to know the relationship among them. We provide a general model of quantum fingerprinting network, defining the relationship function $f^R$ and giving the corresponding decision rules. In this work, we take the four-party quantum fingerprinting protocol as an example for detailed analysis. We also choose the optimal parameters to minimize communication complexity in the case of asymmetric channels. Furthermore, we compare the multi-party quantum fingerprinting with the protocol based on the two-party quantum fingerprinting and find that the multi-party protocol has obvious advantages, especially in terms of communication time. Finally, the method of encoding more than one bit on each coherent state is used to further improve the performance of the protocol.
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 …
It is known that for some languages quantum finite automata are more efficient than classical counterparts. Particularly, a QFA recognizing the language $MOD_p$ has an exponential advantage over the classical finite automata. However, the construction of such QFA is probabilistic. In the current work, we propose a deterministic construction of the QFA for the language $MOD_p$. We construct a QFA for a promise problem $Palindrome_s$ and implement this QFA on the IBMQ simulator using qiskit library tools.
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 th…
Quantum communication has historically been at the forefront of advancements, from fundamental tests of quantum physics to utilizing the quantum-mechanical properties of physical systems for practical applications. In the field of communication complexity, quantum communication allows the advantage of an exponential reduction in the information transmitted over classical communication to accomplish distributed computational tasks. However, to date, demonstrating this advantage in a practical setting continues to be a central challenge. Here, we report an experimental demonstration of a quantum…
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 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 sche…
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 $\mathcal{O}(\log_2 n)$ qubits, thus exhibiting an exponential separation in communication compl…
Quantum fingerprinting reduces communication complexity of determination whether two $n$-bit long inputs are equal or different in the simultaneous message passing model. Here we quantify the advantage of quantum fingerprinting over classical protocols when communication is carried out using optical signals with limited power and unrestricted bandwidth propagating over additive white Gaussian noise (AWGN) channels with power spectral density (PSD) much less than one photon per unit time and unit bandwidth. We identify a noise parameter whose order of magnitude separates near-noiseless quantum …
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 $\mathcal{O}(\log n)$-qubit high dimensional signals [Buhrman et al. 2001], whereas a recently-proposed optical protocol uses a tensor product of $\mathcal{O}(n)$ single-qubit signals, while maintaining the $\mathcal{O}(\log n)$ information leakage of the original protocol [Arrazola and Lütkenhaus 2014]. We find a family of protocols which inte…
Quantum communication complexity studies the efficiency of information communication (that is, the minimum amount of communication required to achieve a certain task) using quantum states. One representative example is quantum fingerprinting, in which the simultaneous message passing model is considered and the minimum amount of communication could be exponentially smaller than the classical fingerprinting protocol. Experimental demonstrations based on a practical quantum fingerprinting protocol where coherent states are used to construct the fingerprints, have successfully shown the superiori…
Cloud-based quantum computers have become a reality with a number of companies allowing for cloud-based access to their machines with tens to more than 100 qubits. With easy access to quantum computers, quantum information processing will potentially revolutionize computation, and superconducting transmon-based quantum computers are among some of the more promising devices available. Cloud service providers today host a variety of these and other prototype quantum computers with highly diverse device properties, sizes, and performances. The variation that exists in today's quantum computers, e…
Although RF fingerprinting is one of the most commonly used techniques for localization, deploying it in a ubiquitous manner requires addressing the challenge of supporting a large number of heterogeneous devices and their variations. We present QHFP, a device-independent quantum fingerprint matching algorithm that addresses two of the issues for realizing worldwide ubiquitous large-scale location tracking systems: storage space and running time as well as devices heterogeneity. In particular, we present a quantum algorithm with a complexity that is exponentially better than the classical tech…
We introduce a new type of cryptographic primitive that we call hiding fingerprinting. A (quantum) fingerprinting scheme translates a binary string of length $n$ to $d$ (qu)bits, typically $d\ll n$, such that given any string $y$ and a fingerprint of $x$, one can decide with high accuracy whether $x=y$. Classical fingerprinting schemes cannot hide information very well: a classical fingerprint of $x$ that guarantees error at most $ε$ necessarily reveals $Ω(\log(1/ epsilon))$ bits about $x$. We call a scheme hiding if it reveals $o(\log(1/ε))$ bits; accordingly, no classical scheme is hiding. F…
Current density distributions in active integrated circuits (ICs) result in patterns of magnetic fields that contain structural and functional information about the IC. Magnetic fields pass through standard materials used by the semiconductor industry and provide a powerful means to fingerprint IC activity for security and failure analysis applications. Here, we demonstrate high spatial resolution, wide field-of-view, vector magnetic field imaging of static (DC) magnetic field emanations from an IC in different active states using a Quantum Diamond Microscope (QDM). The QDM employs a dense lay…
