English
Related papers

Related papers: Quantum Graphs: A model for Quantum Chaos

200 papers

A semiclassical approach to the universal ergodic spectral statistics in quantum star graphs is presented for all known ten symmetry classes of quantum systems. The approach is based on periodic orbit theory, the exact semiclassical trace…

Chaotic Dynamics · Physics 2009-11-10 Sven Gnutzmann , Burkhard Seif

To study electronic transport through chaotic quantum dots, there are two main theoretical approachs. One involves substituting the quantum system with a random scattering matrix and performing appropriate ensemble averaging. The other…

Mathematical Physics · Physics 2013-11-21 G. Berkolaiko , J. Kuipers

We formulate three current models of discrete-time quantum walks in a combinatorial way. These walks are shown to be closely related to rotation systems and 1-factorizations of graphs. For two of the models, we compute the traces and total…

Combinatorics · Mathematics 2019-05-17 Chris Godsil , Hanmeng Zhan

Electronic transport through chaotic quantum dots exhibits universal behaviour which can be understood through the semiclassical approximation. Within the approximation, transport moments reduce to codifying classical correlations between…

Mathematical Physics · Physics 2016-03-25 G. Berkolaiko , J. Kuipers

A version of scattering theory that was developed many years ago to treat nuclear scattering processes, has provided a powerful tool to study universality in scattering processes involving open quantum systems with underlying classically…

Chaotic Dynamics · Physics 2022-10-12 L. E. Reichl , G. Akguc

The Scattering Quantum Random Walk scheme has found success as a basis for search algorithms on highly symmetric graph structures. In this paper we examine its effectiveness at locating a specially marked vertex on square grid graphs,…

Quantum Physics · Physics 2019-01-23 Daniel Koch

Quantum computing (QC) is a new computational paradigm whose foundations relate to quantum physics. Notable progress has been made, driving the birth of a series of quantum-based algorithms that take advantage of quantum computational…

Quantum Physics · Physics 2022-02-22 Yehui Tang , Junchi Yan , Hancock Edwin

We study scattering for continuous-time quantum walks on finite graphs with two attached leads. We derive explicit formulae for the two-terminal scattering matrix in terms of characteristic polynomials of the finite graph and its…

Quantum Physics · Physics 2026-05-15 Allan John Gerrard , Ryo Asaka , Kazumitsu Sakai

For time-reversal invariant graphs we prove the Bohigas-Giannoni-Schmit conjecture in its most general form: For graphs that are mixing in the classical limit, all spectral correlation functions coincide with those of the Gaussian…

Mathematical Physics · Physics 2015-06-18 Z. Pluhar , H. A. Weidenmueller

Quantum transport on structured networks is strongly influenced by interference effects, which can dramatically modify how information propagates through a system. We develop a quantum-information-theoretic framework for scattering on…

Quantum Physics · Physics 2026-01-29 Giuseppe Catalano , Farzad Kianvash , Vittorio Giovannetti

We present an exactly solvable quantum field theory which allows rearrangement collisions. We solve the model in the relevant sectors and demonstrate the orthonormality and completeness of the solutions, and construct the S-matrix. In the…

High Energy Physics - Theory · Physics 2011-06-20 S. Varma , E. C. G. Sudarshan

The explicit solution to the spectral problem of quantum graphs found recently in \cite{Anima}, is used to produce the exact periodic orbit theory description for the probability distributions of spectral statistics, including the…

Quantum Physics · Physics 2007-05-23 Yu. Dabaghian

We investigate the equivalence between spectral characteristics of the Laplace operator on a metric graph, and the associated unitary scattering operator. We prove that the statistics of level spacings, and moments of observations in the…

Mathematical Physics · Physics 2011-10-19 G. Berkolaiko , B. Winn

In this paper, we derive nearly tight probabilistic norm bounds for a class of random matrices we call graph matrices. While the classical case of symmetric matrices with independent random entries (Wigner's matrices) is a special case, in…

Combinatorics · Mathematics 2021-04-30 Kwangjun Ahn , Dhruv Medarametla , Aaron Potechin

We consider the inverse scattering on the quantum graph associated with the hexagonal lattice. Assuming that the potentials on the edges are compactly supported and symmetric, we show that the S-matrix for all energies in any given open set…

Mathematical Physics · Physics 2023-11-28 Kazunori Ando , Hiroshi Isozaki , Evgeny Korotyaev , Hisashi Morioka

The study of quantum evolution on graphs for diversified topologies is beneficial to modeling various realistic systems. A systematic method, the dimerized decomposition, is proposed to analyze the dynamics on an arbitrary network. By…

Quantum Physics · Physics 2020-03-04 He Feng , Tian-Min Yan , Y. H. Jiang

We introduce a Sinkhorn-type algorithm for producing quantum permutation matrices encoding symmetries of graphs. Our algorithm generates square matrices whose entries are orthogonal projections onto one-dimensional subspaces satisfying a…

Quantum Algebra · Mathematics 2019-11-13 Ion Nechita , Simon Schmidt , Moritz Weber

We study the time evolution operator in a family of local quantum circuits with random fields in a fixed direction. We argue that the presence of quantum chaos implies that at large times the time evolution operator becomes effectively a…

Statistical Mechanics · Physics 2021-05-12 Pavel Kos , Bruno Bertini , Tomaž Prosen

We present an in-depth study of the universal correlations of scattering-matrix entries required in the framework of non-stationary many-body scattering where the incoming states are localized wavepackets. Contrary to the stationary case…

Statistical Mechanics · Physics 2021-05-19 Andreas Bereczuk , Barbara Dietz , Jiongning Che , Jack Kuipers , Juan-Diego Urbina , Klaus Richter

We introduce a simple diagrammatic approach for estimating how a randomly walking quantum particle searches on a graph in continuous-time, which involves sketching small weighted graphs with self-loops and considering degenerate…

Quantum Physics · Physics 2015-06-12 Thomas G. Wong