arXiv subjects

Ramona Wolf

Publications and source records attributed to Ramona Wolf.

At least 19 recordsLinked to original sources

arXiv2026

Computing key rates for one-sided device-independent quantum key distribution

The defining feature of one-sided device-independent quantum key distribution is its asymmetric trust model in which only one party is characterized. This scenario sets an interesting middle ground between high key rates achievable by characterizing devices and the security of full device-independence. Here, we provide new tools, methods, and benchmarks for calculating key rates in this setting. To achieve this, we develop and compare two extensions of the NPA hierarchy and derive finite-size security bounds against general attacks with arbitrary device memory. The latter is based on the Generalized Entropy Accumulation Theorem. We then investigate the performance of various protocols: the BB84 protocol both with and without losses, a qutrit mutually unbiased bases protocol, and protocols based on Bell inequalties such as CHSH and $I_{3322}$. We find that the choice of which party is characterized can strongly affects the key rate, surprisingly without a universal ordering. Our work thus offers a general toolbox for calculating key rates for one-sided device-independent QKD protocols.

quant-ph↗

arXiv2025

Defining Security in Quantum Key Distribution

The security of quantum key distribution (QKD) is quantified by a parameter $\varepsilon>0$, which -- under well-defined physical assumptions -- can be bounded explicitly. This contrasts with computationally secure schemes, where security claims are only asymptotic (i.e., under standard complexity assumptions, one only knows that $\varepsilon \to 0$ as the key size grows, but has no explicit bound). Here we explain the definition and interpretation of $\varepsilon$-security. Adopting an axiomatic approach, we show that $\varepsilon$ can be understood as the maximum probability of a security failure. Finally, we review and address several criticisms of this definition that have appeared in the literature.

quant-ph↗

arXiv2025

Security of differential phase shift QKD from relativistic principles

The design of quantum protocols for secure key generation poses many challenges: On the one hand, they need to be practical concerning experimental realisations. On the other hand, their theoretical description must be simple enough to allow for a security proof against all possible attacks. Often, these two requirements are in conflict with each other, and the differential phase shift (DPS) QKD protocol exemplifies these difficulties: It is designed to be implementable with current optical telecommunication technology, which, for this protocol, comes at the cost that many standard security proof techniques do not apply to it. After about 20 years since its invention, this work presents the first full security proof of DPS QKD against general attacks, including finite-size effects. The proof combines techniques from quantum information theory, quantum optics, and relativity. We first give a security proof of a QKD protocol whose security stems from relativistic constraints. We then show that security of DPS QKD can be reduced to security of the relativistic protocol. In addition, we show that coherent attacks on the DPS protocol are, in fact, stronger than collective attacks. Our results have broad implications for the development of secure and reliable quantum communication technologies, as they shed light on the range of applicability of state-of-the-art security proof techniques.

quant-ph↗

arXiv2024

Device-Independent Randomness Amplification

Successful realization of Bell tests has settled an 80-year-long debate, proving the existence of correlations which cannot be explained by a local realistic model. Recent experimental progress allowed to rule out any possible loopholes in these tests, and opened up the possibility of applications in cryptography envisaged more than three decades ago. A prominent example of such an application is device-independent quantum key distribution, which has recently been demonstrated. One remaining gap in all existing experiments, however, is that access to perfect randomness is assumed. To tackle this problem, the concept of randomness amplification has been introduced, allowing to generate such randomness from a weak source -- a task impossible in classical physics. In this work, we demonstrate the amplification of imperfect randomness coming from a physical source. It is achieved by building on two recent developments: The first is a theoretical protocol implementing the concept of randomness amplification within an experimentally realistic setup, which however requires a combination of the degree of Bell inequality violation (S-value) and the amount of data not attained previously. The second is experimental progress enabling the execution of a loophole-free Bell test with superconducting circuits, which offers a platform to reach the necessary combination. Our experiment marks an important step in achieving the theoretical physical limits of privacy and randomness generation.

quant-ph↗

arXiv2024

Entropy bounds for device-independent quantum key distribution with local Bell test

One of the main challenges in device-independent quantum key distribution (DIQKD) is achieving the required Bell violation over long distances, as the channel losses result in low overall detection efficiencies. Recent works have explored the concept of certifying nonlocal correlations over extended distances through the use of a local Bell test. Here, an additional quantum device is placed in close proximity to one party, using short-distance correlations to verify nonlocal behavior at long distances. However, existing works have either not resolved the question of DIQKD security against active attackers in this setup, or used methods that do not yield tight bounds on the keyrates. In this work, we introduce a general formulation of the keyrate computation task in this setup that can be combined with recently developed methods for analyzing standard DIQKD. Using this method, we show that if the short-distance devices exhibit sufficiently high detection efficiencies, positive keyrates can be achieved in the long-distance branch with lower detection efficiencies as compared to standard DIQKD setups. This highlights the potential for improved performance of DIQKD over extended distances in scenarios where short-distance correlations are leveraged to validate quantum correlations.

quant-ph↗

arXiv2023

Commuting operations factorise

Consider two agents, Alice and Bob, each of whom takes a quantum input, operates on a shared quantum system $K$, and produces a quantum output. Alice and Bob's operations may commute, in the sense that the joint input-output behaviour is independent of the order in which they access $K$. Here we ask whether this commutation property implies that $K$ can be split into two factors on which Alice and Bob act separately. The question can be regarded as a "fully quantum" generalisation of a problem posed by Tsirelson, who considered the case where Alice and Bob's inputs and outputs are classical. In this case, the answer is negative in general, but it is known that a factorisation exists in finite dimensions. Here we show the same holds in the fully quantum case, i.e., commuting operations factorise, provided that all input systems are finite-dimensional.

quant-ph↗

arXiv2023

The debate over QKD: A rebuttal to the NSA's objections

A recent publication by the NSA assessing the usability of quantum cryptography has generated significant attention, concluding that this technology is not recommended for use. Here, we reply to this criticism and argue that some of the points raised are unjustified, whereas others are problematic now but can be expected to be resolved in the foreseeable future.

quant-ph↗

arXiv2023

Coherent attacks are stronger than collective attacks on DIQKD with random postselection

In a recent paper [Phys. Rev. Lett. 129, 050502 (2022)], the authors report on the implementation of a device-independent QKD protocol with random postselection, which was originally proposed in [Phys. Rev. Lett. 128, 110506 (2022)]. Both works only provide a security proof against collective attacks, leaving open the question whether the protocol is secure against coherent attacks. In this note, we report on an attack on this protocol that demonstrates that coherent attacks are, in fact, stronger than collective attacks.

quant-ph↗

arXiv2023

Quantum Advantage in Cryptography

Ever since its inception, cryptography has been caught in a vicious circle: Cryptographers keep inventing methods to hide information, and cryptanalysts break them, prompting cryptographers to invent even more sophisticated encryption schemes, and so on. But could it be that quantum information technology breaks this circle? At first sight, it looks as if it just lifts the competition between cryptographers and cryptanalysts to the next level. Indeed, quantum computers will render most of today's public key cryptosystems insecure. Nonetheless, there are good reasons to believe that cryptographers will ultimately prevail over cryptanalysts. Quantum cryptography allows us to build communication schemes whose secrecy relies only on the laws of physics and some minimum assumptions about the cryptographic hardware - leaving basically no room for an attack. While we are not yet there, this article provides an overview of the principles and state of the art of quantum cryptography, as well as an assessment of current challenges and prospects for overcoming them.

quant-ph↗

arXiv2022

Computing associators of endomorphism fusion categories

Many applications of fusion categories, particularly in physics, require the associators or $F$-symbols to be known explicitly. Finding these matrices typically involves solving vast systems of coupled polynomial equations in large numbers of variables. In this work, we present an algorithm that allows associator data for some category with unknown associator to be computed from a Morita equivalent category with known data. Given a module category over the latter, we utilize the representation theory of a module tube category, built from the known data, to compute this unknown associator data. When the input category is unitary, we discuss how to ensure the obtained data is also unitary. We provide several worked examples to illustrate this algorithm. In addition, we include several Mathematica files showing how the algorithm can be used to compute the data for the Haagerup category $\mathcal{H}_1$, whose data was previously unknown.

math.QA↗

arXiv2021

A critical lattice model for a Haagerup conformal field theory

We use the formalism of strange correlators to construct a critical classical lattice model in two dimensions with the \emph{Haagerup fusion category} $\mathcal{H}_3$ as input data. We present compelling numerical evidence in the form of finite entanglement scaling to support a Haagerup conformal field theory (CFT) with central charge $c=2$. Generalized twisted CFT spectra are numerically obtained through exact diagonalization of the transfer matrix and the conformal towers are separated in the spectra through their identification with the topological sectors. It is further argued that our model can be obtained through an orbifold procedure from a larger lattice model with input $Z(\mathcal{H}_3)$, which is the simplest modular tensor category that does not admit an algebraic construction. This provides a counterexample for the conjecture that all rational CFT can be constructed from standard methods.

cond-mat.stat-mech↗

arXiv2021

Device-Independent Quantum Key Distribution with Random Key Basis

Device-independent quantum key distribution (DIQKD) is the art of using untrusted devices to distribute secret keys in an insecure network. It thus represents the ultimate form of cryptography, offering not only information-theoretic security against channel attacks, but also against attacks exploiting implementation loopholes. In recent years, much progress has been made towards realising the first DIQKD experiments, but current proposals are just out of reach of today's loophole-free Bell experiments. Here, we significantly narrow the gap between the theory and practice of DIQKD with a simple variant of the original protocol based on the celebrated Clauser-Horne-Shimony-Holt (CHSH) Bell inequality. By using two randomly chosen key generating bases instead of one, we show that our protocol significantly improves over the original DIQKD protocol, enabling positive keys in the high noise regime for the first time. We also compute the finite-key security of the protocol for general attacks, showing that approximately 1E8 to 1E10 measurement rounds are needed to achieve positive rates using state-of-the-art experimental parameters. Our proposed DIQKD protocol thus represents a highly promising path towards the first realisation of DIQKD in practice.

quant-ph↗

arXiv2021

Microscopic Models for Fusion Categories

This is a PhD Thesis on the connection between subfactors (more precisely, their corresponding fusion categories) and Conformal Field Theory (CFT). Besides being a mathematically interesting topic on its own, subfactors have also attracted the attention of physicists, since there is a conjectured correspondence between these and CFTs. Although there is quite a persuasive body of evidence for this conjecture, there are some gaps: there exists a set of exceptional subfactors with no known counterpart CFT. Hence, it is necessary to develop new techniques for building a CFT from a subfactor. Here, it is useful to study the underlying mathematical structure in more detail: The even parts of every subfactor give rise to two Unitary Fusion Categories (UFCs), and it is a promising direction to study quantum spin systems constructed from these categories to find a connection to CFTs. The simplest example that requires new techniques for building a CFT is the Haagerup subfactor, since it is the smallest subfactor with index larger than 4. In this thesis, we investigate the question whether there is a CFT corresponding to the Haagerup subfactor via lattice models in one and two dimensions. The first task here is to find the F-symbols of the fusion category since these are crucial ingredients for the construction of a physical model in all of the models we consider in this thesis. We then investigate microscopic models such as the golden chain model and the Levin-Wen model in order to find evidence for a corresponding CFT. We find that there is no evidence for a corresponding CFT from the investigation of the UFCs directly and it is necessary to expand these studies to the corresponding unitary modular tensor category, which can, for instance, be obtained via the excitations of the Levin-Wen model.

math-ph↗

arXiv2020

Generalized string-nets for unitary fusion categories without tetrahedral symmetry

The Levin-Wen model of string-net condensation explains how topological phases emerge from the microscopic degrees of freedom of a physical system. However, the original construction is not applicable to all unitary fusion category since some additional symmetries for the $F$-symbols are imposed. In particular, the so-called tetrahedral symmetry is not fulfilled by many interesting unitary fusion categories. In this paper, we present a generalized construction of the Levin-Wen model for arbitrary multiplicity-free unitary fusion categories that works without requiring these additional symmetries. We explicitly calculate the matrix elements of the Hamiltonian and, furthermore, show that it has the same properties as the original one.

quant-ph↗

arXiv2019

Gauging Defects in Quantum Spin Systems

The goal of this work is to build a dynamical theory of defects for quantum spin systems. A kinematic theory for an indefinite number of defects is first introduced exploiting distinguishable Fock space. Dynamics are then incorporated by allowing the defects to become mobile via a microscopic Hamiltonian. This construction is extended to topologically ordered systems by restricting to the ground state eigenspace of Hamiltonians generalizing the golden chain. We illustrate the construction with the example of a spin chain with $\mathbf{Vec}(\mathbb{Z}/2\mathbb{Z})$ fusion rules, employing generalized tube algebra techniques to model the defects in the chain. The resulting dynamical defect model is equivalent to the critical transverse Ising model.

quant-ph↗

arXiv2019

The F-Symbols for the H3 Fusion Category

We present a solution for the F-symbols of the H3 fusion category, which is Morita equivalent to the even parts of the Haagerup subfactor. This solution has been computed by solving the pentagon equations and using several properties of trivalent categories.

math.CT↗

arXiv2019

Efficient Learning for Deep Quantum Neural Networks

Neural networks enjoy widespread success in both research and industry and, with the imminent advent of quantum technology, it is now a crucial challenge to design quantum neural networks for fully quantum learning tasks. Here we propose the use of quantum neurons as a building block for quantum feed-forward neural networks capable of universal quantum computation. We describe the efficient training of these networks using the fidelity as a cost function and provide both classical and efficient quantum implementations. Our method allows for fast optimisation with reduced memory requirements: the number of qudits required scales with only the width, allowing the optimisation of deep networks. We benchmark our proposal for the quantum task of learning an unknown unitary and find remarkable generalisation behaviour and a striking robustness to noisy training data.

quant-ph↗

arXiv2018

From categories to anyons: a travelogue

In this paper we provide an overview of category theory, focussing on applications in physics. The route we follow is motivated by the final goal of understanding anyons and topological QFTs using category theory. This entails introducing modular tensor categories and fusion rings. Rather than providing an in-depth mathematical development we concentrate instead on presenting the "highlights for a physicist".

quant-ph↗