arXiv subjects

Giovanni Gramegna

Publications and source records attributed to Giovanni Gramegna.

17 recordsLinked to original sources

arXiv2026

Limits of Stochastic Semigroups and Block-Triangular Majorisation

We investigate limits of semigroups of stochastic matrices defined by their invariant distribution. Given probability vectors $γ(β)$ depending on a parameter $β$, we introduce a notion of convergence as $β\to\infty$ for the corresponding semigroups of $γ(β)$-preserving stochastic matrices and investigate the structure of the resulting limit. In general, the limiting semigroup differs from the semigroup preserving the limiting distribution, showing that these two operations do not commute. We develop a general framework for such limiting semigroups and study in detail the case in which the invariant distributions are Gibbs vectors at the inverse temperature $β$. We show that the limiting semigroup consists of block-upper-triangular stochastic matrices subject to additional substochasticity constraints. We characterise and enumerate their extremal elements and determine the preorder on probability vectors induced by the action of the semigroup. The resulting notion of Block-Triangular majorisation interpolates between ordinary majorisation and upper triangular (aka unordered) majorisation. We show that it is completely characterised by a finite family of monotones and analyse the corresponding behaviour of Rényi $α$-entropies as $β\to\infty$.

math-ph↗

arXiv2026

Maximal Minimal Spacing for Random Points

From $N+1$ random points on a line we wish to select $M+1$ points so as to maximize the minimal spacing between them. We consider an initial configuration with independent and identically distributed spacings. Equivalently, the points are arrival times of a generic renewal process. For general spacing distributions, and for all $M\leq N$, we derive exact distributional identities for the maximal minimal spacing and obtain its asymptotic behavior. The problem admits a reformulation in terms of a threshold-resetting random walk. The walk advances by successive random increments and is reset to the origin upon exceeding a fixed threshold. The probability that the optimal spacing exceeds a given value coincides with the probability that the walk completes at least $M$ reset cycles within $N$ steps. This yields an exact representation in terms of first-passage functionals of the walk. The same mapping suggests a numerical scheme for the max-min spacing problem in the regime of large $N$ and $M$, whose accuracy is tested against the exact results obtained here.

math-ph↗

arXiv2026

The Most Dispersed Subset of Random Points in $\mathbb{R}^d$

Consider a population of $N$ individuals, each having $d\geq 1$ different traits, and an additive measure, called dispersion, which rewards large pairwise separations between traits. The goal is to select $M\leq N$ individuals such that their traits are as dispersed as possible. We compute analytically the full statistics (including large deviation tails) of the maximally achievable dispersion among sub-populations of size $M$ when the traits are independent and identically distributed. Two complementary approaches are developed, one based on a mean-field theory for order statistics, and the other on the replica method from the field of disordered systems. In all dimensions $d$, and for rotationally symmetric distributions, the optimal subset for large populations consists of all points lying outside a $d$-dimensional ball whose radius is determined self-consistently. For a single trait ($d=1$), the statistics of the maximal dispersion can be tackled for finite $N,M$ as well. The formulae we obtained are corroborated by numerical simulations on small instances and by heuristic algorithms that find near-optimal solutions.

cond-mat.stat-mech↗

arXiv2026

Quantum Systems with jump-discontinuous mass. I

We consider a free quantum particle in one dimension whose mass profile exhibits jump discontinuities. The corresponding Hamiltonian is a self-adjoint realisation of the kinetic-energy operator, with the specific realisation determined by the boundary conditions at the points of mass discontinuity. For a family of scale-free boundary conditions, we analyse the associated spectral problem. We find that the eigenfunctions exhibit a highly sensitive and erratic dependence on the energy. Notably, the system supports infinitely many distinct semiclassical limits, each labeled by a point on a spectral curve embedded in the two-torus. These results demonstrate a rich interplay between discontinuous coefficients, boundary data, and spectral asymptotics.

math-ph↗

arXiv2026

Rotating-Wave and Secular Approximations for Open Quantum Systems

We derive a nonperturbative bound on the distance between evolutions of open quantum systems described by time-dependent generators. We show how this result can be employed to provide an explicit upper bound on the error of the rotating-wave approximation in the presence of dissipation and decoherence. We apply the derived bound to the strong-coupling limit in open quantum systems and to the secular approximation used to obtain a master equation from the Redfield equation.

quant-ph↗

arXiv2026

Pseudo quantum advantages in perceptron storage capacity

We investigate a generalized quantum perceptron architecture characterized by an oscillating activation function with a tunable frequency ranging from zero to infinity. Employing analytical techniques from statistical mechanics, we derive the optimal storage capacity and demonstrate that the classical result is recovered in the limit of vanishing frequency. As the frequency increases, however, the architecture exhibits enhanced quantum storage capabilities. Notably, this improvement stems solely from the specific form of the activation function and, in principle, could be emulated within a classical framework. Accordingly, we refer to this enhancement as a pseudo quantum advantage.

quant-ph↗

arXiv2025

Relative volume of comparable pairs under semigroup majorization

Any semigroup $\mathcal{S}$ of stochastic matrices induces a semigroup majorization relation $\prec^{\mathcal{S}}$ on the set $Δ_{n-1}$ of probability $n$-vectors. Pick $X,Y$ at random in $Δ_{n-1}$: what is the probability that $X$ and $Y$ are comparable under $\prec^{\mathcal{S}}$? We review recent asymptotic ($n\to\infty$) results and conjectures in the case of majorization relation (when $\mathcal{S}$ is the set of doubly stochastic matrices), discuss natural generalisations, and prove a new asymptotic result in the case of majorization, and new exact finite-$n$ formulae in the case of UT-majorization relation, i.e. when $\mathcal{S}$ is the set of upper-triangular stochastic matrices.

math-ph↗

arXiv2023

On the capacity of a quantum perceptron for storing biased patterns

Although different architectures of quantum perceptrons have been recently put forward, the capabilities of such quantum devices versus their classical counterparts remain debated. Here, we consider random patterns and targets independently distributed with biased probabilities and investigate the storage capacity of a continuous quantum perceptron model that admits a classical limit, thus facilitating the comparison of performances. Such a more general context extends a previous study of the quantum storage capacity where using statistical mechanics techniques in the limit of a large number of inputs, it was proved that no quantum advantages are to be expected concerning the storage properties. This outcome is due to the fuzziness inevitably introduced by the intrinsic stochasticity of quantum devices. We strengthen such an indication by showing that the possibility of indefinitely enhancing the storage capacity for highly correlated patterns, as it occurs in a classical setting, is instead prevented at the quantum level.

quant-ph↗

arXiv2022

Principles of quantum functional testing

With increasing commercial availability of quantum information processing devices the need for testing them efficiently for their specified functionality will arise. Complete quantum channel characterization is out of the question for anything more than the simplest quantum channels for one or two qubits. Quantum functional testing leads to a decision problem with outcomes corresponding to rejection or acceptance of the claim of the producer that the device parameters are within certain specifications. In this context, we introduce and analyse three ingredients that can speed up this decision problem: iteration of the channel, efficient decision criteria, and non-greedy adaptive experimental design.

quant-ph↗

arXiv2022

One bound to rule them all: from Adiabatic to Zeno

We derive a universal nonperturbative bound on the distance between unitary evolutions generated by time-dependent Hamiltonians in terms of the difference of their integral actions. We apply our result to provide explicit error bounds for the rotating-wave approximation and generalize it beyond the qubit case. We discuss the error of the rotating-wave approximation over long time and in the presence of time-dependent amplitude modulation. We also show how our universal bound can be used to derive and to generalize other known theorems such as the strong-coupling limit, the adiabatic theorem, and product formulas, which are relevant to quantum-control strategies including the Zeno control and the dynamical decoupling. Finally, we prove generalized versions of the Trotter product formula, extending its validity beyond the standard scaling assumption.

quant-ph↗

arXiv2021

Pattern capacity of a single quantum perceptron

Recent developments in Quantum Machine Learning have seen the introduction of several models to generalize the classical perceptron to the quantum regime. The capabilities of these quantum models need to be determined precisely in order to establish if a quantum advantage is achievable. Here we use a statistical physics approach to compute the pattern capacity of a particular model of quantum perceptron realized by means of a continuous variable quantum system.

quant-ph↗

arXiv2021

Generic aspects of the resource theory of quantum coherence

The class of incoherent operations induces a pre-order on the set of quantum pure states, defined by the possibility of converting one state into the other by transformations within the class. We prove that if two $n$-dimensional pure states are chosen independently according to the natural uniform distribution, then the probability that they are comparable vanishes as $n\rightarrow\infty$. We also study the maximal success probability of incoherent conversions and find an explicit formula for its large-$n$ asymptotic distribution. Our analysis is based on the observation that the extreme values (largest and smallest components) of a random point uniformly sampled from the unit simplex are distributed asymptotically as certain explicit homogeneous Markov chains.

quant-ph↗

arXiv2021

Entropy of quantum states

Given the algebra of observables of a quantum system subject to selection rules, a state can be represented by different density matrices. As a result, different von Neumann entropies can be associated with the same state. Motivated by a minimality property of the von Neumann entropy of a density matrix with respect to its possible decompositions into pure states, we give a purely algebraic definition of entropy for states of an algebra of observables, thus solving the above ambiguity. The entropy so defined satisfies all the desirable thermodynamic properties, and reduces to the von Neumann entropy in the quantum mechanical case. Moreover, it can be shown to be equal to the von Neumann entropy of the unique representative density matrix belonging to the operator algebra of a multiplicity-free Hilbert-space representation.

quant-ph↗

arXiv2021

Typicality of Heisenberg scaling precision in multi-mode quantum metrology

We propose a measurement setup reaching Heisenberg scaling precision for the estimation of any distributed parameter $φ$ (not necessarily a phase) encoded into a generic $M$-port linear network composed only of passive elements. The scheme proposed can be easily implemented from an experimental point of view since it employs only Gaussian states and Gaussian measurements. Due to the complete generality of the estimation problem considered, it was predicted that one would need to carry out an adaptive procedure which involves both the input states employed and the measurement performed at the output; we show that this is not necessary: Heisenberg scaling precision is still achievable by only adapting a single stage. The non-adapted stage only affects the value of a pre-factor multiplying the Heisenberg scaling precision: we show that, for large values of $M$ and a random (unbiased) choice of the non-adapted stage, this pre-factor takes a typical value which can be controlled through the encoding of the parameter $φ$ into the linear network.

quant-ph↗

arXiv2020

Heisenberg scaling precision in multi-mode distributed quantum metrology

We propose an $N$-photon Gaussian measurement scheme which allows the estimation of a parameter $φ$ encoded into a multi-port interferometer with a Heisenberg scaling precision (i.e. of order $1/N$). In this protocol, no restrictions on the structure of the interferometer are imposed other than linearity and passivity, allowing the parameter $φ$ to be distributed over several components. In all previous proposals Heisenberg scaling has been obtained provided that both the input state and the measurement at the output are suitably adapted to the unknown parameter $φ$. This is a serious drawback which would require in practice the use of iterative procedures with a sequence of trial input states and measurements, which involve an unquantified use of additional resources. Remarkably, we find that only one stage has to be adapted, which leaves the choice of the other stage completely arbitrary. We also show that our scheme is robust against imperfections in the optimized stage. Moreover, we show that the adaptive procedure only requires a preliminary classical knowledge (i.e to a precision $1/\sqrt{N}$) on the parameter, and no further additional resources. As a consequence, the same adapted stage can be employed to monitor with Heisenberg-limited precision any variation of the parameter of the order of $1/\sqrt{N}$ without any further adaptation.

quant-ph↗

arXiv2020

Volume of the set of LOCC-convertible quantum states

The class of quantum operations known as Local Operations and Classical Communication (LOCC) induces a partial ordering on quantum states. We present the results of systematic numerical computations related to the volume (with respect to the unitarily invariant measure) of the set of LOCC-convertible bipartite pure states, where the ordering is characterised by an algebraic relation known as majorization. The numerical results, which exploit a tridiagonal model of random matrices, provide quantitative evidence that the proportion of LOCC-convertible pairs vanishes in the limit of large dimension, and therefore support a previous conjecture by Nielsen. In particular, we show that the problem is equivalent to the persistence of a non-Markovian stochastic process and the proportion of LOCC-convertible pairs decays algebraically with a nontrivial persistence exponent. We extend this analysis by investigating the distribution of the maximal success probability of LOCC-conversions. We show a dichotomy in behaviour between balanced and unbalanced bipartitions. In the latter case the asymptotics is somehow surprising: in the limit of large dimensions, for the overwhelming majority of pairs of states a perfect LOCC-conversion is not possible; nevertheless, for most states there exist local strategies that succeed in achieving the conversion with a probability arbitrarily close to one. We present strong evidences of a universal scaling limit for the maximal probability of successful LOCC-conversions and we suggest a connection with the typical fluctuations of the smallest eigenvalue of Wishart random matrices.

quant-ph↗

arXiv2019

Generalized Product Formulas and Quantum Control

We study the quantum evolution under the combined action of the exponentials of two not necessarily commuting operators. We consider the limit in which the two evolutions alternate at infinite frequency. This case appears in a plethora of situations, both in physics (Feynman integral) and mathematics (product formulas). We focus on the case in which the two evolution times are scaled differently in the limit and generalize standard techniques and results.

quant-ph↗