Pith. sign in

REVIEW 1 cited by

On Universal and Fault-Tolerant Quantum Computing

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/9906054 v1 pith:QM6N4EBM submitted 1999-06-16 quant-ph

On Universal and Fault-Tolerant Quantum Computing

classification quant-ph
keywords basisuniversalfault-tolerantgatesquantumcomputationcontrolled-notgate
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

A novel universal and fault-tolerant basis (set of gates) for quantum computation is described. Such a set is necessary to perform quantum computation in a realistic noisy environment. The new basis consists of two single-qubit gates (Hadamard and ${\sigma_z}^{1/4}$), and one double-qubit gate (Controlled-NOT). Since the set consisting of Controlled-NOT and Hadamard gates is not universal, the new basis achieves universality by including only one additional elementary (in the sense that it does not include angles that are irrational multiples of $\pi$) single-qubit gate, and hence, is potentially the simplest universal basis that one can construct. We also provide an alternative proof of universality for the only other known class of universal and fault-tolerant basis proposed by Shor and by Kitaev.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Universal Weakly Fault-Tolerant Quantum Computation via Code Switching in the [[8,3,2]] Code

    quant-ph 2026-03 unverdicted novelty 7.0

    A code-switching protocol in the [[8,3,2]] code yields a universal scheme for postselected fault-tolerant quantum computation with quadratic logical error suppression.