Author of the publication

Dequantizing the Quantum singular value transformation: hardness and applications to Quantum chemistry and the Quantum PCP conjecture.

, and . STOC, page 19-32. ACM, (2022)

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

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)Approximation Algorithms for QMA-Complete Problems., and . SIAM J. Comput., 41 (4): 1028-1050 (2012)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)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)Approximation Algorithms for QMA-Complete Problems., and . CCC, page 178-188. IEEE Computer Society, (2011)Ground State Connectivity of Local Hamiltonians., and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 617-628. Springer, (2015)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)