Itai Arad

According to our database1, Itai Arad authored at least 17 papers between 2006 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A blockBP decoder for the surface code.
CoRR, 2024

2023
Area law for the maximally mixed ground state in degenerate 1D gapped systems.
CoRR, 2023

2022
An area law for 2d frustration-free spin systems.
Proceedings of the STOC '22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20, 2022

2020
Entanglement subvolume law for 2d frustration-free spin systems.
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing, 2020

2018
Linear-Time Algorithm for Quantum 2SAT.
Theory Comput., 2018

2017
Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D.
Proceedings of the 8th Innovations in Theoretical Computer Science Conference, 2017

2016
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

2015
A constructive quantum Lovasz local lemma for commuting projectors.
Quantum Inf. Comput., 2015

2014
Coordinated path following control for a group of car-like vehicles with an application to intelligent transportation system.
Proceedings of the 13th International Conference on Control Automation Robotics & Vision, 2014

Null-space behavioral approach for car-like vehicles with application to intelligent transportation system.
Proceedings of the 13th International Conference on Control Automation Robotics & Vision, 2014

2013
Guest column: the quantum PCP conjecture.
SIGACT News, 2013

The Quantum PCP Conjecture.
CoRR, 2013

2011
A note about a partial no-go theorem for quantum PCP.
Quantum Inf. Comput., 2011

The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach.
Proceedings of the IEEE 52nd Annual Symposium on Foundations of Computer Science, 2011

2010
Quantum Computation and the Evaluation of Tensor Networks.
SIAM J. Comput., 2010

2009
The detectability lemma and quantum gap amplification.
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2006
The BQP-hardness of approximating the Jones Polynomial.
CoRR, 2006


  Loading...