Examples

Here we show the construction of some compilable surface code computations.

CNOT block graphCNOT CZ with a spatial Hadamard block graphCZ with a spatial Hadamard CZ with a temporal Hadamard block graphCZ with a temporal Hadamard S gate block graphS gate T gate block graphT gate T gate with a prepared Y state block graphT gate with a prepared Y state T-state comparison block graphT-state comparison Phase-gradient sequence block graphPhase-gradient sequence Four-T AND block graphFour-T AND CCZ-injected AND block graphCCZ-injected AND CCZ-injected MAJ block graphCCZ-injected MAJ UMA block graphUMA Three-bit controlled adder block graphThree-bit controlled adder Ten-bit controlled adder block graphTen-bit controlled adder Toffoli from AND block graphToffoli from AND CCZ factory with TELS block graphCCZ factory with TELS CCZ factory without TELS block graphCCZ factory without TELS CCZ gate teleportation block graphCCZ gate teleportation Bell state block graphBell state GHZ state block graphGHZ state GHZ with slides and glides block graphGHZ with slides and glides GHZ with patch rotations block graphGHZ with patch rotations 1D yoked layout block graph1D yoked layout T–H–T–H sequence block graphT–H–T–H sequence Compressed three CNOTs block graphCompressed three CNOTs Steane encoding block graphSteane encoding X-basis memory block graphX-basis memory Y-basis memory block graphY-basis memory Rotation through movement block graphRotation through movement Stability experiment block graphStability experiment