Quantum network protocols offer new functionalities such as enhanced security to communication and computational systems. Despite the rapid progress in quantum hardware, it has not yet reached a level of maturity that enables execution of many quantum protocols in practical settings. To develop quantum protocols in real world, it is necessary to examine their performance considering the imperfections in their practical implementation using simulation platforms. In this paper, we consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. The protocols are chosen from both areas of quantum communication and quantum computation as follows: quantum money, W-state based anonymous transmission, verifiable blind quantum computation, and quantum digital signature. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols, considering different figures of merit. We find that to enable quantum money protocol, the decoherence time constant of the quantum memory must be at least three times the storage time of qubits. Furthermore, our simulation results for the w-state based anonymous transmission protocol show that to achieve an average fidelity above 0.8 in this protocol, the storage time of sender's and receiver's particles in the quantum memory must be less than half of the decoherence time constant of the quantum memory. We have also investigated the effect of gate imperfections on the performance of verifiable blind quantum computation. We find that with our chosen parameters, if the depolarizing probability of quantum gates is equal to or greater than 0.05, the security of the protocol cannot be guaranteed. Lastly, our simulation results for quantum digital signature protocol show that channel loss has a significant effect on the probability of repudiation.
Quantum network protocols offer new functionalities such as enhanced security to communication and computational systems. Despite the rapid progress in quantum hardware, it has not yet reached a level of maturity that enables execution of many quantum protocols in practical settings. To develop quantum protocols in real world, it is necessary to examine their performance considering the imperfections in their practical implementation using simulation platforms. In this paper, we consider several quantum protocols that enable promising functionalities and services in near-future quantum networks. The protocols are chosen from both areas of quantum communication and quantum computation as follows: quantum money, W-state based anonymous transmission, verifiable blind quantum computation, and quantum digital signature. We use NetSquid simulation platform to evaluate the effect of various sources of noise on the performance of these protocols, considering different figures of merit. We find that to enable quantum money protocol, the decoherence time constant of the quantum memory must be at least three times the storage time of qubits. Furthermore, our simulation results for the w-state based anonymous transmission protocol show that to achieve an average fidelity above 0.8 in this protocol, the storage time of sender's and receiver's particles in the quantum memory must be less than half of the decoherence time constant of the quantum memory. We have also investigated the effect of gate imperfections on the performance of verifiable blind quantum computation. We find that with our chosen parameters, if the depolarizing probability of quantum gates is equal to or greater than 0.05, the security of the protocol cannot be guaranteed. Lastly, our simulation results for quantum digital signature protocol show that channel loss has a significant effect on the probability of repudiation.
of any of the information contained in it must acknowledge this thesis as the source of the quotation or information. The development of quantum protocols from conception to experimental realizations is one of the main sources of the stimulating exchange between fundamental and experimental research characteristic to quantum information processing. In this thesis we contribute to the development of two recent quantum protocols, Universal Blind Quantum Computation (UBQC) and Quantum Digital Signatures (QDS). UBQC allows a client to delegate a quantum computation to a more powerful quantum server while keeping the input and computation private. We analyse the re-silience of the privacy of UBQC under imperfections. Then, we introduce approximate blindness quantifying any compromise to privacy, and propose a protocol which enables arbitrary levels of security despite imperfections. Subsequently, we investigate the adaptability of UBQC to alter-native implementations with practical advantages. QDS allow a party to send a message to other parties which cannot be forged, modified or repudiated. We analyse the security properties of a first proof-of-principle experiment of QDS, implemented in an optical system. We estimate the
The phenomenal progress in quantum technologies over the past decades has laid the groundwork for the construction of quantum networks, which will channel the power of quantum theory to guarantee secure and efficient communication, computation, and much more. This thesis studies the notion of trust in quantum networks. In our information age, protecting the security or anonymity of data is a key requirement. We investigate certain protocols that are fundamental to the operation and applications of quantum networks, and propose ways to test and analyse their security, in spite of adversarial intervention. Our focus is on practical methods of verifying the untrusted components, which could be incorporated into realistic networks in the near future. To begin, we propose a protocol for authenticated communication of quantum messages, by verifying the entanglement required for quantum teleportation in an experimentally feasible way. We model the performance of our scheme in the presence of noise. Furthermore, we explore such an authenticated teleportation in the one-sided device-independent scenario, where some devices used for verification may be corrupted. We derive error-tolerant self- testing bounds and extend our results to a realistic experimental setting, demonstrating the compatibility of our protocol with state-of-the-art technology. We then study anonymity, an essential feature for communication across networks. Combining the power of classical and quantum subroutines, we build a practical protocol for anonymous communication of quantum messages, without the need to trust the players in our network, their computational power, or the entanglement they share. We end by considering the verification of graph states distributed across a network of possibly dishonest players, applying our scheme to specific graph states that are central to quantum communication and computation schemes.
The second quantum revolution brings with it the promise of a quantum internet. As the first quantum network hardware prototypes near completion new challenges emerge. A functional network is more than just the physical hardware, yet work on scalable quantum network systems is in its infancy. In this paper we present a quantum network protocol designed to enable end-to-end quantum communication in the face of the new fundamental and technical challenges brought by quantum mechanics. We develop a quantum data plane protocol that enables end-to-end quantum communication and can serve as a building block for more complex services. One of the key challenges in near-term quantum technology is decoherence --- the gradual decay of quantum information --- which imposes extremely stringent limits on storage times. Our protocol is designed to be efficient in the face of short quantum memory lifetimes. We demonstrate this using a simulator for quantum networks and show that the protocol is able to deliver its service even in the face of significant losses due to decoherence. Finally, we conclude by showing that the protocol remains functional on the extremely resource limited hardware that is being developed today underlining the timeliness of this work.
Quantum digital signatures (QDS) offer information-theoretic security for message integrity, authenticity, and non-repudiation, and constitute a fundamental cryptographic primitive for future quantum networks. Despite significant progress, the practical deployment of QDS has been severely constrained by limited signature rates and poor tolerance to channel loss, particularly in long-distance and metropolitan-scale networks. Here, we report a high-rate, loss-resilient QDS system that overcomes these two key bottlenecks simultaneously. Our implementation combines intrinsically phase-stable polarization modulation based on a Sagnac interferometer with gigahertz-rate quantum state encoding and low-timing-jitter superconducting nanowire single-photon detectors, enabling robust and continuous operation at high repetition frequencies. By integrating this hardware platform with a one-time universal hashing-based QDS protocol, we achieve a signature rate improvement of more than two orders of magnitude compared with existing QDS implementations under comparable channel-loss conditions. Notably, the system maintains a non-zero effective signature rate of approximately 1.25 times per second at a total channel loss of up to 49.05 dB, representing the highest loss tolerance reported for QDS to date. These results establish a practical and scalable technological pathway for deploying QDS in real-world quantum communication networks.
Quantum technologies, for example, quantum communication and quantum computation, promise spectacular quantum enhanced advantages beyond what can be done classically. However, quantum states, as the element of quantum technologies, are very fragile and easily get lost to the environment, and meanwhile, their generation and quantum operations are mostly probabilistic. These problems make it exponentially hard to build long-distance quantum channels for quantum communication and large quantum systems for quantum computing. Quantum memory allows quantum states to be stored and retrieved in a programmable fashion, therefore providing an elegant solution to the probabilistic nature and associated limitation by coordinating asynchronous events. In the past decades, enormous advances in quantum memory have been made by developing various storage protocols and their physical implementations, and the quantum memory has gradually evolved from the initial conceptual demonstration to a nearly practical one. Aiming at being practicable for efficient synchronisation and physical scalability, an ideal quantum memory should meet several key features known as high efficiency, low noise level, large time bandwidth product (lifetime divided by pulse duration) and operating at room temperature. Here, we present the research status and development trends of this field by introducing some typical storage protocols. Among these protocols, a room-temperature broadband quantum memory is the most attractive due to its simplicity and practicability. However, at room temperature, noise becomes dominant and is a bottleneck problem that has impeded the realization of a real room-temperature broadband quantum memory in the last decades. Recently, the noise problem has been solved in two memory protocols, i.e. FORD (far off-resonance Duan-Lukin-Cirac-Zoller) protocol and ORCA (off-resonant cascaded absorption) protocol. In this paper, the working principles, the merits and demerits of various quantum memory protocols are illustrated. Furthermore, the approaches to eliminating noise and the applications of quantum memory are summarized.
Benchmarking quantum computers often deals with the parameters of single qubits or gates and sometimes deals with algorithms run on an entire chip or a noisy simulator of a chip. Here we propose the idea of using protocols to benchmark quantum computers. The advantage of using protocols, especially the seven suggested here, over other benchmarking methods is that there is a clear cutoff (i.e., a threshold) distinguishing quantumness from classicality for each of our protocols. The protocols we suggest enable a comparison among various circuit-based quantum computers, and also between real chips and their noisy simulators. This latter method may then be used to better understand the various types of noise of the real chips. We use some of these protocols to answer an important question: ``How many effective qubits are there in this N-qubit quantum computer/simulator?'', and we then conclude which effective sub-chips can be named ``truly-quantum''.