Searcharxiv⌕ Search

arXiv subjects

Kevin Limanta

Publications and source records attributed to Kevin Limanta.

5 recordsLinked to original sources

Time- and Photon-Optimal Paths for the Preparation and Logical Flip of Gottesman-Kitaev-Preskill States

Gottesman-Kitaev-Preskill (GKP) states are highly non-Gaussian, making their control challenging, particularly in the presence of photon loss. Here, we use the brachistochrone, the fastest path at bounded speed, to construct ideal nonlinear Hamiltonians for state preparation and logical gates, and compare it with the photon-optimal path. We find that the two paths nearly coincide for state preparation but differ markedly for logical operations, namely the brachistochrone preserves the encoded qubit during a bit flip, whereas the photon-optimal path flips a known state through the vacuum. We then introduce the tangential capacity to quantify how effectively gate sets track these paths. Using this analysis, we find that conditional squeezing achieves the highest capacity, preparing GKP states in 824 ns with a fidelity of 0.99 and a minimum closeness to the path of 0.90, compared with 0.98 and 0.51 for conditional displacements and 0.83 and 0.19 for SNAP gates.

quant-ph↗

Sphere of Influence Centrality via Shapley Values: Empirical Approximation and Network Coverage Analysis

Node centrality is a fundamental problem in network analysis, yet classical metrics fail to capture the collective, coalitional nature of influence. We present a systematic empirical evaluation of the Shapley-value-based framework for the sphere of influence problem -- selecting $m$ nodes to maximize network coverage under three reachability criteria: single-hop, $k$-hop, and multi-path connectivity -- using exact polynomial-time algorithms due to Michalak et al. Evaluation across three diverse real-world networks (Euroroad, Facebook TV Shows, and Cora) demonstrates that practical approximation ratios consistently approach 0.9, substantially exceeding the theoretical $(1-1/e)$ lower bound, and that the Shapley-based approach dramatically outperforms a degree-based baseline, particularly in hub-and-spoke topologies. In the most striking case, Shapley-based selection identifies just 26 nodes (under 1\% of the Cora network) sufficient to influence half the graph under 3-hop reachability, compared to substantially larger sets required by the naive baseline.

cs.SI↗

An Algebraic Interpretation of the Super Catalan Numbers

We extend the notion of polynomial integration over an arbitrary circle $C$ in the Euclidean geometry over general fields $\mathbb F$ of characteristic zero as a normalized $\mathbb F$-linear functional on $\mathbb{F}\left[α_1, α_2\right]$ that takes polynomials that evaluate to zero on $C$ to zero and is $\mathrm{SO}(2,\mathbb{F})$-invariant. This allows us to not only build a purely algebraic integration theory in an elementary way, but also give the super Catalan numbers $$S(m,n) = \frac{(2m)!(2n)!}{m!n!(m+n)!}$$ an algebraic interpretation in terms of values of this algebraic integral over some circle applied to the monomials $α_1^{2m}α_2^{2n}$.

math.CO↗

Permutation-generated maps between Dyck paths

In 2003, Deutsch and Elizalde defined a family of bijective maps between the set of Dyck paths to itself which is induced by some particular permutations. In this paper, we extend the construction of the maps by allowing the permutation to be arbitrary. We characterise the permutations which generate the same map and find all permutations generating a bijection among Dyck paths. Consequently, we give a new combinatorial interpretation of the quantity $(2n-1)!!$ as well as some new statistics of Dyck paths which are equidistributed to some known height statistics via our generalised maps.

math.CO↗

Super Catalan Numbers and Fourier Summation over Finite Fields

We study polynomial summation over unit circles over finite fields of odd characteristic, obtaining a purely algebraic integration theory without recourse to infinite procedures. There are nonetheless strong parallels to classical integration theory over a circle, and we show that the super Catalan numbers and closely related rational numbers lie at the heart of both theories. This gives a uniform analytic meaning to these up to now somewhat mysterious numbers. Our derivation utilises the three-fold symmetry of chromogeometry between Euclidean and relativistic geometries, and we find that the Fourier summation formulas we derive in these two different settings are closely connected.

math.CO↗