default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArjan Cornelissen
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c7]Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Quantum Sabotage Complexity. FSTTCS 2024: 19:1-19:20- [i9]Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Quantum Sabotage Complexity. CoRR abs/2408.12595 (2024) - 2023
- [c6]Arjan Cornelissen, Yassine Hamoudi
:
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions. SODA 2023: 1245-1264 - [c5]Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini:
Quantum tomography using state-preparation unitaries. SODA 2023: 1265-1318 - [c4]Sofiène Jerbi, Arjan Cornelissen, Maris Ozols, Vedran Dunjko:
Quantum Policy Gradient Algorithms. TQC 2023: 13:1-13:24 - 2022
- [c3]Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Improved Quantum Query Upper Bounds Based on Classical Decision Trees. FSTTCS 2022: 15:1-15:22 - [c2]Arjan Cornelissen, Yassine Hamoudi, Sofiène Jerbi:
Near-optimal Quantum algorithms for multivariate mean estimation. STOC 2022: 33-43 - [i8]Arjan Cornelissen, Nikhil S. Mande, Subhasree Patro:
Improved Quantum Query Upper Bounds Based on Classical Decision Trees. CoRR abs/2203.02968 (2022) - [i7]Arjan Cornelissen, Yassine Hamoudi:
A Sublinear-Time Quantum Algorithm for Approximating Partition Functions. CoRR abs/2207.08643 (2022) - [i6]Joran van Apeldoorn, Arjan Cornelissen, András Gilyén, Giacomo Nannicini:
Quantum tomography using state-preparation unitaries. CoRR abs/2207.08800 (2022) - [i5]Sofiène Jerbi, Arjan Cornelissen, Maris Ozols, Vedran Dunjko:
Quantum policy gradient algorithms. CoRR abs/2212.09328 (2022) - 2021
- [i4]Arjan Cornelissen, Johannes Bausch, András Gilyén:
Scalable Benchmarks for Gate-Based Quantum Computers. CoRR abs/2104.10698 (2021) - [i3]Arjan Cornelissen, Yassine Hamoudi, Sofiène Jerbi:
Near-Optimal Quantum Algorithms for Multivariate Mean Estimation. CoRR abs/2111.09787 (2021) - [i2]Arjan Cornelissen, Nikhil S. Mande, Maris Ozols, Ronald de Wolf:
Exact quantum query complexity of computing Hamming weight modulo powers of two and three. CoRR abs/2112.14682 (2021) - 2020
- [c1]Arjan Cornelissen, Stacey Jeffery, Maris Ozols, Alvaro Piedrafita:
Span Programs and Quantum Time Complexity. MFCS 2020: 26:1-26:14 - [i1]Arjan Cornelissen, Stacey Jeffery, Maris Ozols, Alvaro Piedrafita:
Span programs and quantum time complexity. CoRR abs/2005.01323 (2020)
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 2025-01-09 12:48 CET 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:
