相关论文: Explicit Spectral formulae for scaling quantum gra…

We study signatures of quantum chaos in (1+1)D Quantum Field Theory (QFT) models. Our analysis is based on the method of Hamiltonian truncation, a numerical approach for the construction of low-energy spectra and eigenstates of QFTs that…

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 reinterpret the spectral dimension of spacetimes as the scaling of an effective self-energy transition amplitude in quantum field theory (QFT), when the system is probed at a given resolution. This picture has four main advantages: (a)…

Many standard linear algebra problems can be solved on a quantum computer by using recently developed quantum linear algebra algorithms that make use of block encodings and quantum eigenvalue/singular value transformations. A block encoding…

The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…

We initiate a systematic study of quantum properties of finite graphs, namely, quantum asymmetry, quantum symmetry, and quantum isomorphism. We define the Schmidt alternative for a class of graphs, which reveals to be a useful tool for…

The random walk formalism is used across a wide range of applications, from modelling share prices to predicting population genetics. Likewise quantum walks have shown much potential as a frame- work for developing new quantum algorithms.…

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…

Graph theory is important in information theory. We introduce a quantization process on graphs and apply the quantized graphs in quantum information. The quon language provides a mathematical theory to study such quantized graphs in a…

The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…

Quantum walks are powerful kernels in quantum computing protocols that possess strong capabilities in speeding up various simulation and optimisation tasks. One striking example is given by quantum walkers evolving on glued trees for their…

This article presents a novel and succinct algorithmic framework via alternating quantum walks, unifying quantum spatial search, state transfer and uniform sampling on a large class of graphs. Using the framework, we can achieve exact…

The most efficient automated way to construct a large class of quantum photonic experiments is via abstract representation of graphs with certain properties. While new directions were explored using Artificial intelligence and SAT solvers…

Explicit, exact periodic orbit expansions for individual eigenvalues exist for a subclass of quantum networks called regular quantum graphs. We prove that all linear chain graphs have a regular regime.

Spectroscopy underpins modern scientific discovery across diverse disciplines. While experimental spectroscopy probes material properties through scattering or radiation measurements, computational spectroscopy combines theoretical models…

Given a quantum graph $ \Gamma $, a finite symmetry group $ G $ acting on it and a representation $ R $ of $ G $, the quotient quantum graph $ \Gamma /R $ is described and constructed in the literature [1, 2, 18]. In particular, it was…

Quantum network is a set of nodes connected with channels, through which the nodes communicate photons and classical information. Classical structural complexity of a quantum network may be defined through its physical structure, i.e.…

Quantum Graph Neural Networks (QGNNs) represent a novel fusion of quantum computing and Graph Neural Networks (GNNs), aimed at overcoming the computational and scalability challenges inherent in classical GNNs that are powerful tools for…

It is well established that spectral graph neural networks (GNNs) can universally approximate node signals; however, their expressive power remains bounded by the 1-dimensional Weisfeiler-Lehman test, which is mirrored in their lack of…

We study a certain class of classical one dimensional piecewise linear maps. For these systems we introduce an infinite family of Markov partitions into equal cells. The symbolic dynamics generated by these systems is described by…