Quantum AI Report

The convergence of Quantum with AI

Algorithms & Software

Compilers, circuit optimisation, error mitigation, and the algorithms themselves — including quantum machine learning and the hybrid classical-quantum stack.

470 stories

Quantum Zeitgeist

NVIDIA opens CUDA-Q platform to test fault-tolerant quantum applications

NVIDIA has added CUDA-Q Logical, an orchestration layer, to its open-source CUDA-Q platform. The layer is intended for designing and testing fault-tolerant quantum applications, with stated use in drug discovery, financial modelling, and materials development. It is aimed at workflows that need logical qubits to suppress errors and execute larger computations.

OutlookPlausible

Within the next two years, pharmaceutical and financial modelling teams could use CUDA-Q Logical to benchmark fault-tolerant algorithms against projected hardware resource counts before committing to physical quantum hardware access.

arXiv quant-ph

Rethinking Noise in Quantum Machine Learning: When Noise Improves Learning

A preprint reports numerical experiments in an effective noise model in which quantum noise, normally treated as a barrier to reliable computation, appears to improve performance of quantum graph neural networks on molecular tasks. The authors argue this challenges the standard view that near-term noise must always be corrected or mitigated.

OutlookPlausible

Noise-aware training or selective noise injection could become a practical component of quantum graph neural network pipelines for molecular property prediction.

arXiv quant-ph

FTCircuitBench: A Benchmark Suite for Fault-Tolerant Quantum Compilation and Architecture

A new preprint introduces FTCircuitBench, a benchmark suite for evaluating compilation and optimization of logical circuits under quantum error correction. The authors frame fault-tolerant logical compilation as a distinct problem from NISQ-era circuit optimization, with its own constraints and operational assumptions. The abstract does not detail the specific benchmarks or metrics included.

OutlookPlausible

FTCircuitBench could enable direct, comparable evaluation of fault-tolerant compilation strategies across different QEC codes and architectures within the next two years, helping research groups converge on practical logical compilation defaults before full-scale machines are built.

arXiv quant-ph

Reinforcement Learning for Syndrome Extraction

A paper posted to arXiv on 14 September 2026 introduces a reinforcement-learning approach to the problem of selecting syndrome extraction circuits in quantum error correction. It treats the exponentially growing number of possible extraction implementations as a search space, where different implementations have materially different fault-tolerance properties as measured by logical error rates. The abstract frames this as a natural search problem and proposes RL as a way to explore it.

OutlookPlausible

Within two years, RL-optimised syndrome extraction circuits could become a standard benchmarking tool in quantum error correction simulations, producing modest but consistent reductions in logical error rates for small surface codes.

error correctionalgorithms softwareGoogle Quantum AIIBM QuantumQ-CTRLQuantinuumRiverlane
arXiv quant-ph

Quantum neural network equipped with backpropagation on a qudit processor

Researchers describe a quantum neural network method that uses backpropagation and is intended for a qudit processor. The work addresses QNN size limits by employing multi-level quantum digits, which enlarge the accessible Hilbert space relative to qubit circuits. The paper appears as an arXiv preprint and frames QNNs for classification and identification tasks.

OutlookPlausible

Backpropagation on qudits could make small QNN classification experiments practical on existing noisy multi-level devices within two years.

arXiv quant-ph

Sparse-Blossom Decoding in $o(1)$ Time

A preprint posted to arXiv presents a sparse blossom decoder for quantum error correction that is claimed to run in o(1) time. The approach builds on minimum-weight perfect matching, which gives rigorous error-suppression guarantees, and extends earlier sparse blossom techniques that were practical only at modest problem sizes.

OutlookPlausible

This could let surface-code experiments from Google or IBM run MWPM decoding in real time on larger code patches within two years, removing decode latency as a limit on logical clock speed.

Quantum Zeitgeist

Researchers Measure Quantum Processor Speed Using New Benchmark

Researchers introduced a benchmark called CLOPS_h that uses a sustained execution rate above one million circuit layer operations per second as a performance standard. The metric addresses how quickly a quantum processor can repeat complex calculations, a factor earlier benchmarks largely ignored by focusing on fidelity alone. It ties the speed measurement directly to hardware constraints.

OutlookPlausible

Within two years, CLOPS_h could become a standard datapoint in quantum processor datasheets, allowing direct comparison of sustained execution speed across hardware platforms.

Quantum Zeitgeist

Columbia & Cambridge unlock quantum AI for new material models

Researchers led by Michele Simoncelli at Columbia University, working with colleagues at the University of Cambridge, have introduced a benchmark for testing machine learning models that predict material properties. The benchmark is intended to give the community a standardized way to compare how well different models capture the behaviour of materials.

OutlookPlausible

The benchmark could become a standard evaluation suite for machine learning interatomic potentials and property prediction models.

algorithms softwareColumbia UniversityUniversity of Cambridge
Quantum Zeitgeist

memQ compares gate teleportation to circuit cutting for quantum computing

Researchers at memQ Inc. compared two methods for executing quantum circuits across multiple processors: gate teleportation, which uses shared entanglement to transfer gate operations, and circuit cutting, which partitions circuits for separate execution and classical recombination. Their analysis reports that circuit cutting incurs an exponential overhead in the distributed setting.

OutlookPlausible

This could make gate teleportation the preferred primitive for near-term modular quantum processors, pushing hardware teams to invest in entanglement generation between modules rather than relying on circuit cutting.

Quantum Zeitgeist

Researchers Cut Quantum Error Rates with Optimised Atom Loss

Researchers demonstrated that the spatial location of lost neutral atoms within a quantum error-correcting code affects logical error rates, not just the total number lost. By optimising how qubit loss is managed inside the code, they improved logical error rates in up to 73% of tested scenarios, with gains reaching 5.3× under realistic conditions.

OutlookPlausible

Neutral atom quantum processors could tolerate higher atom loss rates without sacrificing logical qubit quality, reducing the need for fast atom reloading and making error-corrected operation feasible on current hardware.

Quantum Zeitgeist

Distinguishability loss function optimizes quantum encoding circuits

Researchers describe a new objective function for quantum error correction called a distinguishability loss function. It works by maximizing the distinguishability of quantum states after a noise channel has acted on them. The approach is reported to discover encoding circuits that are resource-efficient and optimized for specific noise characteristics.

OutlookPlausible

This loss function could be folded into quantum compilation tools to automatically design hardware-specific encoding circuits that improve state fidelity on near-term processors within two years.

arXiv quant-ph

Bayesian quantum sensing using graybox machine learning

An arXiv preprint introduces a Bayesian quantum sensing method that combines graybox machine learning with Bayesian inference to offset residual effects that are hard to model directly. The work is motivated by the gap between quantum sensors' resolution and sensitivity advantages and their practical limits from noise, state-preparation errors, and imperfect control. It targets applications in materials science, healthcare, and adjacent fields.

OutlookPlausible

Within the next two years, this graybox Bayesian approach could be applied to existing quantum sensing platforms, such as nitrogen-vacancy centers or trapped-ion sensors, to reduce measurement errors from unmodelled drift and control imperfections without requiring a complete first-principles model.

arXiv quant-ph

Implementation and verification of coherent error suppression using randomized compiling for Grover's algorithm on a trapped-ion device

An updated arXiv preprint reports an experimental implementation of randomized compiling on a trapped-ion quantum processor, applied to Grover's algorithm, to suppress coherent errors from control imprecision. The work includes verification that the method reduces coherent error in near-term quantum computations that do not use fault-tolerant error correction.

OutlookPlausible

This could establish randomized compiling as a standard pre-processing step for trapped-ion quantum computers, increasing the success probability of small Grover search circuits on existing hardware within two years.

arXiv quant-ph

Local decoders for fault-tolerant quantum computation and translation-invariant stabilizer codes

Researchers have proposed a fault-tolerant quantum computer design that operates in two spatial dimensions using only geometrically local operations. The construction combines topological codes with local classical processing and bounded-speed communication, avoiding the need for higher-dimensional connectivity or non-local decoders. It maintains a constant qubit density.

OutlookPlausible

This could enable near-term demonstrations of fault-tolerant operation on 2D superconducting or silicon spin qubit chips by replacing non-local decoder wiring with local classical logic.

arXiv quant-ph

Generative Replay Mitigates Sample Starvation in Quantum Architecture Search

A preprint proposes a reinforcement learning method for quantum architecture search that adds a learned generative replay model. Rather than only reusing observed state-action transitions, the model produces additional predicted one-step transitions from real state-action seeds to address rare useful circuit trajectories as search spaces expand.

OutlookPlausible

This could make reinforcement-learning-based quantum architecture search practical beyond small benchmark circuits, enabling automated discovery of hardware-efficient ansätze for near-term devices.

arXiv quant-ph

A Quantum-Inspired Dequantization Method for Diagonally Weighted Matrix Functions: Application to Learning with Optimized Random Features

A preprint posted to arXiv introduces a classical, quantum-inspired algorithm for evaluating diagonally weighted matrix functions, explicitly targeting the dequantization of a quantum singular value transformation (QSVT)-based sampler used in learning with optimized random features. The authors claim that existing dequantization frameworks do not cover this particular quantum machine learning routine.

OutlookPlausible

The framework could be generalized by dequantization researchers to cover other QSVT-based quantum algorithms that currently lack classical counterparts.

Quantum Computing Report

Xanadu and AMD Launch Open-Source Backline Extension for PennyLane

Xanadu and AMD have released Backline, an open-source extension for PennyLane designed to link quantum processors to classical compute resources including CPUs, GPUs, FPGAs, and SmartNICs. The framework provides Python-native, microsecond-scale communication aimed at removing the data bottleneck between classical and quantum systems for workloads such as quantum error correction.

OutlookPlausible

Backline could make real-time quantum error correction experiments practical on near-term quantum processors by supplying microsecond-latency feedback between quantum hardware and classical decoders.

Quantum Computing Report

IBM Ventures Leads $8 Million Investment in BQP to Scale Quantum-Accelerated Physics Simulation

IBM Ventures led an $8 million investment in BQP, an enterprise software developer behind BQPhy, a platform for quantum-accelerated physics simulation. The funding will support commercial deployment of BQPhy, which optimizes GPU utilization for up to 10x faster performance in engineering environments and aims to prepare classical workloads for a later transition to hybrid quantum-classical execution.

OutlookPlausible

Within two years, BQPhy could be integrated into IBM's quantum software ecosystem as a physics-simulation layer that lets engineering teams switch between GPU-optimised classical execution and quantum backends without rewriting their simulation workflows.

algorithms softwareBQPIBM Ventures
The Quantum Insider

Researchers And AI Agents Cut Estimated Quantum Cost of Attacking Bitcoin Encryption by 86%

The Quantum Insider reports that researchers, working with AI agents, have reduced the estimated quantum resource cost of attacking Bitcoin's underlying elliptic-curve encryption by 86%. The available abstract does not provide further details on methodology, assumptions, or the specific quantum algorithm involved.

OutlookPlausible

Bitcoin developers might accelerate plans for a post-quantum signature upgrade, using the revised cost estimate as a concrete trigger.

Quantum Zeitgeist

Researchers Achieve Chemical Accuracy Using Quantum Error Mitigation

Researchers applied an unbiased error mitigation protocol called QESEM to quantum processor outputs for the water molecule’s ground-state energy. Raw outputs had overestimated the energy by roughly 500 milliHartree; after QESEM, the discrepancy fell to within 30 milliHartree. The source describes this result as reaching chemical accuracy, which it places at about 1.5 milliHartree.

OutlookPlausible

If the reported error reduction holds and the protocol generalizes, QESEM-style mitigation could be added to existing noisy quantum chemistry pipelines, narrowing the gap to chemically useful predictions for small molecules within two years.