Lior Eldar

16 papers A* 3A 2Journal 9Unranked 1
YearRankTypeTitle / Venue / Authors
2022 J jnl
An efficient quantum algorithm for lattice problems achieving subexponential approximation factor.
CoRR
Lior Eldar, Sean Hallgren
2021 A conf
Robust Quantum Entanglement at (Nearly) Room Temperature.
ITCS
Lior Eldar
2020 J jnl
The Need for Structure in Quantum LDPC Codes.
IEEE Trans. Inf. Theory
Lior Eldar, Maris Ozols, Kevin Thompson
2019 J jnl
Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits.
CoRR
Enric Boix-Adserà, Lior Eldar, Saeed Mehraban
2018 A conf
A Quasi-Random Approach to Matrix Spectral Analysis.
ITCS
Michael Ben-Or, Lior Eldar
2018 A* conf
Approximating the Permanent of a Random Matrix with Vanishing Mean.
FOCS
Lior Eldar, Saeed Mehraban
2017 J jnl
Approximating the Permanent of a Random Matrix with Vanishing Mean.
CoRR
Lior Eldar, Saeed Mehraban
2017 A* conf
Local Hamiltonians Whose Ground States Are Hard to Approximate.
FOCS
Lior Eldar, Aram W. Harrow
2016 J jnl
The Systematic Normal Form of Lattices.
CoRR
Lior Eldar, Peter W. Shor
2015 J jnl
Quantum Locally Testable Codes.
SIAM J. Comput.
Dorit Aharonov, Lior Eldar
2015 J jnl
The Quasi-Random Perspective on Matrix Spectral Analysis with Applications.
CoRR
Michael Ben-Or, Lior Eldar
2015 J jnl
The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP.
Quantum Inf. Process.
Dorit Aharonov, Lior Eldar
2014 — —
Quantum computing : a two-way street between computer science and quantum mechanics (שער נוסף בעברית: החישוב הקוונטי : דר דו-כיוונית בין מכניקת הקוונטים למדעי המחשב).
Lior Eldar
2013 J jnl
Quantum Locally Testable Codes.
CoRR
Dorit Aharonov, Lior Eldar
2011 A* conf
On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems.
FOCS
Dorit Aharonov, Lior Eldar
2008 — conf
Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete.
ICALP (1)
Lior Eldar, Oded Regev