Cited by 431Quantum Computing Algorithms and ArchitectureQuantum Information and CryptographyQuantum Mechanics and Applications

Semiclassical Fourier Transform for Quantum Computation

Open access
Griffiths, Robert B., Niu, Chi-Sheng·1996·Physical Review Letters

Abstract

It is shown that the Fourier transform preceding the final measurement in Shor's algorithm for factorization on a quantum computer can be carried out in a semiclassical way by using the ``classical'' (macroscopic) signal resulting from measuring one bit to determine the type of measurement carried out on the next bit, and so forth. In this way all the two-bit gates in the Fourier transform can be replaced by a smaller number of one-bit gates controlled by classical signals. This suggests that it may be worthwhile looking for other uses of semiclassical methods in quantum computing.

AI snapshot

Written from the paper’s full text.

TL;DR

The paper shows that the quantum Fourier transform used just before measurement in Shor’s algorithms can be performed semiclassically, with no two-bit gates. A measured bit is converted into a classical signal that controls one-bit operations on the next bit, and so on.

Key findings

  • Shor’s final Fourier transform can be replaced by a semiclassical procedure in which each bit is measured and its classical result controls the one-bit transformation applied to the next bit before measurement.
  • All two-bit gates in the Fourier-transform circuit can be eliminated and replaced by one-bit gates controlled by classical signals; the paper presents an equivalent circuit for the case \(s=3\), i.e. four bits.
  • The paper argues this simplification suggests it may be worthwhile to look for other semiclassical methods in quantum computing, though it offers no specific proposals.

Methods

  • Theoretical letter analyzing the discrete Fourier transform on a \(q\)-dimensional Hilbert space with \(q=2^{s+1}\), followed by measurement of the integer \(c\), as used in Shor’s algorithms.
  • Uses gate-network diagrams for \(s=3\) and a consistent-histories perspective to justify inferring a bit’s pre-measurement state from the measurement outcome and “pushing” that property backward in time.
  • No experimental data or numerical simulations are reported.

Limitations

  • The paper states that measuring one bit before beginning to measure another could be a disadvantage if the physical bits are short lived or decohere rapidly on the time scale needed to carry out a measurement and convert it into a classical signal; it suggests arranging the earlier computation so more significant bits of \(a\) are produced earlier.
  • The paper states it has no specific proposals for extending similar semiclassical operations to other parts of Shor’s algorithms or to error correction.
  • Evident from the text: this is a theoretical proposal with no experimental implementation or quantitative resource/gate-count analysis presented.

Model-written summary. Check it against the paper before relying on it.

Integrity signals

Registry

Crossref · 10.1103/physrevlett.76.3228

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Nothing to recompute.

Claims the paper makes

0 of 17 cited sources checked · 0 supported · 0 flagged

  • Findingreasoning
    § Abstract · p. 1

    The two-bit gates in the Fourier transform can all be replaced by a smaller number of one-bit gates controlled by classical signals.

    “In this way the two-bit gates in the Fourier transform can all be replaced by a smaller number of one-bit gates controlled by classical signals.”
    • Also stated in: § Abstract · p. 4 · plain
      “Applying this type of analysis to the other parts of Fig. 1, one is led to the arrangement shown in Fig. 2, where all the two bit gates in Fig. 1 have been eliminated, and their work taken over by one-bit gates controlled by classical signals (double lines) and followed by measurements.”
    Quote in the paperSubstantial claim
    • Rests on an assumption: A measurement result can be converted into a classical signal that controls a later one-bit gate.
  • Findingreasoning
    § Abstract · p. 3

    The network in Fig. 1 produces the desired Fourier transform result.

    “From this perspective it is easy to see how the network in Fig. 1 produces the desired result.”
    Quote in the paperSubstantial claim
  • Findingreasoning
    § Abstract · p. 1

    The quantum Fourier transforms that immediately precede the final measurement in Shor's algorithms can be carried out in a semi-classical fashion requiring no two-bit gates.

    “It is shown that such a Fourier transform can be carried out in a semi-classical way in which a 'classical' (macroscopic) signal resulting from the measurement of one bit (embodied in a twostate quantum system) is employed to determine the type of measurement carried out on the next bit, and so forth.”
    • Also stated in: § Abstract · p. 2 · plain
      “In this letter we shall show how the quantum Fourier transforms which in Shor's algorithms immediately precede a final measurement can be carried out in a semi-classical fashion which requires no two-bit gates.”
    Quote in the paperSubstantial claim
    • Rests on an assumption: A measurement result can be converted into a classical signal that controls a later one-bit gate.
  • Findingreasoning
    § Abstract · p. 4

    The semiclassical arrangement in Fig. 2 yields the same probability to observe a number c as the standard circuit in Fig. 1.

    “Anyone who feels uncomfortable with this method of reasoning can, of course, use traditional techniques to verify that the arrangement in Fig. 2 will yield the same probability to observe a number c as that in Fig. 1.”
    • Also stated in: § Figure Captions · p. 6 · plain
      “Semiclassical procedure which produces the same result as the circuit in Fig. 1.”
    Quote in the paperNot a substantial claim
  • Interpretationreasoning
    § Abstract · p. 4

    The scheme in Fig. 2 should be simpler to realize than that in Fig. 1 because it requires only one-bit operations controlled by classical signals rather than the more difficult and more numerous two-bit operations.

    “The scheme in Fig. 2 should be quite a bit simpler to realize than that in Fig. 1, because it only requires one-bit operations controlled by classical signals rather than the more difficult and more numerous two-bit operations indicated in Fig. 1.”
    Quote in the paperSubstantial claim
    • Rests on an assumption: A measurement result can be converted into a classical signal that controls a later one-bit gate.
  • Classified as probably not a substantial claim. 5
  • May combine two claims. 2
  • Classified as probably not a substantial claim.

    Premisecitation
    § Abstract · p. 1

    A quantum computer, if built, would be capable of solving certain problems such as factoring long numbers much more rapidly than is possible using currently available algorithms on a conventional computer.

    “Recently Shor [1, 2] has shown that a quantum computer [3], if it could be built, would be capable of solving certain problems, such as factoring long numbers, much more rapidly than is possible using currently available algorithms on a conventional computer.”
    Quote in the paperSubstantial claim0 of 3 sources checked
    • cites [1] [1] P. W. Shor, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 1994 , edited by S. Goldwasser (IEEE Computer Society Press, Los Alamitos, California, 1994), p. 124. -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

    • cites [2] [2] P. W. Shor, preprint (quant-ph/9508027), submitted to SIAM J. Computing. -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

    • cites [3] [3] D. Deutsch, Proc. R. Soc. London, Ser. A 400 , 97 (1985); Proc. R. Soc. London, Ser. A 425 , 73 (1989) -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

  • May combine two claims.

    Interpretationreasoning
    § Abstract · p. 4

    The property P has conditional probability one given that the measurement yields c0 = 1, and because P commutes with the preceding two-bit gates, it can be pushed backwards in time to point B with probability one.

    “The conditional probability of P is one, given that the measurement yields c 0 = 1. But in the situation shown in Fig. 1, P commutes with the unitary transformations corresponding to the three 2-bit gates which precede the measurement of c 0 , and therefore one can 'push' the corresponding property backwards in time to the point B in Fig. 1, and again conclude that it occurred with probability one”
    Quote in the paperSubstantial claim0 of 5 sources checked
    • cites [19] [19] R. B. Griffiths, J. Stat. Phys. 36 , 219 (1984). See, in particular, Sec. 5. -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

    • cites [20] [20] R. B. Griffiths, in New Techniques and Ideas in Quantum Measurement Theory , edited by D. M. Greenberger (New York Academy of Sciences, New York, 1986) p. 512. -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

    • cites [21] [21] R. Omn` es, Rev. Mod. Phys. 64 , 339 (1992). -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

    • cites [22] [22] R. B. Griffiths, Phys. Rev. Lett. 70 , 2201 (1993). -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

    • cites [23] [23] R. Omn` es, The Interpretation of Quantum Mechanics (Princeton University Press, Princeton, 1994). -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

  • Classified as probably not a substantial claim.

    Interpretationreasoning
    § Abstract · p. 4

    The need to carry out a measurement on one bit before beginning to measure another could be a disadvantage if the physical elements representing the bits are short lived or decohere rapidly on the time scale required to carry out a measurement and convert it into a classical signal.

    “However, the need to carry out a measurement on one bit before beginning to measure another could be a disadvantage if the physical elements representing the bits are short lived or decohere rapidly on the time scale required to carry out a measurement and convert it into a classical signal.”
    Quote in the paperSubstantial claim
  • Probably not a substantial claim: may not pass S2 (checkable). May combine two claims.

    Premisecitation
    § Abstract · p. 5

    The general principles of quantum mechanics allow for a variety of viewpoints or consistent families, and recent developments in the foundations of quantum theory permit effective use of these without paradoxes or mysterious long-range influences.

    “The general principles of quantum mechanics allow for a variety of viewpoints or, to use the technical term, consistent families, and recent developments in the foundations of quantum theory [25] permit one to make effective use of these without becoming entangled in paradoxes, mysterious long-range influences, and the like.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [25] [25] For a compact review, see R. B. Griffiths, in Symposium on the Foundations of Modern Physics 1994 , edited by K. V. Laurikainen, C. Montonen and K. Sunnarborg (Editions Fronti` eres, Gif-sur-Yvette, France, 1994) p. 85.

      Not checked in the free run.

  • Probably not a substantial claim: may not pass S3 (load-bearing).

    Premisecitation
    § Abstract · p. 2

    A set of gates which carries out the Fourier transform is shown in Fig. 1 for s = 3.

    “A set of gates which carries out this Fourier transform [18] is shown in Fig. 1 for s = 3.”
    Quote in the paperNot a substantial claim0 of 1 sources checked
    • cites [18] [18] According to [2], this scheme was invented independently by D. Coppersmith, IBM Research Report RC 19642 (1994) and by D. Deutsch (unpublished). -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

  • Classified as probably not a substantial claim.

    Premisecitation
    § Abstract · p. 1

    Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement.

    “Shor's algorithms for factorization and discrete logarithms on a quantum computer employ Fourier transforms preceding a final measurement.”
    Quote in the paperSubstantial claim0 of 2 sources checked
    • cites [1] [1] P. W. Shor, in Proceedings of the 35th Annual Symposium on Foundations of Computer Science, Santa Fe, 1994 , edited by S. Goldwasser (IEEE Computer Society Press, Los Alamitos, California, 1994), p. 124. -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

    • cites [2] [2] P. W. Shor, preprint (quant-ph/9508027), submitted to SIAM J. Computing. -

      Couldn’t be matched to a paper in Crossref, so it can’t be checked.

6 of 6
  • The paper relies on this without support.

    A measurement result can be converted into a classical signal that controls a later one-bit gate.

    “The trick is to measure a particular bit and then use the result to produce a classical signal which controls a one-bit transformation carried out on the next bit just before it is measured, and so forth.”
    “converted into 'classical' signals (imagine a pulse of several volts traveling down a coaxial cable), can be used to influence a later step in the computation [16].”
1 of 1

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Recent developments in quantum computation offer a way forward for determining efficient solutions of many instances of large eigenvalue problems that are classically intractable.

    “Recent developments in the field of quantum computation offer a way forward for determining efficient solutions of many instances of large eigenvalue problems that are classically intractable6789101112”

    From A variational eigenvalue solver on a photonic quantum processor (2014) · cites this paper as [8]

    On p. 1, the paper says a quantum computer, if built, could solve certain problems such as factoring long numbers much faster than conventional algorithms. It also describes a simpler Fourier transform for Shor’s factorization and discrete-logarithm algorithms (p. 1). The copy does not support the claim about efficient solutions to many large eigenvalue problems. (LLM, conf=0.84)

    Experimental — accuracy not yet measured
  • The QFT can be implemented semi-classically and interleaved with controlled modular multiplications.

    “The other part of the algorithm, the quantum Fourier transform (QFT), can be implemented semi-classically [40] and interleaved with the controlled modular multiplications.”
  • The construction uses 3n + O(lg n) logical qubits, distributed among accumulation, workspace, lookup output, and exponent registers.

    “In terms of space, we are using 3 n + O (lg n ) logical qubits. The qubits are distributed as follows: n + O (lg n ) for the accumulation register storing the product, n + O (lg n ) for a workspace register during the multiplication, n + O (lg n ) for the lookup output register, and O (lg n ) qubits to hold the part of the exponent needed for the current stage of the semi-classical Fourier trans”

    From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [40]

    The discussion of Fig. 2 (p. 4) describes a semiclassical Fourier transform using measurements and classically controlled one-bit gates. Our copy does not address the claimed 3n + O(lg n) logical-qubit total or its allocation among accumulation, workspace, lookup-output, and exponent registers; searches for those terms found no supporting passage. (LLM, conf=0.76)

    Experimental — accuracy not yet measured
  • Babbush et al. showed that the electronic structure Hamiltonian requires only O(N^2) terms in a plane wave basis while O(N^4) terms are necessary for Gaussians.

    “Babbush et al. 301 showed that the electronic structure Hamiltonian requires only O ( N 2 ) terms in a plane wave basis while O ( N 4 ) terms are necessary for Gaussians.”

    From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]

  • This allows a representation of the chemistry Hamiltonian with a number of terms scaling quadratically in the number of spin-orbitals, a significant reduction on the number of terms in the Hamiltonian when using molecular orbitals.

    “This allows a representation of the chemistry Hamiltonian with a number of terms scaling quadratically in the number of spin-orbitals, a significant reduction on the number of terms in the Hamiltonian when using molecular orbitals.”

    From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]

Cites

Flagged first, then by citations

Research works printed but not linked: 2

  1. 1989, A, 425, 73
  2. R. B. Griffiths, 1994, Proceedings of the Symposium on the Foundations of Modern Physics: 70 Years of Matter Waves, Helsinki, Finland, 1994,

Cited by

Sorted by citations

Authors
Griffiths, R. B., & Niu, C.-S.
Affiliations
Carnegie Mellon University (US)
Venue
Physical Review Letters
Published
1996-04-22
Volume
76
Issue
17
Pages
3228-3231
ISSN
  • 0031-9007 (ISSN-L)
  • 1079-7114
OpenAlex
W1967037487
Cited by
431
References
21
Citations by year
2026: 18 · 2025: 25 · 2024: 26 · 2023: 52 · 2022: 16 · 2021: 27 · 2020: 12 · 2019: 46 · 2018: 9 · 2017: 14 · 2016: 5 · 2015: 5 · 2014: 11 · 2013: 12 · 2012: 23
FWCI
11.47
Type
journal article
Language
en
Open access
Locations
  • Physical Review Letters (publishedVersion)
  • PubMed (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • CERN Document Server (European Organization for Nuclear Research) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum Mechanics and Applications
Keywords
Shor's algorithm, quantum Fourier transform, integer factorization, quantum measurement

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.

Claims read by deepseek-v4.1-flash under definition version 3 (extract-v3) on 2026-10-07.

Classified by jev-1.13-20260917 (gold-guideline-v0.2) on 2026-10-07.

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