Local Hamiltonians Whose Ground States are Hard to Approximate L Eldar, AW Harrow Foundations of Computer Science (FOCS) 2017, 2015 | 69 | 2015 |
On the complexity of commuting local Hamiltonians, and tight conditions for topological order in such systems D Aharonov, L Eldar IEEE 52nd Annual Symposium Foundations of Computer Science (FOCS) 334, 2011 | 63 | 2011 |
Quantum locally testable codes D Aharonov, L Eldar SIAM J. Comput., 44(5), 1230–1262. (33 pages), 2015 | 47 | 2015 |
Approximating the permanent of a random matrix with vanishing mean L Eldar, S Mehraban Foundations of Computer Science, FOCS 2018, 2017 | 25 | 2017 |
The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP D Aharonov, L Eldar Quantum Information Processing 14 (1), 83-101, 2015 | 22 | 2015 |
Receiver and a method for channel estimation L Eldar, R Bercovich US Patent 8,139,683, 2012 | 20 | 2012 |
Quantum SAT for a Qutrit-Cinquit Pair Is QMA 1-Complete L Eldar, O Regev Automata, Languages and Programming: 35th International Colloquium, ICALP …, 2008 | 18 | 2008 |
Commuting local Hamiltonians on expanders, locally testable quantum codes, and the qPCP conjecture D Aharonov, L Eldar arXiv preprint arXiv:1301.3407, 2013 | 10 | 2013 |
The Need for Structure in Quantum LDPC Codes L Eldar, M Ozols, KF Thompson IEEE Transactions on Information Theory ( March 2020 ) 66 (Issue: 3), 2019 | 9 | 2019 |
A Quasi-Random Approach to Matrix Spectral Analysis M Ben-Or, L Eldar Innovations in Computer Science (ITCS) 2018, 2015 | 9 | 2015 |
Robust Quantum Entanglement at (nearly) Room Temperature L Eldar 12th Innovations in Theoretical Computer Science Conference (ITCS 2021) 185 …, 2021 | 8 | 2021 |
An efficient quantum algorithm for lattice problems achieving subexponential approximation factor L Eldar, S Hallgren arXiv preprint arXiv:2201.13450, 2022 | 7 | 2022 |
Parametric channel estimation for pseudo-random user-allocation in uplink OFDMA L Eldar, MR Raghavendra, S Bhashyam, R Bercovich, K Giridhar 2006 IEEE International Conference on Communications 7, 3035-3039, 2006 | 7 | 2006 |
A Discrete Fourier Transform on Lattices with Quantum Applications L Eldar, P Shor QCrypt, 2017, 2017 | 5 | 2017 |
Harrow. 2017. Local Hamiltonians whose ground states are hard to approximate L Eldar, W Aram Foundations of Computer Science (FOCS), 2017 IEEE 58th Annual Symposium on …, 0 | 5 | |
Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits E Boix-Adserà, L Eldar, S Mehraban arXiv:1912.03824, 2019 | 2 | 2019 |
9th Innovations in Theoretical Computer Science Conference (ITCS 2018) K Efremenko, A Garg, R Oliveira, A Wigderson, JY Cai, Z Fu, K Girstmair, ... Schloss Dagstuhl-Leibniz-Zentrum für Informatik GmbH, 2018 | 2 | 2018 |
The Systematic Normal Form of Lattices L Eldar, PW Shor | 2 | 2016 |
An Efficient Quantum Decoder for Prime-Power Fields L Eldar arXiv preprint arXiv:2210.11552, 2022 | | 2022 |
LIPIcs, Volume 94, ITCS'18, Complete Volume}} AR Karlin 9th Innovations in Theoretical Computer Science Conference (ITCS 2018) 94, 0, 2018 | | 2018 |