Quantum entanglement is a key physical resource in quantum information processing that allows for performing basic quantum tasks such as teleportation and quantum key distribution, which are impossible in the classical world. Ever since the rise of quantum information theory, it has been an open problem to quantify entanglement in an information-theoretically meaningful way. In particular, every previously defined entanglement measure bearing a precise information-theoretic meaning is not known to be efficiently computable, or if it is efficiently computable, then it is not known to have a precise information-theoretic meaning. In this Letter, we meet this challenge by introducing an entanglement measure that has a precise information-theoretic meaning as the exact cost required to prepare an entangled state when two distant parties are allowed to perform quantum operations that completely preserve the positivity of the partial transpose. Additionally, this entanglement measure is efficiently computable by means of a semidefinite program, and it bears a number of useful properties such as additivity and faithfulness. Our results bring key insights into the fundamental entanglement structure of arbitrary quantum states, and they can be used directly to assess and quantify the entanglement produced in quantum-physical experiments.
Quantum entanglement is a key physical resource in quantum information processing that allows for performing basic quantum tasks such as teleportation and quantum key distribution, which are impossible in the classical world. Ever since the rise of quantum information theory, it has been an open problem to quantify entanglement in an information-theoretically meaningful way. In particular, every previously defined entanglement measure bearing a precise information-theoretic meaning is not known to be efficiently computable, or if it is efficiently computable, then it is not known to have a precise information-theoretic meaning. In this Letter, we meet this challenge by introducing an entanglement measure that has a precise information-theoretic meaning as the exact cost required to prepare an entangled state when two distant parties are allowed to perform quantum operations that completely preserve the positivity of the partial transpose. Additionally, this entanglement measure is efficiently computable by means of a semidefinite program, and it bears a number of useful properties such as additivity and faithfulness. Our results bring key insights into the fundamental entanglement structure of arbitrary quantum states, and they can be used directly to assess and quantify the entanglement produced in quantum-physical experiments.
Quantum information theory is plagued by the problem of regularizations, which require the evaluation of formidable asymptotic quantities. This makes it computationally intractable to gain a precise quantitative understanding of the ultimate efficiency of key operational tasks such as entanglement manipulation. Here, we consider the problem of computing the asymptotic entanglement cost of preparing noisy quantum states under quantum operations with positive partial transpose (PPT). By means of an analytical example, a previously claimed solution to this problem is shown to be incorrect. Building on a previous characterization of the PPT entanglement cost in terms of a regularized formula, we construct instead a hierarchy of semidefinite programs that bypasses the issue of regularization altogether, and converges to the true asymptotic value of the entanglement cost. Our main result establishes that this convergence happens exponentially fast, thus yielding an efficient algorithm that approximates the cost up to an additive error ϵ in time poly(D,log(1/ϵ)), where D is the underlying Hilbert space dimension. To our knowledge, this is the first time that an asymptotic entanglement measure is shown to be efficiently computable despite no closed-form formula being available.
Quantifying the minimum entanglement needed to prepare quantum states and implement quantum processes is a key challenge in quantum information theory. In this Letter, we develop computable and faithful lower bounds on the entanglement cost under quantum operations that completely preserve the positivity of partial transpose (PPT operations), by introducing the generalized divergence of k-negativity, a generalization of logarithmic negativity. Our bounds are efficiently computable via semidefinite programming and provide nontrivial values for all states that are non-PPT (NPT), establishing their faithfulness for the resource theory of NPT entanglement. Notably, we find and affirm the irreversibility of asymptotic entanglement manipulation under PPT operations for full-rank entangled states. Furthermore, we extend our methodology to derive lower bounds on the entanglement cost of both point-to-point and bipartite quantum channels. Our bound demonstrates improvements over previously known computable bounds for a wide range of quantum states and channels. These findings push the boundaries of understanding the structure of entanglement and the fundamental limits of entanglement manipulation.
Abstract Entanglement is a striking feature of quantum mechanics, and it has a key property called unextendibility. In this paper, we present a framework for quantifying and investigating the unextendibility of general bipartite quantum states. First, we define the unextendible entanglement, a family of entanglement measures based on the concept of a state-dependent set of free states. The intuition behind these measures is that the more entangled a bipartite state is, the less entangled each of its individual systems is with a third party. Second, we demonstrate that the unextendible entanglement is an entanglement monotone under two-extendible quantum operations, including local operations and one-way classical communication as a special case. Normalization and faithfulness are two other desirable properties of unextendible entanglement, which we establish here. We further show that the unextendible entanglement provides efficiently computable benchmarks for the rate of exact entanglement or secret key distillation, as well as the overhead of probabilistic entanglement or secret key distillation.
Quantum states and measurements are two central physical objects in the theory of quantum mechanics. The preparation, control and measurement of quantum states lies at the heart of modern quantum information processing protocols ranging from secure communication to quantum computation and precision sensing. And yet, the reliable operation of these advanced protocols ultimately rests on a far more essential prerequisite - our ability to calibrate, certify and benchmark the quantum states we prepare and the quantum measurements we perform. Quantum information theory provides a natural framework for these tasks, meaningfully connecting the resources we expend for characterisation with the accuracy and precision we can expect in return. While decades of advances in quantum information have refined our understanding of quantum characterisation and sharpened our practical ability to calibrate with enhanced precision, important questions about the fundamental limits of quantum characterisation remain unanswered. Although incorporating entanglement at the measurement stage is known to enhance the estimation of unknown quantum states, the extent of this improvement remains poorly understood. This leaves open a fundamental question on the utility of complex entangling measurement strategies, impeding progress towards bridging the significant gap between practically achievable precision and the ultimate theoretical quantum limit. Complementary to quantum state estimation, which is relatively well-established in theory and practice, the characterisation of quantum measurements lacks a rigorous information-theoretic foundation, leading to a dearth of principled benchmarks and provably optimal strategies despite growing experimental interest. This thesis develops and applies information-theoretic tools to answer questions in quantum characterisation, with an eye to enabling practical improvements beyond current techniques in the field. First, we introduce a computable measure of entanglement enhancement for quantum state estimation and study its variation across general multi-parameter estimation problems for higher-dimensional quantum states. We show that the entanglement enhancement is maximised for full qudit state tomography but grows only linearly with system dimension even when allowing an asymptotically large number of entangling operations. Our proposed tight upper bound to entanglement enhancement therefore constitutes a strong limitation on the utility of such entangling measurements. Next, we formulate the dual problem of quantum detector estimation, developing a comprehensive framework for maximally precise calibration centred around a newly introduced quantity - the detector quantum Fisher information. This information-theoretic measure stipulates the ultimate precision attainable for measurement calibration and identifies the optimal input states that achieve this precision. Further, our framework enables the first provably optimal detector estimation experiment and reveals the scope for entanglement-based enhancements, thereby placing measurement characterisation on equal footing with state characterisation. Considered together, these results suggest two contrasting conclusions about quantum characterisation. On the one hand, they show that for quantum state estimation, increasingly powerful entangling measurements offer only diminishing returns at the ultimate precision limit. On the other hand, they highlight practical quantum advantages available for detector estimation by providing a framework that can improve calibration performance and guide future experimental design. More broadly, these results complete and advance the triad of state, process, and detector characterisation, positioning quantum information measures as not merely abstract bounds, but practical guides for deciding when complex quantum resources are genuinely worth deploying and where near-term quantum advantages are most likely to be realised.
Abstract The precise quantification of the limits to manipulating quantum resources lies at the core of quantum information theory. However, standard information-theoretic analyses do not consider the actual computational complexity involved in performing certain tasks. Here we address this issue within the realm of entanglement theory, finding that accounting for computational efficiency substantially changes what can be achieved using entangled resources. We consider two key figures of merit: the computational distillable entanglement and the computational entanglement cost. These measures quantify the optimal rates of entangled bits that can be extracted from or used to dilute many identical copies of n -qubit bipartite pure states, using computationally efficient local operations and classical communication. We demonstrate that computational entanglement measures diverge considerably from their information-theoretic counterparts. Whereas the information-theoretic distillable entanglement is determined by the von Neumann entropy of the reduced state, we show that the min-entropy governs the computationally efficient setting. On the other hand, computationally efficient entanglement dilution requires maximal consumption of entangled bits, even for nearly unentangled states. Furthermore, in the worst-case scenario, even when an efficient description of the state exists and is fully known, one gains no advantage over state-agnostic protocols. Our findings establish sample-complexity bounds for measuring and testing the von Neumann entropy, fundamental limitations on efficient state compression and efficient local tomography protocols.
Entanglement is one of the most fascinating features of quantum theory, as it fundamentally distinguishes quantum systems from classical systems. It not only might play a role in natural processes, but provides an especially powerful resource for a plethora of quantum information protocols, including quantum state teleportation, superdense coding as well as quantum computation schemes. However, for larger systems involving more than two parties, it is a challenging task to verify and characterize entanglement. In this thesis, efficient means for detecting genuine multipartite entanglement in multiqubit quantum systems will be derived, demonstrated, and discussed. Beyond that, methods for quantum state and process tomography will be introduced, which allow to analyze and investigate prepared multipartite states or even the performance of whole setups. Some typical obstacles for reliable state tomography will be pointed out, together with new means to understand experimentally obtained data. Finally, the measurement problem, which describes the unavoidable backaction of a measurement process to the quantum state under investigation, will be illustrated. Together with the discussion of different methods of quantum measurements, the optimal measurement instruments for binary qubit measurements will be derived. These optimal measurement instruments allow to perform a quantum measurement, providing a tunable amount of information about the quantum state, while avoiding any unnecessary disturbance to the state. This set of optimal instruments will be compared to other measurement schemes, such as measurements based on the optimal quantum cloning protocol.