Decomposition of unitary matrices and quantum gates

DOI10.1142/S0219749913500159MaRDI QIDQ5300693zbMATH OpenOpenAlexFDO

Authors Chi-Kwong Li, Rebecca Roberts, Xiaoyan Yin

Publication date 27 June 2013

Published in International Journal of Quantum Information (Search for Journal in Brave)

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

zbMATH Keywords

quantum gatesunitary matricesgray codescontrolled qubit gatestwo-level unitary matrices

Mathematics Subject Classification ID

Philosophical and critical aspects of logic and foundations (03A05) Quantum computation (81P68)

Abstract: A general scheme is presented to decompose a $d$-by-$d$ unitary matrix as the product of two-level unitary matrices with additional structure and prescribed determinants. In particular, the decomposition can be done by using two-level matrices in $d-1$ classes, where each class is isomorphic to the group of $2imes2$ unitary matrices. The proposed scheme is easy to apply, and useful in treating problems with the additional structural restrictions. A Matlab program is written to implement the scheme, and the result is used to deduce the fact that every quantum gate acting on $n$-qubit registers can be expressed as no more than $2^{n-1}(2^n-1)$ fully controlled single-qubit gates chosen from $2^n-1$ classes, where the quantum gates in each class share the same $n-1$ control qubits. Moreover, it is shown that it is easy to adjust the proposed decomposition scheme to take advantage of additional structure evolving in the process.

Recommendations

• Decomposition of quantum gates
• scientific article
• Constructive quantum scaling of unitary matrices
• scientific article
• The decomposition of an arbitrary \(2^w \times 2^w\) unitary matrix into signed permutation matrices

Cites work

• scientific article; zbMATH DE number 3892457 (Why is no real title available?)
• A Survey of Combinatorial Gray Codes
• Fast transforms: banded matrices with banded inverses
• G-matrices
• Matrix Analysis
• Quantum Computing
• Universality in quantum computation

Cited in

(18)

• On the zero entries in a unitary matrix
• Discrete-time quantum walk on circular graph: simulations and effect of gate depth and errors
• The decomposition of \(U(n)\) into \(XU(n)\) and \(ZU(n)\)
• Zero entries distribution in a unitary matrix
• An analytical decomposition protocol for optimal implementation of two-qubit entangling gates
• A general framework for recursive decompositions of unitary quantum evolutions
• scientific article; zbMATH DE number 6096663 (Why is no real title available?)
• scientific article; zbMATH DE number 5608701 (Why is no real title available?)
• Entanglement quantification from collective measurements processed by machine learning
• scientific article; zbMATH DE number 5984378 (Why is no real title available?)
• Decomposition of quantum gates
• Decompositions of n-qubit Toffoli gates with linear circuit complexity
• Quantum digital-to-analog conversion algorithm using decoherence
• A matrix representation of quantum circuits over non-adjacent qudits
• Quantum Mechanical Image of Matrices' LDU Decomposition
• Circuit implementation of discrete-time quantum walks via the shunt decomposition method
• Unitary coined discrete-time quantum walks on directed multigraphs
• Constructive quantum scaling of unitary matrices

Describes a project that uses

Uses Software

• Matlab

This page was built for publication: Decomposition of unitary matrices and quantum gates

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