相关论文: Weakly Hadamard diagonalizable graphs and Quantum …

Metacirculants are a basic and well-studied family of vertex-transitive graphs, and weak metacirculants are generalizations of them. A graph is called a weak metacirculant if it has a vertex-transitive metacyclic automorphism group. This…

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…

An oriented circulant graph is called integral if all eigenvalues of its Hermitian adjacency matrix are integers. The main purpose of this paper is to investigate the existence of perfect state transfer ($\PST$ for short) and multiple state…

The formation of metallic nanofilaments bridging two electrodes across an insulator is a mechanism for resistive switching. Examples of such phenomena include atomic synapses, which constitute a distinct class of memristive devices whose…

We address the problem of computing a Minimal Dominating Set in highly dynamic distributed systems. We assume weak connectivity, i.e., the network may be disconnected at each time instant and topological changes are unpredictable. We make…

Motivated by the immense success of random walk and Markov chain methods in the design of classical algorithms, we consider_quantum_ walks on graphs. We analyse in detail the behaviour of unbiased quantum walk on the line, with the example…

We review two rigorous results on the transport properties of weakly interacting fermionic systems on $2d$ lattices, in the linear response regime. First, we discuss the universality of the longitudinal conductivity for interacting…

Effective low-energy theories represent powerful theoretical tools to reduce the complexity in modeling interacting quantum many-particle systems. However, common theoretical methods rely on perturbation theory, which limits their…

The "Hermitizability" problem of quantum theory is explained, discussed and illustrated via the discrete-lattice cryptohermitian quantum graphs. In detail, the description of the domain ${\cal D}$ of admissible parameters is provided for…

The connection between certain entangled states and graphs has been heavily studied in the context of measurement-based quantum computation as a tool for understanding entanglement. Here we show that this correspondence can be harnessed in…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

We define quantum automorphisms and isomorphisms of Hadamard matrices. We show that every Hadamard matrix of size $N\ge 4$ has quantum symmetries and that all Hadamard matrices of a fixed size are mutually quantum isomorphic. These results…

The transition matrix of a graph $G$ corresponding to the adjacency matrix $A$ is defined by $H(t):=\exp{\left(-itA\right)},$ where $t\in\mathbb{R}$. The graph is said to exhibit pretty good state transfer between a pair of vertices $u$ and…

Statistical distribution of energy levels for Dirac fermions confined in a quantum dot is studied numerically on the examples of triangular and hexagonal graphene flakes with random electrostatic potential landscape. When increasing the…

We study some spectral properties of a matrix that is constructed as a combination of a Laplacian and an adjacency matrix of simple graphs. The matrix considered depends on a positive parameter, as such we consider the implications in…

We demonstrate how the inverse scattering problem of a quantum star graph can be solved by means of diagonalization of Hermitian unitary matrix when the vertex coupling is of the scale invariant (or F\"ul\H{o}p-Tsutsui) form. This enables…

This paper presents a novel methodology that transforms discrete-time quantum walks into a graph embedding technique, offering a fresh perspective on graph representation methods.Through mathematical manipulations, the approach of this…

The $\alpha$-Hermitian adjacency matrix $H_\alpha$ of a mixed graph $X$ has been recently introduced. It is a generalization of the adjacency matrix of unoriented graphs. In this paper, we consider a special case of the complex number…

A graph polynomial $P$ is weakly distinguishing if for almost all finite graphs $G$ there is a finite graph $H$ that is not isomorphic to $G$ with $P(G)=P(H)$. It is weakly distinguishing on a graph property $\mathcal{C}$ if for almost all…

In quantum computing, the connectivity of qubits placed on two-dimensional chips limits the scalability and functionality of solid-state quantum computers. This paper presents two approaches to constructing complex quantum networks from…