Welcome to the Spring 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. End-to-End Simulation of Chemical Dynamics on a Quantum Computer
- 2. Quantum simulation of nanographenes and Trotter error cancellation
- 3. Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory
- 4. Quantum Solvers for Nonlinear Matrix Equations in Quantum Chemistry
- 5. MLMC-qDRIFT: Multilevel Variance Reduction for Randomized Quantum Hamiltonian Simulation
- Honourable mentions
- Xanadu papers
Top papers
1. End-to-End Simulation of Chemical Dynamics on a Quantum Computer
An important advancement, developing a performant and detailed quantum algorithm for simulating time evolution under pre-Born-Oppenheimer Hamiltonians. This complements prior work by Xanadu.
2. Quantum simulation of nanographenes and Trotter error cancellation
A great example of the type of work needed to advance the field: an optimized quantum algorithm informed by practical considerations targeting a concrete application. It is compelling that 100+ spin orbitals can be simulated with ~1e7 Toffoli gates.
3. Analytical Angle-Finding and Series Expansions for Quantum Signal Processing via Orthogonal Polynomial Theory
Elegant solution to finding optimal angles for QSP. There exist performant numerical angle-finding methods, but analytical expressions could end up being the preferred method in practice.
4. Quantum Solvers for Nonlinear Matrix Equations in Quantum Chemistry
Impressive work exploring an increasingly active research direction: using quantum computers to achieve improvements in regimes where classical chemistry methods work well.
5. MLMC-qDRIFT: Multilevel Variance Reduction for Randomized Quantum Hamiltonian Simulation
Introduces MLMC-qDRIFT, a multilevel Monte Carlo framework for qDRIFT that reduces the accuracy-dependent scaling of shot-based observable extraction using qDRIFT from \mathcal{O}(1/\epsilon^3) to \mathcal{O}(\log^2(1/\epsilon)/\epsilon^2).
Honourable mentions
1. When is randomization advantageous in quantum simulation?
Introduces a randomized construction of QSVT and studies its performance against the deterministic framework. They find that, for Hamiltonians with highly inhomogeneous coefficient distributions, randomized methods reduce gate counts by up to an order of magnitude in regimes of moderate-precision, with deterministic methods becoming more favorable when requiring high-precision.
2. A unified framework for efficient quantum simulation of nonlinear spectroscopy
Clever approach to nonlinear spectroscopy by employing the generalized parameter-shift rule. It remains open to determine if operators with simple spectra exist that make this method attractive compared to prior work by Xanadu.
3. Efficient Quantum Algorithms for Higher-Order Coupled Oscillators
Outside-the-box thinking exploring applications to neural signal processing in brain networks, studied by Kuramoto models. More work needed to determine if attractive quantum speedups are possible.
Xanadu papers
Halving the cost of QROM
Halves the cost of one the most widely utilized algorithmic subroutines. QROM accounts for the majority of the algorithmic overhead in most applications of quantum computers, hence, any improvements in its efficiency have far reaching implications for the field.
Parameter-optimal unitary synthesis with flag decompositions
The authors revisit the old problem of unitary synthesis with a fresh FTQC perspective and find a method that is optimal in the number of rotation gates, leading to fewer non-Clifford gates compared to the previous state of the art.
Probabilistic modeling over permutations using quantum computers
Unlocks a long-elusive practical application for the QFT over the symmetric group, leveraging its super-exponential speedup for machine learning on permutation-structured data. This marks a critical first step towards deploying non-Abelian QFTs as subroutines for probabilistic QML models in real-world tasks.
We hope you enjoyed this selection of top papers. Stay tuned for the Summer 2026 edition! You can sign up to the Xanadu newsletter, PennyLane newsletter, or follow PennyLane on LinkedIn or Twitter/X to get notified.
About the authors
Juan Miguel Arrazola
Making quantum computers useful
Danial Motlagh
Searching for real world applications of quantum computers.