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

One ebit is necessary and sufficient for the elegant joint measurement

Yuxuan Zhang

Published Nov 9, 2026• 0 citations
Publisher

Abstract

We determine the exact pure-state entanglement cost of deterministic LOCC implementation of the elegant joint measurement, with classical outcome output. The lower bound applies to arbitrary finite Schmidt rank and is matched by the one-ebit teleportation protocol. This deposit preserves the website manuscript, version 1.0, dated 9 November 2026. Author: Yuxuan Zhang (no affiliation listed). The manuscript is a complete proof candidate, with internal analytical review and a fresh-context same-model audit; it has not received independent expert or formal verification. No claim of confirmed priority is made. Website manuscript and supporting material: https://yuxuanzhang1995.github.io/agentic-research/elegant-joint-measurement-cost/QIQC original: https://qiqc-op.com/problem/op_d40d1f65b5aaaefd/

DOI
10.5281/zenodo.24191211

Related papers

Nineteen qubits are necessary and sufficient for symmetric quantum codes correcting two errors

Yuxuan Zhang

We determine the minimum length of a two-dimensional code in the fully symmetric subspace of qubits that corrects arbitrary errors on two qubits. The manuscript excludes every length at most eighteen, including complex and degenerate codes, and combines the lower bound with the existing nineteen-qubit construction of Aydin, Alekseyev and Barg. The new boundary claim is the exclusion at length eighteen; the shorter-length scalar bounds are attributed to previous work. This deposit preserves the website manuscript, version 1.0, dated 10 November 2026, by Yuxuan Zhang. Internal analytical review, exact certificates and a fresh-context same-model audit are available; independent expert verification and exhaustive priority confirmation have not been completed. Website and reproduction package: https://yuxuanzhang1995.github.io/agentic-research/symmetric-two-error-code-length/QIQC original: https://qiqc-op.com/problem/op_a72722e455d85d55/

•Nov 10, 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

Agentic Proofs for QIQC: Collected Manuscripts

Yuxuan Zhang

A versioned collection of twenty-one distinct AI-assisted research manuscripts on quantum information and quantum computation. Each manuscript is supplied as a separate PDF, identified by title, author, date, scope, website and QIQC report in README.md and MANUSCRIPTS.json. Sources for manuscripts 1–20 remain in sources-and-verification.zip; the new Chernoff manuscript's source and checking records are in chernoff-two-pass-source.zip. Collection version 1.3, 16 October 2026. This version adds Yuxuan Zhang, Two-pass local measurements beat the measured Chernoff exponent, manuscript version 1.0, 16 October 2026, 10 pages, file chernoff-two-pass.pdf. Theorem 1 gives faithful noncommuting four-dimensional states and a two-pass copywise LOCC counterexample to the universal equality in Eq. (4): the measured Chernoff exponent is below 0.677144, while the displayed protocol's exact exponent exceeds 0.68250256. The optimal unrestricted LOCC and SEP exponents, convergence of their optimal exponent sequences, and possible equality between the two classes remain unresolved. All twenty earlier manuscript PDFs and the earlier source archive are unchanged. Human and AI contributions. The author set the research directions, designed the harness that coordinated model tasks, tools, memory, and checking, supplied physical and mathematical intuitions and proof skeletons, and guided the development and revision of the research ideas. AI models developed detailed candidate arguments and derivations, searched the literature, wrote and ran computational checks, and drafted and revised the manuscripts under this supervision. This is an independently authored collection, not an official publication of the QIQC catalog. Archival publication does not establish novelty, external proof validation or catalog acceptance. Individual verification qualifications remain in each manuscript and index. Background references are distinguished from the manuscripts reporting the results. Withdrawn partial results and research logs are excluded. The eleven-qubit manuscript retains its individual DOI, 10.5281/zenodo.22968593. Prefer that individual DOI when citing that manuscript alone. Research website: https://yuxuanzhang1995.github.io/agentic-research/

•Sep 26, 2026•1 citation

Classical Communication in BB84 Monogamy Games: Perfect Recovery and One-Message Bounds

Jonathan chadbourne

We study how one classical message sent after a public basis reveal changes the probability that two separated holders of quantum side information both recover the same complete BB84 outcome string. The model permits arbitrary finite-dimensional prior entanglement and excludes quantum transmission after the split. Communication is charged using a worst-case integer alphabet-cost convention. For every n ≥ 1, the optimal one-message success probability with n−1 bits is exactly cos²(π/8). More generally, message-dependent projector-overlap bounds combine complementary basis pairs with all XOR shifts, recover the established zero-communication endpoint, and yield an integer bounded-error converse. For joint full-string failure below 1−cos²(π/8), the minimum one-message budget remains n bits. The exact perfect-recovery cost under finite-round classical interaction is included as a baseline consequence of established uncertainty and message-accounting tools. The general one-message interior frontier, including the exact (3,1) value, and a general interactive bounded-error extension remain open. No cryptographic security reduction, laboratory implementation or certified semidefinite-program improvement is claimed. This v1.0 preprint preserves the mathematical content of the October 9, 2026 revision and updates its public presentation. An earlier version received external human review recommending major revision; the revised manuscript has not yet been reassessed by that reviewer, and no journal acceptance is claimed. Generative-AI assistance is disclosed in the paper. The supplement provides manuscript source, consistency-check scripts, recorded outputs and reproduction instructions. Those checks do not replace the analytic proofs or constitute independent scientific validation. Copyright © 2026 Jonathan Matthew Chadbourne. The manuscript PDF, LaTeX source, documentation, and result files are licensed under Creative Commons Attribution 4.0 International (CC BY 4.0): https://creativecommons.org/licenses/by/4.0/. The files checks/step1/verify_bounds.py and checks/step2/verify_bounded_error.py in the supplement are licensed under the MIT License: https://opensource.org/license/MIT. Each license applies only to the files specified here.

•Nov 13, 2026•0 citations

Entanglement requirements for implementing bipartite unitary operations

Dan Stahlke, Robert B. Griffiths

We prove, using a method based on map-state duality, lower bounds on entanglement resources needed to deterministically implement a bipartite unitary using separable (SEP) operations, which include LOCC (local operations and classical communication) as a particular case. It is known that the Schmidt rank of an entangled pure state resource cannot be less than the Schmidt rank of the unitary. We prove that if these ranks are equal the resource must be uniformly (maximally) entangled: equal nonzero Schmidt coefficients. Higher rank resources can have less entanglement: we have found numerical examples of Schmidt rank 2 unitaries, which can be deterministically implemented, by either SEP or LOCC, using an entangled resource of two qutrits with less than one ebit of entanglement.

arXiv:1104.1652•Physical Review A•Sep 14, 2011•34 citations

Bounds on Instantaneous Nonlocal Quantum Computation

Alvin Gonzales, Eric Chitambar

Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of causality, this simulation succeeds up to local errors that can only be corrected after the parties communicate classically with one another. However, this communication is non-interactive, and it involves just the broadcasting of local measurement outcomes. We refer to this operational paradigm as local operations and broadcast communication (LOBC) to distinguish it from the standard local operations and (interactive) classical communication (LOCC). In this paper, we show that an arbitrary two-qubit gate can be implemented by LOBC with ϵ-error using O(log(1/ϵ)) entangled bits (ebits). This offers an exponential improvement over the best known two-qubit protocols, whose ebit costs behave as O(1/ϵ). We also consider the family of binary controlled gates on dimensions dA⊗ dB. We find that any hermitian gate of this form can be implemented by LOBC using a single shared ebit. In sharp contrast, a lower bound of log dB ebits is shown in the case of generic (i.e. non-hermitian) gates from this family, even when dA= 2. This demonstrates an unbounded gap between the entanglement costs of LOCC and LOBC gate implementation. Whereas previous lower bounds on the entanglement cost for instantaneous nonlocal computation restrict the minimum dimension of the needed entanglement, we bound its entanglement entropy. To our knowledge this is the first such lower bound of its kind.

arXiv:1810.00994•IEEE Transactions on Information Theory•Oct 29, 2019•24 citations
We determine the exact pure-state entanglement cost of deterministic LOCC implementation of the elegant joint measurement, with classical outcome output. The lower bound applies to arbitrary finite Schmidt rank and is matched by the one-ebit teleportation protocol. This deposit preserves the website manuscript, version 1.0, dated 9 November 2026. Author: Yuxuan Zhang (no affiliation listed). The manuscript is a complete proof candidate, with internal analytical review and a fresh-context same-model audit; it has not received independent expert or formal verification. No claim of confirmed priority is made. Website manuscript and supporting material: https://yuxuanzhang1995.github.io/agentic-research/elegant-joint-measurement-cost/QIQC original: https://qiqc-op.com/problem/op_d40d1f65b5aaaefd/
We determine the minimum length of a two-dimensional code in the fully symmetric subspace of qubits that corrects arbitrary errors on two qubits. The manuscript excludes every length at most eighteen, including complex and degenerate codes, and combines the lower bound with the existing nineteen-qubit construction of Aydin, Alekseyev and Barg. The new boundary claim is the exclusion at length eighteen; the shorter-length scalar bounds are attributed to previous work. This deposit preserves the website manuscript, version 1.0, dated 10 November 2026, by Yuxuan Zhang. Internal analytical review, exact certificates and a fresh-context same-model audit are available; independent expert verification and exhaustive priority confirmation have not been completed. Website and reproduction package: https://yuxuanzhang1995.github.io/agentic-research/symmetric-two-error-code-length/QIQC original: https://qiqc-op.com/problem/op_a72722e455d85d55/
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.
A versioned collection of twenty-one distinct AI-assisted research manuscripts on quantum information and quantum computation. Each manuscript is supplied as a separate PDF, identified by title, author, date, scope, website and QIQC report in README.md and MANUSCRIPTS.json. Sources for manuscripts 1–20 remain in sources-and-verification.zip; the new Chernoff manuscript's source and checking records are in chernoff-two-pass-source.zip. Collection version 1.3, 16 October 2026. This version adds Yuxuan Zhang, Two-pass local measurements beat the measured Chernoff exponent, manuscript version 1.0, 16 October 2026, 10 pages, file chernoff-two-pass.pdf. Theorem 1 gives faithful noncommuting four-dimensional states and a two-pass copywise LOCC counterexample to the universal equality in Eq. (4): the measured Chernoff exponent is below 0.677144, while the displayed protocol's exact exponent exceeds 0.68250256. The optimal unrestricted LOCC and SEP exponents, convergence of their optimal exponent sequences, and possible equality between the two classes remain unresolved. All twenty earlier manuscript PDFs and the earlier source archive are unchanged. Human and AI contributions. The author set the research directions, designed the harness that coordinated model tasks, tools, memory, and checking, supplied physical and mathematical intuitions and proof skeletons, and guided the development and revision of the research ideas. AI models developed detailed candidate arguments and derivations, searched the literature, wrote and ran computational checks, and drafted and revised the manuscripts under this supervision. This is an independently authored collection, not an official publication of the QIQC catalog. Archival publication does not establish novelty, external proof validation or catalog acceptance. Individual verification qualifications remain in each manuscript and index. Background references are distinguished from the manuscripts reporting the results. Withdrawn partial results and research logs are excluded. The eleven-qubit manuscript retains its individual DOI, 10.5281/zenodo.22968593. Prefer that individual DOI when citing that manuscript alone. Research website: https://yuxuanzhang1995.github.io/agentic-research/
We study how one classical message sent after a public basis reveal changes the probability that two separated holders of quantum side information both recover the same complete BB84 outcome string. The model permits arbitrary finite-dimensional prior entanglement and excludes quantum transmission after the split. Communication is charged using a worst-case integer alphabet-cost convention. For every n ≥ 1, the optimal one-message success probability with n−1 bits is exactly cos²(π/8). More generally, message-dependent projector-overlap bounds combine complementary basis pairs with all XOR shifts, recover the established zero-communication endpoint, and yield an integer bounded-error converse. For joint full-string failure below 1−cos²(π/8), the minimum one-message budget remains n bits. The exact perfect-recovery cost under finite-round classical interaction is included as a baseline consequence of established uncertainty and message-accounting tools. The general one-message interior frontier, including the exact (3,1) value, and a general interactive bounded-error extension remain open. No cryptographic security reduction, laboratory implementation or certified semidefinite-program improvement is claimed. This v1.0 preprint preserves the mathematical content of the October 9, 2026 revision and updates its public presentation. An earlier version received external human review recommending major revision; the revised manuscript has not yet been reassessed by that reviewer, and no journal acceptance is claimed. Generative-AI assistance is disclosed in the paper. The supplement provides manuscript source, consistency-check scripts, recorded outputs and reproduction instructions. Those checks do not replace the analytic proofs or constitute independent scientific validation. Copyright © 2026 Jonathan Matthew Chadbourne. The manuscript PDF, LaTeX source, documentation, and result files are licensed under Creative Commons Attribution 4.0 International (CC BY 4.0): https://creativecommons.org/licenses/by/4.0/. The files checks/step1/verify_bounds.py and checks/step2/verify_bounded_error.py in the supplement are licensed under the MIT License: https://opensource.org/license/MIT. Each license applies only to the files specified here.
We prove, using a method based on map-state duality, lower bounds on entanglement resources needed to deterministically implement a bipartite unitary using separable (SEP) operations, which include LOCC (local operations and classical communication) as a particular case. It is known that the Schmidt rank of an entangled pure state resource cannot be less than the Schmidt rank of the unitary. We prove that if these ranks are equal the resource must be uniformly (maximally) entangled: equal nonzero Schmidt coefficients. Higher rank resources can have less entanglement: we have found numerical examples of Schmidt rank 2 unitaries, which can be deterministically implemented, by either SEP or LOCC, using an entangled resource of two qutrits with less than one ebit of entanglement.
Instantaneous nonlocal quantum computation refers to a process in which spacelike separated parties simulate a nonlocal quantum operation on their joint systems through the consumption of pre-shared entanglement. To prevent a violation of causality, this simulation succeeds up to local errors that can only be corrected after the parties communicate classically with one another. However, this communication is non-interactive, and it involves just the broadcasting of local measurement outcomes. We refer to this operational paradigm as local operations and broadcast communication (LOBC) to distinguish it from the standard local operations and (interactive) classical communication (LOCC). In this paper, we show that an arbitrary two-qubit gate can be implemented by LOBC with ϵ-error using O(log(1/ϵ)) entangled bits (ebits). This offers an exponential improvement over the best known two-qubit protocols, whose ebit costs behave as O(1/ϵ). We also consider the family of binary controlled gates on dimensions dA⊗ dB. We find that any hermitian gate of this form can be implemented by LOBC using a single shared ebit. In sharp contrast, a lower bound of log dB ebits is shown in the case of generic (i.e. non-hermitian) gates from this family, even when dA= 2. This demonstrates an unbounded gap between the entanglement costs of LOCC and LOBC gate implementation. Whereas previous lower bounds on the entanglement cost for instantaneous nonlocal computation restrict the minimum dimension of the needed entanglement, we bound its entanglement entropy. To our knowledge this is the first such lower bound of its kind.