12 citations · 20 across the 21 of their papers we have counts for
22 papers
Computing key rates for one-sided device-independent quantum key distribution
Andreas Bluhm, Gereon Koßmann, Martin Sandfuchs +3
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 interest…
Efficient Computation of QKD Key Rates without Semidefinite Programming
Bence Temesi, Antoine Gansel, Gereon Koßmann +1
Translating observed data into a reliable estimate of the secure key rate is a crucial step for operating a quantum key distribution device. We provide a computational method for t…
Optimal strategies for shadow tomography with limited resources
Zhen-Peng Xu, Qi Ye, Jie Wang +3
Shadow tomography addresses the task of efficiently predicting many expectation values of an unknown quantum state from randomized measurements on comparatively few copies. Existin…
Sharp continuity of quantum conditional entropy
Mario Berta, Pablo Costa Rico, Gereon Kossmann +2
We prove the sharp uniform continuity bound for quantum conditional entropy. If two bipartite states are at trace distance at most and , the optimal dimension-only mo…
Fixed points in de Finetti hierarchies
Gereon Kossmann, Julius A. Zeiss
De Finetti theorems convert permutation symmetry into approximate mixtures of product states and thereby justify a wide range of reductions in classical and quantum statistics. In…
Device-independent Quantum Key Distribution in the commuting operator framework
Gereon Koßmann, René Schwonnek, Po-Chieh Liu +1
Device-independent quantum key distribution (DIQKD) is arguably the gold standard for secure quantum communication, as it aims to rely only on observed input-output statistics of a…
Device independent quantum key distribution with robust self-tests
Andreas Bluhm, Gereon Koßmann, René Schwonnek
Device-independent quantum key distribution (DIQKD) provides a model of quantum key distribution with minimal assumptions and highly abstract theoretical building blocks. Although…
Entanglement cost of bipartite quantum channel discrimination under positive partial transpose operations
Chengkai Zhu, Shuyu He, Gereon Koßmann +1
Quantum channel discrimination is a fundamental task in quantum information processing. In the one-shot regime, discrimination between two candidate channels is characterized by th…
Finite de Finetti for convex bodies and Polynomial Optimization
Julius A. Zeiss, Gereon Koßmann, René Schwonnek +1
Leveraging a recently proposed notion of relative entropy in general probabilistic theories (GPT), we prove a finite de Finetti representation theorem for general convex bodies. We…
A Collection of Pinsker-type Inequalities for Quantum Divergences
Kläre Wienecke, Gereon Koßmann, René Schwonnek
Pinsker's inequality sets a lower bound on the Umegaki divergence of two quantum states in terms of their trace distance. In this work, we formulate corresponding estimates for a v…
Simultaneous variances of Pauli strings, weighted independence numbers, and a new kind of perfection of graphs
Zhen-Peng Xu, Jie Wang, Qi Ye +3
A set of Pauli stings is well characterized by the graph that encodes its commutatitivity structure, i.e., by its frustration graph. This graph provides a natural interface between…
Routed Bell tests with arbitrarily many local parties
Gereon Koßmann, Mario Berta, René Schwonnek
Device-independent quantum key distribution (DIQKD) promises cryptographic security based solely on observed quantum correlations, yet its implementation over long distances remain…
On approximate quantum error correction for symmetric noise
Gereon Koßmann, Julius A. Zeiss, Omar Fawzi +1
We revisit the extendability-based semi-definite programming hierarchy introduced by Berta et al. [Mathematical Programming, 1 - 49 (2021)], which provides converging outer bounds…
Approximating fixed size quantum correlations in polynomial time
Julius A. Zeiss, Gereon Koßmann, Omar Fawzi +1
We show that -additive approximations of the optimal value of fixed-size two-player free games with fixed-dimensional entanglement assistance can be computed in time $…
Reliable Entropy Estimation from Observed Statistics for Device-Independent Quantum Cryptography
Gereon Koßmann, René Schwonnek
This paper introduces a numerical framework for establishing lower bounds on the conditional von-Neumann entropy in device-independent quantum cryptography and randomness extractio…
Semidefinite optimization of the quantum relative entropy of channels
Gereon Koßmann, Mark M. Wilde
This paper introduces a method for calculating the quantum relative entropy of channels, an essential quantity in quantum channel discrimination and resource theories of quantum ch…
Optimising the relative entropy under semidefinite constraints
Gereon Koßmann, René Schwonnek
Finding the minimal relative entropy of two quantum states under semidefinite constraints is a pivotal problem located at the mathematical core of various applications in quantum i…
From barren plateaus through fertile valleys: Conic extensions of parameterised quantum circuits
Lennart Binkowski, Gereon Koßmann, Tobias J. Osborne +2
Optimisation via parameterised quantum circuits is the prevalent technique of near-term quantum algorithms. However, the omnipresent phenomenon of barren plateaus - parameter regio…
Hierarchies for Semidefinite Optimization in -Algebras
Gereon Koßmann, René Schwonnek, Jonathan Steinberg
Semidefinite Optimization has become a standard technique in the landscape of Mathematical Programming that has many applications in finite dimensional Quantum Information Theory.…
Elementary Proof of QAOA Convergence
Lennart Binkowski, Gereon Koßmann, Timo Ziegler +1
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 c…
Symmetry-based quantum algorithms for open-shop scheduling with hard constraints
Lennart Binkowski, Gereon Koßmann, Christian Tutschku +1
Encoding hard-constrained optimization problems into a variational quantum algorithm often turns out to be a challenging task. In this work, we provide a solution for the class of…
Deep-Circuit QAOA
Gereon Koßmann, Lennart Binkowski, Lauritz van Luijk +2
Despite its popularity, several empirical and theoretical studies suggest that the quantum approximate optimization algorithm (QAOA) has persistent issues in providing a substantia…