Constructs Z_N extended fusion rings and modular partition functions for nonanomalous subgroups, extending to multicomponent systems and orbifoldings in CFTs.
Beyond paired quantum Hall states: parafermions and incompressible states in the first excited Landau level
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
abstract
The Pfaffian quantum Hall states, which can be viewed as involving pairing either of spin-polarized electrons or of composite fermions, are generalized by finding the exact ground states of certain Hamiltonians with k+1-body interactions, for all integers k > 0. The remarkably simple wavefunctions of these states involve clusters of k particles, and are related to correlators of parafermion currents in two-dimensional conformal field theory. The k=2 case is the Pfaffian. For k > 1, the quasiparticle excitations of these systems are expected to possess nonabelian statistics, like those of the Pfaffian. For k=3, these ground states have large overlaps with the ground states of the (2-body) Coulomb-interaction Hamiltonian for electrons in the first excited Landau level at total filling factors \nu=2+3/5, 2+2/5.
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.
citing papers explorer
-
Extending fusion rules with finite subgroups: A general construction of $Z_{N}$ extended conformal field theories and their orbifoldings
Constructs Z_N extended fusion rings and modular partition functions for nonanomalous subgroups, extending to multicomponent systems and orbifoldings in CFTs.
-
Lower overhead fault-tolerant building blocks for noisy quantum computers
New combinatorial proofs and circuit designs for quantum error correction reduce physical qubit overhead by up to 10x and time overhead by 2-6x for codes including Steane, Golay, and surface codes.