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

afffundunlabeled
The measurement calculus
Vincent Danos, Elham Kashefi, Prakash Panangaden
2007· article· en· Journal of the ACM· Computer Science
machine prediction:candidate · noneconsensus · none
192
citations
affunlabeled
Consistency of the Adiabatic Theorem
M. H. S. Amin
2009· article· en· Physical Review Letters· Computer Science
machine prediction:candidate · noneconsensus · none
187
citations
affunlabeled
Quantum lower bounds by polynomials
Robert Beals, Harry Buhrman, Richard Cleve, Michele Mosca, Ronald de Wolf
2002· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
185
citations
affunlabeled
Open source software in quantum computing
Mark Fingerhuth, Tomáš Babej, Péter Wittek
2018· article· en· PLoS ONE· Computer Science
machine prediction:candidate · open_scienceconsensus · none
175
citations
affunlabeled
A Decoupling Approach to the Quantum Capacity
Patrick Hayden, Michał Horodecki, Andreas Winter, Jon Yard
2008· article· en· Open Systems & Information Dynamics· Computer Science
machine prediction:candidate · noneconsensus · none
173
citations
affno abstractunlabeled
Barren plateaus in variational quantum computing
Martín Larocca, Supanut Thanasilp, Samson Wang, Kunal Sharma, Jacob Biamonte, Patrick J. Coles +4 more
2025· review· en· Nature Reviews Physics· Computer Science
machine prediction:candidate · noneconsensus · none
173
citations
afffundno abstractunlabeled
Machine Learning in a Quantum World
Esma Aı̈meur, Gilles Brassard, Sébastien Gambs
2006· book-chapter· en· Lecture notes in computer science· Computer Science
machine prediction:candidate · noneconsensus · none
164
citations
affunlabeled
Quantum Adiabatic Brachistochrone
A. T. Rezakhani, Wen-Jui Kuo, Alioscia Hamma, Daniel A. Lidar, Paolo Zanardi
2009· article· en· Physical Review Letters· Computer Science
machine prediction:candidate · noneconsensus · none
163
citations
afffundunlabeled
Operational Resource Theory of Imaginarity
Kang‐Da Wu, Tulja Varun Kondra, Swapan Rana, Carlo Maria Scandolo, Guo‐Yong Xiang, Chuan‐Feng Li +2 more
2021· article· en· Physical Review Letters· Computer Science
machine prediction:candidate · noneconsensus · none
158
citations
affunlabeled
Quantum weakest preconditions
Ellie D’Hondt, Prakash Panangaden
2006· article· en· Mathematical Structures in Computer Science· Computer Science
machine prediction:candidate · noneconsensus · none
156
citations
afffundno abstractunlabeled
Challenges and opportunities in quantum optimization
Amira Abbas, Andris Ambainis, Brandon Augustino, Andreas Bärtschi, Harry Buhrman, Carleton Coffrin +40 more
2024· review· en· Nature Reviews Physics· Computer Science
machine prediction:candidate · noneconsensus · none
154
citations
afffundunlabeled
One-Shot Decoupling
Frédéric Dupuis, Mario Berta, Jürg Wullschleger, Renato Renner
2014· article· en· Communications in Mathematical Physics· Computer Science
machine prediction:candidate · noneconsensus · none
142
citations
affunlabeled
Exponential algorithmic speedup by a quantum walk
Andrew M. Childs, Richard Cleve, E. Deotto, Edward Farhi, Sam Gutmann, Daniel A. Spielman
2003· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
141
citations
← previousnext →

How this was built: Screen · Findings · About