( en | de | ru )

 

Disambiguation of "Gharibian, Sevag"

Author of the publication

copydeleteadd this publication to your clipboard
On global effects caused by locally noneffective unitary operations.

, , and . Quantum Inf. Comput., 9 (11&12): 1013-1029 (2009)

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.

Telma Gharibian

 

Other publications of authors with the same name

QMA variants with polynomially many provers, , and . CoRR, (2011)A linear time algorithm for quantum 2-SAT., and . CoRR, (2015)Hardness of Approximation for Quantum Problems., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 387-398. Springer, (2012)Ground State Connectivity of Local Hamiltonians., and . ICALP (1), volume 9134 of Lecture Notes in Computer Science, page 617-628. Springer, (2015)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)On Polynomially Many Queries to NP or QMA Oracles., and . ITCS, volume 215 of LIPIcs, page 75:1-75:27. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Almost Optimal Classical Approximation Algorithms for a Quantum Generalization of Max-Cut., and . APPROX-RANDOM, volume 145 of LIPIcs, page 31:1-31:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)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)Approximation Algorithms for QMA-Complete Problems., and . SIAM J. Comput., 41 (4): 1028-1050 (2012)Strong NP-hardness of the quantum separability problem.. Quantum Inf. Comput., 10 (3&4): 343-360 (2010)