arXiv subjects

Hermann Kampermann

Publications and source records attributed to Hermann Kampermann.

At least 19 recordsLinked to original sources

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

Fundamental limitations on entanglement extraction from purity

States of sufficiently low purity are separable and cannot be entangled by unital (purity-non-generating) operations. Since high-purity states are experimentally demanding, it is natural to ask how much purity a state must possess to enable entanglement generation. Absolutely separable states remain separable under all deterministic unital channels, and so cannot deterministically generate entanglement in this setting. We show, however, that some absolutely separable states can generate entanglement via probabilistic protocols that do not produce purity. This motivates the study of states that fail to generate entanglement with any non-zero probability, which we call completely absolutely separable; we give a full characterization of this class. Along the way, we derive a novel sufficient condition for separability that depends only on the largest and smallest eigenvalues, along with the smallest local dimension and is independent of all previously known spectral separability criteria.

quant-ph↗

arXiv2026

The relative entropy of magic and its nonadditivity

In most stabilizer-based quantum computing schemes, so-called magic states are a necessary resource for implementing non-transversal quantum gates. With the resource theory of magic, it is possible to analyze and quantify the generation of the non-stabilizer states. The relative entropy is a measure used in various resource theories. For single qubits, we characterize magic states and their closest stabilizer states by applying analytical results known from the relative entropy of entanglement and show that the magic states and their closest stabilizer states are arranged symmetrically around the states at the centers of the faces of the stabilizer octahedron. For tensor products of single-qubit states, we prove analytically that the relative entropy of magic is nonadditive in almost all cases.

quant-ph↗

arXiv2026

Bounds on quantum conference key agreement in pair-entangled networks

We investigate the task of conference key agreement in near-term quantum networks, where the nodes are connected by sources of bipartite entangled states, under the class of local operations not requiring quantum memory. We derive upper bounds on the distillable conference key depending on the network topology and degree of entanglement of the sources, and prove tightness of these bounds for some particular cases. In these cases, we show that pairwise bipartite key distillation followed by merging the bipartite keys into the conference key is optimal.

quant-ph↗

arXiv2025

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↗

arXiv2025

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

Spanning-tree-packing protocol for conference key propagation in quantum networks

We consider a network of users connected by pairwise quantum key distribution (QKD) links. Using these pairwise secret keys and public classical communication, the users want to generate a common (conference) secret key at the maximal rate. We propose an algorithm based on spanning-tree packing (a known problem in graph theory) and prove its optimality. This algorithm enables optimal conference key generation in modern quantum networks of arbitrary topology. Additionally, we discuss how it can guide the optimal placement of new bipartite links in the network design.

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 mechanics based on real numbers: A consistent description

Complex numbers play a crucial role in quantum mechanics. However, their necessity remains debated: whether they are fundamental or merely convenient. Recently, it was shown that any real-number quantum theory satisfying certain postulates can be falsified with multipartite experiments. In this Letter we show that a physically motivated postulate about composite quantum systems allows us to construct quantum mechanics based on real numbers that reproduces predictions for all multipartite quantum experiments. Thus, we argue that real-valued quantum mechanics cannot be falsified, and therefore the use of complex numbers is a matter of convenience.

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↗

arXiv2025

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↗

arXiv2024

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↗

arXiv2024

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↗

arXiv2024

Multipartite multiplexing strategies for quantum routers

This work explores the important role of quantum routers in communication networks and investigates the increase in efficiency using memories and multiplexing strategies. Motivated by the bipartite setup introduced by Abruzzo et al. (2013) for finite-range multiplexing in quantum repeaters, we extend the study to an N-partite network with a router as a central station. We present a general protocol for N parties after defining the underlying matching problem and we calculate the router rate for different N. We analyze the improvement due to multiplexing, and analyze the secret key rate with explicit results for the tripartite network. Investigating strategic qubit selection for the GHZ measurements, we show that using cutoffs to remove qubits after a certain number of rounds and consistently combining qubits with the lowest number of storage rounds leads to an optimal secret key rate.

quant-ph↗

arXiv2023

Distributed quantum incompatibility

Incompatible, i.e. non-jointly measurable quantum measurements are a necessary resource for many information processing tasks. It is known that increasing the number of distinct measurements usually enhances the incompatibility of a measurement scheme. However, it is generally unclear how large this enhancement is and on what it depends. Here, we show that the incompatibility which is gained via additional measurements is upper and lower bounded by certain functions of the incompatibility of subsets of the available measurements. We prove the tightness of some of our bounds by providing explicit examples based on mutually unbiased bases. Finally, we discuss the consequences of our results for the nonlocality that can be gained by enlarging the number of measurements in a Bell experiment.

quant-ph↗

arXiv2023

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

Satellite-Based Quantum Key Distribution in the Presence of Bypass Channels

The security of prepare-and-measure satellite-based quantum key distribution (QKD), under restricted eavesdropping scenarios, is addressed. We particularly consider cases where the eavesdropper, Eve, has limited access to the transmitted signal by Alice, and/or Bob's receiver station. This restriction is modeled by lossy channels between Alice/Bob and Eve, where the transmissivity of such channels can, in principle, be bounded by monitoring techniques. An artefact of such lossy channels is the possibility of having {\it bypass} channels, those which are not accessible to Eve, but may not necessarily be characterized by the users either. This creates interesting, unexplored, scenarios for analyzing QKD security. In this paper, we obtain generic bounds on the key rate in the presence of bypass channels and apply them to continuous-variable QKD protocols with Gaussian encoding with direct and reverse reconciliation. We find regimes of operation in which the above restrictions on Eve can considerably improve system performance. We also develop customised bounds for several protocols in the BB84 family and show that, in certain regimes, even the simple protocol of BB84 with weak coherent pulses is able to offer positive key rates at high channel losses, which would otherwise be impossible under an unrestricted Eve. In this case the limitation on Eve would allow Alice to send signals with larger intensities than the optimal value under an ideal Eve, which effectively reduces the effective channel loss. In all these cases, the part of the transmitted signal that does not reach Eve can play a non-trivial role in specifying the achievable key rate. Our work opens up new security frameworks for spaceborne quantum communications systems.

quant-ph↗