| Publication | Date of Publication | Type |
|---|
Measurement Geometry for Quantum Random Access Codes: Beyond Nayak Bound and Toward Optimality
(available as arXiv preprint) | 2026-01-01 | Paper |
Determinantal reinforcement learning with techniques to avoid poor local optima
Proceedings of the Forum "Math-for-Industry" 2018 | 2024-04-03 | Paper |
Amplitude estimation via maximum likelihood on noisy quantum computer
Quantum Information Processing | 2023-02-22 | Paper |
Amplitude estimation without phase estimation
Quantum Information Processing | 2023-01-05 | Paper |
Measurements of quantum Hamiltonians with locally-biased classical shadows
Communications in Mathematical Physics | 2022-04-19 | Paper |
scientific article; zbMATH DE number 7453154 (Why is no real title available?)
(available as arXiv preprint) | 2022-01-06 | Paper |
| scientific article; zbMATH DE number 7453154 (Why is no real title available?) | 2022-01-06 | Paper |
| Approximate Solutions of Combinatorial Problems via Quantum Relaxations | 2021-11-04 | Paper |
Efficient Construction of Functional Representations for Quantum Algorithms
Reversible Computation | 2021-11-03 | Paper |
Approximate Solutions of Combinatorial Problems via Quantum Relaxations
(available as arXiv preprint) | 2021-01-01 | Paper |
Quantum query complexity of almost all functions with fixed on-set size
Computational Complexity | 2016-11-30 | Paper |
Erratum to: ``Analysis of transient queues with semidefinite optimization''
Queueing Systems | 2015-08-04 | Paper |
Analysis of transient queues with semidefinite optimization
Queueing Systems | 2013-02-18 | Paper |
Quantum counterfeit coin problems
Theoretical Computer Science | 2012-10-11 | Paper |
Unbounded-error quantum query complexity
Theoretical Computer Science | 2011-09-12 | Paper |
Quantum counterfeit coin problems
Algorithms and Computation | 2010-12-09 | Paper |
Quantum Query Complexity of Boolean Functions with Small On-Sets
Algorithms and Computation | 2009-01-29 | Paper |
Unbounded-Error Quantum Query Complexity
Algorithms and Computation | 2009-01-29 | Paper |
Polynomial-Time Construction of Linear Network Coding
Automata, Languages and Programming | 2008-08-28 | Paper |
Unbounded-Error Classical and Quantum Communication Complexity
Algorithms and Computation | 2008-05-27 | Paper |
Unbounded-Error One-Way Classical and Quantum Communication Complexity
Automata, Languages and Programming | 2007-11-28 | Paper |
Improved Algorithms for Quantum Identification of Boolean Oracles
Algorithm Theory – SWAT 2006 | 2007-09-07 | Paper |
Quantum Network Coding
STACS 2007 | 2007-09-03 | Paper |
Improved algorithms for quantum identification of Boolean oracles
Theoretical Computer Science | 2007-06-06 | Paper |
| Quantum identification of Boolean oracles | 2007-05-09 | Paper |
| Query complexity of quantum biased oracles | 2007-05-09 | Paper |
