New techniques for fault-tolerant decomposition of Multi-Controlled Toffoli gate

Abstract

Physical implementation of scalable quantum architectures faces an immense challenge in form of fragile quantum states. To overcome it, quantum architectures with fault tolerance is desirable. This is achieved currently by using surface code along with a transversal gate set. This dictates the need for decomposition of universal Multi Control Toffoli~(MCT) gates using a transversal gate set. Additionally, the transversal non-Clifford phase gate incurs high latency which makes it an important factor to consider during decomposition.Besides, the decomposition of large Multi-control Toffoli~(MCT) gate without ancilla presents an additional hurdle. In this manuscript, we address both of these issues by introducing Clifford+$Z_N$ gate library. We present an ancilla free decomposition of MCT gates with linear phase depth and quadratic phase count. Furthermore, we provide a technique for decomposition of MCT gates in unit phase depth using the Clifford+$Z_N$ library, albeit at the cost of ancillary lines and quadratic phase count.

arXiv comment9 pages, 11 figures

References in corpus (19)

• Quantum Mechanics helps in searching for a needle in a haystack
• Elementary gates for quantum computation
• Quantum Computing
• Surface codes: Towards practical large-scale quantum computation
• Quantum Copying: Beyond the No-Cloning Theorem
• Stabilizer Codes and Quantum Error Correction
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• High threshold universal quantum computation on the surface code
• Restrictions on Transversal Encoded Quantum Gate Sets
• Quantum advantage with shallow circuits
• The Ion Trap Quantum Information Processor
• Universal fault-tolerant quantum computation with only transversal gates and error correction
• Simulating chemistry efficiently on fault-tolerant quantum computers
• Improved Quantum Cost for n-bit Toffoli Gates
• Universal transversal gates with color codes - a simplified approach
• Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla
• On quantum circuits employing roots of the Pauli matrices
• Complex instruction set computing architecture for performing accurate quantum $Z$ rotations with less magic
• Resource comparison of two surface code implementations of small angle Z rotations

Cited by in corpus (7)

• Representation of binary classification trees with binary features by quantum circuits
• Finding solutions to the integer case constraint satisfiability problem using Grover's algorithm
• Quantum Computation of Eigenvalues within Target Intervals
• Scalability and high-efficiency of an $(n+1)$-qubit Toffoli gate sphere via blockaded Rydberg atoms
• Classification and transformations of quantum circuit decompositions for permutation operations
• Clifford operators in SU(N)1; N not odd prime
• Hypergraph States in SU(N)1, N odd prime, Chern-Simons Theory