Reducing the number of ancilla qubits and the gate count required for creating large controlled operations

DOI10.1007/S11128-014-0900-1MaRDI QIDQ2018210zbMATH OpenOpenAlexFDO

Authors Katherine L. Brown, Anmer Daskin, Sabre Kais, Jonathan P. Dowling

Publication date 13 April 2015

Published in Quantum Information Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1304.5548

zbMATH Keywords

quantum computinggate decompositionsmulti-qubit operationsresource reduction

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum measurement theory, state operations, state preparations (81P15)

Abstract: In this paper we show that it is possible to adapt a qudit scheme for creating a controlled-Toffoli created by Ralph et al. [Phys. Rev. A 75 011213] to be applicable to qubits. While this scheme requires more gates than standard schemes for creating large controlled gates, we show that with simple adaptations it is directly equivalent to the standard scheme in the literature. This scheme is the most gate-efficient way of creating large controlled unitaries currently known, however it is expensive in terms of the number of ancilla qubits used. We go on to show that using a combination of these standard techniques presented by Barenco et al. [Phys. Rev. A 52 3457 (1995)] we can create an n-qubit version of the Toffoli using less gates and the same number of ancilla qubits as recent work using computer optimization. This would be useful in any architecture of quantum computing where gates are cheap but qubit initialization is expensive.

Recommendations

• Decompositions of n-qubit Toffoli gates with linear circuit complexity
• Direct implementation of an \(N\)-qubit controlled-unitary gate in a single step
• Efficient circuits for exact-universal computation with qudits
• ANALYTIC ONE-BIT AND CNOT GATE CONSTRUCTIONS OF GENERAL n-QUBIT CONTROLLED GATES
• A general protocol for distributed quantum gates

Cites work

• scientific article; zbMATH DE number 1579275 (Why is no real title available?)
• scientific article; zbMATH DE number 5568624 (Why is no real title available?)
• Exponential algorithmic speedup by a quantum walk
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Quantum gates and circuits

Cited in

(1)

• Exploiting the benefits of clean ancilla based Toffoli gate decomposition across architectures

Describes a project that uses

Uses Software

• RevLib

This page was built for publication: Reducing the number of ancilla qubits and the gate count required for creating large controlled operations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2018210)