arXiv subjects

Cameron Beetar

Publications and source records attributed to Cameron Beetar.

8 recordsLinked to original sources

arXiv2026

More on OTOCs and Chaos in Quantum Mechanics -- Magnetic Fields

We revisit thermal out-of-time-order correlators (OTOCs) in single-particle quantum systems, focusing on magnetic billiards. Using the stadium billiard as a testbed, we compute the thermal OTOC $C_T(t) = -\langle [x(t), p]^2 \rangle_\beta$ and extract Lyapunov-like exponents $\lambda_L$ that quantify early-time growth. We map out $\lambda_L(T, B)$, revealing a crossover from quantum chaos to magnetic rigidity. In parallel, we compute an alternative OTOC built from guiding-center operators, which exhibits qualitatively distinct dynamics and no exponential growth. Our results offer a controlled framework for probing scrambling, temperature dependence, and the interplay of geometry and magnetic fields in quantum systems.

hep-th↗

arXiv2025

(A)Symmetric Complexity and the Quantum Mpemba Effect

The Quantum Mpemba Effect (QME) -- the counter-intuitive phenomenon where states further from equilibrium can relax faster than those closer to it -- challenges standard expectations of quantum thermalization. In this work, we introduce Krylov complexity as a sensitive diagnostic for the QME. We show that Krylov spread complexity encodes the asymmetry essential to the effect, and we define a new class of projective (a)symmetric complexities that sharpen this connection. Strikingly, the structure of these projective complexities at the initial moment ($t=0$) already carries predictive power for the onset of Mpemba-like inversions, obviating the need for explicit time evolution. Our results suggest that the geometry of states in Krylov space captures deep information about non-monotonic relaxation and provides a powerful framework for diagnosing and anticipating anomalous thermalization phenomena in quantum systems.

hep-th↗

arXiv2025

Krylov complexity, path integrals, and instantons

Krylov complexity has emerged as an important tool in the description of quantum information and, in particular, quantum chaos. Here we formulate Krylov complexity $K(t)$ for quantum mechanical systems as a path integral, and argue that at large times, for classical chaotic systems with at least two minima of the potential, that have a plateau for $K(t)$, the value of the plateau is described by quantum mechanical instantons, as is the case for standard transition amplitudes. We explain and test these ideas in a simple toy model.

hep-th↗

arXiv2025

A Quantum Computational Perspective on Spread Complexity

We establish a direct connection between spread complexity and quantum circuit complexity by demonstrating that spread complexity emerges as a limiting case of a circuit complexity framework built from two fundamental operations: time-evolution and superposition. Our approach leverages a computational setup where unitary gates and beam-splitting operations generate target states, with the minimal cost of synthesis yielding a complexity measure that converges to spread complexity in the infinitesimal time-evolution limit. This perspective not only provides a physical interpretation of spread complexity but also offers computational advantages, particularly in scenarios where traditional methods like the Lanczos algorithm fail. We illustrate our framework with an explicit SU(2) example and discuss broader applications, including cases where return amplitudes are non-perturbative or divergent

hep-th↗

arXiv2024

Double Copy in AdS3 from Minitwistor Space

The double copy relates gravitational theories to the square of gauge theories. While it is well understood in flat backgrounds, its precise realisation around curved spacetimes remains an open question. In this paper, we construct a classical double copy for cohomology class representatives in the minitwistor space of hyperbolic spacetimes. We find that the realisation of a physical double copy requires that the masses of the different spinning fields are not equal, contrary to the flat space prescription. This leads to a position-space double copy for bulk-to-boundary propagators. We also show that in coordinate space, this implies the Cotton double copy for waves and warped black holes of Topologically Massive Gravity. We show that these are exact double copy relations by constructing their Kerr-Schild metrics and also analysing the Kerr-Schild double copy. Furthermore, we find that near the boundary the double copy relates the dual CFT currents.

hep-th↗

arXiv2023

Complexity and Operator Growth for Quantum Systems in Dynamic Equilibrium

Krylov complexity is a measure of operator growth in quantum systems, based on the number of orthogonal basis vectors needed to approximate the time evolution of an operator. In this paper, we study the Krylov complexity of a $\mathsf{PT}$-symmetric system of oscillators, which exhibits two phase transitions that separate a dissipative state, a Rabi-oscillation state, and an ultra-strongly coupled regime. We use a generalization of the $su(1,1)$ algebra associated to the Bateman oscillator to describe the Hamiltonian of the coupled system, and construct a set of coherent states associated with this algebra. We compute the Krylov (spread) complexity using these coherent states, and find that it can distinguish between the $\mathsf{PT}$-symmetric and $\mathsf{PT}$ symmetry-broken phases. We also show that the Krylov complexity reveals the ill-defined nature of the vacuum of the Bateman oscillator, which is a special case of our system. Our results demonstrate the utility of Krylov complexity as a tool to probe the properties and transitions of $\mathsf{PT}$-symmetric systems.

hep-th↗

arXiv2023

The asymmetric Otto engine: frictional effects on performance bounds and operational modes

We present a detailed study of an asymmetrically driven quantum Otto engine with a time-dependent harmonic oscillator as its working medium. We obtain analytic expressions for the upper bounds on the efficiency of the engine for two different driving schemes having asymmetry in the expansion and compression work strokes. We show that the Otto cycle under consideration cannot operate as a heat engine in the low-temperature regime. Then, we show that the friction in the expansion stroke is significantly more detrimental to the performance of the engine as compared to the friction in the compression stroke. Further, by comparing the performance of the engine with sudden expansion, sudden compression, and both sudden strokes, we uncover a pattern of connections between the operational points, and we indicate the optimal operation regime for each case. Finally, we analytically characterize the complete phase diagram of the Otto cycle for both driving schemes and highlight the different operational modes of the cycle as a heat engine, refrigerator, accelerator, and heater.

quant-ph↗

arXiv2021

Neural Networks as Universal Probes of Many-Body Localization in Quantum Graphs

We show that a neural network, trained on the entanglement spectra of a nearest neighbor Heisenberg chain in a random transverse magnetic field, can be used to efficiently study the ergodic/many-body localized properties of a number of other quantum systems, without further re-training. We benchmark our computational architecture against a $J_{1}\!\!-\!\!J_{2}$ - model, which extends the Heisenberg chain to include next-to-nearest neighbor interactions, with excellent agreement with known results. When applied to Hamiltonians that differ from the training model by the topology of the underlying graph, the neural network is able to predict the critical disorders and, more generally, shapes of the mobility edge that agree with our heuristic expectation. We take this as proof of principle that machine learning algorithms furnish a powerful new set of computational tools to explore the many-body physics frontier.

cond-mat.dis-nn↗