6 citations · 7 across the 3 of their papers we have counts for
3 papers
cs.IT2024
Maximally Extendable Sheaf Codes
Pavel Panteleev, Gleb Kalachev
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 spa…
quant-ph2021★ 6 cited
Classical Sampling of Random Quantum Circuits with Bounded Fidelity
Gleb Kalachev, Pavel Panteleev, PengFei Zhou +1
Random circuit sampling has become a popular means for demonstrating the superiority of quantum computers over classical supercomputers. While quantum chips are evolving rapidly, c…
cs.FL2014★ 1 cited
Preset Distinguishing Sequences and Diameter of Transformation Semigroups
Pavel Panteleev
We investigate the length of a shortest preset distinguishing sequence (PDS) in the worst case for a -element subset of an -state Mealy automaton. It was mentione…