A practical quantum computer must not merely store information, but also process it. To
prevent errors introduced by noise from multiplying and spreading, a fault-tolerant …

We analyze the resource overhead of recently proposed methods for universal fault-tolerant
quantum computation using concatenated codes. Namely, we examine the concatenation of …

Magic states are key ingredients in schemes to realize universal fault-tolerant quantum
computation. Theories of magic states attempt to quantify this computational element via …

We derive a trade-off relation between accuracy of implementing a desired unitary evolution
using a restricted set of free unitaries and the size of the assisting system, in terms of the …

Concatenation of two quantum error-correcting codes with complementary sets of
transversal gates can provide a means toward universal fault-tolerant quantum computation …

Magic states are fundamental building blocks on the road to fault-tolerant quantum
computing. Calderbank-Shor-Steane (CSS) codes play a crucial role in the construction of …

A non-Clifford gate is required for universal quantum computation, and, typically, this is the
most error-prone and resource-intensive logical operation on an error-correcting code …

A quantum computer is a powerful machine that provides a new approach to information
processing based on quantum mechanics. However, basically, qubits are very vulnerable to …

As existing approaches to get around the restriction of the no-go theorem generally exhibit
high ancillary qubit overhead costs, we propose a scheme for universal fault-tolerant …

Code concatenation and conversion are two prominent methods to realize universal fault-
tolerant quantum computation without the need for magic state distillation. In this paper, we …