pith. sign in

arxiv: 2412.14703 · v2 · pith:JCZF5MLFnew · submitted 2024-12-19 · 🪐 quant-ph · cs.ET· physics.hist-ph

A brief history of quantum vs classical computational advantage

classification 🪐 quant-ph cs.ETphysics.hist-ph
keywords advantagequantumcomputationalexperimentsreviewadditionalgorithmappearing
0
0 comments X
read the original abstract

In this review article we summarize all experiments claiming quantum computational advantage to date. Our review highlights challenges, loopholes, and refutations appearing in subsequent work to provide a complete picture of the current statuses of these experiments. In addition, we also discuss theoretical computational advantage in example problems such as approximate optimization and recommendation systems. Finally, we review recent experiments in quantum error correction -- the biggest frontier to reach experimental quantum advantage in Shor's algorithm.

This paper has not been read by Pith yet.

discussion (0)

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

Forward citations

Cited by 5 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Distributions of Noisy Expectation Values over Sets of Measurement Operators

    quant-ph 2026-04 unverdicted novelty 6.0

    Distributions of noisy expectation values over sets of measurement operators on random mixed states are derived combinatorially and approximated by fitted effective global-depolarizing models that match peaks in brick...

  2. Tensor Networks with Belief Propagation Cannot Feasibly Simulate Google's Quantum Echoes Experiment

    quant-ph 2026-04 unverdicted novelty 5.0

    Tensor networks with belief propagation fail to simulate Google's quantum echoes OTOC experiment because the circuits produce largely incompressible entanglement.

  3. Mind the gaps: The fraught road to quantum advantage

    quant-ph 2025-10 unverdicted novelty 4.0

    The authors identify four transitions needed to reach fault-tolerant application-scale quantum computing from current NISQ devices.

  4. SparQSim: Simulating Scalable Quantum Algorithms via Sparse Quantum State Representations

    quant-ph 2025-03 unverdicted novelty 4.0

    SparQSim is a sparse-state quantum simulator in C++ supporting QRAM that outperforms dense Schrödinger simulators on high-sparsity benchmark circuits and produces consistent results for quantum linear system solvers.

  5. Mind the gaps: The fraught road to quantum advantage

    quant-ph 2025-10 unverdicted novelty 3.0

    The paper identifies four key hurdles in the transition from NISQ to FASQ quantum computers and argues that targeting them will accelerate progress toward useful quantum advantage.