Mohsen Razavi

The security of prepare-and-measure satellite-based quantum key distribution (QKD), under restricted eavesdropping scenarios, is addressed. We particularly consider cases where the eavesdropper, Eve, has limited access to the transmitted signal by Alice, and/or Bob’s receiver station. For instance, Eve can only receive an attenuated version of the transmitted signals. This results in settings where an uncharacterized bypass channel, inaccessible to Eve, can also carry signals to Bob. We obtain generic bounds on the key rate in the presence of bypass channels and apply them to continuous-variable QKD protocols with Gaussian encoding as well as to the family of BB84 protocols. We find regimes of operation in which the above restrictions on Eve can considerably improve system performance. Our work opens up new security frameworks for spaceborne quantum communications systems.

We propose an all-photonic protocol for distributing multipartite entangled states in quantum networks, extending the two-party quantum repeater scheme of Azuma et al. (2015) to the multipartite regime. By introducing a minimal change to the measurement pattern at user nodes, our method achieves GHZ state distribution among multiple users without the need for quantum memories.This approach maintains the core structure of the original protocol, demonstrating that scalable, memory-free entanglement distribution is achievable using only photonic resources and measurement-based operations.

Most current proposals for entanglement distribution networks assume a connection-oriented approach, where resources along a path may be reserved before the start of the session. This strategy, however, does not match the common practice in the existing infrastructure for the Internet, which relies on connectionless packet switching. In our work, we study how a hop-by-hop teleportation can be used to perform entanglement distribution across a network without any prior resource reservation. Specifically, we investigate the attainable secret key generation rate between two users employing this protocol in a repeater chain setup. We analyze this scenario for deterministic quantum repeaters with and without encoding, where we consider a three-qubit repetition code for error detection in the former case. Typical models for the operational errors in these protocols are considered. Our results suggest that the usage of quantum error detection schemes will enable trust-free secret key distribution at distances of interest.

We consider discrete phase randomisation (DPR) for several quantum key distribution (QKD) protocols. Full continuous phase randomisation of weak laser pulses (WCPs) would create an output state that is diagonal in Fock basis. This will simplify the security proof of QKD protocols that rely on WCPs or decoy states. In practice, however, such an ideal phase randomisation may not be achievable. Instead, we may actively choose a discrete number of global phase values for our WCPs. The security proof with DPR has been reported for several QKD protocols, which often requires numerical optimisation. In this work, we develop analytical bounds on the secret key generation rate for BB84 and measurement-device-independent (MDI) QKD protocols with DPR. These analytical bounds closely match the numerical results. We then extend our results to the newly proposed mode-pairing (MP) QKD protocols, which offer favourable rate-versus-distance scaling, with DPR. We show that the number of phase slices needed for MP-QKD to approach the ideal case is larger than that of MDI-QKD.

Quantum networks use platforms like quantum repeaters to enable quantum communications at arbitrary distances. Early quantum networks are expected to be deployed on pre-existing infrastructure, sharing resources with classical networks, and thus can benefit from compatible design principles and behaviours. In particular, most of the research on quantum repeater networks based on entanglement distribution assume that some connection is established in order to reserve resources for the distribution attempt. However, the most prominent classical network, the Internet, is built upon the concept of connectionless communications, and therefore this approach might not be ideal for the early stages of deployment. In our work, we investigate the performance of connectionless protocols over quantum networks. To do so, we consider both unencoded (standard) but deterministic repeaters, and repeaters using a 3-quit repetition code. We analyse the achievable secret key rates for both of these setups in different regimes of errors. Our results suggest that error correction techniques such as the usage of encoded quantum repeaters will be crucial to the success of early quantum networks.

Quantum data centres (QDCs) are a promising way of scaling up quantum computers. In a single-processor quantum computer, the number of high-quality computational qubits is limited by cross talk and difficulties in addressing individual qubits when many qubits share the same housing. QDCs circumvent these challenges by linking together multiple small quantum processing units (QPUs) over short distances. With this architecture, the intra-QPU noise is kept small, but additional noise is introduced due to the latency of and imperfections in the inter-QPU links. Understanding the trade-offs between these different types of noise is essential for guiding future efforts in QDC manufacture and compilation. We develop and use a classical simulator to emulate the execution of different quantum circuits on an imperfect QDC. An individual inter-QPU CNOT gate is first-considered and then a selection of larger circuits are investigated. In both cases, we implement inter-QPU gates using cat-comm and three variants of TP-comm, which we call 1TP-comm, 2TP-comm and TP-safe, respectively. We find that 1TP-comm and cat-comm yield different output fidelities despite both schemes having the same number of gates, measurements and inter-QPU entanglements. We also determine the relative impacts of entanglement error, intra-QPU gate error and memory depolarisation.