Necessary and sufficient conditions for local manipulation of multipartite pure quantum states
Bibliographic record
Abstract
Suppose that several parties jointly possess a pure multipartite state, | . Using local operations on their respective systems and classical communication (i.e. LOCC), it may be possible for the parties to transform deterministically | into another joint state | . In the bipartite case, the Nielsen majorization theorem gives the necessary and sufficient conditions for this process of entanglement transformation to be possible. In the multipartite case, such a deterministic local transformation is possible only if both the states are in the same stochastic LOCC (SLOCC) class. Here, we generalize the Nielsen majorization theorem to the multipartite case, and find necessary and sufficient conditions for the existence of a local separable transformation between two multipartite states in the same SLOCC class. When such a deterministic conversion is not possible, we find an expression for the maximum probability to convert one state to another by local separable operations. In addition, we find necessary and sufficient conditions for the existence of a separable transformation that converts a multipartite pure state into one of a set of possible final states all in the same SLOCC class. Our results are expressed in terms of (i) the stabilizer group of the state representing the SLOCC orbit and (ii) the associate density matrices (ADMs) of the two multipartite states. The ADMs play a similar role to that of the reduced density matrices when considering local transformations that involve pure bipartite states. We show, in particular, that the requirement that one ADM majorizes another is a necessary condition but is, in general, far from also being sufficient as it happens in the bipartite case. In most of the results the twirling operation with respect to
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".