2017
DOI: 10.1088/1751-8121/aa7591
|View full text |Cite
|
Sign up to set email alerts
|

Efficient computation of theW3topological invariant and application to Floquet–Bloch systems

Abstract: We introduce an efficient algorithm for the computation of the W 3 invariant of general unitary maps, which converges rapidly even on coarse discretization grids. The algorithm does not require extensive manipulation of the unitary maps, identification of the precise positions of degeneracy points, or fixing the gauge of eigenvectors. After construction of the general algorithm, we explain its application to the 2 + 1 dimensional maps that arise in the Floquet-Bloch theory of periodically driven two-dimensiona… Show more

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
29
0

Year Published

2018
2018
2020
2020

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 14 publications
(29 citation statements)
references
References 39 publications
0
29
0
Order By: Relevance
“…Particularly efficient computation of the Z 2 -invariants is possible with the algorithm from Ref. 30.…”
Section: Discussionmentioning
confidence: 99%
See 1 more Smart Citation
“…Particularly efficient computation of the Z 2 -invariants is possible with the algorithm from Ref. 30.…”
Section: Discussionmentioning
confidence: 99%
“…(4.4) in Ref. 30, which is the basis of the algorithm presented there. Owing to this similarity, evaluation of the above expression, and also of the Z 2 -invariants defined in the main text, is possible with that algorithm.…”
Section: Acknowledgmentsmentioning
confidence: 99%
“…over all degeneracy points i = 1, ..., dp of the Floquet-Bloch propagator U (k, t) that occur during time-evolution [28,30]. To each degeneracy point, we assign a topological chargeĈ i , given as a Chern number, and a weight factor N i (ε) that ensures that only the degeneracy points in the gap ε contribute to the sum.…”
Section: Ii43 Winding Number Wmentioning
confidence: 99%
“…[32], computed with the algorithm from Ref. [34]). This confirms that the driving protocol indeed supports a nontrivial time-reversal symmetric topological phase, with a pair of counterpropagating boundary states.…”
Section: A Time-reversal Symmetrymentioning
confidence: 99%