( en | de | ru )

 

Disambiguation of "Eldar, Lior"

Author of the publication

copydeleteadd this publication to your clipboard
Local Hamiltonians Whose Ground States Are Hard to Approximate.

, and . FOCS, page 427-438. IEEE Computer Society, (2017)

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.

Eldar Madumarov

Lior Martin

Eldar Sultanow

Nadia Ahmed Eldardiry Hanafy

Eugénie Lioris

 

Other publications of authors with the same name

Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits., , and . CoRR, (2019)Quantum Locally Testable Codes., and . CoRR, (2013)Parametric Channel Estimation for Pseudo-Random User-Allocation in Uplink OFDMA., , , , and . ICC, page 3035-3039. IEEE, (2006)The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP., and . Quantum Inf. Process., 14 (1): 83-101 (2015)Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete., and . ICALP (1), volume 5125 of Lecture Notes in Computer Science, page 881-892. Springer, (2008)On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems., and . FOCS, page 334-343. IEEE Computer Society, (2011)Approximating the Permanent of a Random Matrix with Vanishing Mean., and . FOCS, page 23-34. IEEE Computer Society, (2018)Local Hamiltonians Whose Ground States Are Hard to Approximate., and . FOCS, page 427-438. IEEE Computer Society, (2017)Quantum computing : a two-way street between computer science and quantum mechanics (שער נוסף בעברית: החישוב הקוונטי : דר דו-כיוונית בין מכניקת הקוונטים למדעי המחשב).. Hebrew University of Jerusalem, Israel, (2014)A Quasi-Random Approach to Matrix Spectral Analysis., and . ITCS, volume 94 of LIPIcs, page 6:1-6:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)