相关论文: Explicit Spectral formulae for scaling quantum gra…
Spectral statistics such as the level spacing statistics and spectral form factor (SFF) are widely expected to accurately identify ``ergodicity'', including the presence of underlying macroscopic symmetries, in generic quantum systems…
We prove that the eigenfunctions of quantum star graphs exhibit multifractal self-similar structure in certain specified circumstances. In the semiclassical regime, when the spectral parameter and the number of vertices tend to infinity, we…
We introduce and analyse ensembles of 2-regular random graphs with a tuneable distribution of short cycles. The phenomenology of these graphs depends critically on the scaling of the ensembles' control parameters relative to the number of…
Current quantum computing devices have different strengths and weaknesses depending on their architectures. This means that flexible approaches to circuit design are necessary. We address this task by introducing a novel space-efficient…
The form factor of a quantum graph is a function measuring correlations within the spectrum of the graph. It can be expressed as a double sum over the periodic orbits on the graph. We propose a scheme which allows one to evaluate the…
We study the spectral statistics of quantum (metric) graphs whose vertices are equipped with preferred orientation vertex conditions. When comparing their spectral statistics to those predicted by suitable random matrix theory ensembles,…
We propose a scheme to distribute graph states over quantum networks in the presence of noise in the channels and in the operations. The protocol can be implemented efficiently for large graph sates of arbitrary (complex) topology. We…
A general approach is presented that offers exact analytical solutions for the time-evolution of quantum spin systems during parametric waveforms of arbitrary functions of time. The proposed method utilises the \emph{path-sum} method that…
We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…
We address quantum spatial search on graphs and its implementation by continuous-time quantum walks in the presence of dynamical noise. In particular, we focus on search on the complete graph and on the star graph of order $N$, proving that…
In the past years, many quantum algorithms have been proposed to tackle hard combinatorial problems. In particular, the Maximum Independent Set (MIS) is a known NP-hard problem that can be naturally encoded in Rydberg atom arrays. By…
Spectral characterization of graphs is an important topic in spectral graph theory, which has received a lot of attention from researchers in recent years. It is generally very hard to show a given graph to be determined by its spectrum.…
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 give a derivation of quantum spectral curve (QSC) - a finite set of Riemann-Hilbert equations for exact spectrum of planar N=4 SYM theory proposed in our recent paper Phys.Rev.Lett. 112 (2014). We also generalize this construction to all…
The spectral curve is the key ingredient in the modern theory of classical integrable systems. We develop a construction of the ``quantum spectral curve'' and argue that it takes the analogous structural and unifying role on the quantum…
The spectral form factor is a powerful probe of quantum chaos that diagnoses the statistics of energy levels, but is blind to other features of a theory such as matrix elements of operators or OPE coefficients in conformal field theories.…
A method for estimating the spectral gap along with higher eigenvalues of nonequilateral quantum graphs has been introduced by Amini and Cohen-Steiner recently: it is based on a new transference principle between discrete and continuous…
Spectral graph theory is a branch of mathematics that studies the relationships between the eigenvectors and eigenvalues of Laplacian and adjacency matrices and their associated graphs. The Variational Quantum Eigensolver (VQE) algorithm…
Despite the rich and fruitful history of the integrability approach to string theory on the $AdS_3\times S^3\times T^4$ background, it has not been possible to extract many concrete predictions from integrability, except in a strict…
Trace formulas play a central role in the study of spectral geometry and in particular of quantum graphs. The basis of our work is the result by Kurasov which links the Euler characteristic $\chi$ of metric graphs to the spectrum of their…