Decomposition of unitary matrix into quantum gates
Dmytro Fedoriaka
TL;DR
The paper presents an algorithm to decompose any unitary matrix into a sequence of quantum gates, enabling implementation in Q# and analyzing the complexity and optimizations of the process.
Contribution
It introduces a novel algorithm for decomposing arbitrary unitary matrices into a specific set of quantum gates, with practical implementation and complexity analysis.
Findings
Algorithm successfully decomposes unitary matrices into X, R_y, R_z, and R_1 gates.
Q# implementation demonstrates practical applicability.
Complexity analysis provides insights into efficiency and optimization potential.
Abstract
An algorithm is proposed to convert arbitrary unitary matrix to a sequence of gates and fully controlled and gates. This algorithm is used to generate Q# implementation for arbitrary unitary matrix. Some optimizations are considered and complexity of the result is analyzed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture