collaborators

5 papers

quant-ph2026

Remote entanglement need not be the bottleneck for modular trapped-ion quantum computing

Felix W. Knollmann, David P. Nadlinger, John Blue +7

Modularity underpins classical computing; as quantum processors encounter limits on fabrication yield, reliability, and size, they will also need it acutely. The bottleneck to link…

quant-ph2026

Machine Learning Decoding of Circuit-Level Noise for Bivariate Bicycle Codes

John Blue, Harshil Avlani, Zhiyang He +2

Fault-tolerant quantum computers will depend crucially on the performance of the classical decoding algorithm which takes in the results of measurements and outputs corrections to…

quant-ph2026

Generalized Bicycle Codes as Cyclic Submodules and their Automorphism Structure

AJ Davenport, John Blue, Isaac Chuang

Automorphisms of quantum codes, when they exist, offer a pathway toward fault-tolerant gate implementation via qubit relabeling. Although useful, the conditions under which automor…

quant-ph2026

Full Extractors for Logical Processing in Hypergraph Product Codes

John Blue, Zhiyang He, Hengyun Zhou +1

Quantum low-density parity-check (QLDPC) codes are promising candidates for practical low-overhead quantum memories. For large-scale fault-tolerant quantum computation, we further…

quant-ph2025

A log-depth in-place quantum Fourier transform that rarely needs ancillas

Gregory D. Kahanamoku-Meyer, John Blue, Thiago Bergamaschi +2

When designing quantum circuits for a given unitary, it can be much cheaper to achieve a good approximation on most inputs than on all inputs. In this work we formalize this idea,…