Related papers: A Fermi golden rule for quantum graphs
We show that after a quantum quench of the parameter controlling the number of particles in a Fermi-Hubbard model on scale free graphs, the distribution of energy modes follows a power law dependent on the quenched parameter and the…
The quantum phase transitions of metals have been extensively studied in the rare-earth "heavy electron" materials, the cuprates, and related compounds. The Fermi surface of the metal often has different shapes in the states well away from…
In order to achieve quantum interference of free electrons inside a solid, we have modified the geometry of the solid so that de Broglie waves interfere destructively inside the solid. Quantum interference of de Broglie waves leads to a…
With the rapid development of nanophotonics and cavity quantum electrodynamics, there has been growing interest in how confined electromagnetic fields modify fundamental molecular processes such as electron transfer. In this paper, we…
The classical Bernoulli and baker maps are two simple models of deterministic chaos. On the level of ensembles, it has been shown that the time evolution operator for these maps admits generalized spectral representations in terms of…
Graph states are key resources for measurement-based quantum computing, which is particularly promising for photonic systems. Fusions are probabilistic Bell state measurements, measuring pairs of parity operators of two qubits. Fusions can…
Consider a sequence of finite regular graphs (GN) converging, in the sense of Benjamini-Schramm, to the infinite regular tree. We study the induced quantum graphs with equilateral edge lengths, Kirchhoff conditions (possibly with a non-zero…
We present a simple method for the calculation of reaction rates in the Fermi golden-rule limit, which accurately captures the effects of tunnelling and zero-point energy. The method is based on a modification of the recently proposed…
Though the classical treatment of spontaneous decay leads to an exponential decay law, it is well known that this is an approximation of the quantum mechanical result which is a non-exponential at very small and large times for narrow…
Scalable quantum computing and communication requires the protection of quantum information from the detrimental effects of decoherence and noise. Previous work tackling this problem has relied on the original circuit model for quantum…
We study the spectrum of adjacency matrices of random graphs. We develop two techniques to lower bound the mass of the continuous part of the spectral measure or the density of states. As an application, we prove that the spectral measure…
Random pure states of multi-partite quantum systems, associated with arbitrary graphs, are investigated. Each vertex of the graph represents a generic interaction between subsystems, described by a random unitary matrix distributed…
We consider the linear damped wave equation on finite metric graphs and analyse its spectral properties with an emphasis on the asymptotic behaviour of eigenvalues. In the case of equilateral graphs and standard coupling conditions we show…
We present a study of the coloring problem (antiferromagnetic Potts model) of random regular graphs, submitted to quantum fluctuations induced by a transverse field, using the quantum cavity method and quantum Monte-Carlo simulations. We…
In a previous version of this document we misinterpreted the runtime of a part of the described algorithm. Indeed, the runtime is not better than the Grover-Algorithm. We therefor withdraw this work. We present a novel algorithmic approach…
In this brief paper we present some results on creating and manipulating spectral gaps for a (regular) quantum graph by inserting appropriate internal structures into its vertices. Complete proofs and extensions of the results are planned…
A general treatment of the spectral problem of quantum graphs and tight-binding models in finite Hilbert spaces is given. The direct spectral problem and the inverse spectral problem are written in terms of simple algebraic equations…
Quantum computing holds immense promise for simulating quantum systems, a critical task for advancing our understanding of complex quantum phenomena. One of the primary goals in this domain is to accurately approximate the ground state of…
We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…
We develop a unified quantum framework for subgraph counting in graphs. We encode a graph on $N$ vertices into a quantum state on $2\lceil \log_2 N \rceil$ working qubits and $2$ ancilla qubits using its adjacency list, with worst-case gate…