MétaCan
Menu
Back to cohort
Record W2011269915 · doi:10.1103/physreva.85.062327

Accessible nonlinear entanglement witnesses

2012· article· en· W2011269915 on OpenAlexaff
Juan Miguel Arrazola, Oleg Gittsovich, Norbert Lütkenhaus

Bibliographic record

VenuePhysical Review A · 2012
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsQuantum entanglementEntanglement witnessComputer scienceNonlinear systemWitnessTheoretical computer scienceConstruct (python library)State (computer science)Statistical physicsAlgorithmQuantumPhysicsSquashed entanglementQuantum mechanicsProgramming language

Abstract

fetched live from OpenAlex

Verification of entanglement is an important tool to characterize sources and devices for use in quantum computing and communication applications. In a vast majority of experiments entanglement witnesses (EW) are used in order to prove the presence of entanglement in a quantum state. EWs can be constructed from available measurement results and do not require a reconstruction of the whole density matrix (full tomography), which is especially valuable for high-dimensional systems. We provide a method to construct {\it accessible nonlinear EWs}, which incorporate two important properties. First, they improve on linear EWs in the sense that each non-linear EW detects more entangled states than its linear counterpart and therefore allow the verification of entanglement without critical dependence on having found the 'right' linear witness. Second, they can be evaluated using exactly the same data as for the evaluation of the original linear witness. This allows a reanalysis of published experimental data to strengthen statements about entanglement verification without the requirement to perform additional measurements. These particular properties make the accessible nonlinear EWs attractive for the implementations in current experiments, for they can also enhance the statistical significance of the entanglement verification.

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 imitation

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

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.969
Threshold uncertainty score0.698

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.022
GPT teacher head0.334
Teacher spread0.312 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designNot applicable
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

Citations23
Published2012
Admission routes1
Has abstractyes

Explore more

Same venuePhysical Review ASame topicQuantum Information and CryptographyFrench-language works237,207