default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDItai Arad
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c10]Itai Arad
, Raz Firanko, Rahul Jain:
An Area Law for the Maximally-Mixed Ground State in Arbitrarily Degenerate Systems with Good AGSP. STOC 2024: 1311-1322- [i9]Aviad Kaufmann, Itai Arad:
A blockBP decoder for the surface code. CoRR abs/2402.04834 (2024) - [i8]Itai Arad, Miklos Santha:
Quasi-quantum states and the quasi-quantum PCP theorem. CoRR abs/2410.13549 (2024) - 2023
- [i7]Itai Arad, Raz Firanko, Rahul Jain:
Area law for the maximally mixed ground state in degenerate 1D gapped systems. CoRR abs/2310.19028 (2023) - 2022
- [c9]Anurag Anshu, Itai Arad, David Gosset:
An area law for 2d frustration-free spin systems. STOC 2022: 12-18 - 2020
- [c8]Anurag Anshu, Itai Arad, David Gosset:
Entanglement subvolume law for 2d frustration-free spin systems. STOC 2020: 868-874
2010 – 2019
- 2018
- [j5]Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
Linear-Time Algorithm for Quantum 2SAT. Theory Comput. 14(1): 1-27 (2018) - 2017
- [c7]Itai Arad, Zeph Landau, Umesh V. Vazirani, Thomas Vidick:
Rigorous Rg Algorithms and Area Laws for Low Energy Eigenstates In 1D. ITCS 2017: 46:1-46:14 - 2016
- [c6]Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
Linear Time Algorithm for Quantum 2SAT. ICALP 2016: 15:1-15:14 - [c5]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the Complexity of Probabilistic Trials for Hidden Satisfiability Problems. MFCS 2016: 12:1-12:14 - [i6]Itai Arad, Adam Bouland, Daniel Grier, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
On the complexity of probabilistic trials for hidden satisfiability problems. CoRR abs/1606.03585 (2016) - 2015
- [j4]Or Sattath, Itai Arad:
A constructive quantum Lovasz local lemma for commuting projectors. Quantum Inf. Comput. 15(11&12): 987-996 (2015) - [i5]Itai Arad, Miklos Santha, Aarthi Sundaram, Shengyu Zhang:
Linear time algorithm for quantum 2SAT. CoRR abs/1508.06340 (2015) - 2014
- [c4]Itai Arad, Shai A. Arogeti, Rami Ronen:
Coordinated path following control for a group of car-like vehicles with an application to intelligent transportation system. ICARCV 2014: 59-64 - [c3]Itai Arad, Shai A. Arogeti:
Null-space behavioral approach for car-like vehicles with application to intelligent transportation system. ICARCV 2014: 1805-1810 - 2013
- [j3]Dorit Aharonov, Itai Arad, Thomas Vidick:
Guest column: the quantum PCP conjecture. SIGACT News 44(2): 47-79 (2013) - [i4]Dorit Aharonov, Itai Arad, Thomas Vidick:
The Quantum PCP Conjecture. CoRR abs/1309.7495 (2013) - [i3]Itai Arad, Or Sattath:
A Constructive Quantum Lovász Local Lemma for Commuting Projectors. CoRR abs/1310.7766 (2013) - 2011
- [j2]Itai Arad:
A note about a partial no-go theorem for quantum PCP. Quantum Inf. Comput. 11(11-12): 1019-1027 (2011) - [c2]Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani:
The 1D Area Law and the Complexity of Quantum States: A Combinatorial Approach. FOCS 2011: 324-333 - 2010
- [j1]Itai Arad, Zeph Landau:
Quantum Computation and the Evaluation of Tensor Networks. SIAM J. Comput. 39(7): 3089-3121 (2010) - [i2]Itai Arad:
A note about a partial no-go theorem for quantum PCP. CoRR abs/1012.3319 (2010)
2000 – 2009
- 2009
- [c1]Dorit Aharonov, Itai Arad, Zeph Landau, Umesh V. Vazirani:
The detectability lemma and quantum gap amplification. STOC 2009: 417-426 - 2006
- [i1]Dorit Aharonov, Itai Arad:
The BQP-hardness of approximating the Jones Polynomial. CoRR abs/quant-ph/0605181 (2006)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-01 01:13 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
