2021
DOI: 10.1063/5.0071569
|View full text |Cite
|
Sign up to set email alerts
|

Nonadiabatic geometric quantum computation with shortened path on superconducting circuits

Abstract: Recently, nonadiabatic geometric quantum computation has received much attention due to its fast manipulation and intrinsic error-resilience characteristics. However, to obtain universal geometric quantum control, only limited and special evolution paths have been proposed, which usually require longer gate-time and more operational steps, and thus lead to lower quality of the implemented quantum gates. Here, we present an effective scheme to find the shortest geometric path under conventional conditions of ge… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2021
2021
2023
2023

Publication Types

Select...
6
3

Relationship

2
7

Authors

Journals

citations
Cited by 13 publications
(4 citation statements)
references
References 45 publications
0
4
0
Order By: Relevance
“…In the following, we take the ratios of η = 0, 1, 2, 3 as examples to test their robustness against the control errors, i.e., the qubit-frequency drift δ and the deviation of the driving amplitude, and compare their performance with the OSSP scheme and pure dynamical case. The detailed steps of constructing the quantum OSSP and dynamical gate are in Appendices B and C. The Hamiltonian affected by these controlled errors is written as [33,35]…”
Section: ϕ(T)|ρ|ϕ(t) Dθmentioning
confidence: 99%
“…In the following, we take the ratios of η = 0, 1, 2, 3 as examples to test their robustness against the control errors, i.e., the qubit-frequency drift δ and the deviation of the driving amplitude, and compare their performance with the OSSP scheme and pure dynamical case. The detailed steps of constructing the quantum OSSP and dynamical gate are in Appendices B and C. The Hamiltonian affected by these controlled errors is written as [33,35]…”
Section: ϕ(T)|ρ|ϕ(t) Dθmentioning
confidence: 99%
“…Traditional NHQC schemes usually require exactly the same length of evolution path for any angles of rotation, sometimes it is called orange-slice-shaped NHQC (OSS-NHQC) [27][28][29][30][31][32][33]. A systematic approach to minimize the length has been proposed for two-level system [35,36] and three-level system [37,38]. In this work, we minimized the path of a single qubit gate for a three-level system with Λ configuration in the framework of NHQC.…”
Section: Introductionmentioning
confidence: 99%
“…Recently, many different NGQC protocols have been developed [13][14][15][16][17][18][19]; however, after experimental verification in var-ious quantum systems [20][21][22][23][24][25], it turns out that the advantages of geometric phase are compromised by local noises and the limitations of the protocol. To find better implementations, the orange-slice-shaped scheme [16][17][18][19] is proposed with simplified pulses, and the time and path optimal control techniques [26][27][28][29][30][31] are proposed to shorten the gate time and thus reducing the decoherence induced error. Meanwhile, when the Z error is the main error source, the dynamical decoupling method can be introduced [32][33][34].…”
Section: Introductionmentioning
confidence: 99%