相关论文: Integrability in 1D Quantum Chaos

Many computational problems are unchanged under some symmetry operation. In classical machine learning, this can be reflected with the layer structure of the neural network. In quantum machine learning, the ansatz can be tuned to correspond…

We present quantum algorithms for various problems related to graph connectivity. We give simple and query-optimal algorithms for cycle detection and odd-length cycle detection (bipartiteness) using a reduction to st-connectivity.…

Dimensional regularization of Euclidean momentum space integrals is a highly successful technique in renormalization of quantum field theories. While it yields a straightforward algorithmic method, with which to evaluate diagrams beyond…

Theoretical expressions for the distribution of the ratio of consecutive level spacings for quantum systems with transiting dynamics remain unknown. We propose a family of one-parameter distributions $P(r)\equiv P(r;\beta)$, where…

Recently it has been shown that the evolution of open quantum systems may be ``unraveled'' into individual ``trajectories,'' providing powerful numerical and conceptual tools. In this letter we use quantum trajectories to study mesoscopic…

Since the introduction of the Hermitian adjacency matrix for digraphs, interest in so-called complex unit gain graphs has surged. In this work, we consider gain graphs whose spectra contain the minimum number of two distinct eigenvalues.…

The fundamental correspondence between quantum chaotic single-particle systems and random matrix theory is well-understood via periodic orbit theory. In contrast, we show that many-body systems with explicit subsystem structure possess…

Advances in recent years have made it possible to explore quantum dots as a viable technology for scalable quantum information processing. Charge qubits for example can be realized in the lowest bound states of coupled quantum dots and the…

We evaluate the variance of coefficients of the characteristic polynomial for binary quantum graphs using a dynamical approach. This is the first example where a spectral statistic can be evaluated in terms of periodic orbits for a system…

As a generalization of orbit-polynomial and distance-regular graphs, we introduce the concept of a quotient-polynomial graph. In these graphs every vertex $u$ induces the same regular partition around $u$, where all vertices of each cell…

We study scarring phenomena in open quantum systems. We show numerical evidence that individual resonance eigenstates of an open quantum system present localization around unstable short periodic orbits in a similar way as their closed…

In this paper, we study the $q$-distance matrix for a distance-regular graph and show that the $q$-distance matrix of a distance-regular graph with classical parameters ($D, q, \alpha, \beta$) has exactly three distinct eigenvalues, of…

We give a new approach to handling hypergraph regularity. This approach allows for vertex-by-vertex embedding into regular partitions of hypergraphs, and generalises to regular partitions of sparse hypergraphs. We also prove a corresponding…

A graph is called normal if its vertex set can be covered by cliques and also by stable sets, such that every such clique and stable set have non-empty intersection. This notion is due to Korner, who introduced the class of normal graphs as…

Finding hidden layers in complex networks is an important and a non-trivial problem in modern science. We explore the framework of quantum graphs to determine whether concealed parts of a multi-layer system exist and if so then what is…

These are some informal remarks on quadratic orbital networks over finite fields. We discuss connectivity, Euler characteristic, number of cliques, planarity, diameter and inductive dimension. We find a non-trivial disconnected graph for…

In this paper we investigate orders, longest cycles and the number of cycles of automorphisms of finite vertex-transitive graphs. In particular, we show that the order of every automorphism of a connected vertex-transitive graph with $n$…

By folding an autonomous system of rational equations in the plane to a scalar difference equation, we show that the rational system has coexisting periodic orbits of all possible periods as well as stable aperiodic orbits for certain…

We obtain an explicit characterization of linear maps, in particular, quantum channels, which are covariant with respect to an irreducible representation ($U$) of a finite group ($G$), whenever $U \otimes U^c$ is simply reducible (with…

The quest for optimal/stable paths in graphs has gained attention in a few practical or theoretical areas. To take part in this quest this chapter adopts an equilibrium-oriented approach that is abstract and general: it works with…