Lior Eldar

发表

A Discrete Fourier Transform on Lattices with Quantum Applications

P. Shor, Lior Eldar, 2017, 1703.02515.

An Efficient Quantum Algorithm for a Variant of the Closest Lattice-Vector Problem

P. Shor, Lior Eldar, 2016, 1611.06999.

A Quasi-Random Approach to Matrix Spectral

M. Ben-Or, Lior Eldar, 2018 .

On the Commuting Local Hamiltonian Problem, and Tight Conditions on Topological Order

D. Aharonov, Lior Eldar, 2011 .

Robust Quantum Entanglement at (Nearly) Room Temperature

Lior Eldar, Lior Eldar, 2019, ITCS.

Quantum Locally Testable Codes

Dorit Aharonov, Lior Eldar, D. Aharonov, 2013, SIAM J. Comput..

Commuting Local Hamiltonians on Expanders, Locally Testable Quantum codes, and the qPCP conjecture

Dorit Aharonov, Lior Eldar, D. Aharonov, 2013, 1301.3407.

The Need for Structure in Quantum LDPC Codes

Maris Ozols, Lior Eldar, Kevin F. Thompson, 2016, IEEE Transactions on Information Theory.

Local Hamiltonians Whose Ground States Are Hard to Approximate

Lior Eldar, Aram Wettroth Harrow, A. Harrow, 2015, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).

The commuting local Hamiltonian problem on locally expanding graphs is approximable in $$\mathsf{{NP}}$$NP

D. Aharonov, Lior Eldar, 2015, Quantum Inf. Process..

The commuting local Hamiltonian on locally-expanding graphs is in NP.

Dorit Aharonov, Lior Eldar, D. Aharonov, 2013, 1311.7378.

On the Complexity of Commuting Local Hamiltonians, and Tight Conditions for Topological Order in Such Systems

Dorit Aharonov, Lior Eldar, D. Aharonov, 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.

An efficient quantum algorithm for lattice problems achieving subexponential approximation factor

Lior Eldar, Sean Hallgren, 2022, ArXiv.

Optimal algorithms for linear algebra by quantum inspiration pdf

Michael Ben-Or, Lior Eldar, M. Ben-Or, 2013, ArXiv.

Local Hamiltonians with No Low-energy Trivial States

A. Harrow, Lior Eldar, 2015 .

The commuting local Hamiltonian problem on locally expanding graphs is approximable in NP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt}

Dorit Aharonov, Lior Eldar, D. Aharonov, 2014, Quantum Information Processing.

Local Hamiltonians with Approximation-Robust Entanglement

Lior Eldar, Lior Eldar, 2015, 1503.02269.

Quantum systems with approximation-robust entanglement

Lior Eldar, Lior Eldar, 2015 .

Approximating the Permanent of a Random Matrix with Vanishing Mean

Lior Eldar, Saeed Mehraban, S. Mehraban, 2017, 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS).

The Systematic Normal Form of Lattices pdf

Peter W. Shor, Lior Eldar, P. Shor, 2016, ArXiv.

Quantum SAT for a Qutrit-Cinquit Pair Is QMA1-Complete

Oded Regev, Lior Eldar, O. Regev, 2008, ICALP.

The Quasi-Random Perspective on Matrix Spectral Analysis with Applications pdf

Michael Ben-Or, Lior Eldar, M. Ben-Or, 2015, ArXiv.

Approximating the Determinant of Well-Conditioned Matrices by Shallow Circuits pdf

Enric Boix-Adsera, Lior Eldar, Saeed Mehraban, 2019, ArXiv.