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 9 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
Hamiltonian oracles
Carlos Mochon
2007· article· en· Physical Review A· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
afffundunlabeled
Thresholds for Universal Concatenated Quantum Codes
Christopher Chamberland, Tomas Jochym-O’Connor, Raymond Laflamme
2016· article· en· Physical Review Letters· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affunlabeled
On Testing Quantum Programs
2019· article· en· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
afffundunlabeled
Quantum Software Engineering: Roadmap and Challenges Ahead
Juan M. Murillo, José Garcí­a-Alonso, Enrique Moguel, Johanna Barzen, Frank Leymann, Shaukat Ali +10 more
2025· article· en· ACM Transactions on Software Engineering and Methodology· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
affunlabeled
qTorch: The quantum tensor contraction handler
Eliot Fried, Nicolas P. D. Sawaya, Yudong Cao, Ian Kivlichan, Alán Aspuru‐Guzik
2018· article· en· PLoS ONE· Computer Science
machine prediction:candidate · noneconsensus · none
51
citations
afffundunlabeled
Real Randomized Benchmarking
2018· article· en· Quantum· Computer Science
machine prediction:candidate · noneconsensus · none
50
citations
fundno affunlabeled
[no title]
Daniel Gottesman, Sandy Irani
2013· article· en· Theory of Computing· Computer Science
machine prediction:candidate · insufficient_payloadconsensus · none
50
citations
affunlabeled
Graph isomorphism and Gaussian boson sampling
Kamil Brádler, Shmuel Friedland, Josh Izaac, Nathan Killoran, Daiqin Su
2021· article· en· Special Matrices· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affno abstractunlabeled
Quantum Computational Complexity
John Watrous
2011· book-chapter· en· Computational Complexity· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
afffundunlabeled
Accelerated randomized benchmarking
Christopher Granade, Christopher Ferrie, David G. Cory
2015· article· en· New Journal of Physics· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affunlabeled
Quantum Networks for Generating Arbitrary Quantum States
Michele Mosca, Phillip Kaye
2001· article· en· Optical Fiber Communication Conference and International Conference on Quantum Information· Computer Science
machine prediction:candidate · noneconsensus · none
49
citations
affunlabeled
Graph Homomorphisms for Quantum Players
Laura Mančinska, David E. Roberson
2012· preprint· en· DR-NTU (Nanyang Technological University)· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
affunlabeled
Uncertain fate of fair sampling in quantum annealing
Mario S. Könz, Guglielmo Mazzola, Andrew J. Ochoa, Helmut G. Katzgraber, Matthias Troyer
2019· article· en· Physical review. A/Physical review, A· Computer Science
machine prediction:candidate · noneconsensus · none
48
citations
affunlabeled
An Introduction to Reversible Latches
Jacqueline E. Rice
2008· article· en· The Computer Journal· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations
afffundno abstractunlabeled
Quantum computation: Algorithms and Applications
Chien‐Hung Cho, Chih-Yu Chen, Kuo-Chin Chen, Tsung‐Wei Huang, Ming-Chien Hsu, Ningping Cao +3 more
2021· article· en· Chinese Journal of Physics· Computer Science
machine prediction:candidate · noneconsensus · none
47
citations

How this was built: Screen · Findings · About