2016
DOI: 10.1103/physreva.94.052317
|View full text |Cite
|
Sign up to set email alerts
|

Block-ZXZsynthesis of an arbitrary quantum circuit

Abstract: Given an arbitrary 2 w × 2 w unitary matrix U , a powerful matrix decomposition can be applied, leading to four different syntheses of a w-qubit quantum circuit performing the unitary transformation. The demonstration is based on a recent theorem by H. Führ and Z. Rzeszotnik [Linear Algebra Its Appl. 484, 86 (2015)] generalizing the scaling of single-bit unitary gates (w = 1) to gates with arbitrary value of w. The synthesized circuit consists of controlled one-qubit gates, such as NEGATOR gates and PHASOR gat… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
22
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 27 publications
(22 citation statements)
references
References 24 publications
0
22
0
Order By: Relevance
“…Moreover, our transformation is exact and can be found constructively. In contrast to [9], our transformation consists only of negator gates. The main difference is that transformation needs one-qubit ancilla.…”
Section: Discussionmentioning
confidence: 99%
See 2 more Smart Citations
“…Moreover, our transformation is exact and can be found constructively. In contrast to [9], our transformation consists only of negator gates. The main difference is that transformation needs one-qubit ancilla.…”
Section: Discussionmentioning
confidence: 99%
“…Matrix in the middle is a block-negator matrix (which is also a negator matrix), while left and right matrices are block diagonal matrices. In [9] an algorithm of finding such decomposition was presented. Group XU(2 n ) is isomorphic to U(2 n −1) and can be generated by single-qubit negator and controlled-√ NOT gates [10].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…-Thanks to the groups bXU(n) and bZU(n), we have two decompositions: the primal bZbXbZ decomposition [6] and the dual bXbZbX decomposition [7]…”
Section: We Indeed Havementioning
confidence: 99%
“…One can cite as example the QR method, via Givens rotations [16]. Other decomposition methods have also been proposed, for example the recent block-ZXZ decomposition [4], or the quantum Shannon decomposition [13] that relies on the use of the sine cosine decomposition of a unitary operator U ∈ U(2 n ):…”
Section: Introductionmentioning
confidence: 99%