activity
20222026
most citedBounding the joint numerical range of Pauli strings by graph parameters

13 citations · 22 across the 13 of their papers we have counts for

collaborators
Showing quant-phShow all

12 papers · 1 filter

quant-ph2026

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…

quant-ph2026

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…

quant-ph2025

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…

quant-ph2025

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…

quant-ph2025

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…

quant-ph2024

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…

quant-ph2024★ 1 cited

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…

quant-ph2024★ 4 cited

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…

quant-ph2023

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…

quant-ph2023★ 13 cited

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…

quant-ph2022★ 1 cited

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…

quant-ph2022★ 3 cited

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…