MétaCan
Menu
← Back to cohort
Record W4323066554 · doi:10.48550/arxiv.2303.00881

Achieving metrological limits using ancilla-free quantum error-correcting codes

2023· preprint· en· W4323066554 on OpenAlexfundno aff
Sisi Zhou, Argyris Giannisis Manes, Liang Jiang

Bibliographic record

VenuearXiv (Cornell University) · 2023
Typepreprint
Languageen
FieldComputer Science
TopicQuantum Information and Cryptography
Canadian institutionsnot available
FundersArmy Research OfficeAir Force Office of Scientific ResearchMinistry of Colleges and UniversitiesMultidisciplinary University Research InitiativeInnovation, Science and Economic Development CanadaInstitut Périmètre de physique théoriqueAir Force Research LaboratoryNational Science FoundationGovernment of CanadaInstitute for Quantum Information and Matter, California Institute of TechnologyCalifornia Institute of Technology
KeywordsQuantum error correctionHeisenberg limitQuantumQuantum limitComputer scienceQuantum metrologyAlgorithmQuantum entanglementError detection and correctionMathematicsQuantum algorithmQuantum mechanicsPhysicsQuantum network

Abstract

fetched live from OpenAlex

Quantum error correction (QEC) is theoretically capable of achieving the ultimate estimation limits in noisy quantum metrology. However, existing quantum error-correcting codes designed for noisy quantum metrology generally exploit entanglement between one probe and one noiseless ancilla of the same dimension, and the requirement of noiseless ancillas is one of the major obstacles to implementing the QEC metrological protocol in practice. Here we successfully lift this requirement by explicitly constructing two types of multi-probe quantum error-correcting codes, where the first one utilizes a negligible amount of ancillas and the second one is ancilla-free. Specifically, we consider Hamiltonian estimation under Markovian noise and show that (i)~when the Heisenberg limit (HL) is achievable, our new codes can achieve the HL and its optimal asymptotic coefficient; (ii)~when only the standard quantum limit (SQL) is achievable (even with arbitrary adaptive quantum strategies), the optimal asymptotic coefficient of the SQL is also achievable by our new codes under slight modifications.

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.002
metaresearch head score (Gemma)0.012
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: Methods · Consensus signal: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.012
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.003
Scholarly communication0.0020.003
Open science0.0010.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0020.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.201
GPT teacher head0.232
Teacher spread0.031 · 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
GenreMethods

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

Citations2
Published2023
Admission routes1
Has abstractyes

Explore more

Same venuearXiv (Cornell University)→Same topicQuantum Information and Cryptography→French-language works237,207→