MétaCan
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.

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

affunlabeled
NMR quantum information processing and entanglement
Raymond Laflamme, David G. Cory, C. Negrevergne, Lorenza Viola
2002· article· en· Quantum Information and Computation· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
affunlabeled
EQC
Samuel Stein, Nathan Wiebe, Yufei Ding, Bo Peng, Karol Kowalski, Nathan Baker +2 more
2022· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
44
citations
fundno affunlabeled
Hybrid quantum algorithms for flow problems
Sachin S. Bharadwaj, Katepalli R. Sreenivasan
2023· article· en· Proceedings of the National Academy of Sciences· Computer Science
machine prediction:candidate · noneconsensus · none
43
citations
afffundunlabeled
Quantum Information Complexity
Dave Touchette
2015· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affunlabeled
Constructing SAT Filters with a Quantum Annealer
Adam D. Douglass, Andrew D. King, Jack Raymond
2015· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affunlabeled
Programming the quantum future
Benoît Valiron, Neil J. Ross, Peter Selinger, D. Scott Alexander, Jonathan M. Smith
2015· article· en· Communications of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
42
citations
affunlabeled
[no title]
Ben W. Reichardt, Robert Špalek
2012· article· en· Theory of Computing· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
42
citations
affno abstractunlabeled
Machine learning in quantum spaces
Maria Schuld
2019· letter· en· Nature· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affunlabeled
Quantified synthesis of reversible logic
Robert Wille, Hoang M. Le, Gerhard W. Dueck, Daniel Große
2008· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
41
citations
affno abstractunlabeled
Average mixing of continuous quantum walks
Chris Godsil
2013· article· en· Journal of Combinatorial Theory Series A· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
affno abstractunlabeled
Finding Is as Easy as Detecting for Quantum Walks
Hari Krovi, Frédéric Magniez, Māris Ozols, Jérémie Roland
2010· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
40
citations
afffundno abstractunlabeled
Quantum fractional revival on graphs
Ada Chan, Gabriel Coutinho, Christino Tamon, Luc Vinet, Hanmeng Zhan
2019· article· en· Discrete Applied Mathematics· Computer Science
machine prediction:candidate · noneconsensus · none
39
citations

How this was built: Screen · Findings · About