238 citations · 421 across the 9 of their papers we have counts for
9 papers
Pilot-Wave Simulator: Exact Classical Sampling from Ideal and Noisy Quantum Circuits up to Hundreds of Qubits
Gleb Kalachev, Pavel Mosharev, Zuoheng Zou +2
Quantum circuit simulators running on classical computers offer a vital platform for designing, testing, and optimizing quantum algorithms, driving innovation despite limited acces…
Maximally Extendable Product Codes are Good Coboundary Expanders
Gleb Kalachev, Pavel Panteleev
We investigate the coboundary expansion property of tensor product codes, known as product expansion, which plays an important role in recent constructions of good quantum LDPC cod…
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…
Two-sided Robustly Testable Codes
Gleb Kalachev, Pavel Panteleev
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 produc…
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…
Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
Pavel Panteleev, Gleb Kalachev
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 c…
Multi-Tensor Contraction for XEB Verification of Quantum Circuits
Gleb Kalachev, Pavel Panteleev, Man-Hong Yung
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 qua…
Quantum LDPC Codes with Almost Linear Minimum Distance
Pavel Panteleev, Gleb Kalachev
We give a construction of quantum LDPC codes of dimension and distance as the code length . Using a product of chain complexes this constructi…
Degenerate Quantum LDPC Codes With Good Finite Length Performance
Pavel Panteleev, Gleb Kalachev
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 m…