GGGiovanni Gramegna

Giovanni Gramegna

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Giovanni Gramegna has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Rotating-Wave and Secular Approximations for Open Quantum Systems

    by Daniel Burgarth, Paolo Facchi, Giovanni Gramegna, Kazuya Yuasa

    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 of the Gorini-Kossakowski-Lindblad-Sudarshan form from the Redfield master equation.

  • Open Access

    Maximal Minimal Spacing for Random Points

    by Fabio Deelan Cunden, Noemi Cuppone, Giovanni Gramegna, Pierpaolo Vivo

    From $$N+1$$ N + 1 random points on a line we wish to select $$M+1$$ 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\le N$$ M ≤ 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.

  • Open Access

    Quantum systems with jump-discontinous mass. I

    by Fabio Deelan Cunden, Giovanni Gramegna, Marilena Ligabò

    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 labelled 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.

  • Open Access

    The most dispersed subset of random points in R d

    by Fabio Deelan Cunden, Noemi Cuppone, Giovanni Gramegna, Pierpaolo Vivo

    Consider a population of N individuals, each having d ≥ 1 different traits, and an additive measure, called dispersion, which rewards large pairwise separations between traits. The goal is to select M ≤ 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 nearoptimal solutions.


  • Open Access

    Pseudo quantum advantages in perceptron storage capacity

    by Fabio Benatti, Masoud Gharahi, Giovanni Gramegna, Stefano Mancini, Vincenzo Parisi

    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 .

  • Open Access

    Relative volume of comparable pairs under semigroup majorization

    by Fabio Deelan Cunden, Jakub Czartowski, Giovanni Gramegna, A. de Oliveira Junior

  • Open Access

    On the capacity of a quantum perceptron for storing biased patterns

    by Fabio Benatti, Giovanni Gramegna, Stefano Mancini, Gibbs Nwemadji

    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.


  • Principles of quantum functional testing

    by Nadia Milazzo, Olivier Giraud, Giovanni Gramegna, Daniel Braun

    With the 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 the rejection or acceptance of the claim of the producer that the device parameters are within certain specifications. In this context, we introduce and analyze three ingredients that can speed up this decision problem: the iteration of the channel, efficient decision criteria, and nongreedy adaptive experimental design.

  • Open Access

    One bound to rule them all: from Adiabatic to Zeno

    by Daniel Burgarth, Paolo Facchi, Giovanni Gramegna, Kazuya Yuasa

    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.


  • Open Access

    One bound to rule them all: from Adiabatic to Zeno

    by Daniel Burgarth, Paolo Facchi, Giovanni Gramegna, Kazuya Yuasa

    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.