Skip to content

Category

quantum computing

603 papers

#artificial intelligence Preprint Aug 2026

Bernstein-Vazirani Networks: Quantum Machine Learning by Interference

We introduce Bernstein-Vazirani Networks (BVNs), a non-variational quantum machine learning framework that leverages quantum interference for supervised learning, demonstrated on vision and representation learning tasks. In their standard form, BVNs follow the principle of quantum Fourier sampling: labelled data are pl...

N. Meli, Tolga Birdal, Prayag Tiwari et al. · 0 citations
#artificial intelligence Preprint Aug 2026

AlphaClifford: Efficient Clifford Synthesis and Transpilation with Model-based RL

AlphaClifford is introduced, a model-based Reinforcement Learning framework designed to efficiently synthesize Clifford circuits from the fundamental gate set composed of H, S, and CNOT, demonstrating the broad applicability of the framework on two additional tasks: hardware-constrained Clifford transpilation, where it...

Daniele Lizzio Bosco, Jacopo Cossio, Carla Piazza et al. · 0 citations
#artificial intelligence Preprint Aug 2026

How Quantum Is the Advantage? A Fair, Calibration- and Noise-Aware Benchmark and Attribution Audit of Quantum Machine Learning for Network Intrusion Detection

A quantum-attribution audit is introduced that quantifies how much of any gain is genuinely attributable to the quantum component of quantum models, and attributes this to classical preprocessing and regularisation rather than quantum effects.

Syeda Anshrah Gillani, Mirza Samad Ahmed Baig, Shahid Munir Shah et al. · 1 citation

From tech blogs

See all →
MIT News · Artificial Intelligence Oct 28, 2026

Making machines that can listen

Professor Paris Smaragdis develops computers with superhuman hearing for applications like speech recognition, music understanding, and environmental monitoring.

Microsoft Research Blog Oct 21, 2026

Solving a 31-year-old grand challenge in mathematics – the KLS conjecture

For decades, a fundamental question about the difficulty of computing in high-dimensional spaces has resisted proof. New research resolves this question, removing a major theoretical obstacle to understanding the efficiency of randomized algorithms used across science and computing. The Kannan–Lovász–Simonovits (KLS) conjecture was proposed in 1995. It asks whether, for a broad class of high-dimensional […] The post Solving a 31-year-old grand challenge in mathematics – the KLS conjecture appear…

MIT News · Artificial Intelligence Oct 15, 2026

AI model decodes the language cells use to communicate

A new computational approach reveals how cells communicate to assemble into tissues. This could accelerate stem cell engineering, improve disease models, and inform therapies.

Microsoft Research Blog Oct 15, 2026

Proof-based general-purpose computing with Magnetar

Zero-knowledge proofs can verify computing results without rerunning workloads or exposing sensitive data. Magnetar helps bring them into the mainstream with support for standard programming languages, major speed gains, and quantum-resistant security. The post Proof-based general-purpose computing with Magnetar appeared first on Microsoft Research.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.