arXiv subjects

Bhargavi Jonnadula

Publications and source records attributed to Bhargavi Jonnadula.

8 recordsLinked to original sources

arXiv2026

Lecture hall graphs and the Askey scheme

We establish, for every family of orthogonal polynomials in the $ q $-Askey scheme and the Askey scheme, a combinatorial model for mixed moments and coefficients in terms of paths on the lecture hall graph. This generalizes the previous results of Corteel and Kim for the little $ q $-Jacobi polynomials. We build these combinatorial models by bootstrapping, beginning with polynomials at the bottom and working towards Askey--Wilson polynomials which sit at the top of the $ q $-Askey scheme. As an application of the theory, we provide the first combinatorial proof of the symmetries in the parameters of the Askey--Wilson polynomials.

math.CO↗

arXiv2026

Logical gates on Floquet codes via folds and twists

Floquet codes have recently emerged as a new family of error-correcting codes, and have drawn significant interest across both theoretical and practical quantum computing. A central open question has been how to implement logical operations on these codes. In this work, we show how two techniques from static quantum error-correcting codes can also be implemented on Floquet codes. First, we present a way of implementing fold-transversal operations on Floquet codes in order to yield logical Hadamard and S gates. And second, we present a way of implementing logical CNOT gates on Floquet codes via Dehn twists. We discuss the requirements for these techniques, and show that they are applicable to a wide family of Floquet codes defined on colour code lattices. Through numerical benchmarking of the logical operations on the CCS Floquet code, we establish a logical-gate threshold of 0.25-0.35% and verify sub-threshold exponential error suppression. Our results show that these logical operations are robust, featuring a performance that is close to the baseline set by a quantum memory benchmark. Finally, we explain in detail how to implement logical gates on Floquet codes by operating on the embedded codes.

quant-ph↗

arXiv2025

Distributed quantum error correction based on hyperbolic Floquet codes

Quantum computing offers significant speedups, but the large number of physical qubits required for quantum error correction introduces engineering challenges for a monolithic architecture. One solution is to distribute the logical quantum computation across multiple small quantum computers, with non-local operations enabled via distributed Bell states. Previous investigations of distributed quantum error correction have largely focused on the surface code, which offers good error suppression but poor encoding rates, with each surface code instance only able to encode a single logical qubit. In this work, we argue that hyperbolic Floquet codes are particularly well-suited to distributed quantum error correction for two reasons. Firstly, their hyperbolic structure enables a high number of logical qubits to be stored efficiently. Secondly, the fact that all measurements are between pairs of qubits means that each measurement only requires a single Bell state. Under the circuit-level noise model, we demonstrate through simulations that distributed hyperbolic Floquet codes offer good performance with achievable local and non-local fidelities of approximately $99.97\%$ and $99\%$, respectively. This shows that distributed quantum error correction is not only possible but also efficiently realisable.

quant-ph↗

arXiv2024

Quantum interpretation of lattice paths

In the 1980s, Viennot developed a combinatorial approach to studying mixed moments of orthogonal polynomials using Motzkin paths. Recently, an alternative combinatorial model for these mixed moments based on lecture hall paths was introduced in arXiv:2311.12761. For sequences of orthogonal polynomials, we establish here a bijection between the Motzin paths and the lecture hall paths via a novel symmetric lecture hall graph. We use this connection to calculate the moments of the position operator in various separable quantum systems, such as the quantum harmonic oscillator and the hydrogen atom, showing that they may be expressed as generating functions of Motzkin paths and symmetric lecture hall paths, thereby providing a quantum interpretation for these paths. Our approach can be extended to other quantum systems where the wavefunctions are expressed in terms of orthogonal polynomials.

math-ph↗

arXiv2021

Symmetric Function Theory and Unitary Invariant Ensembles

Representation theory and the theory of symmetric functions have played a central role in Random Matrix Theory in the computation of quantities such as joint moments of traces and joint moments of characteristic polynomials of matrices drawn from the Circular Unitary Ensemble and other Circular Ensembles related to the classical compact groups. The reason is that they enable the derivation of exact formulae, which then provide a route to calculating the large-matrix asymptotics of these quantities. We develop a parallel theory for the Gaussian Unitary Ensemble of random matrices, and other related unitary invariant matrix ensembles. This allows us to write down exact formulae in these cases for the joint moments of the traces and the joint moments of the characteristic polynomials in terms of appropriately defined symmetric functions. As an example of an application, for the joint moments of the traces we derive explicit asymptotic formulae for the rate of convergence of the moments of polynomial functions of GUE matrices to those of a standard normal distribution when the matrix size tends to infinity.

math-ph↗

arXiv2021

On the moments of characteristic polynomials

We examine the asymptotics of the moments of characteristic polynomials of $N\times N$ matrices drawn from the Hermitian ensembles of Random Matrix Theory, in the limit as $N\to\infty$. We focus in particular on the Gaussian Unitary Ensemble, but discuss other Hermitian ensembles as well. We employ a novel approach to calculate asymptotic formulae for the moments, enabling us to uncover subtle structure not apparent in previous approaches.

math-ph↗

arXiv2020

Entanglement measures of bipartite quantum gates and their thermalization under arbitrary interaction strength

Entanglement properties of bipartite unitary operators are studied via their local invariants, namely the entangling power $e_p$ and a complementary quantity, the gate typicality $g_t$. We characterize the boundaries of the set $K_2$ representing all two-qubit gates projected onto the plane $(e_p, g_t)$ showing that the fractional powers of the \textsc{swap} operator form a parabolic boundary of $K_2$, while the other bounds are formed by two straight lines. In this way a family of gates with extreme properties is identified and analyzed. We also show that the parabolic curve representing powers of \textsc{swap} persists in the set $K_N$, for gates of higher dimensions ($N>2$). Furthermore, we study entanglement of bipartite quantum gates applied sequentially $n$ times and analyze the influence of interlacing local unitary operations, which model generic Hamiltonian dynamics. An explicit formula for the entangling power a gate applied $n$ times averaged over random local unitary dynamics is derived for an arbitrary dimension of each subsystem. This quantity shows an exponential saturation to the value predicted by the random matrix theory (RMT), indicating "thermalization" in the entanglement properties of sequentially applied quantum gates that can have arbitrarily small, but nonzero, entanglement to begin with. The thermalization is further characterized by the spectral properties of the reshuffled and partially transposed unitary matrices.

quant-ph↗

arXiv2016

Can local dynamics enhance entangling power?

It is demonstrated here that local dynamics have the ability to strongly modify the entangling power of unitary quantum gates acting on a composite system. The scenario is common to numerous physical systems, in which the time evolution involves local operators and nonlocal interactions. To distinguish between distinct classes of gates with zero entangling power we introduce a complementary quantity called gate-typicality and study its properties. Analyzing multiple applications of any entangling operator interlaced with random local gates, we prove that both investigated quantities approach their asymptotic values in a simple exponential form. This rapid convergence to equilibrium, valid for subsystems of arbitrary size, is illustrated by studying multiple actions of diagonal unitary gates and controlled unitary gates.

quant-ph↗