Pith. sign in

REVIEW 14 cited by

Quantum computing 40 years later

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2106.10522 v3 pith:OTT2AV3H submitted 2021-06-19 quant-ph

classification quant-ph
keywords feynmanquantumyearscomputerlaterarticleassessbuild
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Forty years ago, Richard Feynman proposed harnessing quantum physics to build a more powerful kind of computer. Realizing Feynman's vision is one of the grand challenges facing 21st century science and technology. In this article, we'll recall Feynman's contribution that launched the quest for a quantum computer, and assess where the field stands 40 years later.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 14 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 37 citations worldwide. Full citation record

  1. Maximal coherence of quantum measurement and the resource theory of sharpness

    quant-ph 2026-07 accept novelty 7.0 of 10

    Maximizing the distance-based coherence of a POVM over all unitary basis changes is proven to exactly equal its distance-based sharpness for POVMs with a common eigenbasis or common MUB structure.

  2. Modeling and Simulating Rydberg Atom Quantum Computers for Hardware-Software Co-design with PachinQo

    quant-ph 2024-12 conditional novelty 7.0 of 10

    PachinQo is a co-design framework that compiles general quantum algorithms onto zonal-addressing Rydberg atom computers, reducing simulated runtime and raising estimated success probability.

  3. Advancing Stochastic 3-SAT Solvers by Dissipating Oversatisfied Constraints

    cs.AI 2025-06 conditional novelty 6.0 of 10

    DOCSAT, a WalkSAT variant that penalizes oversatisfied clauses, solves critically hard random 3-SAT instances far more often than WalkSAT, YalSAT, or Kissat in the authors' benchmarks.

  4. Quantum computation of hadron scattering in a lattice gauge theory

    quant-ph 2025-05 conditional novelty 6.0 of 10

    On a trapped-ion quantum computer, the authors prepared multiple meson wave packets and simulated their early-time collisions in a 1+1D Z2 lattice gauge theory.

  5. Domain-Aware Probability Sampling for Hybrid Quantum Systems using Bayesian Optimization

    quant-ph 2025-09 reject novelty 5.0 of 10

    CircuitTree uses tree-based Bayesian optimization with layerwise splitting to prepare quantum states with lower TVD and fewer gates, but its convergence proof is not valid as stated.

  6. Hamiltonian Formalism for Comparing Quantum and Classical Intelligence

    quant-ph 2025-06 conditional novelty 5.0 of 10

    A Hamiltonian framework decomposes AGI dynamics into generators for induction, reasoning, recursion, learning, measurement, and memory, enabling comparison of classical and quantum agents by commutation structure.

  7. Quantum AGI: Ontological Foundations

    quant-ph 2025-06 conditional novelty 5.0 of 10

    Quantum foundational theorems (Bell, Kochen-Specker, no-cloning) impose formal constraints on the states, learning, self-reference, and identity of a hypothetical quantum-native AGI.

  8. Closed-Form Expressions for Unitaries of Spin-Adapted Fermionic Operators

    quant-ph 2025-05 accept novelty 5.0 of 10

    The authors derive closed-form expressions, in spin-orbital and generator-power forms, for unitaries generated by singlet spin-adapted single and double fermionic excitations.

  9. Compact Quantum Dot Models for Analog Microwave co-Simulation

    quant-ph 2025-02 conditional novelty 5.0 of 10

    Quantum-dot devices are modeled in Verilog-A with the Lindblad master equation, enabling mixed quantum-classical circuit co-simulation in Cadence Spectre with results matching analytic theory.

  10. Bogoliubov quasi-particles in superconductors are integer-charged particles inapplicable for braiding quantum information

    cond-mat.str-el 2025-09 reject novelty 4.0 of 10

    A number-conserving treatment of superconductors leads to integer-charged quasiparticles that cannot be Majorana zero modes, challenging topological quantum computation.

  11. Toolchain for Faster Iterations in Quantum Software Development

    quant-ph 2025-07 conditional novelty 4.0 of 10

    A q8s Jupyter kernel offloads quantum circuit simulation to remote GPU clusters, showing up to 10x faster execution for 29-qubit circuits than a local CPU laptop.

  12. One Polynomial Strategy for Computing Local Projections on Square-Lattice Cluster States

    quant-ph 2025-06 reject novelty 4.0 of 10

    The note conjectures a polynomial-time recursive method for computing arbitrary local projections on 2D square-lattice cluster states, but the core 2D recursion is not proved and the numerical evidence is too small to...

  13. Quantum Radar and Research Assessment

    physics.soc-ph 2025-06 conditional novelty 3.0 of 10

    Quantum Radar's range is fundamentally limited by the tiny energy of a single photon, and the publication system that promoted it needs stronger independent assessment.

  14. Gauge Theory and Integrability: An Overview

    hep-th 2025-09 unverdicted novelty 2.0 of 10

    A review of the 4d Chern-Simons framework that derives integrable models and Yangian algebras from gauge theory.

Pith tools