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

arXiv:quant-ph/0306009 · Journal of Physics A Mathematical and General

Entanglement cost of antisymmetric states and additivity of capacity of some quantum channels

Keiji Matsumoto, Fumitaka Yura

Published Mar 29, 2004• 48 citations
arXivHTMLPDF

Abstract

We study the entanglement cost of the states in the antisymmetric space, which consists of ( d − 1) d -dimensional systems. The cost is always log 2 ( d − 1) ebits when the state is divided into bipartite . Combined with the arguments in [6], additivity of channel capacity of some quantum channels is also shown.
DOI
10.1088/0305-4470/37/15/l03

Related papers

Entanglement Cost of Contragredient States and Additivity of Capacity of Some Quantum Channel

Keiji Matsumoto, Fumitaka Yura

We study the entanglement cost of the states in the contragredient space, which consists of $(d-1)$ $d$-dimensional systems. The cost is always $\\log_2 (d-1)$ ebits when the state is divided into bipartite $\\C^d \\otimes (\\C^d)^{d-2}$. Combined with the arguments in \\cite{Matsumoto02}, additivity of channel capacity of some quantum channels is also shown.

•Jun 2, 2003•0 citations

Lower Bound for entanglement cost of antisymmetric states

Toshiyuki Shimono

This report gives a lower bound of entanglement cost for antisymmetric states of bipartite d-level systems to be log_2 (d/(d-1)) ebit (for d=3, E_c >= 0.585...). The paper quant-ph/0112131 claims that the value is equal to one ebit for d=3, since all of the eigenvalues of reduced matrix of any pure states living in N times tensor product of antisymmetric space is not greater than 2^(-N) thus the von Neumann entropy is not less than N, but the proof is not true. Hence whether the value is equal to or less than one ebit is not clear at this moment.

arXiv:quant-ph/0203039•Mar 8, 2002•8 citations

Entanglement cost of three-level antisymmetric states

Fumitaka Yura

We show that the entanglement cost of the three-dimensional antisymmetric states is one ebit.

arXiv:quant-ph/0302163•Journal of Physics A Mathematical and General•Apr 2, 2003•22 citations

The entanglement cost of the antisymmetric state is one ebit: Sharp purity bounds for tensor products of antisymmetric pairs

Matthew Liston

This preprint proves a sharp purity bound for arbitrary complex pure states in tensor products of antisymmetric pair spaces, across the physical cut consisting of the first system from each pair versus the second system from each pair. For every finite number m of pairs and local dimensions at least two, purity is at most 2^(-m) and entanglement entropy is at least m bits, with equality characterized by products of normalized decomposable two-forms. It derives entanglement of formation m for m copies of the normalized antisymmetric state and, using the published regularization theorem, entanglement cost one ebit for every local dimension at least two. The archive provides original formal sources and a precise account of their scope; it does not claim a complete Lean translation of every ordinary LOCC execution. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The inherited QICLean SchattenNorm helper retains Apache 2.0 and its original attribution. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.

•Oct 22, 2026•0 citations

One-shot static entanglement cost of bipartite quantum channels

Ho-Joon Kim, Soojoon Lee

We first investigate the one-shot static entanglement cost to simulate a bipartite quantum channel under the set of nonentangling channels. The lower bound on the one-shot static entanglement cost is given by the generalized robustness of the target channel as well as the robust-generating power of the channel, which implies that the cost necessary to generate a bipartite quantum channel might not be retrievable in general. Next, we conceive a set of quantum channels that extends the set of nonentangling channels. We find out that the one-shot static entanglement cost under the extended set of channels is given by the channel's standard log-robustness. This quantity also gives the one-shot dynamic entanglement cost under a set of free superchannels that do not generate a dynamic entanglement resource; the extended set is shown to be equivalent to the set of free superchannels.

arXiv:2103.10014•Physical Review A•Jun 15, 2021•3 citations

Entanglement Cost of Quantum Channels

Mario Berta, Fernando G. S. L. Brandão, Matthias Christandl +1 more

The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender and receiver) is needed in order to simulate many copies of a quantum channel in the presence of free classical communication. In this paper, we show how to express this quantity as a regularized optimization of the entanglement formation over states that can be generated between sender and receiver. Our formula is the channel analog of a well-known formula for the entanglement cost of quantum states in terms of the entanglement of formation and shares a similar relation to the recently shattered hope for additivity. The entanglement cost of a quantum channel can be seen as the analog of the quantum reverse Shannon theorem in the case where free classical communication is allowed. The techniques used in the proof of our result are then also inspired by a recent proof of the quantum reverse Shannon theorem and feature the one-shot formalism for quantum information theory, the postselection technique for quantum channels as well as Sion's minimax theorem. We discuss two applications of our result. First, we are able to link the security in the noisy-storage model to a problem of sending quantum rather than classical information through the adversary's storage device. This not only improves the range of parameters where security can be shown, but also allows us to prove security for storage devices for which no results were known before. Second, our result has consequences for the study of the strong converse quantum capacity. Here, we show that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.

arXiv:1108.5357•IEEE Transactions on Information Theory•Jul 10, 2013•82 citations
We study the entanglement cost of the states in the contragredient space, which consists of (d−1)(d-1)(d−1) ddd-dimensional systems. The cost is always log2(d−1)\\log_2 (d-1)log2​(d−1) ebits when the state is divided into bipartite Cdotimes(Cd)d−2\\C^d \\otimes (\\C^d)^{d-2}Cdotimes(Cd)d−2. Combined with the arguments in \\cite{Matsumoto02}, additivity of channel capacity of some quantum channels is also shown.
This report gives a lower bound of entanglement cost for antisymmetric states of bipartite d-level systems to be log_2 (d/(d-1)) ebit (for d=3, E_c >= 0.585...). The paper quant-ph/0112131 claims that the value is equal to one ebit for d=3, since all of the eigenvalues of reduced matrix of any pure states living in N times tensor product of antisymmetric space is not greater than 2^(-N) thus the von Neumann entropy is not less than N, but the proof is not true. Hence whether the value is equal to or less than one ebit is not clear at this moment.
This preprint proves a sharp purity bound for arbitrary complex pure states in tensor products of antisymmetric pair spaces, across the physical cut consisting of the first system from each pair versus the second system from each pair. For every finite number m of pairs and local dimensions at least two, purity is at most 2^(-m) and entanglement entropy is at least m bits, with equality characterized by products of normalized decomposable two-forms. It derives entanglement of formation m for m copies of the normalized antisymmetric state and, using the published regularization theorem, entanglement cost one ebit for every local dimension at least two. The archive provides original formal sources and a precise account of their scope; it does not claim a complete Lean translation of every ordinary LOCC execution. Research directed and curated by Matthew Liston. The mathematics, proofs, formalization and manuscript preparation substantially involve AI systems; paper-specific attribution and checking limits are disclosed in the paper and archive. No independent human proof verification, external endorsement or peer review is claimed. Licensing: original manuscript and documentation CC BY 4.0; original code MIT. The inherited QICLean SchattenNorm helper retains Apache 2.0 and its original attribution. The archive provides the exact file-level license mapping. Manuscript revision: 22 October 2026. Research director's note — Matthew Liston: This project is motivated by philosophical exploration and curiosity about AI-assisted research. My aim in sharing these results is to make them available for scrutiny, correction and further development, so that others can build on whatever proves useful to mathematics and science. Correspondence: atemporalwalk@gmail.com.
We first investigate the one-shot static entanglement cost to simulate a bipartite quantum channel under the set of nonentangling channels. The lower bound on the one-shot static entanglement cost is given by the generalized robustness of the target channel as well as the robust-generating power of the channel, which implies that the cost necessary to generate a bipartite quantum channel might not be retrievable in general. Next, we conceive a set of quantum channels that extends the set of nonentangling channels. We find out that the one-shot static entanglement cost under the extended set of channels is given by the channel's standard log-robustness. This quantity also gives the one-shot dynamic entanglement cost under a set of free superchannels that do not generate a dynamic entanglement resource; the extended set is shown to be equivalent to the set of free superchannels.
The entanglement cost of a quantum channel is the minimal rate at which entanglement (between sender and receiver) is needed in order to simulate many copies of a quantum channel in the presence of free classical communication. In this paper, we show how to express this quantity as a regularized optimization of the entanglement formation over states that can be generated between sender and receiver. Our formula is the channel analog of a well-known formula for the entanglement cost of quantum states in terms of the entanglement of formation and shares a similar relation to the recently shattered hope for additivity. The entanglement cost of a quantum channel can be seen as the analog of the quantum reverse Shannon theorem in the case where free classical communication is allowed. The techniques used in the proof of our result are then also inspired by a recent proof of the quantum reverse Shannon theorem and feature the one-shot formalism for quantum information theory, the postselection technique for quantum channels as well as Sion's minimax theorem. We discuss two applications of our result. First, we are able to link the security in the noisy-storage model to a problem of sending quantum rather than classical information through the adversary's storage device. This not only improves the range of parameters where security can be shown, but also allows us to prove security for storage devices for which no results were known before. Second, our result has consequences for the study of the strong converse quantum capacity. Here, we show that any coding scheme that sends quantum information through a quantum channel at a rate larger than the entanglement cost of the channel has an exponentially small fidelity.