Related papers: Quantum graph as a quantum spectral filter
Taking nonlinear effect into account, we study theoretically the transmission properties of photons in a one-dimensional coupled cavities, the cavity located at the center of the cavity array is coupled to a two-level system. By the…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
Using tangent bundle geometry we construct an equivalent reformulation of classical field theory on flat spacetimes which simultaneously encodes the perspectives of multiple observers. Its generalization to curved spacetimes realizes a new…
Quantum walks are at the heart of modern quantum technologies. They allow to deal with quantum transport phenomena and are an advanced tool for constructing novel quantum algorithms. Quantum walks on graphs are fundamentally different from…
Scattering in complex media scrambles light, thus obscuring images and limiting applications from astronomy to microscopy. Existing computational and wavefront-shaping methods treat scattering as a linear optical-wave inversion problem that…
Quantum channels describe the most general dynamics of open quantum systems. A quantum channel, as a linear map on vectorized quantum states, can be represented by a single matrix, whose spectrum is called the channel spectrum. Here we…
In this article we formulate and discuss one particle quantum scattering theory on an arbitrary finite graph with $n$ open ends and where we define the Hamiltonian to be (minus) the Laplace operator with general boundary conditions at the…
We consider symmetric powers of a graph. In particular, we show that the spectra of the symmetric square of strongly regular graphs with the same parameters are equal. We also provide some bounds on the spectra of the symmetric squares of…
This paper proposes a class of $M$-channel spectral graph filter banks with a symmetric structure, that is, the transform has sampling operations and spectral graph filters on both the analysis and synthesis sides. The filter banks achieve…
Neutral atom technology has steadily demonstrated significant theoretical and experimental advancements, positioning itself as a front-runner platform for running quantum algorithms. One unique advantage of this technology lies in the…
Studying the spectral theory of Schroedinger operator on metric graphs (also known as quantum graphs) is advantageous on its own as well as to demonstrate key concepts of general spectral theory. There are some excellent references for this…
A quantum fluid model is used to describe the interacion of a nondegenerate cold relativistic electron beam with an intense optical wiggler taking into account the beam space-charge potential and photon recoil effect. A nonlinear set of…
We analyse the quantum backflow effect and extend it, as a limiting constraint to its spatial extent, for scattering situations in the presence of a purely transmitting discontinuous jump-defect. Analytical and numerical comparisons are…
We discuss approximations of the vertex coupling on a star-shaped quantum graph of $n$ edges in the singular case when the wave functions are not continuous at the vertex and no edge-permutation symmetry is present. It is shown that the…
Quantum effects are known to provide an advantage in particle transfer across networks. In order to achieve this advantage, requirements on both a graph type and a quantum system coherence must be found. Here we show that the process of…
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.…
Based on the measurement of quantum correlation functions, the quantum statistical properties of spectral measurements are studied for broadband radiation fields. The spectral filtering of light before its detection is compared with the…
A homomorphism from a graph $X$ to a graph $Y$ is an adjacency preserving mapping $f:V(X) \rightarrow V(Y)$. We consider a nonlocal game in which Alice and Bob are trying to convince a verifier with certainty that a graph $X$ admits a…
We investigate the propagation of a massless scalar field on a star graph, modeling the junction of $n$ quantum wires. The vertex of the graph is represented by a point-like impurity (defect), characterized by a one-body scattering matrix.…
Let $\Gamma$ be an arbitrary $\mathbb{Z}^n$-periodic metric graph, which does not coincide with a line. We consider the Hamiltonian $\mathcal{H}_\varepsilon$ on $\Gamma$ with the action $-\varepsilon^{-1}{\mathrm{d}^2/\mathrm{d} x^2}$ on…