Zobrazeno 1 - 10
of 113
pro vyhledávání: '"Panteleev, Pavel"'
Autor:
Panteleev, Pavel, Kalachev, Gleb
We study sheaf codes, a type of linear codes with a fixed hierarchical collection of local codes, viewed as a sheaf of vector spaces on a finite topological space we call coded space. Many existing codes, such as tensor product codes, Sipser-Spielman
Externí odkaz:
http://arxiv.org/abs/2403.03651
Autor:
Kalachev, Gleb, Panteleev, Pavel
We show that the tensor product of two random linear codes is robustly testable with high probability. This implies that one can obtain pairs of linear codes such that their product and the product of their dual codes are simultaneously robustly test
Externí odkaz:
http://arxiv.org/abs/2206.09973
Random circuit sampling has become a popular means for demonstrating the superiority of quantum computers over classical supercomputers. While quantum chips are evolving rapidly, classical sampling algorithms are also getting better and better. The m
Externí odkaz:
http://arxiv.org/abs/2112.15083
Autor:
Panteleev, Pavel, Kalachev, Gleb
We study classical and quantum LDPC codes of constant rate obtained by the lifted product construction over non-abelian groups. We show that the obtained families of quantum LDPC codes are asymptotically good, which proves the qLDPC conjecture. Moreo
Externí odkaz:
http://arxiv.org/abs/2111.03654
The computational advantage of noisy quantum computers has been demonstrated by sampling the bitstrings of quantum random circuits. An important issue is how the performance of quantum devices could be quantified in the so-called "supremacy regime".
Externí odkaz:
http://arxiv.org/abs/2108.05665
Autor:
Panteleev, Pavel, Kalachev, Gleb
We give a construction of quantum LDPC codes of dimension $\Theta(\log N)$ and distance $\Theta(N/\log N)$ as the code length $N\to\infty$. Using a product of chain complexes this construction also provides a family of quantum LDPC codes of distance
Externí odkaz:
http://arxiv.org/abs/2012.04068
Autor:
Panteleev, Pavel, Kalachev, Gleb
Publikováno v:
Quantum 5, 585 (2021)
We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that with the help of OSD-
Externí odkaz:
http://arxiv.org/abs/1904.02703
Autor:
Bolosov, Ilia A.1 (AUTHOR) bolosov@ibch.ru, Panteleev, Pavel V.1 (AUTHOR) p.v.panteleev@gmail.com, Sychev, Sergei V.1 (AUTHOR) ovch@ibch.ru, Khokhlova, Veronika A.1 (AUTHOR), Safronova, Victoria N.1 (AUTHOR), Toropygin, Ilia Yu.2 (AUTHOR), Kombarova, Tatiana I.3 (AUTHOR), Korobova, Olga V.3 (AUTHOR), Pereskokova, Eugenia S.3 (AUTHOR), Borzilov, Alexander I.3 (AUTHOR), Ovchinnikova, Tatiana V.1,4 (AUTHOR), Balandin, Sergey V.1 (AUTHOR) arenicin@mail.ru
Publikováno v:
Pharmaceutics. Aug2023, Vol. 15 Issue 8, p2047. 15p.
Autor:
Panteleev, Pavel V., Pichkur, Eugene B., Kruglikov, Roman N., Paleskava, Alena, Shulenina, Olga V., Bolosov, Ilia A., Bogdanov, Ivan V., Safronova, Victoria N., Balandin, Sergey V., Marina, Valeriya I., Kombarova, Tatiana I., Korobova, Olga V., Shamova, Olga V., Myasnikov, Alexander G., Borzilov, Alexander I., Osterman, Ilya A., Sergiev, Petr V., Bogdanov, Alexey A., Dontsova, Olga A., Konevega, Andrey L.
Publikováno v:
Nature Communications; 10/16/2024, Vol. 15 Issue 1, p1-15, 15p
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.