A T-depth two Toffoli gate for 2D square lattice architectures
arXiv:2311.12510 · doi:10.1145/3611315.3633270
Abstract
We present a novel Clifford+T decomposition of a Toffoli gate. Our decomposition requires no SWAP gates in order to be implemented on 2D square lattices of qubits. This decomposition enables shallower, more fault-tolerant quantum computations on both NISQ and error-corrected architectures. We present the derivation of the circuit, and illustrate the qubit mapping on a Sycamore-like architecture.
arXiv commentaccepted at 18th ACM International Symposium on Nanoscale Architectures
References in corpus (8)
- Elementary gates for quantum computation
- A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
- Quantum circuits of T-depth one
- Novel constructions for the fault-tolerant Toffoli gate
- On the advantages of using relative phase Toffolis with an application to multiple control Toffoli optimization
- Parallelising the Queries in Bucket Brigade Quantum RAM
- Orchestrated Trios: Compiling for Efficient Communication in Quantum Programs with 3-Qubit Gates
- Hardware-Conscious Optimization of the Quantum Toffoli Gate