The field of device-independent (DI) quantum information processing concerns itself with devising and analysing protocols, such as quantum key distribution, without referring to the quality of the physical devices utilised to execute the protocols. Instead, the analysis is based on the observed correlations that arise during a repeated interaction with the devices and, in particular, their ability to violate the so called Bell inequalities.
Since the analysis of DI protocols holds irrespectively of the underlying physical device, it implies that any device can be used to execute the protocols: If the apparatus is of poor quality, the users of the protocol will detect it and abort; otherwise, they will accomplish their goal. This strong statement comes at a price-- the analysis of DI protocols is, a priori, extremely challenging.
The thesis presents an approach that can be taken to simplify the analysis of DI information processing protocols. The idea is the following: Instead of analysing the most general device leading to the observed correlations, one should first analyse a significantly simpler device that, in each interaction with the user, behaves in an identical way, independently of all other interactions. We call such a device an independently and identically distributed (IID) device. As the next step, special techniques are used to prove that, without loss of generality, the analysis of the IID device implies similar results for the most general device. These are termed reductions to IID.
We present two mathematical techniques that can be used as reductions to IID in the DI setting, each accompanied by a showcase-application that exemplifies the reduction's usage and benefits. Performing the analysis via a reduction to IID leads to simpler proofs and significant quantitive improvements, matching the tight results proven when analysing IID devices.
The field of device-independent (DI) quantum information processing concerns itself with devising and analysing protocols, such as quantum key distribution, without referring to the quality of the physical devices utilised to execute the protocols. Instead, the analysis is based on the observed correlations that arise during a repeated interaction with the devices and, in particular, their ability to violate the so called Bell inequalities.
Since the analysis of DI protocols holds irrespectively of the underlying physical device, it implies that any device can be used to execute the protocols: If the apparatus is of poor quality, the users of the protocol will detect it and abort; otherwise, they will accomplish their goal. This strong statement comes at a price-- the analysis of DI protocols is, a priori, extremely challenging.
The thesis presents an approach that can be taken to simplify the analysis of DI information processing protocols. The idea is the following: Instead of analysing the most general device leading to the observed correlations, one should first analyse a significantly simpler device that, in each interaction with the user, behaves in an identical way, independently of all other interactions. We call such a device an independently and identically distributed (IID) device. As the next step, special techniques are used to prove that, without loss of generality, the analysis of the IID device implies similar results for the most general device. These are termed reductions to IID.
We present two mathematical techniques that can be used as reductions to IID in the DI setting, each accompanied by a showcase-application that exemplifies the reduction's usage and benefits. Performing the analysis via a reduction to IID leads to simpler proofs and significant quantitive improvements, matching the tight results proven when analysing IID devices.
Quantum entanglement is a unique property of quantum particles. It can correlate them in such a way, that further correlations to an additional unwanted party is prevented. This renders quantum theory as the prime candidate to implement a secure distribution of an encryption key. Quantum key distribution (QKD) is dedicated to this task. A striking feature of correlations in a statistical experiment is, that they can, in principle, always be approximated. Even more so, correlations can be obtained without a detailed knowledge about the underlying physical process that generated the experimental data. This no-characterization approach is at the heart of the device-independent (DI) paradigm. Here, Bell inequalities are an imperative tool to detect nonlocal correlations, which are necessary for a DI secret key. One central subject of this thesis is multipartite DIQKD and the implications of Bell nonlocality in this context. Any DIQKD protocol involves test rounds in which the violation of a Bell inequality is checked. For multipartite DIQKD, however, not all Bell inequalities are suitable. We identify the crucial properties a Bell test requires to be a viable option. In this light, a published protocol for multipartite DIQKD is examined. We establish an incompatibility which is inherent to the proposed Bell test in combination with the required quantum states. This leads us to the conclusion, that the proposed protocol necessarily aborts. In a subsequent work, we develop a family of multipartite Bell inequalities, specifically tailored to the task of DI conference key agreement (CKA). Several features of this Bell inequality are analytically characterized. In addition, we prove its usefulness for the purposes of DICKA. To this end, semidefinite programming techniques are employed and extended to the multipartite scenario which allows us to quantify asymptotic DI conference key rates. In a second part, we explore the challenges of implementing (bipartite) long-distance DIQKD with quantum repeaters. For two repeater protocols, we describe how experimental parameters manifest themselves in DI secret-key rates. In doing so, we shed light on the fundamental differences between the usual and the DI scenario and we benchmark the threshold requirements of quantum devices to make profitable DI secret-key rates feasible. Finally, we develop a general method to describe in a non-DI setting the propagation of an important class of errors through quantum circuits in arbitrary dimensions. With this, we discuss the potential of error-corrected quantum repeaters to overcome fundamental point-to-point limitations.
Device-independent security is the gold standard for quantum cryptography: not only is security based entirely on the laws of quantum mechanics, but it holds irrespective of any a priori assumptions on the quantum devices used in a protocol, making it particularly applicable in a quantum-wary environment. While the existence of device-independent protocols for tasks such as randomness expansion and quantum key distribution has recently been established, the underlying proofs of security remain very challenging, yield rather poor key rates, and demand very high quality quantum devices, thus making them all but impossible to implement in practice. We introduce a technique for the analysis of device-independent cryptographic protocols. We provide a flexible protocol and give a security proof that provides quantitative bounds that are asymptotically tight, even in the presence of general quantum adversaries. At a high level our approach amounts to establishing a reduction to the scenario in which the untrusted device operates in an identical and independent way in each round of the protocol. This is achieved by leveraging the sequential nature of the protocol and makes use of a newly developed tool, the “entropy accumulation theorem” of Dupuis, Fawzi, and Renner [ Entropy Accumulation, preprint, 2016]. As concrete applications we give simple and modular security proofs for device-independent quantum key distribution and randomness expansion protocols based on the CHSH inequality. For both tasks, we establish essentially optimal asymptotic key rates and noise tolerance. In view of recent experimental progress, which has culminated in loophole-free Bell tests, it is likely that these protocols can be practically implemented in the near future.
Device-independent (DI) quantum cryptography provides secure cryptography with minimal trust in, or characterisation of, the used quantum devices. An essential component of DI protocols is the use of randomness extractors for privacy amplification, but these typically require an initial seed of randomness that introduces a potential vulnerability. To solve this problem, the security of seedless extractors was proven in Quantum 9, 1654 (2025). The core idea was to use the Bell violation of the raw data, rather than its min-entropy, as the extractor promise. However, the large fluctuations in the Bell inequality used required many rounds to precisely estimate the Bell violation, consuming substantial randomness and making the protocol very inefficient. In this work, we present a new proof technique based on a truncation method that allows the user to estimate the protocol parameters with an asymptotically vanishing fraction of rounds and, as a consequence, achieves the optimal rate of one key bit per singlet. Notably, we prove this result using seedless extractors that can be implemented efficiently.
Authentication of quantum sources is a crucial task in building reliable and efficient protocols for quantum-information processing.Steady progress vis-à-vis verification of quantum devices in the scenario with fully characterized measurement devices has been observed in recent years.When it comes to the scenario with uncharacterized measurements, the so-called black-box scenario, practical verification methods are still rather scarce.Development of self-testing methods is an important step forward, but these results so far have been used for reliable verification only by considering the asymptotic behavior of large, identically and independently distributed (IID) samples of a quantum resource.Such strong assumptions deprive the verification procedure of its truly device-independent character.In this paper, we develop a systematic approach to device-independent verification of quantum states free of IID assumptions in the finite copy regime.Remarkably, we show that device-independent verification can be performed with optimal sample efficiency.Finally, for the case of independent copies, we develop a device-independent protocol for quantum state certification: a protocol in which a fragment of the resource copies is measured to warrant the rest of the copies to be close to some target state.
This thesis is concerned with rigorous security analyses of practical Quantum Key Distribution (QKD) protocols, using a variety of modern proof techniques. The main results are as follows. First, we establish a security proof for variable-length QKD protocols against IID collective attacks, and extend this result to coherent attacks using the postselection technique. In doing so, we resolve a long-standing flaw in the application of the postselection technique to QKD, thereby placing it on a rigorous mathematical footing. Second, we develop a method to bound phase error rates in entropic uncertainty relation-based and phase error rate-based proofs, using only the observed statistics of the protocol, even when detectors are imperfect and only approximately characterized. This removes a key assumption of identical detector behaviour and enables these techniques to be applied in realistic settings. Third, we present a very general security analysis based on the marginal-constrained entropy accumulation theorem. The resulting framework can be readily adapted to practical imperfections and side channels, and is suitable for certification efforts. Finally, we show that the security of QKD protocols under realistic authentication assumptions can be reduced to the standard idealized setting, where authentication is assumed to behave honestly, with only minor protocol modifications. A distinctive feature of this thesis is its unified presentation of several major QKD security proof frameworks using consistent protocol descriptions and notation. Consequently, this thesis is intended not only as a collection of new technical results, but also as a useful reference for understanding rigorous security analysis in quantum key distribution.
A prominent application of quantum cryptography is the distribution of cryptographic keys that are provably secure. Such security proofs were extended by Vazirani and Vidick (Physical Review Letters, 113, 140501, 2014) to the deviceindependent (DI) scenario, where the users do not need to trust the integrity of the underlying quantum devices. The protocols analyzed by them and by subsequent authors all require a sequential execution of N multiplayer games, where N is the security parameter. In this work, we prove the security of a protocol where all games are executed in parallel. Besides decreasing the number of time-steps necessary for key generation, this result reduces the security requirements for DI-QKD by allowing arbitrary information leakage of each user's inputs within his or her lab. To the best of our knowledge, this is the first parallel security proof for a fully device-independent QKD protocol. Our protocol tolerates a constant level of device imprecision and achieves a linear key rate.