Related papers: Inverse problems for quantum graph associated with…
We consider the problem of searching a general $d$-dimensional lattice of $N$ vertices for a single marked item using a continuous-time quantum walk. We demand locality, but allow the walk to vary periodically on a small scale. By…
We consider the Dirichlet-to-Neumann operator and the direct and inverse Calder\'on's mappings appearing in the Inverse Problem of recovering a smooth bounded and positive isotropic conductivity of a material filling a smooth bounded domain…
Symplectic geometry plays an increasingly important role in mathematics, physics and applications, and naturally gives rise to interesting matrix families and properties. One of these is the notion of symplectic eigenvalues, whose existence…
We develop a unified formulation of the quantum inverse scattering method for lattice vertex models associated to the non-exceptional $A^{(2)}_{2r}$, $A^{(2)}_{2r-1}$, $B^{(1)}_r$, $C^{(1)}_r$, $D^{(1)}_{r+1}$ and $D^{(2)}_{r+1}$ Lie…
We describe inverse scattering for the matrix Schroedinger operator with general selfadjoint boundary conditions at the origin using the Marchenko equation. Our approach allows the recovery of the potential as well as the boundary…
We demonstrate that a quantum annealer can be used to solve the NP-complete problem of graph partitioning into subgraphs containing Hamiltonian cycles of constrained length. We present a method to find a partition of a given directed graph…
Given a unitary operator in a finite dimensional complex Hilbert space, its unitary reduction to a subspace is defined. The application to quantum graphs is discussed. It is shown how the reduction allows to generate the scattering matrices…
We present the exact solution to a one-dimensional multicomponent quantum lattice model interacting by an exchange operator which falls off as the inverse-sinh-square of the distance. This interaction contains a variable range as a…
The inverse scattering problem is studied for the matrix Sturm-Liouville equation on the line. Necessary and sufficient conditions for the scattering data are obtained.
We consider the inverse scattering problem to reconstruct a local perturbation of a given inhomogeneous periodic layer in $\mathbb{R}^d$, $d=2,3$, using near field measurements of the scattered wave on an open set of the boundary above the…
This paper is concerned with time domain forward scattering and inverse scattering problems with a single moving point source as the emitter. Approximate solutions are provided for the forward scattering problem with a moving emitter.…
We propose quantum algorithms, purely quantum in nature, for calculating the determinant and inverse of an $(N-1)\times (N-1)$ matrix (depth is $O(N^2\log N)$) which is a simple modification of the algorithm for calculating the determinant…
We clarify the algebraic structure of continuous and discrete quasi-exactly solvable spectral problems by embedding them into the framework of the quantum inverse scattering method. The quasi-exactly solvable hamiltonians in one dimension…
Matching problems on 3D shapes and images are challenging as they are frequently formulated as combinatorial quadratic assignment problems (QAPs) with permutation matrix constraints, which are NP-hard. In this work, we address such problems…
It is well known that Maxwell equations can be expressed in a unitary Schrodinger-Dirac representation for homogeneous media. However, difficulties arise when considering inhomogeneous media. A Dyson map points to a unitary field qubit…
We present experimental and numerical results for the long-range fluctuation properties in the spectra of quantum graphs with chaotic classical dynamics and preserved time-reversal invariance. Such systems are generally believed to provide…
In this paper, we develop two approaches to investigation of inverse spectral problems for a new class of nonlocal operators on metric graphs. The Laplace differential operator is considered on a star-shaped graph with nonlocal integral…
We investigate quantum graphs with infinitely many vertices and edges without the common restriction on the geometry of the underlying metric graph that there is a positive lower bound on the lengths of its edges. Our central result is a…
In this paper we study the inverse eigenvector centrality problem on directed graphs: given a prescribed node centrality profile, we seek edge weights that realize it. Since this inverse problem generally admits infinitely many solutions,…
The inverse eigenvalue problem of a graph $G$ is the problem of characterizing all lists of eigenvalues of real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of $G$. The strong spectral property is a…