Related papers: A Fermi golden rule for quantum graphs
Based on earlier work by Carlen-Maas and the second- and third-named author, we introduce the notion of intertwining curvature lower bounds for graphs and quantum Markov semigroups. This curvature notion is stronger than both Bakry-\'Emery…
We apply the method of QCD sum rules in the presence of external electromagnetic fields $F_{\mu\nu}$ to the problem of the electromagnetic decays of various vector mesons, such as $\rho\to\pi\gamma$, $K^\ast\to K\gamma$ and…
We present a quantum algorithm for computing the Ramsey numbers whose computational complexity grows super-exponentially with the number of vertices of a graph on a classical computer. The problem is mapped to a decision problem on a…
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…
We construct two types of multi-layer quantum graphs (Schr\"odinger operators on metric graphs) for which the dispersion function of wave vector and energy is proved to be a polynomial in the dispersion function of the single layer. This…
How does one generalize differential geometric constructs such as curvature of a manifold to the discrete world of graphs and other combinatorial structures? This problem carries significant importance for analyzing models of discrete…
We establish quantum thermodynamics for open quantum systems weakly coupled to their reservoirs when the system exhibits degeneracies. The first and second law of thermodynamics are derived, as well as a finite-time fluctuation theorem for…
The system consisting of a fermion in the background of a wobbling kink is studied in this paper. To investigate the impact of the wobbling on the fermion-kink interaction, we employ the time-dependent perturbation theory formalism in…
Motivated by the study of the crossing number of graphs, it is shown that, for trees, the sum of the products of the degrees of the end-vertices of all edges has an upper bound in terms of the sum of all vertex degrees to the power of…
In this paper, we develop the groundwork for a graph theoretic toy model of supersymmetric quantum mechanics. Using discrete Witten-Morse theory, we demonstrate that finite graphs have a natural supersymmetric structure and use this…
In this paper we give a method to associate a graph with an arbitrary density matrix referred to a standard orthonormal basis in the Hilbert space of a finite dimensional quantum system. We study the related issues like classification of…
When using graphs and graph transformations to model systems, consistency is an important concern. While consistency has primarily been viewed as a binary property, i.e., a graph is consistent or inconsistent with respect to a set of…
Classical computation of electronic properties in large-scale materials remains challenging. Quantum computation has the potential to offer advantages in memory footprint and computational scaling. However, general and practical quantum…
Entanglement plays an important role in quantum communication, algorithms, and error correction. Schmidt coefficients are correlated to the eigenvalues of the reduced density matrix. These eigenvalues are used in Von Neumann entropy to…
We derive norm bounds that imply the convergence of perturbation theory in fermionic quantum field theory if the propagator is summable and has a finite Gram constant. These bounds are sufficient for an application in renormalization group…
Quantum metrology exploits quantum mechanical effects to increase the precision of measurements of physical quantities. A wide variety of applications are currently being developed for scientific and technological purposes, however, most…
In this paper, we prove a variant of the Burger-Brooks transfer principle which, combined with recent eigenvalue bounds for surfaces, allows to obtain upper bounds on the eigenvalues of graphs as a function of their genus. More precisely,…
We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…
Diagrammatic perturbation theory is a powerful tool for the investigation of interacting many-body systems, the self-energy operator $\Sigma$ encoding all the variety of scattering processes. In the simplest scenario of correlated electrons…
It is shown that a generalization of the fluctuation-dissipation theorem places an upper bound on the figure of merit for any quantum gate designed to entangle spatially-separated qubits. The bound depends solely on the spectral properties…