( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP.

, и . Quantum Inf. Process., 14 (1): 83-101 (2015)

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.

Eldar Madumarov

Lior Martin

Eldar Sultanow

Nadia Ahmed Eldardiry Hanafy

Eugénie Lioris

 

Другие публикации лиц с тем же именем

Quantum Locally Testable Codes., и . CoRR, (2013)Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits., , и . CoRR, (2019)The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP., и . Quantum Inf. Process., 14 (1): 83-101 (2015)Parametric Channel Estimation for Pseudo-Random User-Allocation in Uplink OFDMA., , , , и . ICC, стр. 3035-3039. IEEE, (2006)On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems., и . FOCS, стр. 334-343. IEEE Computer Society, (2011)Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete., и . ICALP (1), том 5125 из Lecture Notes in Computer Science, стр. 881-892. Springer, (2008)Approximating the Permanent of a Random Matrix with Vanishing Mean., и . FOCS, стр. 23-34. IEEE Computer Society, (2018)Local Hamiltonians Whose Ground States Are Hard to Approximate., и . FOCS, стр. 427-438. IEEE Computer Society, (2017)A Quasi-Random Approach to Matrix Spectral Analysis., и . ITCS, том 94 из LIPIcs, стр. 6:1-6:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Robust Quantum Entanglement at (Nearly) Room Temperature.. ITCS, том 185 из LIPIcs, стр. 49:1-49:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)