default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLeonid P. Pryadko
Person information
- affiliation: University of California, Riverside, CA, USA
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i7]Carmen G. Almudéver, Leonid P. Pryadko, Valentin Savin, Bane Vasic:
Classical-Quantum Synergies in the Theory and Practice of Quantum Error Correction (Dagstuhl Seminar 24212). Dagstuhl Reports 14(5): 173-190 (2024)- 2023
- [c7]Renyu Wang, Hsiang-Ku Lin, Leonid P. Pryadko:
Abelian and Non-Abelian Quantum Two-Block Codes. ISTC 2023: 1-5 - 2022
- [j6]Leonid P. Pryadko
, Vadim A. Shabashov, Valerii K. Kozin:
QDistRnd: A GAP package for computing the distance of quantum error-correcting codes. J. Open Source Softw. 7(71): 4120 (2022) - [j5]Renyu Wang, Leonid P. Pryadko:
Distance Bounds for Generalized Bicycle Codes. Symmetry 14(7): 1348 (2022) - 2020
- [j4]Leonid P. Pryadko:
On maximum-likelihood decoding with circuit-level errors. Quantum 4: 304 (2020)
2010 – 2019
- 2019
- [c6]Weilei Zeng, Alexei Ashikhmin, Michael Woolls, Leonid P. Pryadko:
Quantum convolutional data-syndrome codes. SPAWC 2019: 1-5 - 2018
- [i6]Alexey A. Kovalev, Sanjay Prabhakar, Ilya Dumer, Leonid P. Pryadko:
Numerical and analytical bounds on threshold error rates for hypergraph-product codes. CoRR abs/1804.01950 (2018) - 2017
- [j3]Kathleen E. Hamilton, Leonid P. Pryadko:
Algebraic bounds for heterogeneous site percolation on directed and undirected graphs. Discret. Appl. Math. 222: 124-142 (2017) - [j2]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Distance Verification for Classical and Quantum LDPC Codes. IEEE Trans. Inf. Theory 63(7): 4675-4686 (2017) - 2016
- [c5]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Distance verification for LDPC codes. ISIT 2016: 2529-2533 - [i5]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Distance verification for LDPC codes. CoRR abs/1605.02410 (2016) - [i4]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Distance verification for classical and quantum LDPC codes. CoRR abs/1611.07164 (2016) - 2015
- [j1]Alexey A. Kovalev, Leonid P. Pryadko:
Spin glass reflection of the decoding transition for quantum error correcting codes. Quantum Inf. Comput. 15(9&10): 825-852 (2015) - 2014
- [c4]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Numerical techniques for finding the distances of quantum codes. ISIT 2014: 1086-1090 - [i3]Ilya Dumer, Alexey A. Kovalev, Leonid P. Pryadko:
Numerical Techniques for Finding the Distances of Quantum Codes. CoRR abs/1405.0348 (2014) - 2013
- [c3]Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko:
Linked-cluster technique for finding the distance of a quantum LDPC code. ITA 2013: 1-6 - [i2]Alexey A. Kovalev, Ilya Dumer, Leonid P. Pryadko:
Linked-Cluster Technique for Finding the Distance of a Quantum LDPC Code. CoRR abs/1302.1845 (2013) - 2012
- [c2]Alexandr Kovalev, Leonid P. Pryadko:
Improved quantum hypergraph-product LDPC codes. ISIT 2012: 348-352 - 2010
- [c1]Yunfan Li, Ilya Dumer, Markus Grassl, Leonid P. Pryadko:
Clustered bounded-distance decoding of codeword-stabilized quantum codes. ISIT 2010: 2662-2666
2000 – 2009
- 2009
- [i1]Yunfan Li, Ilya Dumer, Markus Grassl, Leonid P. Pryadko:
Structured Error Recovery for Codeword-Stabilized Quantum Codes. CoRR abs/0912.3245 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 21:23 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
