works on

From the 1 of 10 linked papers with an AI index.

activity
20242026
collaborators

10 papers

quant-ph2026

Experimental demonstration of the Quantum Fourier Transform on up to 100 qubits using a convolutional compilation strategy

Paul Coote, Michael J. Biercuk, Yuval Baum

We present and experimentally validate the `Convolutional QFT': a constructive compilation strategy for the Quantum Fourier Transform (QFT) subroutine on a linear nearest neighbor…

quant-ph2026

Fast, accurate, high-resolution simulation of large-scale Fermi-Hubbard models on a digital quantum processor

Gavin S. Hartnett, Khadijeh Sona Najafi, Aleksei Khindanov +5

The paper demonstrates a digital quantum simulation of the one‑dimensional Fermi‑Hubbard model on a superconducting processor using up to 120 qubits, achieving high‑resolution dyna…

quant-ph2026

Driving Exchange Interaction in Spin Qubits with Quasi-Zero Pulses

Julian D. Teske, Remy L. Delva, Shobhan Kulshreshtha +6

The implementation of high-fidelity quantum gates for spin qubits requires accurate control of exchange interactions between electrons confined in quantum dots, but pulse distortio…

quant-ph2026

Heterogeneous architectures enable a 138x reduction in physical qubit requirements for fault-tolerant quantum computing under detailed accounting

Pranav S. Mundada, Aleksei Khindanov, Yulun Wang +5

Quantum computer hardware is predicted to scale over hundreds of thousands of qubits coming online in the next decade. Despite significant theoretical and experimental QEC progress…

quant-ph2026

Automated discovery of heralded ballistic graph state generators for fusion-based photonic quantum computation

Gavin S. Hartnett, Dave Kielpinski, Smarak Maity +3

Designing photonic circuits that prepare graph states with high fidelity and success probability is a central challenge in linear optical quantum computing. Existing approaches rel…

cs.DS2026

-Motif: Parallel Subgraph Isomorphism via Tabular Operations

Yulun Wang, Esteban Ginez, Jamie Friel +4

Subgraph isomorphism is a fundamental problem in graph analysis that seeks to find all instances of a pattern graph within a larger data graph while preserving structural relations…