MétaCan
Menu
Back to cohort
Record W2003946839 · doi:10.1103/physreva.87.062331

Reliable entanglement verification

2013· article· en· W2003946839 on OpenAlexaff
Juan Miguel Arrazola, Oleg Gittsovich, John M. Donohue, Jonathan Lavoie, Kevin J. Resch, Norbert Lütkenhaus

Bibliographic record

VenuePhysical Review A · 2013
Typearticle
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsQuantum entanglementComputer scienceEntanglement witnessTheoretical computer scienceAlgorithmStatistical physicsQuantumSquashed entanglementQuantum mechanicsPhysics

Abstract

fetched live from OpenAlex

Any experiment attempting to verify the presence of entanglement in a physical system can only generate a finite amount of data. The statement that entanglement was present in the system can thus never be issued with certainty, requiring instead a statistical analysis of the data. Because entanglement plays a central role in the performance of quantum devices, it is crucial to make statistical claims in entanglement verification experiments that are reliable and have a clear interpretation. In this work, we apply recent results by Christandl and Renner [Phys. Rev. Lett. 109, 120403 (2012)] to construct a reliable entanglement verification procedure based on the concept of confidence regions. The statements made do not require the specification of a prior distribution, the assumption of independent measurements, or the assumption of an independent and identically distributed source of states. Moreover, we develop numerical tools that are necessary to employ this approach in practice, rendering the procedure ready to be applied to current experiments. We demonstrate this technique by analyzing the data of a photonic experiment generating two-photon states whose entanglement is verified with the use of an accessible nonlinear witness.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.916
Threshold uncertainty score0.998

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

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.011
GPT teacher head0.268
Teacher spread0.257 · 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.

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

Citations19
Published2013
Admission routes1
Has abstractyes

Explore more

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