398 citations · 1k across the 17 of their papers we have counts for
17 papers
Blocklet concatenation: Low-overhead fault-tolerant protocols for fusion-based quantum computation
Daniel Litinski
We introduce a construction for protocols for fault-tolerant quantum computing based on code concatenation and transversal gates. These protocols can be interpreted as families of…
Comparison of schemes for highly loss tolerant photonic fusion based quantum computing
Sara Bartolucci, Tom Bell, Hector Bombin +18
We summarize the performance of recently-proposed methods for achieving fault tolerant fusions-based quantum computation with high tolerance to qubit loss, specifically aimed at ph…
Quantum schoolbook multiplication with fewer Toffoli gates
Daniel Litinski
This paper presents a method for constructing quantum circuits for schoolbook multiplication using controlled add-subtract circuits, asymptotically halving the Toffoli count compar…
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…
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…
Active volume: An architecture for efficient fault-tolerant quantum computers with limited non-local connections
Daniel Litinski, Naomi Nickerson
In existing general-purpose architectures for surface-code-based fault-tolerant quantum computers, the cost of a quantum computation is determined by the circuit volume, i.e., the…