default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 14 matches
- 2022
- Srinivasan Arunachalam, Sergey Bravyi, Chinmay Nirkhe, Bryan O'Gorman:
The Parametrized Complexity of Quantum Verification. TQC 2022: 3:1-3:18 - Joao Basso, Edward Farhi, Kunal Marwaha, Benjamin Villalonga, Leo Zhou:
The Quantum Approximate Optimization Algorithm at High Depth for MaxCut on Large-Girth Regular Graphs and the Sherrington-Kirkpatrick Model. TQC 2022: 7:1-7:21 - Jop Briët, Francisco Escudero Gutiérrez:
On Converses to the Polynomial Method. TQC 2022: 6:1-6:10 - Harry Buhrman, Bruno Loff, Subhasree Patro, Florian Speelman:
Memory Compression with Quantum Random-Access Gates. TQC 2022: 10:1-10:19 - Suchetan Dontha, Shi Jie Samuel Tan, Stephen Smith, Sangheon Choi, Matthew Coudron:
Approximating Output Probabilities of Shallow Quantum Circuits Which Are Geometrically-Local in Any Fixed Dimension. TQC 2022: 9:1-9:17 - João F. Doriguello, Alessandro Luongo, Jinge Bao, Patrick Rebentrost, Miklos Santha:
Quantum Algorithm for Stochastic Optimal Stopping Problems with Applications in Finance. TQC 2022: 2:1-2:24 - Steven T. Flammia:
Averaged Circuit Eigenvalue Sampling. TQC 2022: 4:1-4:10 - Andrew N. Glaudell, Neil J. Ross, John van de Wetering, Lia Yeh:
Qutrit Metaplectic Gates Are a Subset of Clifford+T. TQC 2022: 12:1-12:15 - Aleks Kissinger, John van de Wetering, Renaud Vilmart:
Classical Simulation of Quantum Circuits with Partial and Graphical Stabiliser Decompositions. TQC 2022: 5:1-5:13 - Vladislavs Klevickis, Krisjanis Prusis, Jevgenijs Vihrovs:
Quantum Speedups for Treewidth. TQC 2022: 11:1-11:18 - Ashley Montanaro, Changpeng Shao:
Quantum Algorithms for Learning a Hidden Graph. TQC 2022: 1:1-1:22 - Sarah A. Osborn, Jamie Sikora:
A Constant Lower Bound for Any Quantum Protocol for Secure Function Evaluation. TQC 2022: 8:1-8:14 - Front Matter, Table of Contents, Preface, Conference Organization. TQC 2022: 0:1-0:12
- François Le Gall, Tomoyuki Morimae:
17th Conference on the Theory of Quantum Computation, Communication and Cryptography, TQC 2022, July 11-15, 2022, Urbana Champaign, Illinois, USA. LIPIcs 232, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2022, ISBN 978-3-95977-237-2 [contents]
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-11-08 06:10 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint