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.

477 stories

arXiv quant-ph

High-rate and computationally-efficient seedless extractors for device-independent quantum cryptography

A preprint on arXiv introduces high-rate, computationally-efficient seedless extractors tailored for device-independent quantum cryptography. Seedless extractors eliminate the need for an independent random seed, simplifying security and implementation. The construction achieves high extraction rates while maintaining efficiency, addressing a bottleneck in practical device-independent protocols.

OutlookPlausible

The seedless extractor design could enable higher secret key rates in experimental device-independent quantum key distribution (DIQKD) systems, potentially making DIQKD more competitive with conventional QKD in the near term.

arXiv quant-ph

An IQP Born Machine for Calorimeter Image Generation at 64 Qubits with Compiled-IQP Deployment

A quantum machine learning model, specifically an IQP Born Machine, was developed to generate calorimeter images for high-energy physics. The model was deployed on a 64-qubit system using compiled IQP circuits for efficient execution. The work was published as a preprint on arXiv.

OutlookPlausible

The compiled-IQP deployment method could be extended to larger qubit counts and more complex imaging tasks, offering a viable quantum alternative for fast event simulation in particle physics.

algorithms softwareCERNGoogleIBM
arXiv quant-ph

Newton-Schulz Retraction-Based Inference Enables Hidden Quantum Markov Models to Outperform Classical HMMs

A research paper on arXiv introduces a new inference method for Hidden Quantum Markov Models (HQMMs) based on Newton-Schulz retractions, demonstrating that HQMMs can outperform classical Hidden Markov Models (HMMs) on sequence modeling tasks.

OutlookSpeculative

The Newton-Schulz retraction method could make HQMMs practical on near-term quantum devices, offering advantages in time-series analysis, natural language processing, or bioinformatics within two years if hardware coherence and gate fidelities continue to improve.

arXiv quant-ph

Architecture-Aware Reinforcement Learning for Communication-Efficient Distributed Quantum Circuit Compilation

A new research paper introduces an architecture-aware reinforcement learning method for distributed quantum circuit compilation, aiming to minimize communication overhead across quantum processors.

OutlookPlausible

This approach could enable more efficient execution of large quantum circuits across networks of small quantum processors by significantly reducing communication overhead.

arXiv quant-ph

QCORE: A Quantum-Control-Oriented Real-Time Execution Architecture with Extensible Closed-Loop Services and Shared AI Acceleration

Researchers have proposed QCORE, a quantum-control-oriented real-time execution architecture that integrates extensible closed-loop services with a shared AI accelerator. The architecture aims to enable efficient, low-latency execution of AI/ML tasks within the quantum control stack, potentially improving calibration, error mitigation, and resource management. A preprint on arXiv details the design and its potential benefits for scaling quantum processors.

OutlookPlausible

If the QCORE architecture is implemented in commercial quantum control systems, it could enable real-time AI-based calibration that significantly reduces the overhead of qubit tune-up, making larger-scale quantum processors more practical within two years.

arXiv quant-ph

Shor's algorithm requires Fanout

Researchers have published a preprint on arXiv quant-ph showing that Shor's algorithm for factoring integers inherently requires fanout operations in its quantum circuit implementation. The paper demonstrates that the modular exponentiation subroutine cannot be implemented efficiently without distributing a single qubit's state to multiple target qubits, imposing a fundamental circuit complexity constraint.

OutlookPlausible

Near-term quantum computers attempting small factoring demonstrations could benefit from new compilation techniques that optimize fanout, potentially reducing circuit depth and making experiments feasible on devices with limited qubit connectivity.

arXiv quant-ph

Quantum Noise Mitigation with Adaptive Zero-Noise Extrapolation: A Contextual Multi-Armed Bandits Approach

Researchers propose an adaptive zero-noise extrapolation method that uses a contextual multi-armed bandit algorithm to dynamically select noise scaling factors, potentially reducing the measurement overhead of error mitigation.

OutlookPlausible

This technique could be integrated into quantum computing SDKs to provide a default adaptive error mitigation strategy, improving the reliability of noisy intermediate-scale quantum devices without manual tuning.

UCLA-Led Consortium Secures $4 Million NSF Grant for 60 Logical Qubit Trapped-Ion Architecture

UCLA-led consortium including University of Oregon, NIST, and UMass Amherst secured a $4 million NSF grant to build a 60-logical qubit trapped-ion quantum computer within two years, leveraging optical resonator technology for high-fidelity entanglement.

OutlookPlausible

If the consortium successfully builds a 60 logical qubit trapped-ion system, it could enable practical demonstrations of error-corrected quantum algorithms that are currently out of reach, such as small-scale molecular simulations or optimization problems with coherent error suppression.

trapped ionalgorithms softwareerror correctionNISTUCLAUniversity of Massachusetts AmherstUniversity of Oregon
Quantum Zeitgeist

QC Ware calculates enzyme energy with hybrid quantum-classical method

QC Ware has demonstrated a hybrid quantum-classical algorithm to calculate the energy of an enzyme, a key step in drug design. The method splits the workload between classical computers and quantum processors to tackle a problem intractable for classical methods alone.

OutlookPlausible

Pharmaceutical companies could begin using QC Ware's hybrid method to screen enzyme-inhibitor candidates on near-term quantum hardware, potentially finding leads faster than classical simulations.

arXiv quant-ph

Error-Mitigated Hamiltonian Simulation: Complexity Analysis and Optimization for Near-Term and Early-Fault-Tolerant Quantum Computers

A preprint on arXiv presents a complexity analysis and optimization framework for Hamiltonian simulation using error mitigation on near-term and early fault-tolerant quantum computers.

OutlookPlausible

The analysis could guide experimental groups in choosing optimal error mitigation strategies, bringing practical Hamiltonian simulation closer to reality within current hardware constraints.

arXiv quant-ph

Convergence and efficiency proof of quantum imaginary time evolution for bounded order systems

Researchers have published a preprint proving convergence and efficiency bounds for quantum imaginary time evolution (QITE) when applied to bounded-order systems, meaning Hamiltonians with interactions limited to a fixed number of qubits. The proof establishes conditions under which QITE can prepare ground states with guaranteed polynomial resource scaling. This theoretical work tightens the understanding of which problems QITE can efficiently solve.

OutlookPlausible

This proof could make QITE a more attractive candidate for practical ground-state preparation on near-term quantum processors, by giving practitioners clear guidelines on when the algorithm will succeed within acceptable runtimes.

arXiv quant-ph

Entangling power of neural networks

A preprint posted to arXiv examines the entangling power of neural networks, focusing on quantum neural network architectures and their capacity to generate entanglement during computation.

OutlookPlausible

This could lead to design principles for quantum neural networks that optimally balance entanglement to enhance trainability and performance.

arXiv quant-ph

Exponential logical-error reduction in quantum memories via optimal syndrome-measurement timing

A new theoretical result demonstrates that optimally timing syndrome measurements in quantum error correction can yield an exponential reduction in logical error rates. The work provides a framework for scheduling measurements to maximize error suppression.

OutlookPlausible

If this optimal timing strategy can be implemented in existing error correction codes, it could reduce logical error rates exponentially, enabling longer coherence times for logical qubits.

arXiv quant-ph

How Much Reconstruction Does Quantum Machine Learning Need? Late Fusion of Independently Trained Quantum Subcircuits

A study proposes training quantum subcircuits independently and then combining them via classical late fusion, potentially reducing circuit depth and training complexity for quantum machine learning models.

OutlookPlausible

If independent training preserves sufficient information, this could enable QML models to be trained on larger problems using current noisy devices, by decomposing the workload into shallow, independently optimized circuits.

arXiv quant-ph

Interferometric Quantum Polynomial Chaos Expansion as a Generative Model for Calorimeter Shower Simulation

Researchers propose an interferometric quantum algorithm that implements polynomial chaos expansion, framing it as a generative model for simulating calorimeter showers in particle physics. The method encodes uncertainty through quantum interference and could be executed on photonic quantum processors.

OutlookPlausible

This could enable near-term photonic quantum processors to serve as efficient generative models for particle physics simulations, providing faster and more accurate data generation for experiments like those at CERN.

arXiv quant-ph

Quantum Error Mitigation with Diffusion-Like Models

Researchers have introduced a quantum error mitigation technique based on diffusion-like generative models. The approach leverages iterative denoising processes, similar to those used in image generation, to suppress errors in quantum circuit outputs. The preprint was posted on arXiv on August 7, 2026.

OutlookPlausible

The diffusion-based error mitigation technique could be integrated into existing quantum computing stacks, improving the accuracy of near-term quantum devices within two years.

arXiv quant-ph

Machine learning for sample-based quantum diagonalization: generative configuration recovery and the classical-simulability frontier

A research paper posted on arXiv proposes using generative machine learning models to enhance sample-based quantum diagonalization by recovering configurations from samples, extending the classical simulability of quantum systems.

OutlookPlausible

This method could enable classical simulation of larger quantum systems than previously possible, aiding in the verification and design of near-term quantum devices.

arXiv quant-ph

One Qubit Can Beat One Bit: Quantum Advantage for Post-Training Quantization

A new arXiv preprint demonstrates that a quantum algorithm requiring only a single qubit can outperform the best known classical algorithm for post-training quantization of neural networks, achieving a provable advantage in terms of accuracy or efficiency.

OutlookPlausible

The algorithm is implemented on existing noisy quantum processors and integrated into cloud-based ML pipelines, enabling AI developers to offload quantization jobs for a measurable improvement in compression quality over purely classical methods within two years.

algorithms softwareIBMIonQRigetti ComputingXanadu
arXiv quant-ph

Quantum Error Management in Practice: A Cross-Stack Benchmark

A cross-stack benchmarking study of quantum error management techniques, spanning both error mitigation and error correction, has been released on arXiv. The work evaluates performance across different backends and abstraction layers, providing a standardized comparison framework.

OutlookPlausible

This could enable near-term quantum computing practitioners to select optimal error management strategies tailored to their specific hardware and application constraints, improving achievable circuit quality within two years.

arXiv quant-ph

A versatile neural-network toolbox for testing Bell locality in networks

Researchers introduced a neural-network toolbox designed to test Bell locality in quantum networks. The approach uses machine learning to efficiently determine whether observed correlations in a network can be explained by local hidden-variable models. This provides a versatile computational tool for foundational tests and network certification.

OutlookPlausible

This neural toolbox could enable real-time certification of network nonlocality in experimental quantum networks, accelerating deployment of secure quantum communication protocols.