相关论文: Explicitly solvable cases of one-dimensional quant…

An approach to the solution of NP-complete problems based on quantum computing and chaotic dynamics is proposed. We consider the satisfiability problem and argue that the problem, in principle, can be solved in polynomial time if we combine…

We present an infinite sequence of finite graphs with trivial automorphism group and non-trivial quantum automorphism group. These are the first known examples of graphs with this property. Moreover, to the best of our knowledge, these are…

We study topological entropy of exactly Devaney chaotic maps on totally regular continua, i.e. on (topologically) rectifiable curves. After introducing the so-called P-Lipschitz maps (where P is a finite invariant set) we give an upper…

In laboratory and numerical experiments, physical quantities are known with a finite precision and described by rational numbers. Based on this, we deduce that quantum control problems both for open and closed systems are in general not…

We analyze spectral properties of a quantum graph in the form of a ring chain with a $\delta$ coupling in the vertices exposed to a homogeneous magnetic field perpendicular to the graph plane. We find the band spectrum in the case when the…

Owing to their interesting spectral properties, the synthetic crystals over lattices other than regular Euclidean lattices, such as hyperbolic and fractal ones, have attracted renewed attention, especially from materials and meta-materials…

Recently normalized Laplacian matrices of graphs are studied as density matrices in quantum mechanics. Separability and entanglement of density matrices are important properties as they determine the nonclassical behavior in quantum…

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…

Chaotic dynamics can be quite heterogeneous in the sense that in some regions the dynamics are unstable in more directions than in other regions. When trajectories wander between these regions, the dynamics is complicated. We say a chaotic…

We introduce an analytical solution to the one of the most familiar problems from the elementary quantum mechanics textbooks. The following discussion provides simple illustrations to a number of general concepts of quantum chaology, along…

Spatio-temporally chaotic dynamics of a classical field can be described by means of an infinite hierarchy of its unstable spatio-temporally periodic solutions. The periodic orbit theory yields the global averages characterizing the chaotic…

We introduce a new model for investigating spectral properties of quantum graphs, a quantum circulant graph. Circulant graphs are the Cayley graphs of cyclic groups. Quantum circulant graphs with standard vertex conditions maintain…

For vertex and edge connectivity we construct infinitely many pairs of regular graphs with the same spectrum, but with different connectivity.

A graph is said to be globally rigid if almost all embeddings of the graph's vertices in the Euclidean plane will define a system of edge-length equations with a unique (up to isometry) solution. In 2007, Jackson, Servatius and Servatius…

Inspired by notorious combinatorial optimization problems on graphs, in this paper we consider a series of related problems defined using a metric space and topology determined by a graph. Particularly, we present the Independent Set,…

We define and study quantum permutations of infinite sets. This leads to discrete quantum groups which can be viewed as infinite variants of the quantum permutation groups introduced by Wang. More precisely, the resulting quantum groups…

To prove presence of chaos for fractals, a new mathematical concept of abstract similarity is introduced. As an example, the space of symbolic strings on a finite number of symbols is proved to possess the property. Moreover, Sierpinski…

There exists an exact relationship between the quasi-exactly solvable problems of quantum mechanics and models of square and rectangular random complex matrices. This relationship enables one to reduce the problem of constructing…

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…

A new family of strongly regular graphs, called the general symplectic graphs $Sp(2\nu, q)$, associated with nonsingular alternate matrices is introduced. Their parameters as strongly regular graphs, their chromatic numbers as well as their…