Panteleev, Pavel
- Asymptotically Good Quantum and Locally Testable Classical LDPC Codes
2021/11/05 by Pavel Panteleev, Gleb Kalachev, Panteleev, Pavel +1 · 65 citations
Computer Science · #Quantum Computing Algorithms and Architecture #Error Correcting Code Techniques #Complexity and Algorithms in Graphs
- Maximally Extendable Sheaf Codes
2024/03/06 by Pavel Panteleev, Gleb Kalachev, Panteleev, Pavel +1 · 2 citations
Computer Science · Engineering · #55N30 #81P73 #94B05 #Cellular Automata and Applications #Coding theory and cryptography #Computational Complexity (cs.CC) #FOS: Computer and information sciences #FOS: Physical sciences #H.1.1 #Information Theory (cs.IT) #Quantum Physics (quant-ph) #graph theory and CDMA systems
- Multi-Tensor Contraction for XEB Verification of Quantum Circuits
2021/08/12 by Kalachev, Gleb, Panteleev, Pavel, Yung, Man-Hong · 1 citation
#FOS: Physical sciences #Quantum Physics (quant-ph)
- Classical Sampling of Random Quantum Circuits with Bounded Fidelity
2021/12/30 by Kalachev, Gleb, Panteleev, Pavel, Zhou, PengFei +1 · 1 citation
#FOS: Physical sciences #Quantum Physics (quant-ph)
- Maximally Extendable Product Codes are Good Coboundary Expanders
2025/01/02 by Gleb Kalachev, Pavel Panteleev, Kalachev, Gleb +1 · 1 voice · 2 citations
#cs.IT #quant-ph
- Two-sided Robustly Testable Codes
2022/06/20 by Gleb Kalachev, Pavel Panteleev, Kalachev, Gleb +1 · 1 citation
Computer Science · #Complexity and Algorithms in Graphs #Cryptography and Data Security #FOS: Computer and information sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture