PennyLane
  • Why PennyLane
  • Getting Started
  • Documentation
  • Ecosystem
Install
Install
  1. Blog/
  2. Algorithms/
  3. Top quantum algorithms papers — Spring 2025 edition

June 26, 2025

Top quantum algorithms papers — Spring 2025 edition

Juan Miguel Arrazola

Juan Miguel Arrazola

Danial Motlagh

Danial Motlagh

Top quantum algorithms papers — Spring 2025 edition

In this blog post, we share our favourite papers released in the second quarter of 2025. The selection is based on relevance to quantum algorithms and applications; 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.

Contents

  • The Top 5
    • 1. A comprehensive framework to simulate real-time chemical dynamics on a fault-tolerant quantum computer
    • 2. How to factor 2048 bit RSA integers with less than a million noisy qubits
    • 3. Quantum Simulation of Dynamical Response Functions of Equilibrium States
    • 4. A log-depth in-place quantum Fourier transform that rarely needs ancillas
    • 5. Productionizing Quantum Mass Production
  • Honorable mentions
    • 1. Quantum simulation with sum-of-squares spectral amplification
    • 2. Demonstration of logical quantum phase estimation for X-ray absorption spectra
    • 3. In the shadow of the Hadamard test: Using the garbage state for good and further modifications
  • Xanadu papers from Winter 2025
    • Integrated photonic source of Gottesman–Kitaev–Preskill qubits
    • Simulating near-infrared spectroscopy on a quantum computer for enhanced chemical detection
    • Logical channels in approximate Gottesman-Kitaev-Preskill error correction
    • The stellar decomposition of Gaussian quantum states
    • Constant-time hybrid compilation of Shor's algorithm with quantum just-in-time compilation

The Top 5

1. A comprehensive framework to simulate real-time chemical dynamics on a fault-tolerant quantum computer

Great strides in the development of algorithms for applications of quantum computing in quantum dynamics.

The time evolution of a chemical system.

2. How to factor 2048 bit RSA integers with less than a million noisy qubits

Substantial reduction in quantum computing resources for factoring by combining a number of recent algorithmic developments in the field.

A plot of the qubits required for various parts of Gidney's algorithm.

3. Quantum Simulation of Dynamical Response Functions of Equilibrium States

Circumventing the need for the exact preparation of equilibrium states for estimating response functions on a quantum computer.

A quantum circuit from the paper.

4. A log-depth in-place quantum Fourier transform that rarely needs ancillas

Introduces the idea of “optimistic quantum circuits” that achieve good approximations on most inputs (but not all), thereby reducing the cost of implementation.

A quantum circuit from the paper.

5. Productionizing Quantum Mass Production

Significant reduction of Clifford operations in quantum read-only memory (QROM).

A quantum circuit from the paper.

Honorable mentions

1. Quantum simulation with sum-of-squares spectral amplification

A table of equations for various parts of algorithms from the paper.

2. Demonstration of logical quantum phase estimation for X-ray absorption spectra

A plot from the paper that compares intensity versus energy in the experiment.

3. In the shadow of the Hadamard test: Using the garbage state for good and further modifications

Two quantum circuits showing the application of the technique in the paper.

Xanadu papers from Winter 2025

Integrated photonic source of Gottesman–Kitaev–Preskill qubits

A plot from the paper showing the probability of observing a quantum state.

Simulating near-infrared spectroscopy on a quantum computer for enhanced chemical detection

A schematic from the paper.

Logical channels in approximate Gottesman-Kitaev-Preskill error correction

A schematic showing the technique described in the paper.

The stellar decomposition of Gaussian quantum states

A quantum circuit from the paper.

Constant-time hybrid compilation of Shor's algorithm with quantum just-in-time compilation

A quantum circuit from the paper.


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

About the authors

Juan Miguel Arrazola
Juan Miguel Arrazola

Juan Miguel Arrazola

Making quantum computers useful

Danial Motlagh
Danial Motlagh

Danial Motlagh

Searching for real world applications of quantum computers.

Last modified: June 30, 2025

Related Blog Posts

PennyLane

PennyLane is an open-source software framework for quantum machine learning, quantum chemistry, and quantum computing, with the ability to run on all hardware. Built with ❤️ by Xanadu.

Stay updated with our newsletter

For researchers

  • Research
  • Features
  • Demos
  • Compilation
  • Datasets
  • Performance
  • Learn
  • Videos
  • Documentation
  • Teach

For learners

  • Learn
  • Codebook
  • Teach
  • Videos
  • Challenges
  • Demos
  • Compilation
  • Glossary

For developers

  • Features
  • Documentation
  • API
  • GitHub
  • Datasets
  • Demos
  • Compilation
  • Performance
  • Devices
  • Catalyst

© Copyright 2025 | Xanadu | All rights reserved

TensorFlow, the TensorFlow logo and any related marks are trademarks of Google Inc.

Privacy Policy|Terms of Service|Cookie Policy|Code of Conduct