47 citations · 74 across the 7 of their papers we have counts for
Showing 2023Show all
2 papers · 1 filter
quant-ph2023★ 6 cited
How to compute a 256-bit elliptic curve private key with only 50 million Toffoli gates
Daniel Litinski
We use Shor's algorithm for the computation of elliptic curve private keys as a case study for resource estimates in the silicon-photonics-inspired active-volume architecture. Here…
quant-ph2023
Unifying flavors of fault tolerance with the ZX calculus
Hector Bombin, Daniel Litinski, Naomi Nickerson +2
There are several models of quantum computation which exhibit shared fundamental fault-tolerance properties. This article makes commonalities explicit by presenting these different…