MétaCan
ENFR
Menu
Cohort builder

4,299,418 works, Canadian by any of four routes.

Every filter state is a URL; the URL is the query; the query is citable via /q/⟨hash⟩. The page, the API and the export parse the same parameters.

Export CSVExport JSONAPI query

The current cohort, streamed from the database: every work column, the machine labels, the provisional scores, and the per-row validation status. Exports are capped at 100,000 rows. Mints a permanent /q/ link for this exact query. The same filters always produce the same link, whoever asks.

Search term
Author
Year range
→
Sort
Language
Type
Field
Venue
Topic
Quantum Computing Algorithms and Architecture
Retraction
Abstract
Evidence source
Study design
Label agreement
Label status

Direct Codex and Gemma labels are unvalidated and sparse. Distilled predictions cover the full frame and are also unvalidated. Choose the evidence source explicitly; absence of a direct label is never a negative label.

affaffiliation
fundfunder
venuejournal
aboutaboutness

The four routes compose: require the funder route and exclude affiliation to get the funder-only stratum no affiliation-based frame ever sees.

2,386 results · 1 filter active ·
Results by year
20002025
Publication date
Categories
Machine labels · sparse coverage
Evidence
Language
Type
Citations
An unlabeled work is unknown, not a negative. Label coverage is reported on every query.
2,386 works in the cohort · of 4,299,418page 7 of 48

Labels cover 3 of 2,386 works in this cohort. The rest are unlabeled, which is not a negative label: the label table is sparse today and grows as labeling rounds land.

Distilled predictions cover 2,386 of 2,386 works in this cohort. Predictions are machine_predicted_unvalidated. The Gemma side is a direct model label for every work (title-only); the Codex side is a distilled, calibrated classifier. Candidate is the union; consensus is the intersection.

affno abstractunlabeled
Is information the key?
Gilles Brassard
2005· article· en· Nature Physics· Computer Science
machine prediction:candidate · noneconsensus · none
72
citations
affunlabeled
Fast quantum circuit cutting with randomized measurements
Angus Lowe, Matija Medvidović, Anthony Hayes, Lee J. O apos Riordan, Thomas R. Bromley, Juan Miguel Arrazola +1 more
2023· article· en· Quantum· Computer Science
machine prediction:candidate · noneconsensus · none
70
citations
affunlabeled
Symmetries and noise in quantum walk
C. M. Chandrashekar, R. Srikanth, Subhashish Banerjee
2007· article· en· Physical Review A· Computer Science
machine prediction:candidate · noneconsensus · none
69
citations
afffundunlabeled
Coherence as a Resource for Shor’s Algorithm
Felix Ahnefeld, Thomas Theurer, Dario Egloff, J. M. Matera, Martin B. Plenio
2022· article· en· Physical Review Letters· Computer Science
machine prediction:candidate · noneconsensus · none
68
citations
afffundunlabeled
Towards Low Overhead Magic State Distillation
Anirudh Krishna, Jean–Pierre Tillich
2019· article· en· Physical Review Letters· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
affunlabeled
Adiabatic Gate Teleportation
Dave Bacon, Steven T. Flammia
2009· article· en· Physical Review Letters· Computer Science
machine prediction:candidate · noneconsensus · none
67
citations
affno abstractunlabeled
Quantum Algorithms for the Subset-Sum Problem
Daniel J. Bernstein, Stacey Jeffery, Tanja Lange, Alexander Meurer
2013· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
66
citations
afffundunlabeled
Continuous-variable quantum computing on encrypted data
Kevin Marshall, Christian S. Jacobsen, Clemens Schäfermeier, Tobias Gehring, Christian Weedbrook, Ulrik L. Andersen
2016· article· en· Nature Communications· Computer Science
machine prediction:candidate · noneconsensus · none
65
citations
afffundunlabeled
Attention-based quantum tomography
2021· article· en· Machine Learning Science and Technology· Computer Science
machine prediction:candidate · noneconsensus · none
64
citations
affunlabeled
Pure and Applied Mathematics
William J. Gilbert, W. K. Nicholson
2003· other· en· Computer Science
machine prediction:candidate · noneconsensus · none
63
citations
affunlabeled
QIP = PSPACE
Rahul Jain, Zhengfeng Ji, Sarvagya Upadhyay, John Watrous
2011· article· en· Journal of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
affno abstractunlabeled
Theory of one-tape linear-time Turing machines
K. Tadaki, Tomoyuki Yamakami, Jack C. H. Lin
2009· article· en· Theoretical Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
62
citations
afffundno abstractunlabeled
Neural Error Mitigation of Near-Term Quantum Simulations
Elizabeth R. Bennewitz, Florian Hopfmueller, Bohdan Kulchytskyy, Juan Carrasquilla, Pooya Ronagh
2022· article· en· Nature Machine Intelligence· Computer Science
machine prediction:candidate · noneconsensus · none
60
citations
← previousnext →

How this was built: Screen · Findings · About