Related papers: Quantum graph as a quantum spectral filter
The quantum Hall effect is a remarkable manifestation of quantized transport in a two-dimensional electron gas. Given its technological relevance, it is important to understand its development in realistic nanoscale devices. In this work we…
In the study of covariant wave equations, linear gravity manifests itself through the metric deviation $\gamma_{\mu\nu}$ and a two-point vector potential $K_{\lambda}$ itself constructed from $\gamma_{\mu\nu}$ and its derivatives. The…
Quantum illumination is an entanglement-based target detection protocol that provides quantum advantages despite the presence of entanglement-breaking noise. However, the advantage of traditional quantum illumination protocols is limited to…
We present a brief overview of the transport of quantum light across a one-dimensional waveguide which is integrated with a periodic string of quantum-scale dipoles. We demonstrate a scheme to implement transparency by suitably tuning the…
We present a mapping of dynamical graphs and, in particular, the graphs used in the Quantum Graphity models for emergent geometry, into an Ising hamiltonian on the line graph of a complete graph with a fixed number of vertices. We use this…
In order to obtain perfect state transfer between two sites in a network of interacting qubits, their corresponding vertices in the underlying graph must satisfy a combinatorial property called strong cospectrality. Here we determine the…
Quantum graphs are defined by having a Laplacian defined on the edges of a metric graph with boundary conditions on each vertex such that the resulting operator, $\mathbf{L}$, is self-adjoint. We use Neumann boundary conditions although we…
We introduce Quantum Graph Neural Networks (QGNN), a new class of quantum neural network ansatze which are tailored to represent quantum processes which have a graph structure, and are particularly suitable to be executed on distributed…
Quantum networks require flying qubits that transfer information between the nodes. This may be implemented by means of single atoms (the nodes) that emit and absorb single photons (the flying qubits) and requires full control of photon…
This work develops a flexible and mathematically sound framework for the design and analysis of graph scattering networks with variable branching ratios and generic functional calculus filters. Spectrally-agnostic stability guarantees for…
Graph filters play a key role in processing the graph spectra of signals supported on the vertices of a graph. However, despite their widespread use, graph filters have been analyzed only in the deterministic setting, ignoring the impact of…
We introduce uniformly vertex-transitive graphs as vertex-transitive graphs satisfying a stronger condition on their automorphism groups, motivated by a problem which arises from a Sinkhorn-type algorithm. We use the derangement graph…
If $\Gamma$ is a graph for which every edge is in exactly one clique of order $\omega$, then one can form a new graph with vertex set equal to these cliques. This is a generalization of the line graph of $\Gamma$. We discover many general…
We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…
A random medium can serve as a controllable arbitrary spectral filter with spectral resolution determined by the inverse of the interaction time of the light in the medium. We use wavefront shaping to implement an arbitrary spectral…
One of the most crucial challenges in graph signal processing is the sampling of bandlimited graph signals, i.e., signals that are sparse in a well-defined graph Fourier domain. So far, the prior art is mostly focused on (sub)sampling…
We analyze an experiment in which a thin wire is scanned across the overlap of two in phase photon beams. We find that unless the wire induces the formation of an interference pattern, the complementarity inequality is violated. Quantum…
The ground-state and the transport properties of graphene subject to the potential of in-plane charged impurities are studied. The screening of the impurity potential is shown to be nonlinear, producing a fractal structure of electron and…
Construction of graphs with equal eigenvalues (co-spectral graphs) is an interesting problem in spectral graph theory. Seidel switching is a well-known method for generating co-spectral graphs. From a matrix theoretic point of view, Seidel…
Graph states are used to represent mathematical graphs as quantum states on quantum computers. They can be formulated through stabilizer codes or directly quantum gates and quantum states. In this paper we show that a quantum graph neural…