phenomenon · claim-type · cross-domain-transfer · mechanism · claim-relation · replication-status · limitation — grounded in the full text| phenomenon | anyonic excitations in two-dimensional lattice spin models— “Excitations in this model are anyons, meaning that the global wavefunction acquires some phase factor when one excitation moves around the other.” | |
| claim-type | method— “These anyons can be used to perform universal quantum computation.” | |
| method — evidence | — “From now on, we are constructing and studying nonabelian anyons which will allow universal quantum computation.” | |
| transfer | from algebraic topology (homology and cohomology): 1-homologies and 1-cohomologies over Z2 used to describe the protected subspace of the lattice model, so that the stored information is a topological invariant rather than a local one— “In a more abstract language, the algebra (with coefficients from Z2), 1-homologies and 1-cohomologies.” | transfers[0] |
| mechanism | A PHYSICAL SYSTEM IS RE-DESCRIBED AS A COMPUTER, AND THE RE-DESCRIPTION IS MARKED AS ONE: a two-dimensional quantum system with anyonic excitations CAN BE CONSIDERED AS a quantum computer, with unitary transformations performed BY MOVING THE EXCITATIONS AROUND EACH OTHER and measurements BY JOINING EXCITATIONS IN PAIRS. `Can be considered as` is a way of regarding, not an identity, and the whole paper rests on it— “A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in pairs and observing the result of fusion.” | mechanisms[0] |
| mechanism | A PROPERTY IS LOCATED IN THE PHYSICS RATHER THAN IN THE PROTOCOL: such computation is said to be FAULT-TOLERANT BY ITS PHYSICAL NATURE - so what is elsewhere achieved by a procedure is here claimed as a feature of the material. The same word, fault-tolerance, is being attached to a different kind of thing— “Such computation is fault-tolerant by its physical nature. A quantum computer can provide fast solution for certain computational problems (e.g. factoring and discrete logarithm [1]) which require exponential time on an ordinary computer.” | mechanisms[1] |
| mechanism | A PHYSICAL PROCESS IS RE-DESCRIBED AS AN ALGORITHM AND THE HEDGE IS LEFT IN: the spins' mutual interaction forcing a flipped spin back is said to be QUITE SIMILAR TO THE STANDARD ERROR CORRECTION PROCEDURE FOR THE REPETITION CODE, after which - WE MAY SAY THAT ERRORS ARE BEING CORRECTED AT THE PHYSICAL LEVEL. The identification is offered as a manner of speaking— “If some spin flips to the opposite direction, the interaction forces it to flip back to the direction of other spins. This process is quite similar to the standard error correction procedure for the repetition code. We may say that errors are being corrected at the physical level.” | mechanisms[2] |
| mechanism | THE ARGUMENT PROCEEDS BY ASKING WHY AN EXISTING PRACTICE IS UNNECESSARY: classical computation CAN ALSO be performed fault-tolerantly, HOWEVER IT IS RARELY DONE IN PRACTICE BECAUSE CLASSICAL GATES ARE RELIABLE ENOUGH - and the next sentence is WHY IS IT POSSIBLE. The paper's question is generated by noticing that a technique is available and unused— “Needless to say, classical computation can be also performed fault-tolerantly. However, it is rarely done in practice because classical gates are reliable enough. Why is it possible?” | mechanisms[3] |
| mechanism | THE EXPLANATION IS SOUGHT IN THE EASIEST CASE FIRST AND THE CHOICE IS ANNOUNCED: LET US TRY TO UNDERSTAND THE EASIEST THING - why classical information can be stored reliably on magnetic media - before the quantum case is attempted. The order of explanation is stated rather than left implicit, and the chosen starting point is a fact about ordinary technology— “Let us try to understand the easiest thing — why classical information can be stored reliably on a magnetic media. Magnetism arise from spins of individual atoms. Each spin is quite sensitive to thermal fluctuations.” | mechanisms[4] |
| mechanism | A THRESHOLD IS REPORTED AS THE OBSTACLE, AND ITS SIZE IS WHAT MATTERS RATHER THAN ITS EXISTENCE: an arbitrary circuit CAN be simulated with imperfect gates PROVIDED they are close to ideal up to a constant precision - and UNFORTUNATELY THE THRESHOLD VALUE IS RATHER SMALL, IT IS VERY DIFFICULT TO ACHIEVE THIS PRECISION. The theoretical solution is granted and then declared impractical by a number— “An arbitrary quantum circuit can be simulated using imperfect gates, provided these gates are close to the ideal ones up to a constant precision δ. Unfortunately, the threshold value of δ is rather small1; it is very difficult to achieve this precision.” | mechanisms[5] |
| mechanism | A PROBLEM IS DECLARED SOLVED FROM ONE STANDPOINT AND OPEN FROM ANOTHER, WITH BOTH NAMED: physical realization is A BIG CHALLENGE and decoherence is one important problem - but FROM THE PURELY THEORETICAL POINT OF VIEW, THIS PROBLEM HAS BEEN SOLVED. Solved and unsolved at once, distinguished by which standpoint the word is being used from— “Physical realization of a quantum computer is a big challenge for scientists. One important problem is decoherence and systematic errors in unitary transformations which occur in real quantum systems. From the purely theoretical point of view, this problem has been solved due to Shor’s discovery of fault-tolerant quantum computation [2], with… | mechanisms[6] |
| mechanism | AN EXPLICIT CAUTION AGAINST CONFLATING TWO THINGS THE SAME MATHEMATICS DESCRIBES: the local operators SHOULD NOT BE INTERPRETED AS symmetry transformations - the true symmetry transformations are a different set, and MATHEMATICALLY THEY ARE DESCRIBED BY THE SAME ALGEBRA, BUT THEIR ACTION ON PHYSICAL STATES IS DIFFERENT. One formalism, two referents, and the paper stops to say so— “Caution. The local operators should not be interpreted as symmetry transformations. The true symmetry transformations, so-called topological operators, will be defined in Sec. 6. Mathematically, they are described by the same algebra , but their action on physical states is different.” | mechanisms[7] |
| mechanism | A TERM OF ART IS CONCEDED AND THEN SET ASIDE AS NOT THE RELEVANT PROPERTY: ONE MAY SAY that these codes have QUITE POOR PARAMETERS, and WELL, THEY ARE NOT GOOD CODES IN THE SENSE OF a cited definition - HOWEVER the code corrects almost any multiple error of a stated size, SO THESE CODES WORK. The established criterion is granted, and then shown not to be the criterion that matters here— “One may say that the toric codes have quite poor parameters. Well, they are not “good” codes in the sense of [17]. However, the code TOR(k) corrects almost any multiple error of size O(k2). (The constant factor in O(. . .) is related to the percolation problem). So, these codes work if the error rate is constant” | mechanisms[8] |
| builds-on | quantum error-correcting codes (stabilizer codes)— “we need a quantum code with local stabilizer operators” | claim_relations[0] |
| builds-on | stabilizer quantum codes on lattices on the torus and other 2-D surfaces [6, 8]— “I start with a class of stabilizer quantum codes associated with lattices on the torus and other 2-D surfaces [6, 8].” | claim_relations[1] |
| extends | G. Castagnoli and M. Rasetti's use of one-dimensional anyons for quantum computation [14]— “An attempt to use one-dimensional anyons for quantum computation was made by G. Castagnoli and M. Rasetti [14], but the question of fault-tolerance was not considered.” | claim_relations[2] |
| builds-on | Einarsson's proof that ground state degeneracy on the torus follows from the existence of anyons [19]— “Here is the original Einarsson’s proof applied to our two types of particles.” | claim_relations[3] |
| sense | fault tolerance - BY PHYSICS RATHER THAN BY PROCEDURE: Shor's construction simulates a circuit with imperfect gates given a precision threshold, whereas here the computation is said to be fault-tolerant by its physical nature, so the two uses of the phrase name a software guarantee and a property of a material— “Such computation is fault-tolerant by its physical nature” | senses[0] |
| sense | the threshold - A NUMBER THE ARGUMENT NEEDS AND NOBODY HAS: the text calls it rather small and very difficult to achieve, and the footnote says outright that it is not known, giving estimates that differ by orders of magnitude— “Unfortunately, the threshold value of δ is rather small1; it is very difficult to achieve this precision” | senses[1] |
| sense | the protected space - AS A DEGENERATE GROUND STATE: it coincides with the ground state of a Hamiltonian built from local stabilizer operators, and its size is set by the genus of the surface rather than by anything about the computation— “The ground state of this Hamiltonian coincides with the protected space of the code. It is 4g-fold degenerate, where g is the genus of the surface” | senses[2] |
| edge | protected space —same-as→ ground state— “The ground state of this Hamiltonian coincides with the protected space of the code” | concept_edges[0] |
| edge | anyonic excitations —causes→ fault-tolerant— “A two-dimensional quantum system with anyonic excitations can be considered as a quantum computer. Unitary transformations can be performed by moving the excitations around each other. Measurements can be performed by joining excitations in pairs and observing the result of fusion. Such computation is fault-tolerant by its physical… | concept_edges[1] |
| for which use | limitation — every fault-tolerance claim: DECOHERENCE AND SYSTEMATIC ERRORS IN UNITARY TRANSFORMATIONS OCCUR IN REAL QUANTUM SYSTEMS— “decoherence and systematic errors in unitary transformations which occur in real quantum systems” | limitations[0] |
| for which use | limitation — the abelian toric-code memory as a usable memory: UNFORTUNATELY, I DO NOT KNOW ANY WAY THIS QUANTUM INFORMATION CAN GET IN OR OUT— “Unfortunately, I do not know any way this quantum information can get in or out.” | limitations[1] |
| for which use | limitation — any universality claim for braiding abelian anyons: TOO FEW THINGS CAN BE DONE BY MOVING ABELIAN ANYONS— “Too few things can be done by moving abelian anyons.” | limitations[2] |
| for which use | limitation — the universal-computation construction: (THE GROUP S5 IS QUITE UNREALISTIC FOR PHYSICAL IMPLEMENTATION)— “(The group S5 is quite unrealistic for physical implementation).” | limitations[3] |
| for which use | limitation — the generality of the constructions: A GENERAL THEORY OF ANYONS AND TOPOLOGICAL QUANTUM ORDER IS LACKING— “A general theory of anyons and topological quantum order is lacking.” | limitations[4] |
| for which use | limitation — the universal-computation results as presented here: (THIS SECTION SHOULD BE CONSIDERED AS AN ABSTRACT OF RESULTS TO BE PRESENTED ELSEWHERE)— “(This section should be considered as an abstract of results to be presented elsewhere).” | limitations[5] |
| for which use | limitation — any use of the fault-tolerance threshold cited here: a footnote states the threshold is not known and that published estimates vary across several orders of magnitude— “Actually, the threshold is not known. Estimates vary from 1/300 [7] to 10−6 [4]” | limitations[6] |
| for which use | limitation — the claim that this scheme corrects errors at the physical level: the supporting argument is an analogy with spins on magnetic media, which the author introduces with 'we may say'— “This process is quite similar to the standard error correction procedure for the repetition code. We may say that errors are being corrected at the physical level” | limitations[7] |
| for which use | limitation — the amount of protected quantum information claimed here: the protected space is the ground state of the Hamiltonian and is 4g-fold degenerate, where g is the genus of the surface the lattice is placed on— “The ground state of this Hamiltonian coincides with the protected space of the code. It is 4g-fold degenerate, where g is the genus of the surface” | limitations[8] |
| evidence status note | mechanism — The span contains 'small1;' - a footnote marker glued to the preceding word by the extraction. The quote is an exact substring and anchors correctly.— “An arbitrary quantum circuit can be simulated using imperfect gates, provided these gates are close to the ideal ones up to a constant precision δ. Unfortunately, the threshold value of δ is rather small1; it is very difficult to achieve this precision.” | mechanisms[5] |
| evidence status note | mechanism — DAMAGE SHAPE 5 INSIDE THIS SPAN, and it removes a name. The sentence reads "described by the same algebra , but their action on physical states is different" - with a space before the comma where the algebra's symbol should be. The symbol was displaced past the end of the sentence by the extraction: "...is different. D 15 a b Figure 7:". So the quote says "the same algebra [ ]" and the algebra it names is unrecoverable from the span. The tag does not name it. Found by reading; no guard sees this.— “Caution. The local operators should not be interpreted as symmetry transformations. The true symmetry transformations, so-called topological operators, will be defined in Sec. 6. Mathematically, they are described by the same algebra , but their action on physical states is different.” | mechanisms[7] |
| replication | untested | |
| limitation | real quantum systems suffer decoherence and systematic errors— “decoherence and systematic errors in unitary transformations which occur in real quantum systems” | limitations[0] |
| limitation | For the abelian toric-code memory the author has no way to read information into or out of the protected space.— “Unfortunately, I do not know any way this quantum information can get in or out.” | limitations[1] |
| limitation | The gate set obtainable by braiding abelian anyons is not universal.— “Too few things can be done by moving abelian anyons.” | limitations[2] |
| limitation | The group used for the universal-computation construction is physically implausible.— “(The group S5 is quite unrealistic for physical implementation).” | limitations[3] |
| limitation | No general theory underlies the constructions given.— “A general theory of anyons and topological quantum order is lacking.” | limitations[4] |
| limitation | The universal-computation results are stated without full derivation, to appear elsewhere.— “(This section should be considered as an abstract of results to be presented elsewhere).” | limitations[5] |
| limitation | The number the whole fault-tolerance argument depends on is declared unknown in a footnote, with estimates three orders of magnitude apart.— “Actually, the threshold is not known. Estimates vary from 1/300 [7] to 10−6 [4]” | limitations[6] |
| limitation | The case that errors can be corrected by physics rather than by procedure is made by analogy with magnetic storage, and hedged.— “This process is quite similar to the standard error correction procedure for the repetition code. We may say that errors are being corrected at the physical level” | limitations[7] |
| limitation | The protection is degeneracy of a ground state on a surface, so the quantity protected depends on the topology chosen. | limitations[8] |
finding · quantity · variable · definition · key-term — grounded in the full text| finding | A two-dimensional quantum system with anyonic excitations can serve as a quantum computer, with unitary transformations performed by moving the excitations around each other. | content_tags.findings[0] |
| finding | The ground-state degeneracy persists under local perturbation. | content_tags.findings[1] |
| quantity | 4g-fold — ground-state degeneracy of the toric-code Hamiltonian, g = genus of the surface | content_tags.quantities[0] |
| quantity | ΔE = 2 — energy gap separating excited states (eigenvalue difference of the stabilizer operators) | content_tags.quantities[1] |
| variable | braiding (independent) | content_tags.variables[0] |
| variable | degenerate state (dependent) | content_tags.variables[1] |
| definition | nonabelian anyons | content_tags.definitions[0] |
| definition | braiding Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.definitions[1] |
| key-terms | quantum, excitations, topological, fault-tolerant, unitary, stabilizer, degenerate, braiding, anyons, error |
| concept | protected space Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[5] |
| concept | ground state Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[6] |
| concept | stabilizer operators Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[7] |
| concept | anyonic excitations Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[8] |
| concept | fault-tolerant Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | concepts[9] |
| mean μ | as written: average of Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.statistics[0] |
| standard-error SE | Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | content_tags.statistics[2] |
| claim type | method — a second reading reaching the same value; recorded: method Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | alternatives.claim_type |
| method | formal-model — a second reading DIFFERING from the recorded value; recorded: theory Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | alternatives.method |
| phenomenon | decoherence and systematic gate error as the obstacle to physically realising a quantum computer — a second reading DIFFERING from the recorded value; recorded: anyonic excitations in two-dimensional lattice spin models Quotation withheld — this paper is not ours to reproduce, and the page has already quoted as much of it as the rights layer allows. The tag, its field and its confidence stand; the sentence is at the publisher. | alternatives.phenomenon |
When we have changed our mind. Some entries in the table begin with a word in capitals and the reason for it. EVIDENCE CORRECTED — the finding still stands, but we had quoted the wrong sentence from the paper, and the quotation has been replaced with the right one. RETRACTED — the entry itself was wrong; it stays on the page, marked, with the reason, rather than being deleted. WITHDRAWN AND REPLACED — the entry was wrong, and a corrected version of it appears in the entries below. Each mark carries its own reason, in brackets, because the reasons differ from one entry to the next. An entry we have WITHDRAWN is removed from this page and kept in the record, with its reason. A line reading Audit and a date is a later re-reading of the entry against its whole sentence: DOUBTFUL means it was kept, and the reason says what is loose about it. Quotation marks inside the tagger's sentence. Where a tag is the tagger's own sentence, a phrase in quotation marks inside it is borrowed from the paper — the tagger's wording around it is not. The paper's own sentence is the evidence quote for that row; on this page it is withheld with the article, and the article is at its publisher. Nothing inside quotation marks anywhere on this page is ours: if it is quoted, it is the paper's. Whose words a concept carries. A concept entry records a term the paper itself uses, so the term, the sense given for it, and its evidence are the paper's own words, quoted where the paper fixes them. This is the opposite of a sense entry in the tag table, which is the tagger's sentence about how the paper uses a term. Where a concept entry could not be grounded in the paper's words, the entry says so on its own row.
Tag layer © the Meta-Tagging Project, CC BY 4.0. The paper text is © its authors/publisher
and is linked, not reproduced. Excerpts shown are short quotations for identification and verification.
· back to index
· concepts · authors
· עברית
© 2026 Shir Sivroni · ORCID 0009-0000-2597-2824