MétaCan
Menu
Back to cohort
Record W2953079354 · doi:10.1063/1.3459068

A family of norms with applications in quantum information theory

2010· article· en· W2953079354 on OpenAlexaff
Nathaniel Johnston, David W. Kribs

Bibliographic record

VenueJournal of Mathematical Physics · 2010
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsUniversity of WaterlooUniversity of Guelph
Fundersnot available
KeywordsMathematicsQuantum entanglementPeres–Horodecki criterionNorm (philosophy)Operator (biology)Eigenvalues and eigenvectorsQuantumQuantum stateQuantum informationUpper and lower boundsPure mathematicsQuantum mechanicsMathematical analysisPhysicsW stateLaw

Abstract

fetched live from OpenAlex

We consider a family of vector and operator norms defined by the Schmidt decomposition theorem for quantum states. We use these norms to tackle two fundamental problems in quantum information theory: the classification problem for k-positive linear maps and entanglement witnesses, and the existence problem for nonpositive partial transpose bound entangled states. We begin with an analysis of the norms, showing that the vector norms can be explicitly calculated, and we derive several inequalities in order to bound the operator norms and compute them in special cases. We then use the norms to establish what appears to be the most general spectral test for k-positivity currently available, showing how it implies several other known tests as well as some new ones. Building on this work, we frame the nonpositive partial transpose bound entangled problem as a concrete problem on a specific limit, specifically that a particular entangled Werner state is bound entangled if and only if a certain norm inequality holds on a given family of projections.

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.005
metaresearch head score (Gemma)0.016
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: none
Teacher disagreement score0.005
Threshold uncertainty score0.027

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.016
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0020.006
Scholarly communication0.0030.007
Open science0.0010.003
Research integrity0.0010.004
Insufficient payload (model declined to judge)0.0030.001

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.007
GPT teacher head0.226
Teacher spread0.219 · 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

Citations43
Published2010
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Mathematical PhysicsSame topicQuantum Information and CryptographyFrench-language works237,207