Author of the publication

The Complexity of Translationally Invariant Problems Beyond Ground State Energies.

, , and . STACS, volume 254 of LIPIcs, page 54:1-54:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Approximation Algorithms for QMA-Complete Problems., and . SIAM J. Comput., 41 (4): 1028-1050 (2012)Improved Hardness Results for the Guided Local Hamiltonian Problem., , , , , , and . ICALP, volume 261 of LIPIcs, page 32:1-32:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)BQP, Meet NP: Search-To-Decision Reductions and Approximate Counting., and . ICALP, volume 297 of LIPIcs, page 70:1-70:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Quantum Hamiltonian Complexity., , and . CoRR, (2014)Quantum Hamiltonian Complexity., , , and . Found. Trends Theor. Comput. Sci., 10 (3): 159-282 (2015)Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture., and . STOC, page 19-32. ACM, (2022)Approximation Algorithms for QMA-Complete Problems., and . CCC, page 178-188. IEEE Computer Society, (2011)Quantum Polynomial Hierarchies: Karp-Lipton, Error Reduction, and Lower Bounds., , , and . MFCS, volume 306 of LIPIcs, page 7:1-7:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)Dequantizing the Quantum Singular Value Transformation: Hardness and Applications to Quantum Chemistry and the Quantum PCP Conjecture., and . SIAM J. Comput., 52 (4): 1009-1038 (August 2023)A Linear Time Algorithm for Quantum 2-SAT., and . CCC, volume 50 of LIPIcs, page 27:1-27:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)