Linear-Depth Quantum Circuits for n-qubit Toffoli gates with no Ancilla

Abstract

We design a circuit structure with linear depth to implement an $n$-qubit Toffoli gate. The proposed construction uses a quadratic-size circuit consists of elementary 2-qubit controlled-rotation gates around the x axis and uses no ancilla qubit. Circuit depth remains linear in quantum technologies with finite-distance interactions between qubits. The suggested construction is related to the long-standing construction by Barenco et al. (Phys. Rev. A, 52: 3457-3467, 1995, arXiv:quant-ph/9503016), which uses a quadratic-size, quadratic-depth quantum circuit for an $n$-qubit Toffoli gate.

5 pages, 7 figures

References in corpus (10)

• Synthesis of Quantum Logic Circuits
• Implementation of a Toffoli Gate with Superconducting Circuits
• Realization of the quantum Toffoli gate with trapped ions
• Synthesis and Optimization of Reversible Circuits - A Survey
• Efficient Toffoli Gates Using Qudits
• Quantum Circuit Simplification and Level Compaction
• Process tomography of ion trap quantum gates
• Fast Quantum Modular Exponentiation
• Quantum-control approach to realizing a Toffoli gate in circuit QED
• Faster Quantum Number Factoring via Circuit Synthesis

Cited by in corpus (32)

• Fixed-point quantum search with an optimal number of queries
• Quantum Inference on Bayesian Networks
• Resilience of quantum random access memory to generic noise
• Distributed Quantum Computing and Network Control for Accelerated VQE
• Error mitigation for variational quantum algorithms through mid-circuit measurements
• Deterministic Grover search with a restricted oracle
• Linear-depth quantum circuits for multiqubit controlled gates
• Random circuit block-encoded matrix and a proposal of quantum LINPACK benchmark
• Qudits for decomposing multiqubit gates and realizing quantum algorithms
• New techniques for fault-tolerant decomposition of Multi-Controlled Toffoli gate
• Efficient and scalable quantum walk algorithms via the quantum Fourier transform
• Representation of binary classification trees with binary features by quantum circuits
• Numerical analysis of quantum circuits for state preparation and unitary operator synthesis
• Polylogarithmic-depth controlled-NOT gates without ancilla qubits
• Novel Technique for Robust Optimal Algorithmic Cooling
• Efficient implementation of discrete-time quantum walks on quantum computers
• Non-Markovian Dynamics of a Single Excitation within Many-Body Dissipative Systems
• Finding solutions to the integer case constraint satisfiability problem using Grover's algorithm
• Jet Discrimination with Quantum Complete Graph Neural Network
• Hybrid quantum computing with ancillas
• Breaking the limits of purification: Postselection enhances heat-bath algorithmic cooling
• Problem-Size Independent Angles for a Grover-Driven Quantum Approximate Optimization Algorithm
• Prog-QAOA: Framework for resource-efficient quantum optimization through classical programs
• Reduction of circuit depth by mapping qubit-based quantum gates to a qudit basis
• Quantum State Preparation Using an Exact CNOT Synthesis Formulation
• Fault-tolerance in qudit circuit design
• Block encoding of matrix product operators
• Linear decomposition of approximate multi-controlled single qubit gates
• Scalability and high-efficiency of an $(n+1)$-qubit Toffoli gate sphere via blockaded Rydberg atoms
• Phases and phase transition in Grover's algorithm with systematic noise
• Single-Qudit Quantum Neural Networks for Multiclass Classification
• Quantum algorithm for collisionless Boltzmann simulation of self-gravitating systems