Top quantum algorithms papers — Summer 2026 edition

Welcome to the Summer edition of our top papers series on quantum algorithms and applications. The following are our favourite papers of the season based on their potential to advance the field; these are results that we admire and that have been influential to our research. Xanadu papers won’t appear in the selection due to an obvious conflict of interest, but we take the opportunity to share our latest work at the end. And if you haven’t already, make sure to also check out our new Top Quantum Compilation Papers series.

Contents

• Top papers
  • 1. Quantum Fourier transform toolbox and Quantum Fourier transform for the symmetric group
  • 2. Spectral amplification for ground-state energy estimation of electronic structure in first quantization
  • 3. Faster quantum linear system solver beyond the condition number
  • 4. Time-Dependent Hamiltonian Simulation with Optimal Query Complexity
  • 5. Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding and Sparse Quantum State Preparation with Sublinear T-Count
• Honourable mentions
  • 1. Breaking the Curse of Dimensionality in Quantum PDE Solvers via Gevrey Regularity
  • 2. Clifford-efficient sparse state preparation for molecular wavefunctions
  • 4. Nearly Optimal Amplitude Estimation at any Depth
• Xanadu papers
  • 1. Practical Estimation of Trotter Error for Hamiltonian Simulation
  • 2. Theory and practice of Trotter product formulas for quantum chemistry
  • 3. Spectral Born machines: classically trainable quantum generative models for discrete data
  • 4. Improved constant factors for qubitized Hamiltonian simulation
  • 5. Spectral Theory of Semisimple Bivariate Bicycle Codes

Top papers

1. Quantum Fourier transform toolbox and Quantum Fourier transform for the symmetric group

Thorough constructions and resource estimates for non-Abelian QFTs, with exponential circuit-cost improvements for specific group families and a simpler symmetric-group transform. Useful groundwork for new algorithmic applications.

2. Spectral amplification for ground-state energy estimation of electronic structure in first quantization

Extends spectral amplification to first-quantized electronic structure, giving 2–44× lower Toffoli counts than the earlier LCU approach across benchmarks. Pseudopotentials remain an important next step for materials applications.

3. Faster quantum linear system solver beyond the condition number

Promising linear-system algorithms whose cost follows the input's spectral weight, giving smaller bounds for favourable instances. Concrete application-level estimates are still needed to assess practical savings.

4. Time-Dependent Hamiltonian Simulation with Optimal Query Complexity

Shows that Lipschitz-continuous time dependence adds no asymptotic query overhead in the HAM-T model, matching optimal precision dependence. A useful theoretical advance in Hamiltonian simulation.

5. Optimal T Counts under Sparsity: from QROM to State Preparation and Block Encoding and Sparse Quantum State Preparation with Sublinear T-Count

First construction of sparse QROM with sublinear T-count, with applications to state preparation and block encoding.

Honourable mentions

1. Breaking the Curse of Dimensionality in Quantum PDE Solvers via Gevrey Regularity

Uses Gevrey smoothness to avoid exponential dependence on dimension in quantum PDE solving, with explicit circuits. The speedup depends on regularity, periodic boundaries, and conditioning assumptions.

2. Clifford-efficient sparse state preparation for molecular wavefunctions

Exploits affine relationships between molecular configurations to simplify sparse-state preparation with Clifford gates. The benchmarks use fewer ancillas while keeping non-Clifford counts competitive.

4. Nearly Optimal Amplitude Estimation at any Depth

Nearly optimal tradeoffs between depth and repetitions for amplitude estimation, without extra ancillas or controlled Grover operations.

Xanadu papers

1. Practical Estimation of Trotter Error for Hamiltonian Simulation

Novel theoretical and numerical developments for tight Trotter-error estimation at unprecedented scale.

2. Theory and practice of Trotter product formulas for quantum chemistry

Introduces SPRINT, a novel framework for the construction of advanced product formulas that reduce costs for electronic structure Hamiltonians; achieving a 4.5× Toffoli reduction on the benchmarked Li₄Mn₂O system.

3. Spectral Born machines: classically trainable quantum generative models for discrete data

Classically trainable quantum generative models, demonstrated with a 190-qubit model and over a million parameters on RNA sequences.

4. Improved constant factors for qubitized Hamiltonian simulation

Tighter QSP degree bounds reduce established Hamiltonian-simulation overhead estimates by about 1.36× in the large-time regime. A useful constant-factor improvement to a widely used primitive.

5. Spectral Theory of Semisimple Bivariate Bicycle Codes

An algebraic treatment of semisimple bivariate bicycle codes using Frobenius orbits, yielding logical dimensions, distance lower bounds, and explicit constructions. A useful complement to numerical code discovery.

---

We hope you enjoyed this selection of top papers. Stay tuned for the Fall 2026 edition! You can sign up to the Xanadu newsletter or follow PennyLane on LinkedIn or Twitter/X to get notified.