Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from VLDB 2026 / reviewers in the wild / expert

Li-Juan Xing

dblp:58/5594 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
3 papers
Quantum computing and quantum information · 50% Coding theory · 50%

Topics — the 4 heaviest of 5, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Quantum computing and quantum information › quantum error correction
quantum code		 0.432013
Classification of q-Ary Perfect Quantum Codes · IEEE Trans. Inf. Theory 2013
On a problem concerning the quantum hamming bound for impure quantum codes · IEEE Trans. Inf. Theory 2010
A family of asymptotically good quantum codes based on code concatenation · IEEE Trans. Inf. Theory 2009
Coding theory › error-correcting codes
code classification		 0.212013
Classification of q-Ary Perfect Quantum Codes · IEEE Trans. Inf. Theory 2013
Coding theory › error-correcting codes
concatenated codes		 0.112009
A family of asymptotically good quantum codes based on code concatenation · IEEE Trans. Inf. Theory 2009
Quantum computing and quantum information › quantum error correction
stabilizer codes		 0.112009
A family of asymptotically good quantum codes based on code concatenation · IEEE Trans. Inf. Theory 2009

Methods — techniques the papers use, named apart from their topics

parameter classification · 0.2threshold analysis · 0.1code concatenation · 0.1asymptotic analysis · 0.1
YearPublicationVenuePosition
2013 Classification of q-Ary Perfect Quantum Codes
abstract
We solve the problem of the classification ofq-ary perfect quantum codes. We prove that the only nontrivialq-ary perfect quantum codes are those with the parameters (((q2l- 1)/(q2- 1),qn- 2l,3))q. There exist no other nontrivialq-ary perfect quantum codes.
Zhuo Li 0007, Li-Juan Xing
 IEEE Trans. Inf. Theory2
2010 On a problem concerning the quantum hamming bound for impure quantum codes
abstract
A famous open problem in the theory of quantum error-correcting codes is whether or not the parameters of an impure quantum code can violate the quantum Hamming bound for pure quantum codes. We partially solve this problem. We demonstrate that there exists a thresholdN(d,m) such that an arbitrary((n,K,d))mquantum code must obey the quantum Hamming bound whenevern≥N(d,m). We list some values ofN(d,m) for smalldand binary quantum codes.
Zhuo Li 0007, Li-Juan Xing
 IEEE Trans. Inf. Theory2
2009 A family of asymptotically good quantum codes based on code concatenation
abstract
We explicitly construct an infinite family of asymptotically good concatenated quantum stabilizer codes where the outer codes use quantum Reed-Solomon codes and the inner codes use a set of special quantum codes. In the field of quantum error-correcting codes, this is the first time that a family of asymptotically good quantum codes is derived from bad codes. Its occurrence supplies a gap in quantum coding theory.
Zhuo Li 0007, Li-Juan Xing, Xinmei Wang
 IEEE Trans. Inf. Theory2