MétaCan
Menu
Back to cohort
Record W2025164650 · doi:10.1063/1.2203431

GHZ extraction yield for multipartite stabilizer states

2006· article· en· W2025164650 on OpenAlexaff
Sergey Bravyi, David Fattal, Daniel Gottesman

Bibliographic record

VenueJournal of Mathematical Physics · 2006
Typearticle
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsPerimeter Institute
Fundersnot available
KeywordsMultipartiteQubitQuantum entanglementMultipartite entanglementStabilizer (aeronautics)MathematicsUnitary stateLattice (music)LOCCQuantum stateState (computer science)Quantum mechanicsFormalism (music)QuantumPhysicsCombinatoricsDiscrete mathematicsLawSquashed entanglementAlgorithmPolitical science

Abstract

fetched live from OpenAlex

Let ∣Ψ⟩ be an arbitrary stabilizer state distributed between three remote parties, such that each party holds several qubits. Let S be a stabilizer group of ∣Ψ⟩. We show that ∣Ψ⟩ can be converted by local unitaries into a collection of singlets, GHZ states, and local one-qubit states. The numbers of singlets and GHZs are determined by dimensions of certain subgroups of S. For an arbitrary number of parties m we find a formula for the maximal number of m-partite GHZ states that can be extracted from ∣Ψ⟩ by local unitaries. A connection with earlier introduced measures of multipartite correlations is made. An example of an undecomposable four-party stabilizer state with more than one qubit per party is given. These results are derived from a general theoretical framework that allows one to study interconversion of multipartite stabilizer states by local Clifford group operators. As a simple application, we study three-party entanglement in two-dimensional lattice models that can be exactly solved by the stabilizer formalism.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.002
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0000.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0050.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.

Opus teacher head0.019
GPT teacher head0.270
Teacher spread0.251 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations63
Published2006
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Mathematical PhysicsSame topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207