A Magnetic Model with a Possible Chern-Simons Phase
Open accessThe DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Abstract
An elementary family of local Hamiltonians , is described for a 2-dimensional quantum mechanical system of spin particles. On the torus, the ground state space Gŝ,ℓ is (log) extensively degenerate but should collapse under ``perturbation'' to an anyonic system with a complete mathematical description: the quantum double of the SO(3)-Chern-Simons modular functor at q=e2πi/ℓ+2 which we call DEℓ. The Hamiltonian Hŝ,ℓ defines a quantum loop gas. We argue that for ℓ=1 and 2, G○,ℓ is unstable and the collapse to Gε,ℓ≌DEℓ can occur truly by perturbation. For ℓ≥3, G○,ℓ is stable and in this case finding Gε,ℓ≌DEℓ must require either ε>εℓ>0, help from finite system size, surface roughening (see Sect. 3), or some other trick, hence the initial use of quotes `` ''. A hypothetical phase diagram is included in the introduction. The effect of perturbation is studied algebraically: the ground state space G○,ℓ of H○,ℓ is described as a surface algebra and our ansatz is that perturbation should respect this structure yielding a perturbed ground state Gε,ℓ described by a quotient algebra. By classification, this implies Gε,ℓ≌DEℓ. The fundamental point is that nonlinear structures may be present on degenerate eigenspaces of an initial Hŝ which constrain the possible effective action of a perturbation. There is no reason to expect that a physical implementation of Gε,ℓ≌DEℓ as an anyonic system would require the low temperatures and time asymmetry intrinsic to Fractional Quantum Hall Effect (FQHE) systems or rotating Bosé-Einstein condensates − the currently known physical systems modelled by topological modular functors. A solid state realization of DE3, perhaps even one at a room temperature, might be found by building and studying systems, ``quantum loop gases'', whose main term is H○,3. This is a challenge for solid state physicists of the present decade. For ℓ≥3,ℓ≠2 mod 4, a physical implementation of DEℓ would yield an inherently fault-tolerant universal quantum computer. But a warning must be posted, the theory at ℓ=2 is not computationally universal and the first universal theory at ℓ=3 seems somewhat harder to locate because of the stability of the corresponding loop gas. Does nature abhor a quantum computer?
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Algorithms for quantum computation: discrete logarithms and factoring
Shor, P. W. (2002) · Proceedings 35th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1994.365700 · Cited by 8,713 · cited 2×
“Shor’s poly time factoring algorithm [ S2 ] and a thousand bit integer, and maps the pair into a string s of operations as in (3).”
BackgroundSimulating physics with computers
Feynman, R. P. (1982) · International Journal of Theoretical Physics · doi:10.1007/bf02650179 · Cited by 7,691
Quantum field theory and the Jones polynomial
Witten, E. (1989) · Communications in Mathematical Physics · doi:10.1007/bf01217730 · Cited by 4,758
Invariants of 3-manifolds via link polynomials and quantum groups
Reshetikhin, N., & Turaev, V. G. (1991) · Inventiones Mathematicae · doi:10.1007/bf01239527 · Cited by 1,492 · cited 1×
“s to meet at the intermediate level (θ 1 +θ 2)/2 w.r.t. the S1 orientation.) Regarding γ as labelled by the 2−dimensional representation, hγ 1,γ 2i:= Witten invariant (Yb ×S1,γ) at level ℓ, see [Wi], [RT], and [BHMV]. We refer to this pairing, also, as the Markov trace pairing. The combinatorial properties the code sp…”
Quantum computations: algorithms and error correction
Kitaev, A. Y. (1997) · Russian Mathematical Surveys · doi:10.1070/rm1997v052n06abeh002155 · Cited by 1,424 · cited 2×
“conversion of eigenvalues observed to a probabilistic output is the same as for the qubit architecture. The structure of the compiler is also similar but must include a rapid approximation algorithm [K2][So] subroutine. We have presented Hǫ,3,t as a theoretical candidate for an anyonic medium capable of universal quan…”
BackgroundMethodClassical and Quantum Computation
Kitaev, A., Shen, A., & Vyalyi, M. (2002) · Graduate Studies in Mathematics · doi:10.1090/gsm/047 · Cited by 1,387
Quantum computational networks
Deutsch, D. E. (1989) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1989.0099 · Cited by 1,270 · cited 1×
“putation defined: q-Turing machine [ D ], q-circuit model [Y], q-cellular automata [Ll].”
State sum invariants of 3-manifolds and quantum 6j-symbols
Turaev, V. G., & Viro, O. Y. (1992) · Topology · doi:10.1016/0040-9383(92)90015-a · Cited by 1,145
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649
The Geometry and Physics of Knots
Atiyah, M. (1990) · doi:10.1017/cbo9780511623868 · Cited by 597
Maintaining coherence in quantum computers
Unruh, W. G. (1995) · Physical Review A · doi:10.1103/physreva.51.992 · Cited by 594
A Modular Functor Which is Universal¶for Quantum Computation
Freedman, M. H., Larsen, M., & Wang, Z. (2002) · Communications in Mathematical Physics · doi:10.1007/s002200200645 · Cited by 573 · cited 4×
“ctional quantum Hall effect FQHE. With a few low level (e.g. ℓ = 1,2 or 4, when G = SU(2)) exceptions nonabelian anyonic systems are capable, under braiding, of realizing universal quantum computation [FLW2]. The essential point is that the braid representation “Jones representation” associated to the Lie group SU(2) h…”
BackgroundInfluentialSelf-citation
Cited by
Non-Abelian anyons and topological quantum computation
Nayak, C., Simon, S. H., Stern, A., Freedman, M., & Das Sarma, S. (2008) · Reviews of Modern Physics · doi:10.1103/revmodphys.80.1083 · Cited by 6,861
Self-citationAnyons in an exactly solved model and beyond
Kitaev, A. (2006) · Annals of Physics · doi:10.1016/j.aop.2005.10.005 · Cited by 5,245
“S5 [24], A5 [32, 33] and S3 [34]), and double Chern-Simons models [ 35 , 36, 37].”
Operator quantum error-correcting subsystems for self-correcting quantum memories
Bacon, D. (2006) · Physical Review A · doi:10.1103/physreva.73.012340 · Cited by 486
On Classification of Modular Tensor Categories
Rowell, E., Stong, R., & Wang, Z. (2009) · Communications in Mathematical Physics · doi:10.1007/s00220-009-0908-z · Cited by 314
Metadata
- Authors
- Freedman, M. H.
- Venue
- Communications in Mathematical Physics
- Published
- 2003-03-01
- Volume
- 234
- Issue
- 1
- Pages
- 129-183
- ISSN
- 0010-3616 (ISSN-L)
- 1432-0916
- OpenAlex
- W2080398313
- Cited by
- 80
- References
- 12
- FWCI
- 4.01
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.