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

Catalyst-rank limits for second-order entanglement concentration

Sam Vaseghi

Published Nov 9, 2026• 0 citations
Publisher

Abstract

Exact catalysts can improve the second-order yield of pure-state entanglement concentration, but the optimal yield does not specify how the catalyst must grow. We obtain a necessary rank condition for this improvement. Let the source have a fixed nonuniform finite squared Schmidt vector, with entropy $H$ and information variance $V$ defined using base-two logarithms, and fix a required squared fidelity $q\in(0,1)$. For pure outputs of $n$ source copies, with a pure catalyst returned exactly and uncorrelated, suppose that the target contains $nH+b\sqrt n+o(\sqrt n)$ Bell pairs. If the catalyst rank $K_n$ satisfies $\limsup \log_2K_n/\sqrt n\le c<\infty$, we give an explicit necessary fidelity bound strictly below $e^{-b^2/(2V)}$ for every $b>0$. Consequently, attaining the known unrestricted coefficient $\sqrt{2V\ln(1/q)}$ requires $\log_2K_n/\sqrt n\to\infty$. Catalysts with $\log_2K_n=o(\sqrt n)$ cannot improve the unassisted coefficient. The proof combines a fidelity concentration estimate, a Gaussian limit of the majorization inequalities, and a positive tail term retained by the rank constraint. The record contains a standalone PDF preprint and an accompanying source archive with the LaTeX manuscript, figure files, reproducible Python figure source and build instructions. No experimental dataset is used. The preprint has not undergone journal peer review. AI assistance is disclosed in the manuscript.

DOI
10.5281/zenodo.24074482

Related papers

Entanglement Catalysis Beyond the Asymptotic Rate

Alexander Streltsov

Quantum entanglement is a fundamental resource in quantum information science, commonly consumed to perform tasks like quantum teleportation and quantum key distribution. Entanglement concentration converts partially entangled pure states into nearly perfect Bell pairs. While its efficiency is well understood in the asymptotic limit, practical protocols must operate with finite systems. In this finite regime, and at the low error levels relevant in practice, performance is penalized by corrections that reduce the achievable yield. We investigate whether this fundamental finite-size penalty can be mitigated by an entanglement catalyst: an auxiliary state that aids the transformation but is returned exactly and uncorrupted. Although such a catalyst cannot increase the leading-order asymptotic yield, we show that it fundamentally alters the finite-size scaling. For every bipartite pure state with nonuniform Schmidt coefficients, we exactly determine the optimal second-order correction to the yield and show that catalysis completely overcomes this finite-size penalty.

quant-pharXiv:2610.13602•Oct 12, 2026•0 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

An Equivalence of Entanglement-Assisted Transformation and Multiple-Copy Entanglement Transformation

Runyao Duan, Yuan Feng, Mingsheng Ying

We examine the powers of entanglement-assisted transformation and multiple-copy entanglement transformation. First, we find a sufficient condition of when a given catalyst is useful in producing another specific target state. As an application of this condition, for any non-maximally entangled bipartite pure state and any integer $n$ not less than 4, we are able to explicitly construct a set of $n\times n$ quantum states which can be produced by using the given state as a catalyst. Second, we prove that for any positive integer $k$, entanglement-assisted transformation with $k\times k$-dimensional catalysts is useful in producing a target state if and only if multiple-copy entanglement transformation with $k$ copies of state is useful in producing the same target. Moreover, a necessary and sufficient condition for both of them is obtained in terms of the Schmidt coefficients of the target. This equivalence of entanglement-assisted transformation and multiple-copy entanglement transformation implies many interesting properties of entanglement transformation. Furthermore, these results are generalized to the case of probabilistic entanglement transformations.

arXiv:quant-ph/0404046•Apr 7, 2004•4 citations

The exact catalyst return cost of producing photons in a vacuum signal

Zixuan He

How much must an optical catalyst change when it supplies photons to an initially empty signal? This article gives an exact finite-budget benchmark: a specified unconditional probability of producing a nonvacuum signal requires a minimum disturbance of the entire returned catalyst, even when the output may be correlated. Exact return-error frontier. Let the catalyst have initial mean photon number at most \(E\), while the signal and all other auxiliary ports start in vacuum. A deterministic unitary strongly conserves total photon number. Define \(a\) as the actual, unconditional probability that the output signal is nonvacuum, and \(d_C=\tfrac12\|\tau'_C-\tau_C\|_1\) as the catalyst's return error. For \(0\lt a\le1\) and \(E\ge a\), put \[ m=\left\lfloor\frac{2E}{a}-1\right\rfloor,\qquad F(E,a)=\frac{2[(m+1)a-E]}{m(m+1)}. \] Every allowed process satisfies \(d_C\ge F(E,a)\), and a finite-mode catalyst with a passive cyclic permutation attains equality for every feasible pair \((E,a)\). If \(E\lt a\), the event probability is infeasible; if \(a=0\), the minimum error is zero. The converse covers normal states with photon-number coherence, infinite photon tails, finitely or countably many modes, correlations with an untouched reference, and correlated outputs. The same lower bound holds for the joint catalyst–reference return distance. Equality is a global optimization over the catalyst, its modes, the operation and the reference association, not a guarantee for each preselected catalyst. A convenient consequence is \[ d_C\ge\frac{a^2}{2E-a},\qquad E\ge\frac a2+\frac{a^2}{2d_C}. \] This smooth bound agrees with the exact frontier at the discrete budgets \(E/a=(m+1)/2\). For certain photon production, \(a=1\), a return error of one per cent requires at least 50.5 photons of initial mean catalyst number, and the construction attains this budget. Mechanism and prior work. A common input–output number record preserves the actual source and its conservation law. Every successful event crosses a number threshold, whose lost probability is bounded by the return trace distance. The mean photon budget then limits how this event probability can be distributed across thresholds. Filling the lowest levels first gives the exact piecewise frontier. Energy-ladder shifts, energy-constrained embezzlement and the equal-weight optical queue are established ingredients; the contribution here is the all-process converse and its attained finite-budget frontier for arbitrary event probability. The matching source uses a weighted version of the known queue. What the guarantee means. For a single signal mode with prescribed negative parity \(-\operatorname{Tr}[(-1)^{N_S}\rho'_S]=s\), \(0\lt s\le1\), the exact globally optimized return cost is \(F(E,(1+s)/2)\), with feasibility requiring \(E\ge(1+s)/2\). The attaining permutation transfers negativity already present in the catalyst; it does not create that resource from a Wigner-positive source. The budget counts mean photon number, not a per-run photon cutoff or physical energy at arbitrary unequal mode frequencies. The catalyst loses at least \(a\) photons on average in every allowed process, so a small single-use trace-distance change does not imply cost-free restoration or repeated use. Populated auxiliary inputs and postselected success branches obey different resource conditions. The integrated seven-page PDF contains two figures, the complete proofs and references; its constructions and curves are theoretical, not experimental performance claims.

•Nov 9, 2026•0 citations

Necessary and Sufficient Conditions for the Trumping Relation

S. Turgut

Entanglement catalysis allows one to convert certain entangled states into others by the temporary involvement of another entangled state (so-called catalyst), where after the conversion the catalyst is returned to the same state. For bipartite pure entangled states that can be transformed in this way with unit probability, the respective Schmidt coefficients are said to satisfy the trumping relation, a mathematical relation which is an extension of the majorization relation. This article provides all necessary and sufficient conditions for the trumping relation in terms of the Schmidt coefficients. The coefficients should satisfy strict inequalities for the entropy of entanglement and for power means excluding the special power 1.

arXiv:0707.0444•Jul 3, 2007•16 citations

Spatial resource bounds for classical-communication simulation of controlled momentum-kick statistics

Mikhail Petrov

We study classical-communication simulation of the joint source and probe statistics of a qubit-controlled momentum kick. Competitors retain quantum local matter, arbitrary causal classical memory and two-way communication, but no shared entanglement or quantum communication. For fixed Gaussian probe preparation and specified source preparations and readouts, an explicit local instrument approximates the complete continuous momentum statistics arbitrarily well while preserving branch-control distributions exactly. An independently bounded full output position second moment gives a strictly positive total-variation lower bound against the entire competitor class; the explicit simulator attains the same asymptotic order. At fixed nonzero kick separation, the minimum RMS spatial resource for error d scales as Theta(d^(-1/2)); at fixed relative size greater than one, the minimum error scales as Theta(eta^2) in the weak-kick parameter eta. Fixed finite bins admit exact simulation at sufficiently large finite resource. These are statements about specified readout statistics, not full-channel approximation, a Newtonian realization of the simulator, or demonstrated experimental feasibility. The manuscript discusses conditional routes to independent resource certification. This record contains the preprint, editable LaTeX source and an offline reproducibility archive. The archive reproduces Table 1 and runs 22 computational tests; three project-history tests requiring undistributed materials are explicitly excluded. The preprint has not undergone external peer review. Licensing: the manuscript, documentation and numerical records are licensed under CC BY 4.0; the Python software and tests are licensed under MIT. The archive specifies these separate scopes.

•Sep 17, 2026•0 citations
Exact catalysts can improve the second-order yield of pure-state entanglement concentration, but the optimal yield does not specify how the catalyst must grow. We obtain a necessary rank condition for this improvement. Let the source have a fixed nonuniform finite squared Schmidt vector, with entropy HHH and information variance VVV defined using base-two logarithms, and fix a required squared fidelity q∈(0,1)q\in(0,1)q∈(0,1). For pure outputs of nnn source copies, with a pure catalyst returned exactly and uncorrelated, suppose that the target contains nH+bn+o(n)nH+b\sqrt n+o(\sqrt n)nH+bn​+o(n​) Bell pairs. If the catalyst rank KnK_nKn​ satisfies lim sup⁡log⁡2Kn/n≤c<∞\limsup \log_2K_n/\sqrt n\le c<\inftylimsuplog2​Kn​/n​≤c<∞, we give an explicit necessary fidelity bound strictly below e−b2/(2V)e^{-b^2/(2V)}e−b2/(2V) for every b>0b>0b>0. Consequently, attaining the known unrestricted coefficient 2Vln⁡(1/q)\sqrt{2V\ln(1/q)}2Vln(1/q)​ requires log⁡2Kn/n→∞\log_2K_n/\sqrt n\to\inftylog2​Kn​/n​→∞. Catalysts with log⁡2Kn=o(n)\log_2K_n=o(\sqrt n)log2​Kn​=o(n​) cannot improve the unassisted coefficient. The proof combines a fidelity concentration estimate, a Gaussian limit of the majorization inequalities, and a positive tail term retained by the rank constraint. The record contains a standalone PDF preprint and an accompanying source archive with the LaTeX manuscript, figure files, reproducible Python figure source and build instructions. No experimental dataset is used. The preprint has not undergone journal peer review. AI assistance is disclosed in the manuscript.
Quantum entanglement is a fundamental resource in quantum information science, commonly consumed to perform tasks like quantum teleportation and quantum key distribution. Entanglement concentration converts partially entangled pure states into nearly perfect Bell pairs. While its efficiency is well understood in the asymptotic limit, practical protocols must operate with finite systems. In this finite regime, and at the low error levels relevant in practice, performance is penalized by corrections that reduce the achievable yield. We investigate whether this fundamental finite-size penalty can be mitigated by an entanglement catalyst: an auxiliary state that aids the transformation but is returned exactly and uncorrupted. Although such a catalyst cannot increase the leading-order asymptotic yield, we show that it fundamentally alters the finite-size scaling. For every bipartite pure state with nonuniform Schmidt coefficients, we exactly determine the optimal second-order correction to the yield and show that catalysis completely overcomes this finite-size penalty.
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 examine the powers of entanglement-assisted transformation and multiple-copy entanglement transformation. First, we find a sufficient condition of when a given catalyst is useful in producing another specific target state. As an application of this condition, for any non-maximally entangled bipartite pure state and any integer nnn not less than 4, we are able to explicitly construct a set of n×nn\times nn×n quantum states which can be produced by using the given state as a catalyst. Second, we prove that for any positive integer kkk, entanglement-assisted transformation with k×kk\times kk×k-dimensional catalysts is useful in producing a target state if and only if multiple-copy entanglement transformation with kkk copies of state is useful in producing the same target. Moreover, a necessary and sufficient condition for both of them is obtained in terms of the Schmidt coefficients of the target. This equivalence of entanglement-assisted transformation and multiple-copy entanglement transformation implies many interesting properties of entanglement transformation. Furthermore, these results are generalized to the case of probabilistic entanglement transformations.
How much must an optical catalyst change when it supplies photons to an initially empty signal? This article gives an exact finite-budget benchmark: a specified unconditional probability of producing a nonvacuum signal requires a minimum disturbance of the entire returned catalyst, even when the output may be correlated. Exact return-error frontier. Let the catalyst have initial mean photon number at most EEE, while the signal and all other auxiliary ports start in vacuum. A deterministic unitary strongly conserves total photon number. Define aaa as the actual, unconditional probability that the output signal is nonvacuum, and dC=12∥τC′−τC∥1d_C=\tfrac12\|\tau'_C-\tau_C\|_1dC​=21​∥τC′​−τC​∥1​ as the catalyst's return error. For 0<a≤10\lt a\le10<a≤1 and E≥aE\ge aE≥a, put m=⌊2Ea−1⌋,F(E,a)=2[(m+1)a−E]m(m+1). m=\left\lfloor\frac{2E}{a}-1\right\rfloor,\qquad F(E,a)=\frac{2[(m+1)a-E]}{m(m+1)}. m=⌊a2E​−1⌋,F(E,a)=m(m+1)2[(m+1)a−E]​. Every allowed process satisfies dC≥F(E,a)d_C\ge F(E,a)dC​≥F(E,a), and a finite-mode catalyst with a passive cyclic permutation attains equality for every feasible pair (E,a)(E,a)(E,a). If E<aE\lt aE<a, the event probability is infeasible; if a=0a=0a=0, the minimum error is zero. The converse covers normal states with photon-number coherence, infinite photon tails, finitely or countably many modes, correlations with an untouched reference, and correlated outputs. The same lower bound holds for the joint catalyst–reference return distance. Equality is a global optimization over the catalyst, its modes, the operation and the reference association, not a guarantee for each preselected catalyst. A convenient consequence is dC≥a22E−a,E≥a2+a22dC. d_C\ge\frac{a^2}{2E-a},\qquad E\ge\frac a2+\frac{a^2}{2d_C}. dC​≥2E−aa2​,E≥2a​+2dC​a2​. This smooth bound agrees with the exact frontier at the discrete budgets E/a=(m+1)/2E/a=(m+1)/2E/a=(m+1)/2. For certain photon production, a=1a=1a=1, a return error of one per cent requires at least 50.5 photons of initial mean catalyst number, and the construction attains this budget. Mechanism and prior work. A common input–output number record preserves the actual source and its conservation law. Every successful event crosses a number threshold, whose lost probability is bounded by the return trace distance. The mean photon budget then limits how this event probability can be distributed across thresholds. Filling the lowest levels first gives the exact piecewise frontier. Energy-ladder shifts, energy-constrained embezzlement and the equal-weight optical queue are established ingredients; the contribution here is the all-process converse and its attained finite-budget frontier for arbitrary event probability. The matching source uses a weighted version of the known queue. What the guarantee means. For a single signal mode with prescribed negative parity −Tr⁡[(−1)NSρS′]=s-\operatorname{Tr}[(-1)^{N_S}\rho'_S]=s−Tr[(−1)NS​ρS′​]=s, 0<s≤10\lt s\le10<s≤1, the exact globally optimized return cost is F(E,(1+s)/2)F(E,(1+s)/2)F(E,(1+s)/2), with feasibility requiring E≥(1+s)/2E\ge(1+s)/2E≥(1+s)/2. The attaining permutation transfers negativity already present in the catalyst; it does not create that resource from a Wigner-positive source. The budget counts mean photon number, not a per-run photon cutoff or physical energy at arbitrary unequal mode frequencies. The catalyst loses at least aaa photons on average in every allowed process, so a small single-use trace-distance change does not imply cost-free restoration or repeated use. Populated auxiliary inputs and postselected success branches obey different resource conditions. The integrated seven-page PDF contains two figures, the complete proofs and references; its constructions and curves are theoretical, not experimental performance claims.
Entanglement catalysis allows one to convert certain entangled states into others by the temporary involvement of another entangled state (so-called catalyst), where after the conversion the catalyst is returned to the same state. For bipartite pure entangled states that can be transformed in this way with unit probability, the respective Schmidt coefficients are said to satisfy the trumping relation, a mathematical relation which is an extension of the majorization relation. This article provides all necessary and sufficient conditions for the trumping relation in terms of the Schmidt coefficients. The coefficients should satisfy strict inequalities for the entropy of entanglement and for power means excluding the special power 1.
We study classical-communication simulation of the joint source and probe statistics of a qubit-controlled momentum kick. Competitors retain quantum local matter, arbitrary causal classical memory and two-way communication, but no shared entanglement or quantum communication. For fixed Gaussian probe preparation and specified source preparations and readouts, an explicit local instrument approximates the complete continuous momentum statistics arbitrarily well while preserving branch-control distributions exactly. An independently bounded full output position second moment gives a strictly positive total-variation lower bound against the entire competitor class; the explicit simulator attains the same asymptotic order. At fixed nonzero kick separation, the minimum RMS spatial resource for error d scales as Theta(d^(-1/2)); at fixed relative size greater than one, the minimum error scales as Theta(eta^2) in the weak-kick parameter eta. Fixed finite bins admit exact simulation at sufficiently large finite resource. These are statements about specified readout statistics, not full-channel approximation, a Newtonian realization of the simulator, or demonstrated experimental feasibility. The manuscript discusses conditional routes to independent resource certification. This record contains the preprint, editable LaTeX source and an offline reproducibility archive. The archive reproduces Table 1 and runs 22 computational tests; three project-history tests requiring undistributed materials are explicitly excluded. The preprint has not undergone external peer review. Licensing: the manuscript, documentation and numerical records are licensed under CC BY 4.0; the Python software and tests are licensed under MIT. The archive specifies these separate scopes.