13 citations · 22 across the 13 of their papers we have counts for
14 papers
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…
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…
Entanglement Detection with Rotationally Covariant Measurements -- From Compton Scattering to Lemonade
Marlene Funck, Ilija Funk, Tizian Schmidt +1
The accurate and efficient detection of quantum entanglement remains a central challenge in quantum information science. In this work, we study the detection of entanglement of pol…
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…
Specifying the Intrinsic Back-action of a General Measurement
Liang-Liang Sun, Armin Tavakoli, René Schwonnek +3
Understanding the invasive nature of quantum measurement and its implications in quantum foundations and information science demands a mathematically rigorous and physically well-g…
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…
One for All: Universal Quantum Conic Programming Framework for Hard-Constrained Combinatorial Optimization Problems
Lennart Binkowski, Tobias J. Osborne, Marvin Schwiering +2
We present a unified quantum-classical framework for addressing NP-complete constrained combinatorial optimisation problems, generalising the recently proposed Quantum Conic Progra…
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.…
Bounding the joint numerical range of Pauli strings by graph parameters
Zhen-Peng Xu, René Schwonnek, Andreas Winter
The interplay between the quantum state space and a specific set of measurements can be effectively captured by examining the set of jointly attainable expectation values. This set…
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…