相关论文: Weakly Hadamard diagonalizable graphs and Quantum …
Using the two way distance, we introduce the concepts of weak metric dimension of a strongly connected digraph $\Gamma$. We first establish lower and upper bounds for the number of arcs in $\Gamma$ by using the diameter and weak metric…
In a recent work we have introduced a novel approach to study the effect of weak non-linearities in the transfer function on the information transmitted by an analogue channel, by means of a perturbative diagrammatic expansion. We extend…
We introduce and study the classical and quantum mechanics of certain non hyperbolic maps on the unit square. These maps are modifications of the usual baker's map and their behaviour ranges from chaotic motion on the whole measure to chaos…
In 2015, Archdeacon proposed the notion of Heffter arrays in view of its connection to several other combinatorial objects. In the same paper he also presented the following variant. A weak Heffter array $\mathrm{W}\mathrm{H}(m,n;h,k)$ is…
Motivated by discrete Laplacian differential operators with various accuracy orders in numerical analysis, we introduce new matrices attached to a simple graph that can be considered graph Laplacians with higher accuracy. In particular, we…
We adapt the transfer matrix ($\T$-matrix) method originally designed for one-dimensional quantum mechanical problems to solve the circularly symmetric two-dimensional problem of graphene quantum dots. In similarity to one-dimensional…
The graph Laplacian is an important tool in Graph Signal Processing (GSP) as its eigenvalue decomposition acts as an analogue to the Fourier transform and is known as the Graph Fourier Transform (GFT). The line graph has a GFT that is a…
We present a symbolic decomposition of the Pearson chi-square statistic with unequal cell probabilities, by presenting Hadamard-type matrices whose columns are eigenvectors of the variance-covariance matrix of the cell counts. All of the…
We have generalised the concept of graph states to what we have called mixed graph states, which we define in terms of mixed graphs, that is graphs with both directed and undirected edges, as the density matrix stabilized by the associated…
We consider the dynamics of relativistic spin-half particles in quantum graphs with transparent branching points. The system is modeled by combining the quantum graph concept with the one of transparent boundary conditions applied to the…
This paper is an introduction to diagrammatic methods for representing quantum processes and quantum computing. We review basic notions for quantum information and quantum computing. We discuss topological diagrams and some issues about…
We analyze the propagation of quantum states in the presence of weak disorder. In particular, we investigate the reliable transmittance of quantum states, as potential carriers of quantum information, through disorder-perturbed waveguides.…
This paper is a sequel to the work of Bhattacharjya et al.\ (J. Phys. A-Math. 57.33: 335303, https://doi.org/10.1088/1751-8121/ad6653) on quantum state transfer on blow-up graphs, where instead of the adjacency matrix, we take the Laplacian…
We discuss the concept of connection states (or connection matrices) that describe posterior ensembles, post-selected according to the outcomes of a quantum measurement. Connection matrices allow one to obtain results of any weak and some…
A one-dimensional quantum system with off diagonal disorder, consisting of a sample of conducting regions randomly interspersed within potential barriers is considered. Results mainly concerning the large $N$ limit are presented. In…
The eigenvalues of the Laplacian matrix for a class of directed graphs with both positive and negative weights are studied. First, a class of directed signed graphs is investigated in which one pair of nodes (either connected or not) is…
We prove that estimating the ground state energy of a translationally-invariant, nearest-neighbour Hamiltonian on a 1D spin chain is QMAEXP-complete, even for systems of low local dimension (roughly 40). This is an improvement over the best…
A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot product of every two distinct columns takes at most two values. This definition was introduced by Kharaghani and Suda in 2019, although…
This paper discusses continuous-time quantum walks and asymptotic state transfer in graphs with an involution. By providing quantitative bounds on the eigenvectors of the Hamiltonian, it provides an approach to achieving high-fidelity state…
A weakly distance-regular digraph is 3-equivalenced if its attached association scheme is 3-equivalenced. In this paper, we classify the family of such digraphs under the assumption of the commutativity.