Arjan Cornelissen

According to our database1, Arjan Cornelissen authored at least 9 papers between 2020 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Quantum Sabotage Complexity.
CoRR, 2024

2023
Quantum Policy Gradient Algorithms.
Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

A Sublinear-Time Quantum Algorithm for Approximating Partition Functions.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

Quantum tomography using state-preparation unitaries.
Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022
Near-optimal Quantum algorithms for multivariate mean estimation.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

Improved Quantum Query Upper Bounds Based on Classical Decision Trees.
Proceedings of the 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2022

2021
Exact quantum query complexity of computing Hamming weight modulo powers of two and three.
CoRR, 2021

Scalable Benchmarks for Gate-Based Quantum Computers.
CoRR, 2021

2020
Span Programs and Quantum Time Complexity.
Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020


  Loading...