arXiv subjects

Raphael Brinster

Publications and source records attributed to Raphael Brinster.

7 recordsLinked to original sources

arXiv2026

Multinegativity and single-letter formulas for asymptotic entanglement

The study of entanglement inevitably leads to the concept of regularization, where measures are evaluated on infinitely many copies of a state. Single-letter formulas try to make these asymptotic entanglement quantities accessible through a calculation on one copy of a state, but are rarely available. We introduce a decreasing hierarchy of computable upper bounds on the asymptotic relative entropy of entanglement with respect to positive-partial-transpose (PPT) states. The regularization of every fixed hierarchy level equals this asymptotic quantity. Additivity at any level therefore yields a single-letter formula, even when the usual one-copy relative entropy is nonadditive. We establish such additivity at the first nontrivial level for two broad multiparameter families, both containing all Werner states. The upper-bound construction also extends to sandwiched Renyi divergences. The hierarchy motivates $k$-multinegative states, a generalization of binegative states and the associated $k$-multinegativity, which gives explicit upper bounds on both the asymptotic relative entropy and exact PPT entanglement cost. We construct states which are $k$-multinegative at arbitrarily large depths $k$ that separate consecutive levels of the previously introduced entanglement-cost hierarchy, disproving its conjectured finite collapse. These results provide state-dependent single-letter formulas while identifying a limitation of universal finite-level characterizations.

quant-ph↗

arXiv2026

Sharp Quantum Capacity Thresholds: Exponential Strong Converses for Degradable and Antidegradable Channels

The quantum capacity of a noisy channel quantifies the maximum rate at which quantum information can be transmitted reliably. For general channels, its evaluation requires an optimization over arbitrarily many channel uses. Degradable channels form a central exception: their capacity is given by the single-letter coherent information, while antidegradable channels have zero capacity. Nevertheless, even for these fundamental classes, it has remained open whether communication above capacity becomes possible when a fixed non-maximal error is tolerated. Here we resolve this problem by proving an exponential strong converse for every finite-dimensional degradable and antidegradable channel: at any rate above capacity, the fidelity of every coding scheme decays exponentially with the number of channel uses. As an immediate consequence, we establish the first all-code exponential strong converse for the quantum erasure channel throughout its full parameter range, strengthening previous results that applied only to almost all codes. We also show that exponential strong-converse bounds are preserved under receiver post-processing. This yields efficiently computable semidefinite-programming bounds for arbitrary finite-dimensional channels, improved bounds for Pauli channels, and an exact exponential strong converse for a nondegradable multilevel amplitude-damping family.

quant-ph↗

arXiv2026

Very Strong Irreversibility of Quantum Entanglement

The manipulation of quantum entanglement is fundamentally irreversible: some mixed entangled states require pure entanglement for their preparation, although no pure entanglement can be recovered from them by local operations and classical communication. This irreversibility is known to persist even under the maximal class of operations that do not generate entanglement, revealing a fundamental distinction between entanglement theory and thermodynamics. We construct cases for which any attempt to restore reversibility necessarily incurs an error that increases exponentially with the number of copies. Technically, we demonstrate a strict separation between the exponential strong-converse distillable entanglement and the exponential strong-converse entanglement cost. Our result resolves a conjecture posed by Lami and Regula (Nat. Phys. 19, 184-189 (2023)) and strengthens it by showing that the irreversibility of entanglement persists even at the level of polynomially (in the number of copies) growing error. We further derive a semidefinite-programming lower bound on the exponential strong-converse cost under non-entangling operations. Finally, for the class of completely PPT-preserving operations, we construct analytically solvable families of antisymmetric states exhibiting the exponential strong-converse irreversibility. Remarkably, to our knowledge, no analogous separation between exponential strong converse cost and the analogous distillable entanglement is currently known even under the more restrictive class of LOCC operations.

quant-ph↗

arXiv2026

Robust certification of non-projective measurements: theory and experiment

Determining the conditions under which positive operator-valued measures (POVMs), the most general class of quantum measurements, outperform projective measurements remains a challenging and largely unresolved problem. Of particular interest are projectively simulable POVMs, which can be realized through probabilistic mixtures of projective measurements, and therefore offer no advantage over projective schemes. Characterizing the boundary between simulable and non-simulable POVMs is, however, a difficult task, and existing tools either fail to scale efficiently, provide limited experimental feasibility or work only for specific POVMs. Here, we introduce and demonstrate a general method to certify non-simulability of a POVM by introducing a complete hierarchy of semidefinite programs. It provides upper bounds on the non-simulability measure of critical visibility of arbitrary POVMs which are tight in many cases and outperform previously known criteria. We experimentally certify the non-simulability of two- and three-dimensional POVMs using a trapped-ion qudit quantum processor by constructing non-simulability witnesses and introduce a modification of our framework that makes them robust against state preparation errors. Finally, we extend our results to the setting where an additional ancilla system is available.

quant-ph↗

arXiv2026

Certifying coherence in quantum devices under classical control

Quantum states that do not commute exhibit coherence, but only when the device preparing them is assumed to be unaffected by classical parameters inaccessible to the experimenter. Such hidden classical control arises both in fundamental tests of quantum phenomena and in quantum information protocols that operate under limited control assumptions. Here, we address the problem of coherence certification by developing complete and practically efficient methods. First, we prove that coherence can be fully characterised through a hierarchy of semidefinite programs. Second, we introduce a practical semidefinite programming approach that achieves useful accuracy while remaining computationally efficient even for preparation devices generating many, potentially high-dimensional, quantum states. For the important special case of qubits, we further exploit conceptual connections with the theory of joint measurability to obtain highly accurate coherence characterisation that scales to more than one thousand qubits. Finally, we apply these methods to determine whether quantum channels are able to preserve coherence or are inherently coherence-breaking. Together, these results provide a powerful toolbox for analysing quantum superposition in the presence of hidden classical control.

quant-ph↗

arXiv2026

Maximally non-projective measurements are not always symmetric informationally complete

Standard quantum measurements are projective. However, the full scope of quantum measurements is represented by positive operator-valued measures (POVMs) and many of these break the limitations of projective measurements as resources in quantum information. It is therefore natural to consider how accurately an experimenter with access only to projective measurements and classical processing can simulate POVMs. The most well-known class of non-projective measurements is called symmetric informationally complete (SIC). Such measurements are both ubiquitous in the broader scope of quantum information theory and known to be the most strongly non-projective measurements in qubit systems. Here, we show that beyond qubit systems, the SIC property is in general not associated with the most non-projective measurement. For this, we put forward a semidefinite programming criterion for detecting genuinely non-projective measurements. This method allows us to determine quantitative simulability thresholds for generic POVMs and to put forward a conjecture on which qutrit and ququart measurements that are most strongly non-projective.

quant-ph↗

arXiv2025

Measurement and Teleportation in the cSYK/JT Correspondence

We consider two complex SYK models entangled in a thermofield double (TFD) state and investigate the effect of one-sided projective measurements. As measurement operator we choose single site charge operators. Performing a measurement results in a non-zero $U(1)$ charge. The entropy curve differs from the previously studied SYK model due to a thermodynamic phase transition that takes place after a certain charge is reached. We also match our results to a dual bulk description. Finally, a teleportation protocol is provided to support the notion of a traversable wormhole being formed.

hep-th↗