Gidney, Craig

Factoring with n+2 clean qubits and n-1 dirty qubits

Gidney, C. (2017) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 28

Asymptotically Efficient Quantum Karatsuba Multiplication

Gidney, C. (2019) · arXiv

Quantum Computing Algorithms and ArchitectureCryptography and Residue Arithmetic

Cited by 18

Flexible layout of surface code computations using AutoCCZ states

Gidney, C., & Fowler, A. G. (2019) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 12

Windowed quantum arithmetic

Gidney, C. (2019) · arXiv

Quantum Computing Algorithms and ArchitectureCryptography and Residue Arithmetic

Cited by 11

Magic state cultivation: growing T states as cheap as CNOT gates

Gidney, C., Shutty, N., & Jones, C. (2024) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 9

How to factor 2048 bit RSA integers with less than a million noisy qubits

Gidney, C. (2025) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 7

New circuits and an open source decoder for the color code

Gidney, C., & Jones, C. (2023) · arXiv

Quantum Computing Algorithms and ArchitectureQuantum Information and Cryptography

Cited by 3

Approximate encoded permutations and piecewise quantum adders

Gidney, C. (2019) · arXiv

Quantum Computing Algorithms and ArchitectureCryptography and Residue Arithmetic

Cited by 3