2 citations · 5 across the 11 of their papers we have counts for
5 papers · 1 filter
Computing 256-bit elliptic curve discrete logarithms in 26 days on a fault-tolerant trapped-ion quantum computer with 20,000 qubits
Thomas Häner, Felix Tripier, Jacob Young +11
One of the strengths of our recently proposed Walking Cat Architecture for a trapped-ion quantum computer is that it is straightforward to extend and optimize for a specific applic…
Fast logical operations in quantum LDPC codes using simple resource states
Mark Webster, Nicolas Delfosse
Quantum LPDC codes provide a substantial reduction in qubit overhead required for fault-tolerant quantum computation compared to surface code, thanks to their high encoding rate. H…
Efficiently simulable quantum circuits with large entanglement, magic, and non-Gaussianity via code-compiled tensor networks
Aydin Deger, Stergios Koutsioumpas, Mark Webster +3
We introduce a family of quantum circuits that possess standard indicators of classical simulation hardness including high entanglement entropy, magic, and non-Gaussianity, yet adm…
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…
Distance-Finding Algorithms for Quantum Codes and Circuits
Mark Webster, Abraham Jacob, Oscar Higgott
The distance of a classical or quantum code is a key figure of merit which reflects its capacity to detect errors. Quantum LDPC code families have considerable promise in reducing…