| Publication | Date of Publication | Type |
|---|
| Learning low-degree quantum objects | 2026-01-14 | Paper |
Testing and learning structured quantum Hamiltonians
Communications in Mathematical Physics | 2025-12-15 | Paper |
A cb-Bohnenblust-Hille inequality with constant one and its applications in learning theory
Mathematische Annalen | 2025-08-13 | Paper |
| Quantum learning algorithms imply circuit lower bounds | 2025-08-13 | Paper |
| Sample-efficient learning of quantum many-body systems | 2025-08-12 | Paper |
Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case
ACM Transactions on Computation Theory | 2025-02-25 | Paper |
| Optimal algorithms for learning quantum phase states | 2024-11-20 | Paper |
| Trade-offs between entanglement and communication | 2024-11-19 | Paper |
| On the Gaussian surface area of spectrahedra | 2024-09-20 | Paper |
| The parametrized complexity of quantum verification | 2024-06-27 | Paper |
Positive spectrahedra: invariance principles and pseudorandom generators
Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing | 2023-12-08 | Paper |
| Improved Bounds on Fourier Entropy and Min-Entropy | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7651037 (Why is no real title available?)
(available as arXiv preprint) | 2023-02-07 | Paper |
scientific article; zbMATH DE number 7561509 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-21 | Paper |
Improved bounds on Fourier entropy and min-entropy
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
Improved bounds on Fourier entropy and min-entropy
ACM Transactions on Computation Theory | 2022-03-29 | Paper |
Hard satisfiable 3-SAT instances via autocorrelation
Journal on Satisfiability, Boolean Modeling and Computation | 2021-12-09 | Paper |
| On the Gaussian surface area of spectrahedra | 2021-12-02 | Paper |
| Matrix hypercontractivity, streaming algorithms and LDCs: the large alphabet case | 2021-09-06 | Paper |
Quantum hardness of learning shallow classical circuits
SIAM Journal on Computing | 2021-06-22 | Paper |
| Quantum query algorithms are completely bounded forms | 2021-06-15 | Paper |
On the robustness of bucket brigade quantum RAM
New Journal of Physics | 2021-01-15 | Paper |
The asymptotic induced matching number of hypergraphs: balanced binary strings
The Electronic Journal of Combinatorics | 2020-07-30 | Paper |
Optimal quantum sample complexity of learning algorithms
(available as arXiv preprint) | 2020-05-26 | Paper |
Optimizing quantum optimization algorithms via faster quantum gradient computation
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Optimizing quantum optimization algorithms via faster quantum gradient computation
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
Quantum query algorithms are completely bounded forms
SIAM Journal on Computing | 2019-05-07 | Paper |
| Optimal quantum sample complexity of learning algorithms | 2019-01-30 | Paper |
Quantum hedging in two-round prover-verifier interactions
(available as arXiv preprint) | 2018-05-03 | Paper |
On the robustness of bucket brigade quantum RAM
(available as arXiv preprint) | 2017-07-12 | Paper |
| A Substitution to Bernoulli Numbers in easier computation of (\zeta(2k)) | 2011-05-05 | Paper |
