Semiclassical Fourier Transform for Quantum Computation
Open accessAbstract
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
Cites
Statistics
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.
- Also stated in: § Abstract · p. 4 · plain
- 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.
- Also stated in: § Abstract · p. 2 · plain
- 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 - Also stated in: § Figure Captions · p. 6 · plain
- 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.
- Interpretationcitation§ Abstract · p. 2
The semiclassical method can be understood using a consistent-histories point of view in which measurement results are used to infer the state of a quantum system before the measurement was carried out.
“Third, a simple way of seeing why the semi-classical method actually works is to adopt a point of view-in technical terms, a particular family of consistent histories-in which the results of a measurement are used to infer the state of a quantum system before the measurement was carried out.”
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.
- Interpretationreasoning§ Abstract · p. 3
The result of measuring a control bit determines the state of that bit just before the measurement, at point B, with probability one.
“Suppose that the final measurement reveals that the bit c 0 is 1, corresponding to | 1 〉 . Then, since a control bit enters and leaves the two-bit gates unchanged, we conclude that this bit was also in the state | 1 〉 at point B , just after emerging from the first one-bit gate. Similarly, if the measurement yields c 0 = 0, we conclude that the bit was in the state | 0 〉 at the point B .”
Quote in the paperSubstantial claim - Premisecitation§ Abstract · p. 1
Quantum computations can be carried out using circuits employing one-bit gates together with two-bit gates.
“It turns out that quantum computations can be carried out using circuits employing one-bit gates, which produce a unitary transformation on the twodimensional Hilbert space representing a single bit, together with two-bit gates producing appropriate unitary transformations on a four-dimensional Hilbert space [12, 13, 14, 15].”
Quote in the paperNot a substantial claim0 of 4 sources checked- cites [12] [12] D. P. DiVincenzo, Phys. Rev. A 51 , 1015 (1995). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [13] [13] D. Deutsch, A. Barenco and A Ekert, Proc. R. Soc. Lond. A 449 , 669 (1995). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [14] [14] S. Lloyd, Phys. Rev. Lett. 75 , 346 (1995). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- cites [15] [15] A. Barenco et al., Phys. Rev. A 52 , 3457 (1995). -
Couldn’t be matched to a paper in Crossref, so it can’t be checked.
- Classified as probably not a substantial claim. 5
- May combine two claims. 2
Classified as probably not a substantial claim.
Premisecitation§ Abstract · p. 1A 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. 4The 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. 4The 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 claimProbably not a substantial claim: may not pass S2 (checkable). May combine two claims.
Premisecitation§ Abstract · p. 5The 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. 2A 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. 1Shor'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.
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].”
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 measuredThe 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.”
From How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits (2021) · cites this paper as [40]
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 measuredBabbush 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]
Babbush et al. proposed using a dual form of the plane wave basis that diagonalizes the potential operator, leading to a representation of the electronic structure Hamiltonian with only O(N^2) terms.
“In particular, Babbush et al. have proposed to use a dual form of the plane wave basis 301 which diagonalizes the potential operator, leading to the following representation of the electronic structure Hamiltonian that has only O ( N 2 ) terms:”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]
When combined with the simplified representations of the Hamiltonian, the Hamiltonian variational method can be used to construct variational circuits with depth equal to the number of spin-orbitals for a linear qubit architecture, using the fermionic swap network.
“When combined with the simplified representations of the Hamiltonian described in the previous section 301 , the Hamiltonian variational method can be used to construct variational circuits with depth equal to the number of spin-orbitals for a linear qubit architecture, using the fermionic swap network 302 .”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]
Kivlichan et al. demonstrated that a single Trotter step of the Hamiltonian in Equation 44 can be implemented with a circuit of depth N using a Fermionic Swap Network, which has a constant improvement with respect to the proposal in Babbush et al. and is conjectured to be optimal.
“Finally, Kivlichan et al. 302 demonstrated that a single Trotter step of the Hamiltonian in Equation 44 can be implemented with a circuit of depth N using a Fermionic Swap Network , which has a constant improvement with respect to the proposal in Babbush et al. 301 and is conjectured to be optimal.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]
In Babbush et al., the idea of using the plane wave dual basis with the Hamiltonian variational strategy is developed to propose a VQE simulation for Jellium that requires depth O(N·S) and optimizes only O(N) parameters by exploiting translational invariance.
“In Babbush et al. 301 , this idea is developed to propose a VQE simulation for Jellium, that requires depth O ( N · S ) and optimizes only over O ( N ) parameters by exploiting the translational invariance of this system.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]
Since in finite molecules and bulk materials η ∈ O(N), the number of measurements does not scale worse than O(N^4/ε^2) for this representation of the Hamiltonian.
“Since in finite molecules and bulk materials, η ∈ O ( N ), this shows that the number of measurements does not scale worse than O ( N 4 /ϵ 2 ) for this representation of the Hamiltonian.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]
For Hamiltonians in the plane wave dual basis, the number of measurements required to estimate the expectation values can be bounded, and further savings are possible because the interaction (V) and potential (U) terms are diagonal and commute, allowing separate unbiased estimation for the mean of their sum.
“Alternatively, for Hamiltonians in the plane wave dual basis (Equation 44), the number of measurements required to estimate the expectation values can be bounded as 301”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]
The dual plane-wave basis set has been proposed as an alternative for electronic structure calculations on quantum computers.
“Recently, the dual plane-wave basis set (dual PW), corresponding to the Fourier transform of PW, has been proposed as an alternative for electronic structure calculations on quantum computers 301”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]
The dual PW basis set provides a more compact representation of the molecular Hamiltonian in second quantization.
“The dual PW basis set has the advantage of providing a more compact representation of the molecular Hamiltonian in second quantization.”
From Quantum Chemistry in the Age of Quantum Computing (2019) · cites this paper as [301]
Cold atoms representing qubits can be arranged on a two- or three-dimensional lattice and state-dependent interaction phases may be acquired via cold collisions between neighboring atoms or via tunneling.
“Cold atoms representing the qubits can be arranged on a two-or three dimensional lattice and state-dependent interaction phases may be acquired via cold collisions between neighboring atoms [12] or via tunneling [13].”
From Measurement-based quantum computation on cluster states (2003) · cites this paper as [13]
Cites
Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels
Bennett, C. H., Brassard, G., Crépeau, C., Jozsa, R., Peres, A., & Wootters, W. K. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.1895 · Cited by 13,703 · see citing works
Quantum theory, the Church–Turing principle and the universal quantum computer
Deutsch, D. (1985) · Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences · doi:10.1098/rspa.1985.0070 · Cited by 4,597 · see citing works
Scheme for reducing decoherence in quantum computer memory
Shor, P. W. (1995) · Physical Review A · doi:10.1103/physreva.52.r2493 · Cited by 4,479 · see citing works
Elementary gates for quantum computation
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., Sleator, T., Smolin, J. A., & Weinfurter, H. (1995) · Physical Review A · doi:10.1103/physreva.52.3457 · Cited by 4,311 · see citing works
Quantum Computations with Cold Trapped Ions
Cirac, J. I., & Zoller, P. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4091 · Cited by 3,733 · see citing works
DiVincenzo, D. P. (1995) · Science · doi:10.1126/science.270.5234.255 · Cited by 1,651 · see citing works
Consistent histories and the interpretation of quantum mechanics
Griffiths, R. B. (1984) · Journal of Statistical Physics · doi:10.1007/bf01015734 · Cited by 1,138 · see citing works
Self-citationProceedings 35th Annual Symposium on Foundations of Computer Science
(1994) · doi:10.1109/sfcs.1994 · Cited by 1,133 · see citing works
Two-bit gates are universal for quantum computation
DiVincenzo, D. P. (1995) · Physical Review A · doi:10.1103/physreva.51.1015 · Cited by 1,069 · see citing works
The Interpretation of Quantum Mechanics
Omnès, R. (1994) · doi:10.1515/9780691187433 · Cited by 1,033 · see citing works
Conditional Quantum Dynamics and Logic Gates
Barenco, A., Deutsch, D., EKERT, A. K., & Jozsa, R. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4083 · Cited by 966 · see citing works
Almost Any Quantum Logic Gate is Universal
Lloyd, S. (1995) · Physical Review Letters · doi:10.1103/physrevlett.75.346 · Cited by 690 · see citing works
A Potentially Realizable Quantum Computer
Lloyd, S. (1993) · Science · doi:10.1126/science.261.5128.1569 · Cited by 649 · see citing works
Consistent interpretations of quantum mechanics
Omnès, R. (1992) · Reviews of Modern Physics · doi:10.1103/revmodphys.64.339 · Cited by 648 · see citing works
Quantum Information and Computation
Bennett, C. H. (1995) · Physics Today · doi:10.1063/1.881452 · Cited by 574 · see citing works
Realizable Universal Quantum Logic Gates
Sleator, T., & Weinfurter, H. (1995) · Physical Review Letters · doi:10.1103/physrevlett.74.4087 · Cited by 515 · see citing works
Universality in quantum computation
Deutsch, D. E., Barenco, A., & Ekert, A. (1995) · Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences · doi:10.1098/rspa.1995.0065 · Cited by 346 · see citing works
Universality in Quantum ComputationPreprint
Deutsch, D., Barenco, A., & Ekert, A. (1995) · Cited by 322 · see citing works
Lloyd, S. (1995) · Scientific American · doi:10.1038/scientificamerican1095-140 · Cited by 150 · see citing works
Consistent interpretation of quantum mechanics using quantum trajectories
Griffiths, R. B. (1993) · Physical Review Letters · doi:10.1103/physrevlett.70.2201 · Cited by 131 · see citing works
Self-citationNew Techniques and Ideas in Quantum Measurement Theory
Semon, M. D. (1988) · American Journal of Physics · doi:10.1119/1.15471 · Cited by 125 · see citing works
Flagged first, then by citations
Research works printed but not linked: 2
- 1989, A, 425, 73
- 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
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1997) · SIAM Journal on Computing · doi:10.1137/s0097539795293172 · Cited by 8,472 · see citing works
A variational eigenvalue solver on a photonic quantum processor
Peruzzo, A., McClean, J., Shadbolt, P., Yung, M.-H., Zhou, X.-Q., Love, P. J., Aspuru-Guzik, A., & O’Brien, J. L. (2014) · Nature Communications · doi:10.1038/ncomms5213 · Cited by 4,552 · see citing works
Degen, C. L., Reinhard, F., & Cappellaro, P. (2017) · Reviews of Modern Physics · doi:10.1103/revmodphys.89.035002 · Cited by 4,045 · see citing works
Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer
Shor, P. W. (1999) · SIAM Review · doi:10.1137/s0036144598347011 · Cited by 3,904 · see citing works
Measurement-based quantum computation on cluster states
Raussendorf, R., Browne, D. E., & Briegel, H. J. (2003) · Physical Review A · doi:10.1103/physreva.68.022312 · Cited by 1,655 · see citing works
Quantum Chemistry in the Age of Quantum Computing
Cao, Y., Romero, J., Olson, J. P., Degroote, M., Johnson, P. D., Kieferová, M., Kivlichan, I. D., Menke, T., Peropadre, B., Sawaya, N. P. D., et al. (2019) · Chemical Reviews · doi:10.1021/acs.chemrev.8b00803 · Cited by 1,560 · see citing works
Quantum computing with trapped ions
HAFFNER, H., ROOS, C., & BLATT, R. (2008) · Physics Reports · doi:10.1016/j.physrep.2008.09.003 · Cited by 1,154 · see citing works
Preskill, J. (1998) · Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences · doi:10.1098/rspa.1998.0167 · Cited by 994 · see citing works
How to factor 2048 bit RSA integers in 8 hours using 20 million noisy qubits
Gidney, C., & Ekerå, M. (2021) · Quantum · doi:10.22331/q-2021-04-15-433 · Cited by 830 · see citing works
Entanglement-free Heisenberg-limited phase estimation
Higgins, B. L., Berry, D. W., Bartlett, S. D., Wiseman, H. M., & Pryde, G. J. (2007) · Nature · doi:10.1038/nature06257 · Cited by 628 · see citing works
Encoding Electronic Spectra in Quantum Circuits with Linear T Complexity
Babbush, R., Gidney, C., Berry, D. W., Wiebe, N., McClean, J., Paler, A., Fowler, A., & Neven, H. (2018) · Physical Review X · doi:10.1103/physrevx.8.041015 · Cited by 383 · see citing works
Experimental realization of Shor's quantum factoring algorithm using qubit recycling
Martín-López, E., Laing, A., Lawson, T., Alvarez, R., Zhou, X.-Q., & O'Brien, J. L. (2012) · Nature Photonics · doi:10.1038/nphoton.2012.259 · Cited by 349 · see citing works
Experimental Demonstration of a Compiled Version of Shor’s Algorithm with Quantum Entanglement
Lanyon, B. P., Weinhold, T. J., Langford, N. K., Barbieri, M., James, D. F. V., Gilchrist, A., & White, A. G. (2007) · Physical Review Letters · doi:10.1103/physrevlett.99.250505 · Cited by 327 · see citing works
A programmable qudit-based quantum processor
Chi, Y., Huang, J., Zhang, Z., Mao, J., Zhou, Z., Chen, X., Zhai, C., Bao, J., Dai, T., Yuan, H., et al. (2022) · Nature Communications · doi:10.1038/s41467-022-28767-x · Cited by 273 · see citing works
Dobšíček, M., Johansson, G., Shumeiko, V., & Wendin, G. (2007) · Physical Review A · doi:10.1103/physreva.76.030306 · Cited by 208 · see citing works
Quantum Resource Estimates for Computing Elliptic Curve Discrete Logarithms
Roetteler, M., Naehrig, M., Svore, K. M., & Lauter, K. (2017) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-70697-9_9 · Cited by 212 · see citing works
Experimental Quantum Computing to Solve Systems of Linear Equations
Cai, X.-D., Weedbrook, C., Su, Z.-E., Chen, M.-C., Gu, M., Zhu, M.-J., Li, L., Liu, N.-L., Lu, C.-Y., & Pan, J.-W. (2013) · Physical Review Letters · doi:10.1103/physrevlett.110.230501 · Cited by 173 · see citing works
Parker, S., & Plenio, M. B. (2000) · Physical Review Letters · doi:10.1103/physrevlett.85.3049 · Cited by 130 · see citing works
Calculating the thermal rate constant with exponential speedup on a quantum computer
Lidar, D. A., & Wang, H. (1999) · Physical Review E · doi:10.1103/physreve.59.2429 · Cited by 115 · see citing works
Factoring using $2n+2$ qubits with Toffoli based modular multiplication
Haner, T., Roetteler, M., & Svore, K. M. (2017) · Quantum Information and Computation · doi:10.26421/qic17.7-8-7 · Cited by 90 · see citing works
Experimental phase estimation enhanced by machine learning
Lumino, A., Polino, E., Rab, A. S., Milani, G., Spagnolo, N., Wiebe, N., & Sciarrino, F. (2018) · Physical Review Applied · doi:10.1103/physrevapplied.10.044033 · Cited by 97 · see citing works
Midcircuit Measurements on a Single-Species Neutral Alkali Atom Quantum Processor
Graham, T. M., Phuttitarn, L., Chinnarasu, R., Song, Y., Poole, C., Jooya, K., Scott, J., Scott, A., Eichler, P., & Saffman, M. (2023) · Physical Review X · doi:10.1103/physrevx.13.041051 · Cited by 81 · see citing works
Improved Quantum Circuits for Elliptic Curve Discrete Logarithms
Häner, T., Jaques, S., Naehrig, M., Roetteler, M., & Soeken, M. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-44223-1_23 · Cited by 76 · see citing works
Veis, L., Višňák, J., Nishizawa, H., Nakai, H., & Pittner, J. (2016) · International Journal of Quantum Chemistry · doi:10.1002/qua.25176 · Cited by 55 · see citing works
Relativistic quantum chemistry on quantum computers
Veis, L., Višňák, J., Fleig, T., Knecht, S., Saue, T., Visscher, L., & Pittner, J. (2012) · Physical Review A · doi:10.1103/physreva.85.030304 · Cited by 36 · see citing works
Quantum information and physics: Some future directions
Preskill, J. (2000) · Journal of Modern Optics · doi:10.1080/095003400148097 · Cited by 154 · see citing works
Quantum Computing Approach to Nonrelativistic and Relativistic Molecular Energy Calculations
Veis, L., & Pittner, J. (2014) · Advances in Chemical Physics · doi:10.1002/9781118742631.ch04 · Cited by 3 · see citing works
Quantum algorithms for computing general discrete logarithms and orders with tradeoffs
Ekerå, M. (2021) · Journal of Mathematical Cryptology · doi:10.1515/jmc-2020-0006 · Cited by 3 · see citing works
- Authors
- Griffiths, R. B., & Niu, C.-S.
- Affiliations
- Carnegie Mellon University (US)
- ORCID
- Griffiths, Robert B.
- Venue
- Physical Review Letters
- Publisher
- American Physical Society (APS)
- Published
- 1996-04-22
- Volume
- 76
- Issue
- 17
- Pages
- 3228-3231
- ISSN
- 0031-9007 (ISSN-L)
- 1079-7114
- OpenAlex
- W1967037487
- Semantic Scholar
- 329841e83131305db888e7016124a456ab5836cf
- 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
- green
- arxiv.org
- 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