arXiv:2610.32605
QuantumBilliards.jl: An extensible, user friendly, high-performance Julia library for the large scale computation of spectra and eigenstates of quantum billiards and related problems
Matic Orel, Črt Lozej
Abstract
We present QuantumBilliards.jl, an open-source Julia library providing a suite of numerical solvers for the two-dimensional interior Helmholtz eigenproblem with Dirichlet boundary conditions, a paradigmatic model in quantum chaos. The library implements conventional wavenumber-sweep techniques together with several accelerated eigensolvers: the Vergini--Saraceno scaling method, the expanded boundary integral method (EBIM), Beyn's contour-integral method, and the Compact Rational Krylov (CORK) method. It provides a common framework for constructing billiard geometries, exploiting discrete symmetries, computing eigenvalues and eigenstates, and treating smooth, cornered, and multiply connected domains. The library further includes reconstruction of eigenfunctions from boundary normal derivatives and the computation of Poincaré--Husimi (PH) phase-space representations. Available at: https://github.com/Quantum-Chaos-Julia/QuantumBilliards.jl.
AI Summary
The paper presents QuantumBilliards.jl, an open-source Julia framework for computing spectra and eigenstates of the two-dimensional interior Helmholtz problem with Dirichlet boundary conditions. It addresses the numerical workflow needed for high-energy quantum-chaos studies: geometry construction, symmetry reduction, spectral computation, and reconstruction of boundary functions, interior wavefunctions, and Poincaré–Husimi representations. The library combines basis-expansion and boundary-integral sweep solvers with four accelerated methods: Vergini–Saraceno scaling, expanded boundary integrals, Beyn contour integration, and compact rational Krylov (CORK). A common interface supports smooth, cornered, and multiply connected domains. Implementation details include Kress quadrature with corner grading, numerical-nullspace removal for overcomplete bases, and analytic Taylor recurrences that reduce repeated special-function evaluations. Benchmarks over $500\leq k\leq1400$ compute approximately 107,000–109,000 eigenvalues in 2,875–4,125 seconds on a 64-core Threadripper workstation. The scaling solver uses a weaker billiard deformation than Beyn and CORK because of basis-convergence restrictions. Accuracy is examined against exact rectangular spectra, residuals, resolution changes, and cross-method agreement; spectral completeness is assessed through the absence of accumulating drift relative to Weyl’s law. Some CORK rectangle tests reach the double-precision scale $k\epsilon_{\rm mach}$ away from window edges. Stated limitations include dense boundary factorizations costing $O(k^3)$ at fixed points per wavelength, geometry-dependent basis convergence, coupled corner-grading and resolution choices, and window-dependent approximation errors. Vergini–Saraceno has no proven strict eigenvalue-error bounds here. Magnetic and hyperbolic extensions are demonstrated but remain under testing for a subsequent release.
Error found: The basis-method section incorrectly equates a generalized Rayleigh-quotient minimization with minimizing ||Fc||₂/||Nc||₂, which generally gives a different minimum. The analytic-Taylor appendix appears to use doubled layer operators without explicitly distinguishing them from the operators defined in the main text. The benchmark section treats absence of drift relative to Weyl's law as establishing spectral completeness, although this test cannot exclude isolated omissions or compensating missing and spurious levels.
Written by gpt-6.1-sol from the paper's full text. Automated: it can be wrong.
- Comments
- 53 pages, 19 figures