Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
114 tokens/sec
GPT-4o
12 tokens/sec
Gemini 2.5 Pro Pro
35 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
3 tokens/sec
DeepSeek R1 via Azure Pro
33 tokens/sec
2000 character limit reached

Level compressibility of certain random unitary matrices (2202.11184v1)

Published 22 Feb 2022 in nlin.CD, math-ph, math.MP, and quant-ph

Abstract: The value of spectral form factor at the origin, called level compressibility, is an important characteristic of random spectra. The paper is devoted to analytical calculations of this quantity for different random unitary matrices describing models with intermediate spectral statistics. The computations are based on the approach developed by G. Tanner in [J. Phys. A: Math. Gen. 34, 8485 (2001)] for chaotic systems. The main ingredient of the method is the determination of eigenvalues of a transition matrix whose matrix elements equal squared moduli of matrix elements of the initial unitary matrix. The principal result of the paper is the proof that the level compressibility of random unitary matrices derived from the exact quantisation of barrier billiards and consequently of barrier billiards themselves is equal to $1/2$ irrespectively of the height and the position of the barrier.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-up Questions

We haven't generated follow-up questions for this paper yet.

Authors (1)