pith. machine review for the scientific record. sign in

arxiv: cond-mat/9407022 · v1 · submitted 1994-07-05 · ❄️ cond-mat · hep-lat· quant-ph

Recognition: unknown

Two-Bit Gates are Universal for Quantum Computation

Authors on Pith no claims yet
classification ❄️ cond-mat hep-latquant-ph
keywords quantumgatestwo-bitcomputergearboxphasestatesthree-bit
0
0 comments X
read the original abstract

A proof is given, which relies on the commutator algebra of the unitary Lie groups, that quantum gates operating on just two bits at a time are sufficient to construct a general quantum circuit. The best previous result had shown the universality of three-bit gates, by analogy to the universality of the Toffoli three-bit gate of classical reversible computing. Two-bit quantum gates may be implemented by magnetic resonance operations applied to a pair of electronic or nuclear spins. A ``gearbox quantum computer'' proposed here, based on the principles of atomic force microscopy, would permit the operation of such two-bit gates in a physical system with very long phase breaking (i.e., quantum phase coherence) times. Simpler versions of the gearbox computer could be used to do experiments on Einstein-Podolsky-Rosen states and related entangled quantum states.

This paper has not been read by Pith yet.

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. Universality of Quantum Gates in Particle and Symmetry Constrained Subspaces

    quant-ph 2026-05 unverdicted novelty 6.0

    Hardware-efficient gates are universal for state preparation in particle-number and symmetry-constrained subspaces because commutators generate Pauli Z projectors that span the full so(w) and su(w) algebras.