Fig. 1: Example universal gate sets for four computational models. | Nature

Fig. 1: Example universal gate sets for four computational models.

From: Universal logic with encoded spin qubits in silicon

Fig. 1

Top left, digital Boolean logic is universal with NOT and AND. Top right, single-spin-based quantum, with rotations about vector v, Rv(θ) and CNOT. Bottom left, all Boolean logic may be performed reversibly within a subsystem using the Fredkin gate. Likewise, bottom right, all quantum logic may be performed within a subsystem using partial swaps.

Back to article page