2010
DOI: 10.1142/s0217979210064678
|View full text |Cite
|
Sign up to set email alerts
|

Quantum Network Models and Classical Localization Problems

Abstract: A review is given of quantum network models in class C which, on a suitable 2d lattice, describe the spin quantum Hall plateau transition. On a general class of graphs, however, many observables of such models can be mapped to those of a classical walk in a random environment, thus relating questions of quantum and classical localization. In many cases it is possible to make rigorous statements about the latter through the relation to associated percolation problems, in both two and three dimensions.

Help me understand this report
View preprint versions

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
8
0

Year Published

2015
2015
2022
2022

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 10 publications
(8 citation statements)
references
References 22 publications
0
8
0
Order By: Relevance
“…Another example is the Chalker-Coddington model [195] for the quantum Hall (and spin quantum Hall) effect, where the transmission matrix J between two contacts a and b is given by [196,197]…”
Section: Complex Disorder and Localizationmentioning
confidence: 99%
“…Another example is the Chalker-Coddington model [195] for the quantum Hall (and spin quantum Hall) effect, where the transmission matrix J between two contacts a and b is given by [196,197]…”
Section: Complex Disorder and Localizationmentioning
confidence: 99%
“…In general, oriented scattering network models consist of a directed graph, composed of a set of vertices (or nodes) representing scattering matrices, which are connected to each other by directed edges (or links) over which flows a directed current [20]. At each vertex v, the number b v of incoming links is equal to the number of outgoing links to guarantee the unitarity of scattering events, which are described by a scattering matrix S v ∈ U (b v ), which relates the incoming amplitudes c in e on each incoming edge e to the outgoing amplitudes c out f on each outgoing edge f by…”
Section: B Oriented Scattering Network Modelsmentioning
confidence: 99%
“…that each vertex is connected to the same number of links. The most simple nontrivial situations is b = 2, where matrices are U (2) rotations, and it is usually possible to reduce any network model to this situation [20,21]. While network models can be used in any space dimension, we shall focus on two-dimensional systems.…”
Section: B Oriented Scattering Network Modelsmentioning
confidence: 99%
See 1 more Smart Citation
“…We consider the Manhattan pinball problem which is a network model of a quantum localization problem (see [3] and also [12, Page 237], [5]). There are equivalent ways to state the problem formally.…”
Section: Introductionmentioning
confidence: 99%