activity
20232026
most citedUncertainty relations from state polynomial optimization

7 citations · 10 across the 17 of their papers we have counts for

collaborators
Showing quant-phShow all

13 papers · 1 filter

quant-ph2026

Counterexamples to the fractional coloring conjecture for triply efficient shadow tomography

Jędrzej Stempin, Santiago Llorens, Felix Huber

Fractional graph colorings are useful for the Shadow tomography of Pauli observables. In practice, it is desirable that any experimentally interesting set of Pauli operators has a…

quant-ph2026

On the two-copy distillability of Werner states and a new partial trace inequality

Thomas C. Fraser, Felix Huber, Balázs Pozsgay +1

Problem 5 in {\it Five Open Problems in Quantum Information Theory} [PRX Quantum 3, 010101 (2022)], asks whether the two-ququart Werner state is two-copy dis…

quant-ph2026

A 0.651-approximation to quantum Max Cut via Rydberg atoms

Tomás Crosta, Matthieu Saubanere, Felix Huber

Quantum Max Cut, also known as the anti-ferromagnetic Heisenberg Hamiltonian, is a QMA-complete problem which serves as a benchmark for approximation algorithms in quantum physics.…

quant-ph2026

Complete entanglement detection using polynomial invariants

Thomas C. Fraser, Vjosa Blakaj, Roberto Rubboli +2

Existing methods for deciding whether a bipartite quantum state is separable or entangled typically fall into one of two categories: they are either complete but require access to…

quant-ph2026

Combining moment matrices, symmetric extension, and Lovász theta: is entangled

Jȩdrzej Stempin, Gerard Anglès Munné, Santiago Llorens +1

We solve an open problem in entanglement theory posed by Yu et al., {\it Nature Communications 12, 1012 (2021)}. The problem is to show, via an entanglement witness, that the -…

quant-ph2026

SDP bounds on quantum codes: rational certificates

Gerard Anglès Munné, Felix Huber

A fundamental problem in quantum coding theory is to determine the maximum size of quantum codes of given block length and distance. A recent work introduced bounds based on semide…

quant-ph2025

Lovász theta and Shearer lower bounds on Quantum Max Cut

Felix Huber

Quantum Max Cut is a problem relevant to computer science and many-body quantum physics due to its links to classical Max Cut and the anti-ferromagnetic Heisenberg Hamiltonian. We…

quant-ph2025

Quasi-Clifford to qubit mappings

Felix Huber

Algebras with given (anti-)commutativity structure are widespread in quantum mechanics. This structure is captured by quasi-Clifford algebras (QCA): a QCA generated by $α_1, \dots,…

quant-ph2025★ 1 cited

On two maximally entangled couples

Felix Huber, Jens Siewert

In a seminal article, Higuchi and Sudbery showed that a pure four-qubit state can not be maximally entangled across every bipartition. Such states are now known as absolutely maxim…

quant-ph2024

Positivity of state, trace, and moment polynomials, and applications in quantum information

Felix Huber, Victor Magron, Jurij Volčič

State, trace, and moment polynomials are polynomial expressions in several operator or random variables and positive functionals on their products (states, traces or expectations).…

quant-ph2024

Second order cone relaxations for quantum Max Cut

Felix Huber, Kevin Thompson, Ojas Parekh +1

Quantum Max Cut (QMC), also known as the quantum anti-ferromagnetic Heisenberg model, is a QMA-complete problem relevant to quantum many-body physics and computer science. Semidefi…

quant-ph2024

SDP bounds on quantum codes

Gerard Anglès Munné, Andrew Nemec, Felix Huber

This paper provides a semidefinite programming hierarchy based on state polynomial optimization to determine the existence of quantum codes with given parameters. The hierarchy is…

quant-ph2023★ 7 cited

Uncertainty relations from state polynomial optimization

Moisés Bermejo Morán, Felix Huber

Uncertainty relations are a fundamental feature of quantum mechanics. How can these relations be found systematically? Here we develop a semidefinite programming hierarchy for addi…