Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userAnonymous communication protocol over quantum networks
60
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
We propose a W state-based protocol for anonymously transmitting quantum messages in a quantum network. Different from the existing protocols [A. Unnikrishnan, et al., Phys. Rev. Lett. 122, 240501 (2019)], the proposed protocol can be effectively implemented in the network only equipped with quantum channels and regular broadcast channels. Throughout the design procedure, we develop three sub-protocols using the W state, including the quantum collision detection protocol and the quantum notification protocol. Moreover, together with the conventional anonymous entanglement protocol, the whole anonymous communication protocol has been constructed. Finally, we examine the correctness and security of the proposed quantum anonymous communication protocol.
rate research
Read More
We show that for all $nge3$, an example of an $n$-partite quantum correlation that is not genuinely multipartite nonlocal but rather exhibiting anonymous nonlocality, that is, nonlocal but biseparable with respect to all bipartitions, can be obtained by locally measuring the $n$-partite Greenberger-Horne-Zeilinger (GHZ) state. This anonymity is a manifestation of the impossibility to attribute unambiguously the underlying multipartite nonlocality to any definite subset(s) of the parties, even though the correlation can indeed be produced by nonlocal collaboration involving only such subsets. An explicit biseparable decomposition of these correlations is provided for any partitioning of the $n$ parties into two groups. Two possible applications of these anonymous GHZ correlations in the device-independent setting are discussed: multipartite secret sharing between any two groups of parties and bipartite quantum key distribution that is robust against nearly arbitrary leakage of information.
A lot of attention has been paid to a quantum-sensing network for detecting magnetic fields in different positions. Recently, cryptographic quantum metrology was investigated where the information of the magnetic fields is transmitted in a secure way. However, sometimes, the positions where non-zero magnetic fields are generated could carry important information. Here, we propose an anonymous quantum sensor where an information of positions having non-zero magnetic fields is hidden after measuring magnetic fields with a quantum-sensing network. Suppose that agents are located in different positions and they have quantum sensors. After the quantum sensors are entangled, the agents implement quantum sensing that provides a phase information if non-zero magnetic fields exist, and POVM measurement is performed on quantum sensors. Importantly, even if the outcomes of the POVM measurement is stolen by an eavesdropper, information of the positions with non-zero magnetic fields is still unknown for the eavesdropper in our protocol. In addition, we evaluate the sensitivity of our proposed quantum sensors by using Fisher information when there are at most two positions having non-zero magnetic fields. We show that the sensitivity is finite unless these two (non-zero) magnetic fields have exactly the same amplitude. Our results pave the way for new applications of quantum-sensing network.
Establishing end-to-end quantum connections requires quantified link characteristics, and operations need to coordinate decision-making between nodes across a network. We introduce the RuleSet-based communication protocol for supporting quantum operations over distant nodes to minimize classical packet transmissions for guaranteeing synchronicity. RuleSets are distributed to nodes along a path at connection set up time, and hold lists of operations that need to be performed in real time. We simulate the RuleSet-based quantum link bootstrapping protocol, which consists of recurrent purifications and link-level tomography, to quantify the quantum link fidelity and its throughput. Our Markov-Chain Monte-Carlo simulation includes various error sources, such as the memory error, gate error and channel error, modeled on currently available hardware. We found that when two quantum nodes, each with 100 memory qubits capable of emitting photons ideally to the optical fiber, are physically connected with a 10km MeetInTheMiddle link, the Recurrent Single selection - Single error purification (RSs-Sp) protocol is capable of bringing up the fidelity from an average input $F_{r}=0.675$ to around $F_{r}=0.865$ with a generation rate of 1106 Bell pairs per second, as determined by simulated tomography. The system gets noisier with longer channels, in which case errors may develop faster than the purification gain. In such a situation, a stronger purification method, such as the double selection-based purification, shows an advantage for improving the fidelity. The knowledge acquired from bootstrapping can later be distributed to nodes within the same network, and used for other purposes such as route selection.
In reply to Vaidmans Comment [arXiv:1304.6689], we show that his claim that our Protocol for Direct Counterfactual Quantum Communication [PRL 110, 170502 (2013), arXiv:1206.2042] is counterfactual only for one type of information bit is wrong.
Full quantum capability devices can provide secure communications, but they are challenging to make portable given the current technology. Besides, classical portable devices are unable to construct communication channels resistant to quantum computers. Hence, communication security on portable devices cannot be guaranteed. Semi-Quantum Communication (SQC) attempts to break the quandary by lowering the receivers required quantum capability so that secure communications can be implemented on a portable device. However, all SQC protocols have low qubit efficiency and complex hardware implementations. The protocols involving quantum entanglement require linear Entanglement Preservation Time (EPT) and linear quregister size. In this paper, we propose two new keyless SQC protocols that address the aforementioned weaknesses. They are named Economic Keyless Semi-Quantum Point-to-point Communication (EKSQPC) and Rate Estimation EKSQPC (REKSQPC). They achieve theoretically constant minimal EPT and quregister size, regardless of message length. We show that the new protocols, with low overhead, can detect Measure and Replay Attacks (MRAs). REKSQDC is tolerant to transmission impairments and environmental perturbations. The protocols are based on a new quantum message transmission operation termed Tele-Fetch. Like QKD, their strength depends on physical principles rather than mathematical complexity.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
