arXiv subjects

René Schwonnek

Publications and source records attributed to René Schwonnek.

34 records · Page 2Linked to original sources

arXiv2023

Improved DIQKD protocols with finite-size analysis

The security of finite-length keys is essential for the implementation of device-independent quantum key distribution (DIQKD). Presently, there are several finite-size DIQKD security proofs, but they are mostly focused on standard DIQKD protocols and do not directly apply to the recent improved DIQKD protocols based on noisy preprocessing, random key measurements, and modified CHSH inequalities. Here, we provide a general finite-size security proof that can simultaneously encompass these approaches, using tighter finite-size bounds than previous analyses. In doing so, we develop a method to compute tight lower bounds on the asymptotic keyrate for any such DIQKD protocol with binary inputs and outputs. With this, we show that positive asymptotic keyrates are achievable up to depolarizing noise values of $9.33\%$, exceeding all previously known noise thresholds. We also develop a modification to random-key-measurement protocols, using a pre-shared seed followed by a "seed recovery" step, which yields substantially higher net key generation rates by essentially removing the sifting factor. Some of our results may also improve the keyrates of device-independent randomness expansion.

quant-ph↗

arXiv2023

The Schmidt rank for the commuting operator framework

In quantum information theory, the Schmidt rank is a fundamental measure for the entanglement dimension of a pure bipartite state. Its natural definition uses the Schmidt decomposition of vectors on bipartite Hilbert spaces, which does not exist (or at least is not canonically given) if the observable algebras of the local systems are allowed to be general C*-algebras. In this work, we generalize the Schmidt rank to the commuting operator framework where the joint system is not necessarily described by the minimal tensor product but by a general bipartite algebra. We give algebraic and operational definitions for the Schmidt rank and show their equivalence. We analyze bipartite states and compute the Schmidt rank in several examples: The vacuum in quantum field theory, Araki-Woods-Powers states, as well as ground states and translation invariant states on spin chains which are viewed as bipartite systems for the left and right half chains. We conclude with a list of open problems for the commuting operator framework.

quant-ph↗

arXiv2023

An entropic uncertainty principle for mixed states

The entropic uncertainty principle in the form proven by Maassen and Uffink yields a fundamental inequality that is prominently used in many places all over the field of quantum information theory. In this work, we provide a family of versatile generalizations of this relation. Our proof methods build on a deep connection between entropic uncertainties and interpolation inequalities for the doubly stochastic map that links probability distributions in two measurements bases. In contrast to the original relation, our generalization also incorporates the von Neumann entropy of the underlying quantum state. These results can be directly used to bound the extractable randomness of a source independent QRNG in the presence of fully quantum attacks, to certify entanglement between trusted parties, or to bound the entanglement of a system with an untrusted environment.

quant-ph↗

arXiv2023

Elementary Proof of QAOA Convergence

The Quantum Alternating Operator Ansatz (QAOA) and its predecessor, the Quantum Approximate Optimization Algorithm, are one of the most widely used quantum algorithms for solving combinatorial optimization problems. However, as there is yet no rigorous proof of convergence for the QAOA, we provide one in this paper. The proof involves retracing the connection between the Quantum Adiabatic Algorithm and the QAOA, and naturally suggests a refined definition of the `phase separator' and `mixer' keywords.

quant-ph↗

arXiv2022

Complete hierarchy for high-dimensional steering certification

High-dimensional quantum steering can be seen as a test for the dimensionality of entanglement, where the devices at one side are not characterized. As such, it is an important component in quantum informational protocols that make use of high-dimensional entanglement. Although it has been recently observed experimentally, the phenomenon of high-dimensional steering is lacking a general certification procedure. We provide necessary and sufficient conditions to certify the entanglement dimension in a steering scenario. These conditions are stated in terms of a hierarchy of semidefinite programs, which can also be used to quantify the phenomenon using the steering dimension robustness. To demonstrate the practical viability of our method, we characterize the dimensionality of entanglement in steering scenarios prepared with maximally entangled states measured in mutually unbiased bases. Our methods give significantly stronger bounds on the noise robustness necessary to experimentally certify high-dimensional entanglement.

quant-ph↗

arXiv2021

Computing secure key rates for quantum key distribution with untrusted devices

Device-independent quantum key distribution (DIQKD) provides the strongest form of secure key exchange, using only the input-output statistics of the devices to achieve information-theoretic security. Although the basic security principles of DIQKD are now well-understood, it remains a technical challenge to derive reliable and robust security bounds for advanced DIQKD protocols that go beyond the previous results based on violations of the CHSH inequality. In this work, we present a framework based on semi-definite programming that gives reliable lower bounds on the asymptotic secret key rate of any QKD protocol using untrusted devices. In particular, our method can in principle be utilized to find achievable secret key rates for any DIQKD protocol, based on the full input-output probability distribution or any choice of Bell inequality. Our method also extends to other DI cryptographic tasks.

quant-ph↗

arXiv2020

Wigner distributions for n arbitrary observables

We study a generalization of the Wigner function to arbitrary tuples of hermitian operators. We show that for any collection of hermitian operators A1...An , and any quantum state there is a unique joint distribution on R^n, with the property that the marginals of all linear combinations of the operators coincide with their quantum counterpart. In other words, we consider the inverse Radon transform of the exact quantum probability distributions of all linear combinations. We call it the Wigner distribution, because for position and momentum this property defines the standard Wigner function. We discuss the application to finite dimensional systems, establish many basic properties and illustrate these by examples. The properties include the support, the location of singularities, positivity, the behavior under symmetry groups, and informational completeness.

quant-ph↗

arXiv2020

Properties of the Wigner distribution for n arbitrary operators

We study a generalization of the Wigner function to arbitrary tuples of hermitian operators, which is a distribution uniquely characterized by the property that the marginals for all linear combinations of the given operators agree with the quantum mechanical distributions. Its role as a joint quasi-probability distribution is underlined by the property that its support always lies in the set of expectation value tuples of the operators. We characterize the set of singularities and positivity, and provide some basic examples.

quant-ph↗

arXiv2019

Entanglement detection with scrambled data

In the usual entanglement detection scenario the possible measurements and the corresponding data are assumed to be fully characterized. We consider the situation where the measurements are known, but the data is scrambled, meaning the assignment of the probabilities to the measurement outcomes is unknown. We investigate in detail the two-qubit scenario with local measurements in two mutually unbiased bases. First, we discuss the use of entropies to detect entanglement from scrambled data, showing that Tsallis- and Rényi entropies can detect entanglement in our scenario, while the Shannon entropy cannot. Then, we introduce and discuss scrambling-invariant families of entanglement witnesses. Finally, we show that the set of non-detectable states in our scenario is non-convex and therefore in general hard to characterize.

quant-ph↗

arXiv2018

Entanglement detection by violations of noisy uncertainty relations: A proof of principle

It is well-known that the violation of a local uncertainty relation can be used as an indicator for the presence of entanglement. Unfortunately, the practical use of these non-linear witnesses has been limited to few special cases in the past. However, new methods for computing uncertainty bounds became available. Here we report on an experimental implementation of uncertainty-based entanglement witnesses, benchmarked in a regime dominated by strong local noise. We combine the new computational method with a local noise tomography in order to design noise-adapted entanglement witnesses. This proof-of-principle experiment shows that quantum noise can be successfully handled by a fully quantum model in order to enhance entanglement detection efficiencies.

quant-ph↗

arXiv2017

State-independent Uncertainty Relations and Entanglement Detection in Noisy Systems

Quantifying quantum mechanical uncertainty is vital for the increasing number of experiments that reach the uncertainty limited regime. We present a method for computing tight variance uncertainty relations, i.e., the optimal state-independent lower bound for the sum of the variances for any set of two or more measurements. The bounds come with a guaranteed error estimate, so results of pre-assigned accuracy can be obtained straightforwardly. Our method also works for POVM measurements. Therefore, it can be used for detecting entanglement in noisy environments, even in cases where conventional spin squeezing criteria fail because of detector noise.

quant-ph↗

arXiv2016

Optimal uncertainty relations in a modified Heisenberg algebra

Various theories that aim at unifying gravity with quantum mechanics suggest modifications of the Heisenberg algebra for position and momentum. From the perspective of quantum mechanics, such modifications lead to new uncertainty relations which are thought (but not proven) to imply the existence of a minimal observable length. Here we prove this statement in a framework of sufficient physical and structural assumptions. Moreover, we present a general method that allows to formulate optimal and state-independent variance-based uncertainty relations. In addition, instead of variances, we make use of entropies as a measure of uncertainty and provide uncertainty relations in terms of min- and Shannon entropies. We compute the corresponding entropic minimal lengths and find that the minimal length in terms of min-entropy is exactly one bit.

quant-ph↗

arXiv2016

Entanglement Distillation using the Exchange Interaction

A key ingredient of quantum repeaters is entanglement distillation, i.e., the generation of high-fidelity entangled qubits from a larger set of pairs with lower fidelity. Here, we present entanglement distillation protocols based on qubit couplings that originate from exchange interaction. First, we make use of asymmetric bilateral two-qubit operations generated from anisotropic exchange interaction and show how to distill entanglement using two input pairs. We furthermore consider the case of three input pairs coupled through isotropic exchange. Here, we characterize a set of protocols which are optimizing the tradeoff between the fidelity increase and the probability of a successful run.

quant-ph↗

arXiv2016

Measurement Uncertainty for Finite Quantum Observables

Measurement uncertainty relations are lower bounds on the errors of any approximate joint measurement of two or more quantum observables. The aim of this paper is to provide methods to compute optimal bounds of this type. The basic method is semidefinite programming, which we apply to arbitrary finite collections of projective observables on a finite dimensional Hilbert space. The quantification of errors is based on an arbitrary cost function, which assigns a penalty to getting result $x$ rather than y, for any pair (x,y). This induces a notion of optimal transport cost for a pair of probability distributions, and we include an appendix with a short summary of optimal transport theory as needed in our context. There are then different ways to form an overall figure of merit from the comparison of distributions. We consider three, which are related to different physical testing scenarios. The most thorough test compares the transport distances between the marginals of a joint measurement and the reference observables for every input state. Less demanding is a test just on the states for which a "true value" is known in the sense that the reference observable yields a definite outcome. Finally, we can measure a deviation as a single expectation value by comparing the two observables on the two parts of a maximally entangled state. All three error quantities have the property that they vanish if and only if the tested observable is equal to the reference. The theory is illustrated with some characteristic examples.

quant-ph↗

arXiv2015

Uncertainty Relations for Angular Momentum

In this work we study various notions of uncertainty for angular momentum in the spin-s representation of SU(2). We characterize the "uncertainty regions'' given by all vectors, whose components are specified by the variances of the three angular momentum components. A basic feature of this set is a lower bound for the sum of the three variances. We give a method for obtaining optimal lower bounds for uncertainty regions for general operator triples, and evaluate these for small s. Further lower bounds are derived by generalizing the technique by which Robertson obtained his state-dependent lower bound. These are optimal for large s, since they are saturated by states taken from the Holstein-Primakoff approximation. We show that, for all s, all variances are consistent with the so-called vector model, i.e., they can also be realized by a classical probability measure on a sphere of radius sqrt(s(s+1)). Entropic uncertainty relations can be discussed similarly, but are minimized by different states than those minimizing the variances for small s. For large s the Maassen-Uffink bound becomes sharp and we explicitly describe the extremalizing states. Measurement uncertainty, as recently discussed by Busch, Lahti and Werner for position and momentum, is introduced and a generalized observable (POVM) which minimizes the worst case measurement uncertainty of all angular momentum components is explicitly determined, along with the minimal uncertainty. The output vectors for the optimal measurement all have the same length r(s), where r(s)/s goes to 1 as s tends to infinity.

quant-ph↗

arXiv2015

Optimality of entropic uncertainty relations

The entropic uncertainty relation proven by Maassen and Uffink for arbitrary pairs of two observables is known to be non-optimal. Here, we call an uncertainty relation optimal, if the lower bound can be attained for any value of either of the corresponding uncertainties. In this work we establish optimal uncertainty relations by characterising the optimal lower bound in scenarios similar to the Maassen-Uffink type. We disprove a conjecture by Englert et al. and generalise various previous results. However, we are still far from a complete understanding and, based on numerical investigation and analytical results in small dimension, we present a number of conjectures.

quant-ph↗