A graph neural network path planner and phase-aware Gerchberg-Saxton algorithm enable defect-free assembly of 10,000-atom arrays in under 6 ms, faster than typical atom loss times.
Title resolution pending
5 Pith papers cite this work. Polarity classification is still indexing.
5
Pith papers citing it
years
2026 5representative citing papers
Sparse power-of-two circuit connectivity provides task-dependent advantages for variational quantum learning, and a Monna-map qubit reordering enables short-range circuits to solve long-range problems.
A modular atomic processor with 500,000 qubits factors 2048-bit RSA numbers in roughly the same time as a single large module when inter-module Bell-pair communication runs at 10^5 per second.
An STGNN dual-head decoder simultaneously corrects Pauli errors and identifies qubit-loss locations from syndrome histories, outperforming MWPM baselines on simulated surface-code memory.
A compilation scheme called Parity Twine achieved a 50-qubit unitary QFT with process fidelity ≈1e-2 on IBM Heron r3, and up to 52 qubits with plurality voting, surpassing prior unitary QFT demonstrations.
citing papers explorer
-
An Algorithm for Fast Assembling Large-Scale Defect-Free Atom Arrays
A graph neural network path planner and phase-aware Gerchberg-Saxton algorithm enable defect-free assembly of 10,000-atom arrays in under 6 ms, faster than typical atom loss times.
-
Variational Learning with Sparse Long-range Entangling Gates
Sparse power-of-two circuit connectivity provides task-dependent advantages for variational quantum learning, and a Monna-map qubit reordering enables short-range circuits to solve long-range problems.
-
Factoring $2048$ bit RSA integers with a half-million-qubit modular atomic processor
A modular atomic processor with 500,000 qubits factors 2048-bit RSA numbers in roughly the same time as a single large module when inter-module Bell-pair communication runs at 10^5 per second.
-
AI-Enabled Decoding of Qubit Loss for Quantum Error-Correcting Codes
An STGNN dual-head decoder simultaneously corrects Pauli errors and identifies qubit-loss locations from syndrome histories, outperforming MWPM baselines on simulated surface-code memory.
-
Demonstrating Record Fidelity for the Quantum Fourier Transform
A compilation scheme called Parity Twine achieved a 50-qubit unitary QFT with process fidelity ≈1e-2 on IBM Heron r3, and up to 52 qubits with plurality voting, surpassing prior unitary QFT demonstrations.