General theory of quantum fingerprinting network
- URL: http://arxiv.org/abs/2011.06266v1
- Date: Thu, 12 Nov 2020 09:00:15 GMT
- Title: General theory of quantum fingerprinting network
- Authors: Ji-Qian Qin, Jing-Tao Wang, Yun-Long Yu and Xiang-Bin Wang
- Abstract summary: The multi-party quantum fingerprinting is studied on whether the messages from many parties are the same.
We provide a general model of quantum fingerprinting network, defining the relationship function $fR$ and giving the corresponding decision rules.
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.
- Score: 6.768616299601037
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: 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.
Related papers
- Scalable & Noise-Robust Communication Advantage of Multipartite Quantum Entanglement [0.0]
Quantum resources offer advantages over classical methods in addressing this challenge.
We show that when the receiver and the senders share a multi-qubit Greenberger-Horne-Zeilinger (GHZ) state, certain global functions of the distributed inputs can be computed with only one bit of classical communication from each sender.
We also show that the entanglement-based protocol exhibits significant robustness under white noise.
arXiv Detail & Related papers (2024-09-20T05:17:09Z) - Guarantees on the structure of experimental quantum networks [109.08741987555818]
Quantum networks connect and supply a large number of nodes with multi-party quantum resources for secure communication, networked quantum computing and distributed sensing.
As these networks grow in size, certification tools will be required to answer questions regarding their properties.
We demonstrate a general method to guarantee that certain correlations cannot be generated in a given quantum network.
arXiv Detail & Related papers (2024-03-04T19:00:00Z) - Boosted quantum and semi-quantum communication protocols [0.0]
We show that it is possible to reduce the number of such runs by a suitable design of the key generation rule.
We illustrate this advantage by proposing quantum and semi-quantum key distribution protocols.
arXiv Detail & Related papers (2023-03-24T12:33:22Z) - Multi-User Entanglement Distribution in Quantum Networks Using Multipath
Routing [55.2480439325792]
We propose three protocols that increase the entanglement rate of multi-user applications by leveraging multipath routing.
The protocols are evaluated on quantum networks with NISQ constraints, including limited quantum memories and probabilistic entanglement generation.
arXiv Detail & Related papers (2023-03-06T18:06:00Z) - Bounds on oblivious multiparty quantum communication complexity [0.0]
We show, for a wide class of functions, how to prove strong lower bounds on their oblivious quantum $k$-party communication complexity.
In particular, we obtain an optimal $Omega(ksqrtn)$ lower bound on the oblivious quantum $k$-party communication complexity of the $n$-bit Set-Disjointness function.
arXiv Detail & Related papers (2022-10-27T13:09:51Z) - Interactive Protocols for Classically-Verifiable Quantum Advantage [46.093185827838035]
"Interactions" between a prover and a verifier can bridge the gap between verifiability and implementation.
We demonstrate the first implementation of an interactive quantum advantage protocol, using an ion trap quantum computer.
arXiv Detail & Related papers (2021-12-09T19:00:00Z) - Computation-aided classical-quantum multiple access to boost network
communication speeds [61.12008553173672]
We quantify achievable quantum communication rates of codes with computation property for a two-sender cq-MAC.
We show that it achieves the maximum possible communication rate (the single-user capacity), which cannot be achieved with conventional design.
arXiv Detail & Related papers (2021-05-30T11:19:47Z) - Fault-tolerant Coding for Quantum Communication [71.206200318454]
encode and decode circuits to reliably send messages over many uses of a noisy channel.
For every quantum channel $T$ and every $eps>0$ there exists a threshold $p(epsilon,T)$ for the gate error probability below which rates larger than $C-epsilon$ are fault-tolerantly achievable.
Our results are relevant in communication over large distances, and also on-chip, where distant parts of a quantum computer might need to communicate under higher levels of noise.
arXiv Detail & Related papers (2020-09-15T15:10:50Z) - Multi-party quantum fingerprinting with weak coherent pulses: circuit
design and protocol analysis [0.0]
We introduce a novel multi-user quantum fingerprinting protocol that is ready to be implemented with existing technology.
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.
arXiv Detail & Related papers (2020-06-01T04:28:52Z) - Efficient experimental quantum fingerprinting with wavelength division
multiplexing [1.1947990549568768]
We show that the new WDM-CQF protocol can potentially reduce the communication time significantly.
With the same experimental parameters, the amount of communication is much reduced in the new scheme compared with the original CQF protocol.
arXiv Detail & Related papers (2020-05-12T21:02:54Z) - Experimental quantum conference key agreement [55.41644538483948]
Quantum networks will provide multi-node entanglement over long distances to enable secure communication on a global scale.
Here we demonstrate quantum conference key agreement, a quantum communication protocol that exploits multi-partite entanglement.
We distribute four-photon Greenberger-Horne-Zeilinger (GHZ) states generated by high-brightness, telecom photon-pair sources across up to 50 km of fibre.
arXiv Detail & Related papers (2020-02-04T19:00:31Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.