feat(OpenQuantumProblems): Formalization of open quantum problem 35#3491
Open
MarioKrenn6240 wants to merge 3 commits intogoogle-deepmind:mainfrom
Open
feat(OpenQuantumProblems): Formalization of open quantum problem 35#3491MarioKrenn6240 wants to merge 3 commits intogoogle-deepmind:mainfrom
MarioKrenn6240 wants to merge 3 commits intogoogle-deepmind:mainfrom
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
This PR adds a formalization of Open Quantum Problem 35 from the IQOQI Vienna Open Quantum Problems list: existence of absolutely maximally entangled pure states.
Mathematical content
For integers
n ≥ 2andd ≥ 2, the problem asks for which pairs(n,d)there exists a pureAME(n,d)state.A pure state
ψonnparties of local dimensiondis absolutely maximally entangled (AME) if, for every subset of at most half of the parties, the corresponding reduced density matrix is maximally mixed.In the formalization, a multipartite pure state is represented by a computational-basis amplitude function
ψ : (Fin n → Fin d) → ℂ,together with an explicit normalization condition.
The reduced density matrix on the first
mparties is defined by summing over the remainingn - mparties, and the AME condition is encoded by requiring maximal mixing after arbitrary permutations of the parties, which is equivalent to checking all subsystems of size⌊n / 2⌋.What is introduced
The file defines:
IsNormalizedfor normalized multipartite pure states,reducedDensityFirstfor the reduced density matrix on the first subsystem block,HasMaximallyMixedFirstReductionfor maximal mixing of a chosen reduction,IsAMEfor absolutely maximally entangled pure states,ExistsAME n dfor existence of anAME(n,d)state.It also introduces a reusable witness family:
diagonalStatefor the uniform superposition over constant computational-basis strings,bellStateandghzStateas special cases of this family.The key reusable lemma is:
reducedDensityFirst_of_completion, showing that a state given by a uniform superposition over the graph of an injective completion map has maximally mixed reduction.Included results
The PR includes:
oqp_35, expressing the full classification problem for alln ≥ 2andd ≥ 2,ame_8_4_openandame_7_6_open, expressing two especially important small unresolved cases,ame_2_existsandame_3_exists, obtained from the Bell and GHZ families,AME(2,2),AME(3,2),AME(5,2),AME(6,2),AME(4,2),AME(7,2),AME(4,3), andAME(4,6),ghzState4_not_ame, showing that the 4-party GHZ family is not AME ford ≥ 2.The Bell and 3-party GHZ witnesses are proved directly in Lean via the generic completion criterion.
Background
An
AME(n,d)state is equivalently a pure state that is maximally entangled across every bipartition, or a⌊n / 2⌋-uniform state.The problem is closely related to quantum error-correcting codes: existence of an
AME(n,d)state is equivalent to existence of a pure((n,1,⌊n/2⌋+1))_dquantum code.For qubits (
d = 2), AME states exist only forn = 2, 3, 5, 6; in particular, there is noAME(4,2)and noAME(7,2).A particularly notable solved case is
AME(4,6), whose construction goes beyond the usual stabilizer/classical-code framework.In higher local dimensions, the full classification remains open.
References
Primary source list entry:
https://oqp.iqoqi.oeaw.ac.at/existence-of-absolutely-maximally-entangled-pure-states
https://oqp.iqoqi.oeaw.ac.at/open-quantum-problems
Foundational and benchmark references included in the docstring:
Closes #3452.
Assisted by GPT Pro 5.4.