A quantum algorithm is a procedure that manipulates the amplitudes of a many-qubit state so that interference concentrates probability on the answer to a classically hard problem. The field splits into two broadly separate families. The first is the provable-speedup family: Shor’s factoring and discrete-logarithm algorithms, the quantum Fourier transform, phase estimation, and the quantum signal processing (QSP) and quantum singular value transformation (QSVT) framework that unifies factorisation, matrix inversion and Hamiltonian simulation under one construction. These have known complexity advantages but assume error-corrected logical qubits. The second is the heuristic variational family, principally the variational quantum eigensolver (VQE) and the Quantum Approximate Optimisation Algorithm (QAOA), designed to run on today’s noisy devices by interleaving shallow quantum circuits with classical parameter optimisation.
For the second family the deciding parameter is trainability. Expressive circuits with standard expectation-value objectives fall into barren plateaus, where gradients vanish, and multi-constraint state-preparation targets make the landscape worse still. Much of the current literature is therefore about landscape engineering and noise-cost reduction rather than new speedups: reshaped loss functions, parameter heuristics, constraint-preserving mixers whose Trotter error scales with individual constraint size rather than problem size, and learned surrogates that reproduce zero-noise-extrapolation results at lower circuit-execution cost.
A third strand is the supporting plumbing: loading classical or tensor-network reference states in logarithmic circuit depth, new Fourier transforms over semisimple algebras with poly(n, log d, log(1/eps)) gate complexity, compilation for distributed multi-module machines, and formal verification of compiled oracles, where a semantics-level audit of an elliptic-curve Shor oracle found the controlled version violating the expected control law despite passing a trivial sanity check.
Evidence base
Open questions
Once magic-state delivery limits are included, how much do published fault-tolerant resource estimates for Shor-class algorithms change, given that T-depth is a poor predictor of executable makespan?
How widespread are semantic defects in compiled quantum oracles beyond the single Qrisp ECDLP case study, and does routine semantic auditing invalidate any existing published complexity or resource claims?
Do landscape-reshaping methods such as tilted losses and constraint-preserving mixers scale past the demonstrated problem sizes, or do the trainability-estimability and Trotter-error trade-offs bind first?
Can any variational result that relies on a classically learned surrogate for error mitigation still support an advantage claim over a purely classical method on the same problem?
Assessment drafted 2026-08-31 from up to 18 KB sources using the technology-scorecard framework; scores are a draft read pending review.
2023-05-24💡 E01: Launching State of the Future: The Worlds First Deep Tech Trackersubstack
Frontier questions
Once magic-state delivery limits are included, how much do published fault-tolerant resource estimates for Shor-class algorithms change, given that T-depth is a poor predictor of executable makespan 2026 05 08 when t depth misleads predicting fault tolerant quantum exec?
How widespread are semantic defects in compiled quantum oracles beyond the single Qrisp ECDLP case study, and does routine semantic auditing invalidate any existing published complexity or resource claims 2026 05 05 semantics based verification of an implemented shor oracle f?
Do landscape-reshaping methods such as tilted losses and constraint-preserving mixers scale past the demonstrated problem sizes, or do the trainability-estimability and Trotter-error trade-offs bind first 2026 05 05 quantum tilted loss in variational optimization theory and a 2026 05 05 constraint preserving xy mixers under trotterized adiabatic ?
Can any variational result that relies on a classically learned surrogate for error mitigation still support an advantage claim over a purely classical method on the same problem 2026 05 05 accelerating noisy variational quantum algorithms with physi?
Does the Quantum Tilted Loss retain gradient amplification and global-minimum preservation at qubit counts and circuit depths where barren plateaus are empirically confirmed, or only in the structured instances reported 2026 05 05 quantum tilted loss in variational optimization theory and a?
Do the simulated advantages of distributed qLDPC transversal operations over surface-code lattice surgery reproduce on physical multi-module hardware with measured inter-module link fidelities 2026 05 04 transversal fault tolerant distributed quantum computing ope?
Can penalty-free fully quantum eigenstate algorithms be resource-costed against variational baselines for a fixed many-body Hamiltonian, in gate count and required code distance 2026 05 05 a penalty free quantum algorithm to find energy eigenstates?
How frequently do control-law violations of the kind found in the Qrisp ECDLP oracle appear across other compilers and published Shor resource estimates, and by how much do they change stated qubit and gate counts 2026 05 05 semantics based verification of an implemented shor oracle f?
For constraint-preserving mixers, at what constraint size does Trotter error exceed the penalty-method distortion it was introduced to avoid 2026 05 05 constraint preserving xy mixers under trotterized adiabatic ?