MétaCan
Menu
Back to cohort
Record W2534741016 · doi:10.4230/lipics.ccc.2017.23

Augmented Index and Quantum Streaming Algorithms for DYCK(2)

2016· preprint· en· W2534741016 on OpenAlexafffund
Ashwin Nayak, Dave Touchette

Bibliographic record

VenueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics) · 2016
Typepreprint
Languageen
FieldComputer Science
TopicQuantum Computing Algorithms and Architecture
Canadian institutionsUniversity of Waterloo
FundersIndustry CanadaNatural Sciences and Engineering Research Council of CanadaGovernment of CanadaCanadian Institute for Advanced Research
KeywordsLeverage (statistics)Upper and lower boundsQuantumComputer scienceGeneralizationAlgorithmQuantum algorithmTheoretical computer scienceMathematicsQuantum mechanicsPhysicsArtificial intelligence

Abstract

fetched live from OpenAlex

We show how two recently developed quantum information theoretic tools can be applied to obtain lower bounds on quantum information complexity. We also develop new tools with potential for broader applicability, and use them to establish a lower bound on the quantum information complexity for the Augmented Index function on an easy distribution. This approach allows us to handle superpositions rather than distributions over inputs, the main technical challenge faced previously. By providing a quantum generalization of the argument of Jain and Nayak [IEEE TIT'14], we leverage this to obtain a lower bound on the space complexity of multi-pass, unidirectional quantum streaming algorithms for the DYCK(2) language.

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.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow), Scholarly communication
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.942
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.000
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0020.004
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.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.017
GPT teacher head0.267
Teacher spread0.250 · 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 designSimulation or modeling
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
Published2016
Admission routes2
Has abstractyes

Explore more

Same venueDROPS (Schloss Dagstuhl – Leibniz Center for Informatics)Same topicQuantum Computing Algorithms and ArchitectureFrench-language works237,207