Decomposition of quantum gates
classification
🪐 quant-ph
keywords
gatesqubitdecompositionnumberpresentedrecurrenceschemesingle
read the original abstract
A recurrence scheme is presented to decompose an $n$-qubit unitary gate to the product of no more than $N(N-1)/2$ single qubit gates with small number of controls, where $N = 2^n$. Detailed description of the recurrence steps and formulas for the number of $k$-controlled single qubit gates in the decomposition are given. Comparison of the result to a previous scheme is presented, and future research directions are discussed.
This paper has not been read by Pith yet.
Forward citations
Cited by 1 Pith paper
-
Simulating quantum chaos on a quantum computer
Hybrid simulation of the 2-qubit quantum kicked top on IBMQ shows periodic evolution and chaos signatures in time-averaged entanglement, with gate count independent of kick number.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.