Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Operational Meaning of Entanglement Entropy in Anyonic Systems

Kohtaro Kato, Fabian Furrer, Mio Murao

Published Oct 15, 2013• 1 citation
OpenAlex

Abstract

We present an information theoretical approach to entanglement in pure bipartite anyonic systems by introducing a proper entanglement measure and link it to optimal distillation and dilution rates. Since the operational meaning of the measure is similar to the entanglement entropy for qubits we call it the anyonic entanglement entropy. It is defined as the asymptotic limit of infinite identical copies of the straightforward generalization of the entanglement entropy to anyonic systems, i.e., the entropy of the reduced state. We then show that in contrast to the qubit case, the asymptotic limit increases the value for anyonic systems by the average logarithm of the quantum dimensions of the state. Together with the established interpretation as the optimal entanglement distillation rates, it implies that by exploiting the anyonic structure higher entanglement conversion rates can be achieved than in qubit systems.

Related papers

Information-theoretical formulation of anyonic entanglement

Kohtaro Kato, Fabian Furrer, Mio Murao

Anyonic systems are modeled by topologically protected Hilbert spaces which obey complex superselection rules restricting possible operations. These Hilbert spaces cannot be decomposed into tensor products of spatially localized subsystems, whereas the tensor product structure is a foundation of the standard entanglement theory. We formulate bipartite entanglement theory for pure anyonic states and analyze its properties as a nonlocal resource for quantum information processing. We introduce a new entanglement measure, asymptotic entanglement entropy (AEE), and show that it characterizes distillable entanglement and entanglement cost similarly to entanglement entropy in conventional systems. AEE depends not only on the Schmidt coefficients but also on the quantum dimensions of the anyons shared by the local subsystems. Moreover, it turns out that AEE coincides with the entanglement gain by anyonic excitations in certain topologically ordered phases.

arXiv:1310.4140•Physical Review A•Dec 17, 2014•12 citations

Catalytic Transformations of Pure Entangled States

Tulja Varun Kondra, Chandan Datta, Alexander Streltsov

Quantum entanglement of pure states is usually quantified via the entanglement entropy, the von Neumann entropy of the reduced state. Entanglement entropy is closely related to entanglement distillation, a process for converting quantum states into singlets, which can then be used for various quantum technological tasks. The relation between entanglement entropy and entanglement distillation has been known only for the asymptotic setting, and the meaning of entanglement entropy in the single-copy regime has so far remained open. Here we close this gap by considering entanglement catalysis. We prove that entanglement entropy completely characterizes state transformations in the presence of entangled catalysts. Our results imply that entanglement entropy quantifies the amount of entanglement available in a bipartite pure state to be used for quantum information processing, giving asymptotic results an operational meaning also in the single-copy setup.

arXiv:2102.11136•Physical Review Letters•Oct 5, 2021•56 citations

Asymptotic Entanglement Manipulation of Bipartite Pure States

Garry Bowen, Nilanjana Datta

Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement manipulation of an asymptotically large number of copies of the bipartite pure state. In this paper, two different asymptotic measures of entanglement for arbitrary sequences of bipartite pure states are established. These are shown to coincideonly whenthe sequence isinformation stable, in terms of the quantum spectral information rates of its corresponding sequence of subsystem states. Additional bounds on the optimal rates of entanglement manipulation protocols in quantum information theory are also presented. These include bounds given by generalizations of the coherent information bounds, Rains' bound, and the relative entropy of entanglement.

arXiv:quant-ph/0610199•IEEE Transactions on Information Theory•Jul 24, 2008•18 citations

Non-Asymptotic Entanglement Distillation

Kun Fang, Xin Wang, Marco Tomamichel +1 more

Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this paper, we study the non-asymptotic fundamental limits for entanglement distillation. We investigate the optimal tradeoff between the distillation rate, the number of prepared states, and the error tolerance. First, we derive the one-shot distillable entanglement under completely positive partial transpose preserving operations as a semidefinite program and demonstrate an exact characterization via the quantum hypothesis testing relative entropy. Second, we establish efficiently computable second-order estimations of the distillation rate for general quantum states. In particular, we provide explicit as well as approximate evaluations for various quantum states of practical interest, including pure states, mixture of Bell states, maximally correlated states, and isotropic states.

arXiv:1706.06221•IEEE Transactions on Information Theory•May 7, 2019•79 citations

Entanglement theory with limited computational resources

Lorenzo Leone, J. Douglas Rizzo, Jens Eisert +1 more

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.

arXiv:2502.12284•Nature Physics•Oct 22, 2025•17 citations

Asymptotic quantification of entanglement with a single copy

Ludovico Lami, Mario Berta, Bartosz Regula

Despite the central importance of quantum entanglement in quantum technologies, understanding the optimal ways to exploit it is still beyond our reach, and even measuring entanglement in an operationally meaningful way is prohibitively difficult. Here we study two fundamental tasks in the processing of entanglement: entanglement testing, which is a quantum state discrimination problem concerned with detecting entanglement in the many-copy regime, and entanglement distillation, which is concerned with purifying entanglement from noisy entangled states. We introduce a way of benchmarking the performance of distillation that focuses on the best achievable error rather than its yield in the asymptotic limit. When the underlying set of operations used for entanglement distillation is the axiomatic class of non-entangling operations, we show that the two figures of merit for entanglement testing and distillation coincide. We solve both problems by proving a generalized quantum Sanov's theorem, which enables the exact evaluation of the asymptotic error rates of composite quantum hypothesis testing. We show in particular that the asymptotic figure of merit is given by the reverse relative entropy of entanglement, a single-letter quantity that can be evaluated using only a single copy of a quantum state-a distinct feature among measures of entanglement that quantify the optimal performance of information-theoretic tasks.

arXiv:2408.07067•Nature Physics•Mar 1, 2026•16 citations
We present an information theoretical approach to entanglement in pure bipartite anyonic systems by introducing a proper entanglement measure and link it to optimal distillation and dilution rates. Since the operational meaning of the measure is similar to the entanglement entropy for qubits we call it the anyonic entanglement entropy. It is defined as the asymptotic limit of infinite identical copies of the straightforward generalization of the entanglement entropy to anyonic systems, i.e., the entropy of the reduced state. We then show that in contrast to the qubit case, the asymptotic limit increases the value for anyonic systems by the average logarithm of the quantum dimensions of the state. Together with the established interpretation as the optimal entanglement distillation rates, it implies that by exploiting the anyonic structure higher entanglement conversion rates can be achieved than in qubit systems.
Anyonic systems are modeled by topologically protected Hilbert spaces which obey complex superselection rules restricting possible operations. These Hilbert spaces cannot be decomposed into tensor products of spatially localized subsystems, whereas the tensor product structure is a foundation of the standard entanglement theory. We formulate bipartite entanglement theory for pure anyonic states and analyze its properties as a nonlocal resource for quantum information processing. We introduce a new entanglement measure, asymptotic entanglement entropy (AEE), and show that it characterizes distillable entanglement and entanglement cost similarly to entanglement entropy in conventional systems. AEE depends not only on the Schmidt coefficients but also on the quantum dimensions of the anyons shared by the local subsystems. Moreover, it turns out that AEE coincides with the entanglement gain by anyonic excitations in certain topologically ordered phases.
Quantum entanglement of pure states is usually quantified via the entanglement entropy, the von Neumann entropy of the reduced state. Entanglement entropy is closely related to entanglement distillation, a process for converting quantum states into singlets, which can then be used for various quantum technological tasks. The relation between entanglement entropy and entanglement distillation has been known only for the asymptotic setting, and the meaning of entanglement entropy in the single-copy regime has so far remained open. Here we close this gap by considering entanglement catalysis. We prove that entanglement entropy completely characterizes state transformations in the presence of entangled catalysts. Our results imply that entanglement entropy quantifies the amount of entanglement available in a bipartite pure state to be used for quantum information processing, giving asymptotic results an operational meaning also in the single-copy setup.
Entanglement of pure states of bipartite quantum systems has been shown to have a unique measure in terms of the von Neumann entropy of the reduced states of either of its subsystems. The measure is established under entanglement manipulation of an asymptotically large number of copies of the bipartite pure state. In this paper, two different asymptotic measures of entanglement for arbitrary sequences of bipartite pure states are established. These are shown to coincideonly whenthe sequence isinformation stable, in terms of the quantum spectral information rates of its corresponding sequence of subsystem states. Additional bounds on the optimal rates of entanglement manipulation protocols in quantum information theory are also presented. These include bounds given by generalizations of the coherent information bounds, Rains' bound, and the relative entropy of entanglement.
Entanglement distillation, an essential quantum information processing task, refers to the conversion from multiple copies of noisy entangled states to a smaller number of highly entangled states. In this paper, we study the non-asymptotic fundamental limits for entanglement distillation. We investigate the optimal tradeoff between the distillation rate, the number of prepared states, and the error tolerance. First, we derive the one-shot distillable entanglement under completely positive partial transpose preserving operations as a semidefinite program and demonstrate an exact characterization via the quantum hypothesis testing relative entropy. Second, we establish efficiently computable second-order estimations of the distillation rate for general quantum states. In particular, we provide explicit as well as approximate evaluations for various quantum states of practical interest, including pure states, mixture of Bell states, maximally correlated states, and isotropic states.
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.
Despite the central importance of quantum entanglement in quantum technologies, understanding the optimal ways to exploit it is still beyond our reach, and even measuring entanglement in an operationally meaningful way is prohibitively difficult. Here we study two fundamental tasks in the processing of entanglement: entanglement testing, which is a quantum state discrimination problem concerned with detecting entanglement in the many-copy regime, and entanglement distillation, which is concerned with purifying entanglement from noisy entangled states. We introduce a way of benchmarking the performance of distillation that focuses on the best achievable error rather than its yield in the asymptotic limit. When the underlying set of operations used for entanglement distillation is the axiomatic class of non-entangling operations, we show that the two figures of merit for entanglement testing and distillation coincide. We solve both problems by proving a generalized quantum Sanov's theorem, which enables the exact evaluation of the asymptotic error rates of composite quantum hypothesis testing. We show in particular that the asymptotic figure of merit is given by the reverse relative entropy of entanglement, a single-letter quantity that can be evaluated using only a single copy of a quantum state-a distinct feature among measures of entanglement that quantify the optimal performance of information-theoretic tasks.