| No. |
Title |
Author |
Year |
| 1 |
Improved Hardness Results for the Guided Local Hamiltonian Problem |
Cade, Chris et al. |
2023 |
| 2 |
Quantum Space, Ground Space Traversal, and How to Embed Multi-Prover Interactive Proofs into Unentanglement |
Gharibian, Sevag et al. |
2023 |
| 3 |
The Complexity of Translationally Invariant Problems Beyond Ground State Energies |
Watson, James D. et al. |
2023 |
| 4 |
The Optimal Depth of Variational Quantum Algorithms Is QCMA-Hard to Approximate |
Bittel, Lennart et al. |
2023 |
| 5 |
On Polynomially Many Queries to NP or QMA Oracles |
Gharibian, Sevag et al. |
2022 |
| 6 |
Quantum Complexity: Theory and Application (Dagstuhl Seminar 21261) |
Fefferman, Bill et al. |
2021 |
| 7 |
Oracle Complexity Classes and Local Measurements on Physical Hamiltonians |
Gharibian, Sevag et al. |
2020 |
| 8 |
Towards Quantum One-Time Memories from Stateless Hardware |
Broadbent, Anne et al. |
2020 |
| 9 |
Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut |
Gharibian, Sevag et al. |
2019 |
| 10 |
On Efficiently Solvable Cases of Quantum k-SAT |
Aldi, Marco et al. |
2018 |
| 11 |
Quantum Generalizations of the Polynomial Hierarchy with Applications to QMA(2) |
Gharibian, Sevag et al. |
2018 |
| 12 |
The Complexity of Simulating Local Measurements on Quantum Systems |
Gharibian, Sevag et al. |
2018 |
| 13 |
A Linear Time Algorithm for Quantum 2-SAT |
de Beaudrap, Niel et al. |
2016 |
