pith. sign in

arxiv: 2209.04819 · v2 · submitted 2022-09-11 · 🪐 quant-ph

Universal Quantum Electron Microscopy: A Small-Scale Quantum Computing Application with Provable Advantage

Hiroshi Okamoto This is my paper

Pith reviewed 2026-05-24 11:41 UTC · model grok-4.3

classification 🪐 quant-ph
keywords quantum electron microscopyquantum query complexityspecimen damageGrover searchphase objectquantum advantagebeam-sensitive samplessmall-scale quantum computing
0
0 comments X

The pith

A quantum electron microscope reduces specimen damage by using algorithms with lower query complexity, offering provable advantage even on small quantum devices.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper models the interaction between an electron beam and a beam-sensitive phase object, such as a biological specimen, as the oracle queries inside a quantum algorithm. Because damage scales with the number of queries rather than total runtime, any quantum algorithm that solves a problem with fewer queries than a classical counterpart extracts more information before the specimen is destroyed. A concrete example is using Grover search to identify the correct structure among a list of candidates. A sympathetic reader cares because this supplies a near-term physical setting where small-scale quantum hardware can already demonstrate an advantage without requiring error-corrected logical qubits.

Core claim

By treating the specimen as the phase object that implements the quantum oracle, the number of electron-specimen interactions required equals the query complexity of the algorithm. Quantum algorithms therefore inflict less damage than their classical counterparts for the same computational task, directly translating query-complexity advantage into an increase in extractable data from the specimen.

What carries the argument

Modeling the electron-specimen interaction as the oracle in a quantum query algorithm, so that query count directly controls cumulative damage.

If this is right

  • Grover search over candidate structures becomes feasible with less cumulative damage than any classical exhaustive search.
  • Any quantum algorithm whose query complexity is lower than its classical counterpart yields a corresponding reduction in specimen damage.
  • Small-scale quantum processors can already demonstrate advantage in a microscopy setting without needing large numbers of logical qubits.
  • The advantage holds as long as the dominant damage mechanism is the number of electron-specimen interactions.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

  • The same query-damage mapping could apply to other quantum algorithms such as quantum phase estimation or amplitude amplification if they can be recast as oracles on a physical specimen.
  • If control overhead proves negligible, the approach might extend to quantum-enhanced tomography or 3-D structure determination of radiation-sensitive molecules.
  • The framework suggests a route to benchmark small quantum devices against classical ones using a physical resource (specimen integrity) that is easier to quantify than runtime on classical hardware.

Load-bearing premise

Physical electron-specimen interactions can be treated as ideal abstract quantum queries without extra damage from control fields, decoherence, or other overheads.

What would settle it

A controlled comparison in which the same search task is run classically and quantumly on identical specimens, measuring whether the quantum version actually yields more usable diffraction or imaging data before the specimen is destroyed.

Figures

Figures reproduced from arXiv: 2209.04819 by Hiroshi Okamoto.

Figure 1
Figure 1. Figure 1: FIG. 1: Schematic drawing of a universal QEM at the con [PITH_FULL_IMAGE:figures/full_fig_p002_1.png] view at source ↗
Figure 2
Figure 2. Figure 2: FIG. 2: Designs of some parts of the universal QEM. (a) An [PITH_FULL_IMAGE:figures/full_fig_p003_2.png] view at source ↗
read the original abstract

We propose a simple design of a quantum electron microscope that ``queries'' a beam-sensitive phase object, such as a biological specimen, as part of quantum computation. Lower quantum query complexity, not the time complexity, of a quantum algorithm means less specimen damage, which translates to more data extracted from the specimen. Hence small-scale quantum computing offers provable quantum advantage in this context. A possible application of the proposed microscope is the Grover search for a true structure, out of a set of candidate structures.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 1 minor

Summary. The manuscript proposes a design for a 'universal quantum electron microscope' that treats a beam-sensitive phase object (e.g., biological specimen) as an oracle in a quantum algorithm. It claims that the reduced query complexity of quantum algorithms (such as Grover search), rather than time complexity, directly implies less specimen damage and thus more extractable data, yielding a provable quantum advantage for small-scale quantum computers.

Significance. If the mapping from abstract query complexity to physical damage can be rigorously established, the work would identify a concrete near-term application domain for quantum devices in which the advantage metric is sample preservation rather than runtime, potentially relevant to electron microscopy of radiation-sensitive materials.

major comments (2)
  1. [Abstract] Abstract: The central claim that 'Lower quantum query complexity, not the time complexity, of a quantum algorithm means less specimen damage' is asserted without derivation, Hamiltonian, scattering model, or resource count showing how superposition, phase kickback, or ancillary controls map to physical electron-specimen interactions without net increase from control fields, decoherence, or retries.
  2. [Abstract] Abstract: The assertion of 'provable quantum advantage' rests on the unmodeled equivalence between the number of oracle queries and specimen damage; this equivalence is load-bearing for the thesis but receives no supporting analysis or error budget.
minor comments (1)
  1. The invented entity 'Universal quantum electron microscope' is introduced without a precise operational definition or comparison to existing quantum microscopy proposals.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the detailed feedback. We address the two major comments point-by-point below, clarifying the conceptual basis of the proposal while agreeing to strengthen the manuscript with additional discussion on the physical mapping.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The central claim that 'Lower quantum query complexity, not the time complexity, of a quantum algorithm means less specimen damage' is asserted without derivation, Hamiltonian, scattering model, or resource count showing how superposition, phase kickback, or ancillary controls map to physical electron-specimen interactions without net increase from control fields, decoherence, or retries.

    Authors: The proposal treats the phase object as a quantum oracle in the standard query model, where each oracle call corresponds to one controlled interaction between the electron probe and the specimen. Quantum algorithms achieve the task with asymptotically fewer such calls than classical counterparts, directly reducing the cumulative number of scattering events and thus the total damage. We agree the current manuscript states this at a high level without a full Hamiltonian or scattering derivation. In revision we will add a dedicated paragraph in the introduction that sketches the electron-optical implementation of the oracle (using phase plates or structured illumination for the controlled phase shift) and notes that ancillary controls and retries are assumed to contribute sub-dominant overhead relative to the specimen interactions themselves. revision: yes

  2. Referee: [Abstract] Abstract: The assertion of 'provable quantum advantage' rests on the unmodeled equivalence between the number of oracle queries and specimen damage; this equivalence is load-bearing for the thesis but receives no supporting analysis or error budget.

    Authors: The provable advantage is with respect to query complexity in the oracle model; we argue this translates to damage because each query is realized by a single electron-specimen interaction. The manuscript does not claim a complete error budget or full resource count, which would require a detailed physical model. We will revise the text to explicitly state the modeling assumption (oracle cost dominated by specimen damage) and to include a short qualitative error-budget paragraph acknowledging decoherence and control overhead while maintaining that the query reduction still provides a net advantage for the Grover-search application. We therefore view the equivalence as modeled at the level of the query complexity framework rather than entirely unmodeled. revision: partial

Circularity Check

0 steps flagged

No circularity; advantage rests on standard query complexity assumption without self-referential reduction

full rationale

The paper states that lower quantum query complexity directly implies less specimen damage and thus provable advantage for small-scale quantum computing in electron microscopy, with an example application to Grover search. No equations, fitted parameters, or derivations are presented that reduce the central claim to its own inputs by construction. The mapping from abstract queries to physical damage is posited as an assumption rather than derived via self-definition, renaming, or load-bearing self-citation. The argument relies on established quantum query complexity results without internal circular steps, making the derivation self-contained against the provided criteria.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 1 invented entities

The proposal rests on the standard quantum query model and the unstated premise that query count maps linearly to physical damage; no free parameters or invented entities are explicitly introduced in the abstract.

axioms (2)
  • standard math Quantum algorithms achieve lower query complexity than classical counterparts for certain search problems
    Invoked implicitly when stating provable advantage via Grover search
  • domain assumption Number of electron-specimen interactions equals the number of quantum queries
    Central mapping assumed without justification in abstract
invented entities (1)
  • Universal quantum electron microscope no independent evidence
    purpose: Device that performs quantum algorithm queries on phase objects
    New conceptual device introduced to realize the query model physically

pith-pipeline@v0.9.0 · 5596 in / 1281 out tokens · 17448 ms · 2026-05-24T11:41:14.641497+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

31 extracted references · 31 canonical work pages

  1. [1]

    EATCS 87, 78-103 (2005)

    Peter Hoyer and Robert Spalek, Lower bounds on quan- tum query complexity, Bull. EATCS 87, 78-103 (2005)

    work page 2005

  2. [2]

    R. M. Glaeser, K. Downing, D. DeRosier, W. Chiu, and J. Frank, Electron Crystallography of Biological Macro- molecules (Oxford University Press, New York, 2007)

    work page 2007

  3. [3]

    McClean, Michael Newman, Craig Gidney, Sergio Boixo, and Hartmut Neven, Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage, PRX Quantum 2, 010103 (2021)

    Ryan Babbush, Jarrod R. McClean, Michael Newman, Craig Gidney, Sergio Boixo, and Hartmut Neven, Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage, PRX Quantum 2, 010103 (2021)

    work page 2021

  4. [4]

    Okamoto, Quantum interface to charged particles in a vacuum, Phys

    H. Okamoto, Quantum interface to charged particles in a vacuum, Phys. Rev. A 92, 053805 (2015)

    work page 2015

  5. [5]

    Okamoto, Resilient quantum electron microscopy, Phys

    H. Okamoto, Resilient quantum electron microscopy, Phys. Rev. A 106, 022605 (2022)

    work page 2022

  6. [6]

    Kruit, R

    P. Kruit, R. G. Hobbs, C-S. Kim, Y. Yang, V. R. Man- frinato, J. Hammer, S. Thomas, P. Weber, B. Klopfer, C. Kohstall, T. Juffmann, M. A. Kasevich, P. Hommelhoff, and K. K. Berggren, Designs for a quantum electron mi- croscope, Ultramicroscopy 164, 31-45 (2016)

    work page 2016

  7. [7]

    Madan, G

    I. Madan, G. M. Vanacore, S. Gargiulo, T. LaGrange, and F. Carbone, The quantum future of microscopy: Wave function engineering of electrons, ions, and nuclei, Appl. Phys. Lett. 116, 230502 (2020)

    work page 2020

  8. [8]

    Koppell, Yonatan Israel, Adam J

    Stewart A. Koppell, Yonatan Israel, Adam J. Bowman, Brannon B. Klopfer, and M. A. Kasevich, Transmission electron microscopy at the quantum limit, Appl. Phys. Lett. 120, 190502 (2022)

    work page 2022

  9. [9]

    S. A. Koppell, M. Mankos, A. J. Bowman, Y. Israel, T. Juffmann, B. B. Klopfer, and M. A. Kasevich, Design for a 10 keV multi-pass transmission electron microscope, Ul- tramicroscopy 207, 112834 (2019)

    work page 2019

  10. [10]

    Turner, Cameron W

    Amy E. Turner, Cameron W. Johnson, Pieter Kruit, and Benjamin J. McMorran, Interaction-Free Measure- ment with Electrons, Phys. Rev. Lett.127, 110401 (2021)

    work page 2021

  11. [11]

    Okamoto, Possible use of a Cooper-pair box for low- dose electron microscopy, Phys

    H. Okamoto, Possible use of a Cooper-pair box for low- dose electron microscopy, Phys. Rev. A85, 043810 (2012)

    work page 2012

  12. [12]

    Juffmann, S

    T. Juffmann, S. A. Koppell, B. B. Klopfer, C. Ophus, R. M. Glaeser, and M. A. Kasevich, Multi-pass transmission electron microscopy, Sci. Rep. 7, 1699 (2017)

    work page 2017

  13. [13]

    Dmitry Lyumkis, Challenges and opportunities in cryo- EM single-particle analysis, J. Biol. Chem. 294, 5181– 5197 (2019)

    work page 2019

  14. [14]

    Lucas, Benjamin A

    Bronwyn A. Lucas, Benjamin A. Himes, Liang Xue, Tim- othy Grant, Julia Mahamid, and Nikolaus Grigorieff, Lo- cating macromolecular assemblies in cells by 2D template matching with cisTEM, eLife 10:e68946 (2021)

    work page 2021

  15. [15]

    Kfir, Entanglements of Electrons and Cavity Photons in the Strong-Coupling Regime, Phys

    O. Kfir, Entanglements of Electrons and Cavity Photons in the Strong-Coupling Regime, Phys. Rev. Lett. 123, 103602 (2019)

    work page 2019

  16. [16]

    Mi- croanal

    Colin Ophus, Four-Dimensional Scanning Transmission Electron Microscopy (4D-STEM): From Scanning Nan- odiffraction to Ptychography and Beyond, Microsc. Mi- croanal. 25, 563–582 (2019)

    work page 2019

  17. [17]

    Schwartz, Jochen Brau- mueller, Philip Krantz, Joel I.J

    Morten Kjaergaard, Mollie E. Schwartz, Jochen Brau- mueller, Philip Krantz, Joel I.J. Wang, Simon Gustavsson, and William D. Oliver, Superconducting Qubits: Current State of Play, Annu. Rev. Condens. Matter Phys. 11, 369- 395 (2020)

    work page 2020

  18. [18]

    Hiroshi Okamoto and Yukinori Nagatani, Entanglement- assisted electron microscopy based on a flux qubit, Appl. Phys. Lett. 104, 062604 (2014)

    work page 2014

  19. [19]

    Lanting, A

    T. Lanting, A. J. Przybysz, A. Yu. Smirnov, F. M. Spedalieri, M. H. Amin, A. J. Berkley, R. Harris. F. Al- tomare, S. Boixo, P. Bunyk, N. Dickson, C. Enderud, J. P. Hilton, E. Hoskinson, M. W. Johnson, E. Ladizinsky, N. Ladizinsky, R. Neufeld, T. Oh, I. Perminov, C. Rich, M. C. Thom, E. Tolkacheva, S. Uchaikin, A. B. Wilson, and G. Rose, Entanglement in a...

    work page 2014

  20. [20]

    Hiroshi Okamoto, Full-vortex flux qubit for charged- particle optics, Phys. Rev. A 97, 042342 (2018)

    work page 2018

  21. [21]

    Nigg, Luigi Frunzio, S

    Brian Vlastakis, Gerhard Kirchmair, Zaki Leghtas, Si- mon E. Nigg, Luigi Frunzio, S. M. Girvin, Mazyar Mir- rahimi, M. H. Devoret , R. J. Schoelkopf, Deterministi- cally Encoding Quantum Information Using 100-Photon Schroedinger Cat States, Science 342, 607-610 (2013)

    work page 2013

  22. [22]

    Kaya, TEM at millikelvin temperatures: Observing and utilizing superconducting qubits, Micron 161, 103330 (2022)

    Hiroshi Okamoto, Reza Firouzmand, Ryosuke Miyamura, Vahid Sazgari, Shun Okumura, Shota Uchita, Ismet I. Kaya, TEM at millikelvin temperatures: Observing and utilizing superconducting qubits, Micron 161, 103330 (2022)

    work page 2022

  23. [23]

    See Supplemental Material I

    work page

  24. [24]

    Robert Zimmermann, Michael Seidling, and Peter Hom- melhoff, Charged particle guiding and beam splitting with auto-ponderomotive potentials on a chip, Nat. Commun. 12, 390 (2021)

    work page 2021

  25. [25]

    Marius Constantin Chirita Mihaila, Philipp Weber, Matthias Schneller, Lucas Grandits, Stefan Nimmrichter, and Thomas Juffmann, Transverse electron-beam shaping with light, Phys. Rev. X, 12, 031043 (2022)

    work page 2022

  26. [26]

    Hiroshi Okamoto, Measurement errors in entanglement- assisted electron microscopy, Phys. Rev. A 89, 063828 (2014)

    work page 2014

  27. [27]

    See Supplemental Material II

    work page

  28. [28]

    Kuperberg, A subexponential-time quantum algo- rithm for the dihedral hidden subgroup problem, SIAM J

    G. Kuperberg, A subexponential-time quantum algo- rithm for the dihedral hidden subgroup problem, SIAM J. Comput. 35, 170–188 (2005)

    work page 2005

  29. [29]

    Ashley Montanaro, Quantum Pattern Matching Fast on Average, Algorithmica 77, 16–39 (2017)

    work page 2017

  30. [30]

    Universal Quantum Electron Microscopy: A Small-Scale Quantum Computing Application with Provable Advantage

    Hsin-Yuan Huang, Michael Broughton, Jordan Cotler, Sitan Chen, Jerry Li, Masoud Mohseni, Hartmut Neven, Ryan Babbush, Richard Kueng, John Preskill, and Jarrod R. McClean, Quantum advantage in learning from exper- iments, Science 376, 1182–1186 (2022). 1 Supplemental Material for “Universal Quantum Electron Microscopy: A Small-Scale Quantum Computing Appli...

    work page 2022

  31. [31]

    (S22) Let us discretize this integration to obtain a sum

    − ψi(d′ 2)] . (S22) Let us discretize this integration to obtain a sum. As the discretized small solid angle, we take ∆Ω introduced previously, a choice that will be justified shortly. Then we can replace the first integration by a sum as (1/∆Ω) R H dΩ ⇒ Σ, where the sum goes over all the small elements on the hemisphere. Next, we discretize the second in...

    work page 2014