| No. | Title | Author | Year |
|---|---|---|---|
| 1 | On Polynomially Many Queries to NP or QMA Oracles | Gharibian, Sevag et al. | 2022 |
| 2 | Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261) | Fefferman, Bill et al. | 2021 |
| 3 | Oracle Complexity Classes and Local Measurements on Physical Hamiltonians | Gharibian, Sevag et al. | 2020 |
| 4 | Towards Quantum One-Time Memories from Stateless Hardware | Broadbent, Anne et al. | 2020 |
| 5 | Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut | Gharibian, Sevag et al. | 2019 |
| 6 | On Efficiently Solvable Cases of Quantum k-SAT | Aldi, Marco et al. | 2018 |
| 7 | Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2) | Gharibian, Sevag et al. | 2018 |
| 8 | The Complexity of Simulating Local Measurements on Quantum Systems | Gharibian, Sevag et al. | 2018 |
| 9 | A Linear Time Algorithm for Quantum 2-SAT | de Beaudrap, Niel et al. | 2016 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 9 |