Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete. - Lior Eldar; Oded Regev 001 (ICALP (1), 2008)

On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems. - Dorit Aharonov; Lior Eldar (FOCS, 2011)

Quantum computing : a two-way street between computer science and quantum mechanics (שער נוסף בעברית: החישוב הקוונטי : דר דו-כיוונית בין מכניקת הקוונטים למדעי המחשב). - Lior Eldar (2014)

The Quasi-Random Perspective on Matrix Spectral Analysis with Applications. - Michael Ben-Or; Lior Eldar (CoRR, 2015)

The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP. - Dorit Aharonov; Lior Eldar (Quantum Inf. Process., 2015)

Quantum Locally Testable Codes. - Dorit Aharonov; Lior Eldar (SIAM J. Comput., 2015)

The Systematic Normal Form of Lattices. - Lior Eldar; Peter W. Shor (CoRR, 2016)

Local Hamiltonians Whose Ground States Are Hard to Approximate. - Lior Eldar; Aram W. Harrow (FOCS, 2017)

Approximating the Permanent of a Random Matrix with Vanishing Mean. - Lior Eldar; Saeed Mehraban (FOCS, 2018)

A Quasi-Random Approach to Matrix Spectral Analysis. - Michael Ben-Or; Lior Eldar (ITCS, 2018)

Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits. - Enric Boix-Adserà; Lior Eldar; Saeed Mehraban (CoRR, 2019)

The Need for Structure in Quantum LDPC Codes. - Lior Eldar; Maris Ozols; Kevin Thompson 005 (IEEE Trans. Inf. Theory, 2020)

Robust Quantum Entanglement at (Nearly) Room Temperature. - Lior Eldar (ITCS, 2021)

An efficient quantum algorithm for lattice problems achieving subexponential approximation factor. - Lior Eldar; Sean Hallgren (CoRR, 2022)