default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDChris Cade
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans:
Quantum algorithms for community detection and their empirical run-times. Quantum Inf. Comput. 24(5&6): 361-410 (2024)- [c3]Jordi Weggemans, Marten Folkertsma, Chris Cade:
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansatz State Preparation and the Quantum PCP Conjecture. TQC 2024: 10:1-10:24 - 2023
- [j4]Chris Cade, Farrokh Labib, Ido Niesen:
Quantum Motif Clustering. Quantum 7: 1046 (2023) - [j3]Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans:
Quantifying Grover speed-ups beyond asymptotic analysis. Quantum 7: 1133 (2023) - [c2]Chris Cade, Marten Folkertsma, Sevag Gharibian, Ryu Hayakawa, François Le Gall, Tomoyuki Morimae, Jordi Weggemans:
Improved Hardness Results for the Guided Local Hamiltonian Problem. ICALP 2023: 32:1-32:19 - [i8]Jordi Weggemans, Marten Folkertsma, Chris Cade:
Guidable Local Hamiltonian Problems with Implications to Heuristic Ansätze State Preparation and the Quantum PCP Conjecture. CoRR abs/2302.11578 (2023) - 2022
- [j2]Casper Gyurik
, Chris Cade, Vedran Dunjko:
Towards quantum advantage via topological data analysis. Quantum 6: 855 (2022) - [i7]Chris Cade, Marten Folkertsma, Ido Niesen, Jordi Weggemans:
Quantifying Grover speed-ups beyond asymptotic analysis. CoRR abs/2203.04975 (2022) - [i6]Chris Cade, Marten Folkertsma, Jordi Weggemans:
Complexity of the Guided Local Hamiltonian Problem: Improved Parameters and Extension to Excited States. CoRR abs/2207.10097 (2022) - 2021
- [i5]Chris Cade, Farrokh Labib, Ido Niesen:
Quantum Motif Clustering. CoRR abs/2111.13222 (2021) - 2020
- [b1]Chris Cade:
Quantum algorithms and complexity in non-standard models. University of Bristol, UK, 2020 - [i4]Casper Gyurik, Chris Cade, Vedran Dunjko:
Towards quantum advantage for topological data analysis. CoRR abs/2005.02607 (2020)
2010 – 2019
- 2018
- [j1]Chris Cade, Ashley Montanaro, Aleksandrs Belovs:
Time and space efficient quantum algorithms for detecting cycles and testing bipartiteness. Quantum Inf. Comput. 18(1&2): 18-50 (2018) - [c1]Chris Cade, Ashley Montanaro:
The Quantum Complexity of Computing Schatten p-norms. TQC 2018: 4:1-4:20 - [i3]Chris Cade:
Post-selected Classical Query Complexity. CoRR abs/1804.10010 (2018) - 2017
- [i2]Chris Cade, Ashley Montanaro:
The Quantum Complexity of Computing Schatten $p$-norms. CoRR abs/1706.09279 (2017) - 2016
- [i1]Chris Cade, Ashley Montanaro, Aleksandrs Belovs:
Time and Space Efficient Quantum Algorithms for Detecting Cycles and Testing Bipartiteness. CoRR abs/1610.00581 (2016)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-27 22:00 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
