<?xml version="1.0" encoding="UTF-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xml:lang="en">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer</title>
        <author>Peter W. Shor</author>
      </titleStmt>
      <publicationStmt>
        <p>Tag layer of the DHSS Meta-Tagging Project. The article text is reproduced from the
           staged copy named in sourceDesc and is not altered; the tags are held separately in
           standOff so that overlapping and nested spans are preserved.</p>
      </publicationStmt>
      <sourceDesc>
        <bibl>
          <title>Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer</title>
          <date>1997</date>
          <publisher>SIAM Journal on Computing / arXiv</publisher>
          <idno type="DOI">10.1137/S0097539795293172</idno>
          <idno type="arXiv">quant-ph/9508027</idno>
          <idno type="record">shor1997-factoring</idno>
          <note type="staged-file">shor1997-factoring.txt, the project's staged copy</note>
          <note type="text-sha1">521342bd9582cdca50d1970a641023c2feb1e03f</note>
          <note type="rights">arxiv-open</note>
        </bibl>
      </sourceDesc>
    </fileDesc>
    <profileDesc>
      <textClass><keywords><term>quantum-computing</term></keywords></textClass>
      <particDesc>
        <person xml:id="paper"><p>the paper's own words</p></person>
        <person xml:id="tagger"><p>the tag layer; a sentence written by the tagger about the
          paper, always anchored to a quotation but not itself a quotation</p></person>
      </particDesc>
    </profileDesc>
    <revisionDesc>
      <change when="2026-10-06"
              who="build_paper_edition.py">0 spans located by searching the stored text for the quote's exact words, allowing any whitespace between them</change>
    </revisionDesc>
  </teiHeader>
  <standOff>
    <spanGrp type="tags">
      <span xml:id="t0" type="claim_type" ana="#claim_type" resp="#paper">
        <label>method</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t1" type="phenomenon" ana="#phenomenon" resp="#paper">
        <label>prime factorization and discrete logarithms on a quantum computer</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t2" type="method" ana="#method" resp="#paper">
        <label>mathematical-proof</label>
        <term>mathematical-proof</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t3" type="mechanisms" ana="#mechanisms[0]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>A THESIS&#x27;S VALUE IS ITS ECONOMY, AND THE ECONOMY IS STATED AS THE REASON: Church&#x27;s thesis GREATLY SIMPLIFIES THE STUDY OF COMPUTATION, SINCE IT REDUCES THE POTENTIAL FIELD OF STUDY FROM AN INFINITE NUMBER OF POTENTIAL COMPUTING DEVICES TO TURING MACHINES. What is claimed for it first is not its truth but what it lets one stop studying</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t4" type="mechanisms" ana="#mechanisms[1]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>FORMALISING A CLAIM WOULD MAKE IT WEAKER, AND THE MECHANISM IS GIVEN: the thesis IS NOT A MATHEMATICAL THEOREM, and to make it one WOULD REQUIRE A PRECISE MATHEMATICAL DESCRIPTION of a computing device - which WOULD LEAVE OPEN THE POSSIBILITY of some practical device NOT SATISFYING that description, and so WOULD MAKE THE RESULTING THEOREM WEAKER THAN THE ORIGINAL THESIS. A formalism can be escaped in a way an informal claim cannot</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t5" type="mechanisms" ana="#mechanisms[2]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>A CATEGORY IS INTRODUCED EXPLICITLY AS A COMPROMISE BETWEEN TWO UNUSABLE GRAINS: the old distinction is MUCH TOO COARSE, the exact efficiency is TOO PRECISE A QUANTITY TO WORK WITH EASILY, and what the field uses is THE GENERALLY ACCEPTED COMPROMISE BETWEEN COARSENESS AND PRECISION - polynomial versus superpolynomial scaling. The class P is presented as a negotiated grain, not a natural joint</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t6" type="mechanisms" ana="#mechanisms[3]" resp="#tagger" cert="0.85">
        <label>mechanisms</label>
        <term>THE CLASSIFICATION IS SHOWN TO REQUIRE A FURTHER THESIS BEFORE IT MEANS ANYTHING: FOR THIS CLASSIFICATION TO MAKE SENSE, WE NEED IT TO BE MACHINE-INDEPENDENT - we need to know that polynomial-time computability does not depend on the kind of device used - and that requirement IS a quantitative version of Church&#x27;s thesis. A definition resting on an unproved claim about the world</term>
        <note>about this quote: RE-SLICED: the first cut ended &quot;...quantitative version of Church&quot;, stopping INSIDE THE NAME. The cut-word guard did not catch it because the next character is a curly apostrophe, not a letter - so `Church` + `’s` reads as a clean word boundary to the check. A span must not end inside a person&#x27;s name either, and no guard currently tests that. PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: `PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b` matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t7" type="mechanisms" ana="#mechanisms[4]" resp="#tagger" cert="0.85">
        <label>mechanisms</label>
        <term>ONE CLAIM CARRIES THREE NAMES ACROSS THREE LITERATURES, AND ONE OF THEM ONLY PARTLY: the same thesis has been CALLED THE STRONG CHURCH&#x27;S THESIS by one group, and MAKES UP HALF OF THE INVARIANCE THESIS of another author. Two vocabularies name it whole, a third contains it as a part - which is a partial overlap between naming systems, not a synonym</term>
        <note>about this quote: EXTENDED BACKWARDS: the first cut began &quot;which Vergis et al. [1986] have called...&quot; and never named the thesis it was about. A tag asserting that one claim carries three names has to contain the claim. Overlaps the span of the preceding mechanism, which is allowed and normal. PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t8" type="mechanisms" ana="#mechanisms[5]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>A READER-FACING SUBSTITUTION IS OFFERED AND JUSTIFIED BY MUTUAL SIMULATION: readers NOT COMFORTABLE WITH Turing machines MAY THINK INSTEAD OF digital computers with linearly growing memory, BECAUSE THESE TWO CLASSES CAN EFFICIENTLY SIMULATE EACH OTHER. One object is licensed to stand in for another, and the licence is an equivalence</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t9" type="mechanisms" ana="#mechanisms[6]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>THE THESIS&#x27;S ESCAPE CLAUSES ARE LOCATED IN TWO SPECIFIC WORDS AND NAMED AS SUCH: THERE ARE TWO ESCAPE CLAUSES IN THE ABOVE THESIS - ONE OF THESE IS THE WORD PHYSICAL, and machine models that violate the thesis HAVE BEEN RULED OUT BY SOME REASON FOR WHY THEY ARE NOT PHYSICAL, that is, why they could not be built and made to work. A single underdefined word is doing the excluding</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t10" type="mechanisms" ana="#mechanisms[7]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>AND THE SECOND ESCAPE CLAUSE IS A WORD WHOSE MEANING IS SAID TO BE INCOMPLETELY SPECIFIED: THE OTHER ESCAPE CLAUSE IS THE WORD RESOURCES, THE MEANING OF WHICH IS NOT COMPLETELY SPECIFIED - after which the resources are enumerated for digital computers, and MORE are said to be pertinent to analog computation. The thesis&#x27;s content varies with a list nobody has closed</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t11" type="mechanisms" ana="#mechanisms[8]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>A NEW RESOURCE IS ADDED TO THE ACCOUNTING AND THE ADDITION IS ARGUED FOR: for quantum computation, IN ADDITION TO SPACE AND TIME, THERE IS ALSO A THIRD POTENTIALLY IMPORTANT RESOURCE, PRECISION - and the argument is that the changes a quantum computer makes CAN CLEARLY NOT BE PERFECTLY ACCURATE but MUST CONTAIN SOME SMALL AMOUNT OF INHERENT IMPRECISION. The bookkeeping is extended because the physics forces a third column</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t12" type="mechanisms" ana="#mechanisms[9]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>WHAT SETS THE LIMIT IS ATTRIBUTED TO MATERIALS RATHER THAN TO PHYSICAL LAW, WITH THE HEDGE STATED: AS FAR AS WE KNOW, what precision is possible IS DICTATED NOT BY FUNDAMENTAL PHYSICAL LAWS BUT BY THE PROPERTIES OF THE MATERIALS AND THE ARCHITECTURE with which the computer is built - and IT IS CURRENTLY NOT CLEAR which architectures will give high precision</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t13" type="mechanisms" ana="#mechanisms[10]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>A MODELLING CHOICE IS DEFENDED AGAINST A TRUE DESCRIPTION, AND THE GROUND IS USEFULNESS: treating precision as a large constant - EVEN THOUGH IT IS ALMOST CERTAIN TO BE CONSTANT FOR ANY GIVEN MACHINE - is compared to treating a digital computer as a finite automaton, of which the verdict is THIS VIEW IS TECHNICALLY CORRECT; HOWEVER, IT IS NOT PARTICULARLY USEFUL. A description can be accurate and the wrong one to adopt</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t14" type="mechanisms" ana="#mechanisms[11]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>A KEY WORD IS FOUND SUBSTITUTED IN ANOTHER AUTHOR&#x27;S STATEMENT OF THE SAME THESIS, AND THE SUBSTITUTION IS DIAGNOSED: in one restatement THE WORD PHYSICAL IS REPLACED WITH THE WORD REASONABLE - and IT IS DIFFICULT TO IMAGINE ANY DEFINITION OF REASONABLE IN THIS CONTEXT WHICH DOES NOT MEAN PHYSICALLY REALIZABLE. One word swapped for another in the same claim, and the author argues they must come to the same thing</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t15" type="mechanisms" ana="#mechanisms[12]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>A THESIS IS BELIEVED ON THE STRENGTH OF FAILED REFUTATIONS, AND THE FAILURES ARE THEN SHOWN TO SHARE A PROPERTY: computer scientists became convinced THROUGH THE FAILURE OF ALL PROPOSED COUNTER-EXAMPLES - but MOST OF THESE HAVE BEEN BASED ON THE LAWS OF CLASSICAL MECHANICS, HOWEVER THE UNIVERSE IS IN REALITY QUANTUM MECHANICAL. The induction&#x27;s instances share exactly the property the new case lacks</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t16" type="mechanisms" ana="#mechanisms[13]" resp="#tagger" cert="0.95">
        <label>mechanisms</label>
        <term>PRIORITY IS ASSIGNED BY THE EXPLICITNESS OF A QUESTION RATHER THAN BY THE IDEA, AND ONE AUTHOR IS CREDITED FOR WHAT HE DID NOT ASK: one researcher DID NOT ASK whether quantum mechanics conferred extra power AND YET showed enough to make later work possible; another RAISED THE POSSIBILITY, THUS IMPLICITLY ASKING the converse question; and a third WAS THE FIRST TO ASK THIS QUESTION EXPLICITLY</term>
        <note>about this quote: PROVENANCE: this record belongs to the priming sub-corpus, which is the other terminal&#x27;s lane, and these mechanisms were written by the project. No two hands were on the record - it carried no mechanisms before these, and the project confirmed on 2026-08-17 that the project is auditing rather than tagging. Kept rather than retracted on his instruction (17:22): retracting verified work over a bookkeeping flag would leave a retraction reason that misdescribes the row. Recorded here so a reader learns it from the corpus. The flag on this record is a FALSE POSITIVE of the ownership rule, not a judgement about the paper: &#x27;PRIMING_SUBJECT = \bprim(e|es|ed|ing)\b&#x27; matched “PRIME factorization” in the title. It carries no priming fields and it is number theory. Released by name on 2026-08-17 17:22 via MANUAL_RELEASED in an internal tool, together with greentao2004-primes and culpepper2020 - which the same rule caught on “the PRIMES” and on a pun about a subscription service.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t17" type="limitations" ana="#limitations[0]" resp="#tagger">
        <label>the quantum algorithms are randomized, allowing a small probability of error</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t18" type="limitations" ana="#limitations[1]" resp="#tagger">
        <label>No quantum computer exists that could run the algorithms.</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t19" type="limitations" ana="#limitations[2]" resp="#tagger">
        <label>Decoherence and precision obstacles grow with machine size, so machines large enough for interesting computations may face fundamental difficulties.</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t20" type="limitations" ana="#limitations[3]" resp="#tagger">
        <label>The analysis of the discrete-log algorithm only establishes the residue of r for primes larger than 18, requiring extra work for small prime powers.</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t21" type="limitations" ana="#limitations[4]" resp="#tagger">
        <label>The proved efficiency bounds are loose; an actual implementation could do considerably better than the paper&#x27;s analysis shows.</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t22" type="limitations" ana="#limitations[5]" resp="#tagger">
        <label>The problems solved are of narrow intrinsic value, mattering mainly because cryptography assumed they were hard.</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t23" type="limitations" ana="#limitations[6]" resp="#tagger" cert="0.95">
        <label>Making the thesis provable would make it weaker, and the paper says so: &#x27;Quotation withheld&#x27; The informal statement is unprovable and the formal one is about a smaller class of machines.</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t24" type="transfers" ana="#transfers[0]" resp="#tagger">
        <label>reducing integer factorization to order/period-finding (a number-theory reduction), then solving it on a quantum computer via the quantum Fourier transform</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t25" type="concepts" ana="#concepts[4]" resp="#paper" cert="0.95">
        <label>precision</label>
        <term>precision</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t26" type="concepts" ana="#concepts[5]" resp="#paper" cert="0.95">
        <label>quantum computer</label>
        <term>quantum computer</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t27" type="concepts" ana="#concepts[6]" resp="#paper" cert="0.95">
        <label>Church’s thesis</label>
        <term>Church’s thesis</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t28" type="concepts" ana="#concepts[7]" resp="#paper" cert="0.9">
        <label>physical</label>
        <term>physical</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t29" type="concepts" ana="#concepts[8]" resp="#paper" cert="0.9">
        <label>reasonable</label>
        <term>reasonable</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t30" type="unhoused_relations" ana="#unhoused_relations[0]" resp="#tagger" cert="0.95">
        <label>Church’s thesis → a mathematical theorem</label>
        <note>THREE PAPERS, THREE DIFFERENT VERDICTS ON WHETHER A FORMALISM CAN BE SHOWN TO CAPTURE THE INFORMAL NOTION IT REPLACES - and no type in the vocabulary can express a disagreement about what KIND OF CLAIM something is. This paper says the identification CANNOT BE MADE A THEOREM WITHOUT WEAKENING IT: a precise mathematical description of a computing device would leave open the possibility of a practical device that did not satisfy it, so the theorem would be weaker than the thesis it replaced. turing1936-computable-numbers argues it instead, enumerating three kinds of argument; tkacik2016-information-living reports a theorem that did make a vague notion precise. &#x27;same-as&#x27; and &#x27;distinct-from&#x27; are both false here: the three are not making one claim or two, they are ruling differently on whether the identification is the sort of thing a proof can settle. All eight edge types assert that a relation holds between two concepts. Recorded per record, each row quoting only its own paper; the cross-paper half is this paraphrase, checkable by opening the other two., and the third case for an earlier note of ours - which by the rule that one is an observation and three make a proposal is the point at which the gap should be put to Shir.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t31" type="senses" ana="#senses[0]" resp="#tagger" cert="0.95">
        <label>Quantitative Church’s thesis - AS THE PAPER READS IT, WITH ITS TWO LOOSE WORDS NAMED: &#x27;There are TWO ESCAPE CLAUSES in the above thesis. One of these is the word &quot;physical&quot; ... The other escape clause ... is the word &quot;resources,&quot; the meaning of which is NOT COMPLETELY SPECIFIED.&#x27; What the thesis asserts depends on which senses are supplied for those two words</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t32" type="senses" ana="#senses[1]" resp="#tagger" cert="0.95">
        <label>efficiently computable - EXPLICITLY A COMPROMISE, NOT A DISCOVERY: &#x27;The generally accepted compromise between coarseness and precision&#x27; between a computable/non-computable split that is &#x27;much too coarse&#x27; and exact efficiency that is &#x27;too precise a quantity to work with easily&#x27; - realised as the polynomial vs superpolynomial scaling line</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t33" type="claim_relations" ana="#claim_relations[0]" resp="#tagger">
        <label>builds-on → the number-theoretic reduction of factoring to order-finding (Miller 1976)</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t34" type="claim_relations" ana="#claim_relations[1]" resp="#tagger">
        <label>builds-on → computability theory (Church, Turing, Post 1936)</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t35" type="claim_relations" ana="#claim_relations[2]" resp="#tagger">
        <label>builds-on → Simon [1994]</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t36" type="claim_relations" ana="#claim_relations[3]" resp="#tagger">
        <label>builds-on → Miller [1976] randomised reduction of factoring to order-finding</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t37" type="claim_relations" ana="#claim_relations[4]" resp="#tagger">
        <label>builds-on → Coppersmith [1994] and Deutsch [see Ekert and Jozsa 1995] construction of the quantum Fourier transform</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t38" type="claim_relations" ana="#claim_relations[5]" resp="#tagger">
        <label>extends → Deutsch and Jozsa [1992] and Berthiaume and Brassard [1992a, 1992b]</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t39" type="claim_relations" ana="#claim_relations[6]" resp="#tagger">
        <label>contradicts → the quantitative (strong) Church&#x27;s thesis, that any physical computing device can be simulated by a Turing machine with at most polynomial overhead</label>
        <note>differs in: THE AXIS IS WHETHER QUANTUM MECHANICS IS TAKEN INTO ACCOUNT. &#x27;A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time by at most A POLYNOMIAL FACTOR. This may not be true when quantum mechanics is taken into cons[IDERATION].&#x27; The thesis is not shown false - it is shown to have a physical precondition nobody had needed to state, and the polynomial factor is what fails. A &#x27;contradicts&#x27; alone records a dispute with a computing thesis and drops the fact that the dispute is ABOUT WHICH PHYSICS THE MACHINE OBEYS.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t40" type="concept_edges" ana="#concept_edges[1]" resp="#tagger" cert="0.9">
        <label>physical —same-as→ reasonable</label>
        <term>physical</term>
        <term>reasonable</term>
        <note>strength of the relation: 0.8 · note: TWO PUBLISHED STATEMENTS OF ONE THESIS DIFFER IN ONE WORD, AND THE PAPER ARGUES THEY MUST MEAN THE SAME: in van Emde Boas [1990] &#x27;…is replaced with the word &quot;reasonable.&quot; It is difficult…&#x27; A terminological argument inside a mathematics paper, about the load-bearing word of the thesis being tested.
Audit 2026-09-28: DOUBTFUL - read against its full span and kept, but the span says &#x27;physical&#x27; was REPLACED by &#x27;reasonable&#x27; in one statement of the thesis; same-as is loose.</note>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t41" type="content_tags" ana="#content_tags.quantities[0]" resp="#tagger">
        <label>polynomial — quantum running time for factoring / discrete log (vs believed super-polynomial classically)</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t42" type="content_tags" ana="#content_tags.findings[0]" resp="#tagger">
        <label>Efficient randomized algorithms for factoring and discrete logarithms are given for a hypothetical quantum computer, taking a number of steps polynomial in the input size.</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t43" type="content_tags" ana="#content_tags.findings[1]" resp="#tagger">
        <label>The quantitative Church thesis may not be true when quantum mechanics is taken into consideration.</label>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t44" type="content_tags" ana="#content_tags.variables[0]" resp="#tagger">
        <label>input size</label>
        <term>input size</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t45" type="content_tags" ana="#content_tags.variables[1]" resp="#tagger">
        <label>number of steps</label>
        <term>number of steps</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t46" type="content_tags" ana="#content_tags.definitions[1]" resp="#tagger">
        <label>quantum order-finding algorithm</label>
        <term>quantum order-finding algorithm</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t47" type="content_tags" ana="#content_tags.definitions[2]" resp="#tagger">
        <label>factoring integers</label>
        <term>factoring integers</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
      <span xml:id="t48" type="content_tags" ana="#content_tags.definitions[3]" resp="#tagger">
        <label>discrete logarithms</label>
        <term>discrete logarithms</term>
        <note type="quotation-withheld">Quotation withheld because this record is not cleared for redistribution.</note>
      </span>
    </spanGrp>
  </standOff>
  <text>
    <body>
      <p><note type="rights">The full text of this article is not redistributable, so it is
      not included here. The evidence sentences are withheld with it; the tag layer and its
      grounding status remain. The article itself is at https://doi.org/10.1137/S0097539795293172.</note></p>
    </body>
  </text>
</TEI>
