Decompositions of general quantum gates

TL;DR

This paper reviews various methods for decomposing general quantum gates, highlighting improvements in gate counts and addressing physical constraints like nearest-neighbor interactions in quantum computing.

Contribution

It provides a comprehensive review of quantum gate decompositions and offers a slight improvement in the known gate count for controlled NOT gates.

Findings

Improved gate count for CNOT gates to (23/48)4^n

Analysis of decompositions with nearest-neighbor interaction constraints

Comparison of different decomposition techniques

Abstract

Quantum algorithms may be described by sequences of unitary transformations called quantum gates and measurements applied to the quantum register of n quantum bits, qubits. A collection of quantum gates is called universal if it can be used to construct any n-qubit gate. In 1995, the universality of the set of one-qubit gates and controlled NOT gate was shown by Barenco et al. using QR decomposition of unitary matrices. Almost ten years later the decomposition was improved to include essentially fewer elementary gates. In addition, the cosine-sine matrix decomposition was applied to efficiently implement decompositions of general quantum gates. In this chapter, we review the different types of general gate decompositions and slightly improve the best known gate count for the controlled NOT gates to (23/48)4^n in the leading order. In physical realizations, the interaction strength between the qubits can decrease strongly as a function of their distance. Therefore, we also discuss decompositions with the restriction to nearest-neighbor interactions in a linear chain of qubits.