Zobrazeno 1 - 10
of 44
pro vyhledávání: '"Fault tolerant computation"'
Autor:
Nikolas Breuckmann, Christophe Vuillot
Publikováno v:
IEEE Transactions on Information Theory, 68(9)
Vuillot, C & Breuckmann, N P 2022, ' Quantum Pin Codes ', IEEE Transactions on Information Theory, vol. 68, no. 9, pp. 5955-5974 . https://doi.org/10.1109/TIT.2022.3170846
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2022, ⟨10.1109/TIT.2022.3170846⟩
Vuillot, C & Breuckmann, N P 2022, ' Quantum Pin Codes ', IEEE Transactions on Information Theory, vol. 68, no. 9, pp. 5955-5974 . https://doi.org/10.1109/TIT.2022.3170846
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory, 2022, ⟨10.1109/TIT.2022.3170846⟩
We introduce quantum pin codes: a class of quantum CSS codes. Quantum pin codes are a generalization of quantum color codes and Reed-Muller codes and share a lot of their structure and properties. Pin codes have gauge operators, an unfolding procedur
Autor:
Preskill, John
Publikováno v:
Proceedings: Mathematical, Physical and Engineering Sciences, 1998 Jan 01. 454(1969), 385-410.
Externí odkaz:
https://www.jstor.org/stable/53172
Publikováno v:
PODC
The celebrated result of Fischer, Lynch and Paterson is the fundamental lower bound for asynchronous fault tolerant computation: any 1-crash resilient asynchronous agreement protocol must have some (possibly measure zero) probability of not terminati
Publikováno v:
SIU
In this study, we propose a simple method for fault-tolerant Strassen-like matrix multiplications. The proposed method is based on using two distinct Strassen-like algorithms instead of replicating a given one. We have realized that using two differe
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::48a7bc19cc102543d2afbe63583e9997
http://arxiv.org/abs/2210.04441
http://arxiv.org/abs/2210.04441
We initiate the study of distributed graph algorithms under the presence of Byzantine nodes. We consider the fundamental problem of testing the connectivity of a graph in the congested clique model in a Byzantine setting. We are given a n-vertex (arb
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ba35c293774415f17f411c3d63da1407
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Felipe Gomes Lacerda
Publikováno v:
Repositório Institucional da UnB
Universidade de Brasília (UnB)
instacron:UNB
Universidade de Brasília (UnB)
instacron:UNB
Tese (doutorado)—Universidade de Brasília, Instituto de Ciências Exatas, Departamento de Ciência da Computação, 2015. Implementações físicas de algoritmos criptográficos vazam informação, o que os torna vulneráveis aos chamados ataques
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::854220d6fc01f99f87433664203e661f
https://doi.org/10.26512/2015.07.t.19594
https://doi.org/10.26512/2015.07.t.19594
Publikováno v:
IEEE Transactions on Information Theory. 54(8):3693-3698
It is known that $\epsilon$-noisy gates with 2 inputs are universal for arbitrary computation (i.e.\ can compute any function with bounded error), if all gates fail independently with probability $\epsilon$ and $\epsilon
Autor:
Falk Unger
Publikováno v:
IEEE Transactions on Information Theory, 54(8), 3693-3698. Institute of Electrical and Electronics Engineers Inc.
IEEE Transactions on Information Theory, 54(8), 3693-3698
IEEE Transactions on Information Theory, 54(8), 3693-3698
It is known that $\epsilon$-noisy gates with 2 inputs are universal for arbitrary computation (i.e.\ can compute any function with bounded error), if all gates fail independently with probability $\epsilon$ and $\epsilon
Publikováno v:
Fundamenta Informaticae. 42:61-73
We consider the problem of dependable computation with multiple inputs. The goal is to study when redundancy can help to achieve survivability and when it cannot. We use AND/OR graphs to model fault tolerant computations with multiple inputs. While t