arXiv subjects

Nikolai Wyderka

Publications and source records attributed to Nikolai Wyderka.

At least 19 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

High-dimensional quantum key distribution rates for multiple measurement bases

We investigate the advantages of high-dimensional encoding for a quantum key distribution protocol. In particular, we address a BBM92-like protocol where the dimension of the systems can be larger than two and more than two mutually unbiased bases (MUBs) can be employed. Indeed, it is known that, for a system whose dimension $d$ is a prime or the power of a prime, up to $d+1$ MUBs can be found. We derive an analytic expression for the asymptotic key rate when $d+1$ MUBs are exploited and show the effects of using different numbers of MUBs on the performance of the protocol. Then, we move to the non-asymptotic case and optimize the finite key rate against collective and coherent attacks for generic dimension of the systems and all possible numbers of MUBs. In the finite-key scenario, we find that, if the number of rounds is small enough, the highest key rate is obtained by exploiting three MUBs, instead of $d+1$ as one may expect.

quant-ph↗

arXiv2026

Entanglement quantification with randomized measurements is maximally difficult

The certification of quantum systems is essential for emerging quantum technologies, particularly in quantum communication, networks, and distributed computing, where maintaining a common reference frame across distant nodes poses significant challenges. Reference frame independent approaches, such as randomized measurement schemes, offer a promising route by reducing experimental demands while granting access to basis-independent quantities, including entanglement. However, the efficiency of such schemes in measuring such local invariants has remained unclear. In this work, we determine the minimal number of measurement settings required to access all two-qubit invariants. We further demonstrate that entanglement certification necessarily involves the most demanding invariants, establishing it as a maximally difficult task. Our results reveal a fundamental hierarchy among invariants, with direct implications for experimental feasibility and theoretical understanding of quantum certification. Finally, we extend our analysis beyond bipartite systems by applying it to the Kempe invariant in three-qubit systems, improving known measurement protocols and providing a first step toward uncovering similar hierarchies in higher dimensions.

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

Refuting spectral compatibility of quantum marginals

The spectral variant of the quantum marginal problem asks: Given prescribed spectra for a set of overlapping quantum marginals, does there exist a compatible joint state? The main idea of this work is a symmetry-reduced semidefinite programming hierarchy that detects when no such joint state exists. The hierarchy is complete, in the sense that it detects every incompatible set of spectra. The refutations it provides are dimension-free, certifying incompatibility in all local dimensions. The hierarchy also applies to the sums of Hermitian matrices problem, the compatibility of local unitary invariants, for certifying vanishing Kronecker coefficients, and to optimize over equivariant state polynomials.

quant-ph↗

arXiv2025

High-dimensional quantum key distribution with resource-efficient detection

While quantum key distribution (QKD) based on two-dimensional (qubit) encoding is a mature, field-tested technology, its performance is lacking for many cryptographic applications. High-dimensional encoding for QKD enables increased achievable key rates and robustness as compared to the standard qubit-based systems. However, experimental implementations of such systems are more complicated, expensive, and require careful security analysis as they are less common. In this work we present a proof of principle high-dimensional time-phase BB84 QKD experiment using only one single-photon detector per measurement basis. We employ the temporal Talbot effect to detect QKD symbols in the control basis, and show experimentally-obtained simplistic key rates for the two-dimensional and four-dimensional case, including in an urban fiber network. We present a comparison of a simplistic secret key rate obtained from a standard security proof with the one derived from a recently devised proof using a tunable beam splitter to display security issues stemming from asymmetric detection efficiencies in the two bases. Our results contribute to the discussion of the benefits of high-dimensional encoding and highlight the impact of security analysis on the achievable QKD performance.

quant-ph↗

arXiv2025

Multiplexed multipartite quantum repeater rates in the stationary regime

Multipartite quantum repeaters play an important role in quantum communication networks enabling the transmission of quantum information over larger distances. To increase the rates for multipartite entanglement distribution, multiplexing of quantum memories is included. Understanding the limitations of achievable rates in the stationary regime for different network sizes is a fundamental step to comprehend scalability of quantum networks. This work investigates the behavior of the multipartite quantum repeater rate (i.e., the number of GHZ states generated per round and per memory) in the stationary regime in multipartite star graphs with a single central multipartite quantum repeater including multiplexing using Markov chains. We derive a closed-form expression for the stationary rate depending on the network size. We support our results with numerical simulations. Further, we show that the rate saturates for large number of memories. On an abstract level, the mathematical description is equivalent to quantum repeater chains between two parties. Therefore, our results also apply to those setups.

quant-ph↗

arXiv2025

Quantum Key Distribution with Basis-Dependent Detection Probability

Quantum Key Distribution (QKD) is a promising technology for secure communication. Nevertheless, QKD is still treated with caution in certain contexts due to potential gaps between theoretical models and actual QKD implementations. A common assumption in security proofs is that the detection probability at the receiver, for a given input state, is independent of the measurement basis, which might not always be verified and could lead to security loopholes. This paper presents a security proof for QKD protocols that does not rely on the above assumption and is thus applicable in scenarios with detection probability mismatches, even when induced by the adversary. We demonstrate, through simulations, that our proof can extract positive key rates for setups vulnerable to large detection probability mismatches. This is achieved by monitoring whether an adversary is actively exploiting such vulnerabilities, instead of considering the worst-case scenario as in previous proofs. Our work highlights the importance of accounting for basis-dependent detection probabilities and provides a concrete solution for improving the security of practical QKD systems.

quant-ph↗

arXiv2025

No quantum advantage without classical communication: fundamental limitations of quantum networks

Quantum networks connect systems at separate locations via quantum links, enabling a wide range of quantum information tasks between distant parties. Large-scale networks have the potential to enable global secure communication, distributed quantum computation, enhanced clock synchronization, and high-precision multiparameter metrology. For the optimal development of these technologies, however, it is essential to identify the necessary resources and sub-routines that will lead to the quantum advantage, but this is demanding even for the simplest protocols in quantum information processing. Here we show that quantum networks relying on the long-distance distribution of bipartite entanglement, combined with local operations and shared randomness, cannot achieve a relevant quantum advantage. Specifically, we prove that these networks do not help in preparing resourceful quantum states such as Greenberger-Horne-Zeilinger states or cluster states, despite the free availability of long-distance entanglement. At an abstract level, our work points towards a fundamental difference between bipartite and multipartite entanglement. From a practical perspective, our results highlight the need for classical communication combined with quantum memories to fully harness the power of quantum networks.

quant-ph↗

arXiv2024

Bound entangled Bell diagonal states of unequal local dimensions, and their witnesses

Bell diagonal states constitute a well-studied family of bipartite quantum states that arise naturally in various contexts in quantum information. In this paper we generalize the notion of Bell diagonal states to the case of unequal local dimensions and investigate their entanglement properties. We extend the family of entanglement criteria of Sarbicki et al. to non-Hermitian operator bases to construct entanglement witnesses for the class of generalized Bell diagonal states. We then show how to optimize the witnesses with respect to noise robustness. Finally, we use these witnesses to construct bound entangled states that are not detected by the usual computable cross norm or realignment and de Vicente criteria.

quant-ph↗

arXiv2023

Complete characterization of quantum correlations by randomized measurements

The fact that quantum mechanics predicts stronger correlations than classical physics is an essential cornerstone of quantum information processing. Indeed, these quantum correlations are a valuable resource for various tasks, such as quantum key distribution or quantum teleportation, but characterizing these correlations in an experimental setting is a formidable task, especially in scenarios where no shared reference frames are available. By definition, quantum correlations are reference-frame independent, i.e., invariant under local transformations; this physically motivated invariance implies, however, a dedicated mathematical structure and, therefore, constitutes a roadblock for an efficient analysis of these correlations in experiments. Here we provide a method to directly measure any locally invariant property of quantum states using locally randomized measurements, and we present a detailed toolbox to analyze these correlations for two quantum bits. We implement these methods experimentally using pairs of entangled photons, characterizing their usefulness for quantum teleportation and their potential to display quantum nonlocality in its simplest form. Our results can be applied to various quantum computing platforms, allowing simple analysis of correlations between arbitrary distant qubits in the architecture.

quant-ph↗

arXiv2023

Shor-Laflamme distributions of graph states and noise robustness of entanglement

The Shor-Laflamme distribution (SLD) of a quantum state is a collection of local unitary invariants that quantify $k$-body correlations. We show that the SLD of graph states can be derived by solving a graph-theoretical problem. In this way, the mean and variance of the SLD are obtained as simple functions of efficiently computable graph properties. Furthermore, this formulation enables us to derive closed expressions of SLDs for some graph state families. For cluster states, we observe that the SLD is very similar to a binomial distribution, and we argue that this property is typical for graph states in general. Finally, we derive an SLD-based entanglement criterion from the purity criterion and apply it to derive meaningful noise thresholds for entanglement. Our new entanglement criterion is easy to use and also applies to the case of higher-dimensional qudits. In the bigger picture, our results foster the understanding both of quantum error-correcting codes, where a closely related notion of Shor-Laflamme distributions plays an important role, and of the geometry of quantum states, where Shor-Laflamme distributions are known as sector length distributions.

quant-ph↗

arXiv2023

Experimental verification of bound and multiparticle entanglement with the randomized measurement toolbox

In recent years, analysis methods for quantum states based on randomized measurements have been investigated extensively. Still, in the experimental implementations these methods were typically used for characterizing strongly entangled states and not to analyze the different families of multiparticle or weakly entangled states. In this work, we experimentally prepare various entangled states with path-polarization hyper-entangled photon pairs, and study their entanglement properties using the full toolbox of randomized measurements. First, we successfully characterize the correlations of a series of GHZ-W mixed states using the second moments of the random outcomes, and demonstrate the advantages of this method by comparing it with the well-known three-tangle and squared concurrence. Second, we generate bound entangled chessboard states of two three-dimensional systems and verify their weak entanglement with a criterion derived from moments of randomized measurements.

quant-ph↗

arXiv2023

Continuity of robustness measures in quantum resource theories

Robustness measures are increasingly prominent resource quantifiers that have been introduced for quantum resource theories such as entanglement and coherence. Despite the generality of these measures, their usefulness is hindered by the fact that some of their mathematical properties remain unclear, especially when the set of resource-free states is non-convex. In this paper, we investigate continuity properties of different robustness functions. We show that their continuity depends on the shape of the set of free states. In particular, we demonstrate that in many cases, star-convexity is sufficient for Lipschitz-continuity of the robustness, and we provide specific examples of sets leading to non-continuous measures. Finally, we illustrate the applicability of our results by defining a robustness of teleportability and of quantum discord.

quant-ph↗