2023
DOI: 10.1103/physrevapplied.19.034017
|View full text |Cite
|
Sign up to set email alerts
|

Optimal Quantum Dataset for Learning a Unitary Transformation

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
2
0

Year Published

2023
2023
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 41 publications
0
2
0
Order By: Relevance
“…Crucially when is learned by a shallow quantum circuit with depth , this part can be approximately simulated with quantum gates. 29 , 68 The depth of Algorithms 3 and 4 are and independent on the system size. Table 1 compares circuit gate complexity of Algorithms 2 , 3 , and 4 .…”
Section: Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Crucially when is learned by a shallow quantum circuit with depth , this part can be approximately simulated with quantum gates. 29 , 68 The depth of Algorithms 3 and 4 are and independent on the system size. Table 1 compares circuit gate complexity of Algorithms 2 , 3 , and 4 .…”
Section: Resultsmentioning
confidence: 99%
“…Notice that we follow the Algorithm 3 but exact implement the block-diagonal unitary in Example 2, because the rightness of compiling approaches have been verified in works. 29 , 68 …”
Section: Resultsmentioning
confidence: 99%