activity
20202026
most citedParallel Machine Learning for Forecasting the Dynamics of Complex Networks

56 citations · 67 across the 9 of their papers we have counts for

collaborators
Showing quant-phShow all

7 papers · 1 filter

quant-ph2026

Fault-Tolerant Quantum Computing with Trapped Ions: The Walking Cat Architecture

Felix Tripier, Woo Chang Chung, Jacob Young +15

We propose a fault-tolerant quantum computer architecture for trapped-ion devices, which we call the walking cat architecture. Our blueprint includes a compiler, a detailed descrip…

quant-ph2025

Correction of chain losses in trapped ion quantum computers

Nolan J. Coble, Min Ye, Nicolas Delfosse

Neutral atom quantum computers and to a lesser extent trapped ions may suffer from atom loss. In this work, we investigate the impact of atom loss in long chains of trapped ions. E…

quant-ph2024★ 5 cited

Geometric structure and transversal logic of quantum Reed-Muller codes

Alexander Barg, Nolan J. Coble, Dominik Hangleiter +1

Designing efficient and noise-tolerant quantum computation protocols generally begins with an understanding of quantum error-correcting codes and their native logical operations. T…

quant-ph2023★ 2 cited

Hamiltonians whose low-energy states require T gates

Nolan J. Coble, Matthew Coudron, Jon Nelson +1

The recent resolution of the NLTS Conjecture [ABN22] establishes a prerequisite to the Quantum PCP (QPCP) Conjecture through a novel use of newly-constructed QLDPC codes [LZ22]. Ev…

quant-ph2023★ 2 cited

Local Hamiltonians with no low-energy stabilizer states

Nolan J. Coble, Matthew Coudron, Jon Nelson +1

The recently-defined No Low-energy Sampleable States (NLSS) conjecture of Gharibian and Le Gall [GL22] posits the existence of a family of local Hamiltonians where all states of lo…

quant-ph2021★ 1 cited

On nonlinear transformations in quantum computation

Zoë Holmes, Nolan Coble, Andrew T. Sornborger +1

While quantum computers are naturally well-suited to implementing linear operations, it is less clear how to implement nonlinear operations on quantum computers. However, nonlinear…

quant-ph2020★ 1 cited

Quasi-polynomial time approximation of output probabilities of geometrically-local, shallow quantum circuits

Nolan J. Coble, Matthew Coudron

We present a classical algorithm that, for any 3D geometrically-local, polylogarithmic-depth quantum circuit acting on qubits, and any bit string , can compu…