A linear-time CCZ gate can be implemented on a looped pipeline 2D architecture, but resource estimates show it is currently about two times slower and larger than magic state distillation.
The full CCZ requires the codes on the left and right to switch places, so each code needs to travel (2 dccz − 1) + 1 = 2dccz data qubit loops to the left or right
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
quant-ph 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Fault-tolerant Quantum Computation without Distillation on a 2D Device
A linear-time CCZ gate can be implemented on a looped pipeline 2D architecture, but resource estimates show it is currently about two times slower and larger than magic state distillation.