More Like this

1. Kaluza-Klein fermion mass matrices from exceptional field theory and $$ \mathcal{N} $$ = 1 spectra

   https://doi.org/10.1007/JHEP03(2021)138  

   Cesàro, Mattia; Varela, Oscar (March 2021, Journal of High Energy Physics)

   null (Ed.)

   A bstract Using Exceptional Field Theory, we determine the infinite-dimensional mass matrices for the gravitino and spin-1 / 2 Kaluza-Klein perturbations above a class of anti-de Sitter solutions of M-theory and massive type IIA string theory with topologically-spherical internal spaces. We then use these mass matrices to compute the spectrum of Kaluza-Klein fermions about some solutions in this class with internal symmetry groups containing SU(3). Combining these results with previously known bosonic sectors of the spectra, we give the complete spectrum about some $$ \mathcal{N} $$ N = 1 and some non-supersymmetric solutions in this class. The complete spectra are shown to enjoy certain generic features. 

   more » « less
2. Random anti-commuting Hermitian matrices

   https://doi.org/10.1142/S2010326324500199  

   McCarthy, John E; McCarthy, Hazel T (October 2024, Random Matrices: Theory and Applications)

   We consider pairs of anti-commuting [Formula: see text]-by-[Formula: see text] Hermitian matrices that are chosen randomly with respect to a Gaussian measure. Generically such a pair decomposes into the direct sum of [Formula: see text]-by-[Formula: see text] blocks on which the first matrix has eigenvalues [Formula: see text] and the second has eigenvalues [Formula: see text]. We call [Formula: see text] the skew spectrum of the pair. We derive a formula for the probability density of the skew spectrum, and show that the elements are repelling. 

   more » « less
3. Discovering Transforms: A Tutorial on Circulant Matrices, Circular Convolution, and the Discrete Fourier Transform

   https://doi.org/10.48550/arXiv.1805.05533  

   Bamieh, Bassam (July 2020, ArXivorg)

   How could the Fourier and other transforms be naturally discovered if one didn't know how to postulate them? In the case of the Discrete Fourier Transform (DFT), we show how it arises naturally out of analysis of circulant matrices. In particular, the DFT can be derived as the change of basis that simultaneously diagonalizes all circulant matrices. In this way, the DFT arises naturally from a linear algebra question about a set of matrices. Rather than thinking of the DFT as a signal transform, it is more natural to think of it as a single change of basis that renders an entire set of mutually-commuting matrices into simple, diagonal forms. The DFT can then be ``discovered'' by solving the eigenvalue/eigenvector problem for a special element in that set. A brief outline is given of how this line of thinking can be generalized to families of linear operators, leading to the discovery of the other common Fourier-type transforms, as well as its connections with group representations theory. 

   more » « less
4. Synthesis of Logical Clifford Operators via Symplectic Geometry

   Rengaswamy, Narayanan; Calderbank, Robert; Kadhe, Swanand; Pfister, Henry D. (January 2018, IEEE International Symposium on Information Theory)

   Quantum error-correcting codes can be used to protect qubits involved in quantum computation. This requires that logical operators acting on protected qubits be translated to physical operators (circuits) acting on physical quantum states. We propose a mathematical framework for synthesizing physical circuits that implement logical Clifford operators for stabilizer codes. Circuit synthesis is enabled by representing the desired physical Clifford operator in CN ×N as a 2m × 2m binary sym- plectic matrix, where N = 2m. We show that for an [m, m − k] stabilizer code every logical Clifford operator has 2k(k+1)/2 symplectic solutions, and we enumerate them efficiently using symplectic transvections. The desired circuits are then obtained by writing each of the solutions as a product of elementary symplectic matrices. For a given operator, our assembly of all of its physical realizations enables optimization over them with respect to a suitable metric. Our method of circuit synthesis can be applied to any stabilizer code, and this paper provides a proof of concept synthesis of universal Clifford gates for the well- known [6, 4, 2] code. Programs implementing our algorithms can be found at https://github.com/nrenga/symplectic-arxiv18a. 

   more » « less
5. Pauli spectrum and nonstabilizerness of typical quantum many-body states

   https://doi.org/10.1103/PhysRevB.111.054301  

   Turkeshi, Xhek; Dymarsky, Anatoly; Sierant, Piotr (February 2025, Physical Review B)

   An important question of quantum information is to characterize genuinely quantum (beyond-Clifford) resources necessary for universal quantum computing. Here, we use the Pauli spectrum to quantify how “magic,” beyond Clifford, typical many-qubit states are. We first present a phenomenological picture of the Pauli spectrum based on quantum typicality, and then we confirm it for Haar random states. We then introduce filtered stabilizer entropy, a magic measure that can resolve the difference between typical and atypical states. We proceed with the numerical study of the Pauli spectrum of states created by random circuits as well as for eigenstates of chaotic Hamiltonians. We find that in both cases, the Pauli spectrum approaches the one of Haar random states, up to exponentially suppressed tails. We discuss how the Pauli spectrum changes when ergodicity is broken due to disorder. Our results underscore the difference between typical and atypical states from the point of view of quantum information 

   more » « less