activity
20142025
most citedA Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery

398 citations · 1k across the 17 of their papers we have counts for

collaborators

17 papers

quant-ph2025

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…

quant-ph2025

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…

quant-ph2024

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…

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★ 41 cited

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…

quant-ph2022★ 13 cited

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…

quant-ph2021★ 8 cited

Interleaving: Modular architectures for fault-tolerant photonic quantum computing

Hector Bombin, Isaac H. Kim, Daniel Litinski +5

Useful fault-tolerant quantum computers require very large numbers of physical qubits. Quantum computers are often designed as arrays of static qubits executing gates and measureme…

quant-ph2019★ 214 cited

Magic State Distillation: Not as Costly as You Think

Daniel Litinski

Despite significant overhead reductions since its first proposal, magic state distillation is often considered to be a very costly procedure that dominates the resource cost of fau…

cond-mat.str-el2018★ 54 cited

Higher order topological superconductors as generators of quantum codes

Yizhi You, Daniel Litinski, Felix von Oppen

We show that interactions can drive a class of higher order topological superconductors (HOTSC) into symmetry enriched topologically ordered phases exemplified by topological quant…

quant-ph2018★ 398 cited

A Game of Surface Codes: Large-Scale Quantum Computing with Lattice Surgery

Daniel Litinski

Given a quantum gate circuit, how does one execute it in a fault-tolerant architecture with as little overhead as possible? In this paper, we discuss strategies for surface-code qu…

cond-mat.mes-hall2018★ 74 cited

Quantum Computing with Majorana Fermion Codes

Daniel Litinski, Felix von Oppen

We establish a unified framework for Majorana-based fault-tolerant quantum computation with Majorana surface codes and Majorana color codes. All logical Clifford gates are implemen…

quant-ph2017★ 86 cited

Lattice Surgery with a Twist: Simplifying Clifford Gates of Surface Codes

Daniel Litinski, Felix von Oppen

We present a planar surface-code-based scheme for fault-tolerant quantum computation which eliminates the time overhead of single-qubit Clifford gates, and implements long-range mu…

cond-mat.mes-hall2017★ 47 cited

Braiding by Majorana Tracking and Long-Range CNOT Gates with Color Codes

Daniel Litinski, Felix von Oppen

Color-code quantum computation seamlessly combines Majorana-based hardware with topological error correction. Specifically, as Clifford gates are transversal in two-dimensional col…

cond-mat.mes-hall2017★ 73 cited

Combining Topological Hardware and Topological Software: Color Code Quantum Computing with Topological Superconductor Networks

Daniel Litinski, Markus S. Kesselring, Jens Eisert +1

We present a scalable architecture for fault-tolerant topological quantum computation using networks of voltage-controlled Majorana Cooper pair boxes, and topological color codes f…

cond-mat.mes-hall2016★ 19 cited

The Interacting Mesoscopic Capacitor Out of Equilibrium

Daniel Litinski, Piet W. Brouwer, Michele Filippone

We consider the full nonequilibrium response of a mesoscopic capacitor in the large transparency limit, exactly solving a model with electron-electron interactions appropriate for…

physics.plasm-ph2014★ 1 cited

Analysis of linear and nonlinear conductivity of plasma-like systems on the basis of the Fokker-Planck equation

S. A. Trigger, W. Ebeling, G. J. F. van Heijst +1

The problems of high linear conductivity in an electric field, as well as nonlinear conductivity, are considered for plasma-like systems. First, we recall several observations of n…

cond-mat.other2014

Universality of phonon-roton spectrum in liquids and superfluidity of He II

V. B. Bobrov, S. A. Trigger, D. I. Litinski

Based on numerous experimental data on inelastic neutron and X-ray scattering in liquids, we assert that the phonon-roton spectrum of elementary excitations, predicted by Landau fo…