Related papers: Inverse scattering problem for quantum graph verti…
We consider the inverse scattering problem associated with any number of interacting modes in one-dimensional structures. The coupling between the modes is contradirectional in addition to codirectional, and may be distributed continuously…
We calculate the S-matrix correlation function for chaotic scattering on quantum graphs and show that it agrees with that of random--matrix theory (RMT). We also calculate all higher S-matrix correlation functions in the Ericson regime.…
We explore algebraic and spectral properties of weighted graphs containing twin vertices that are useful in quantum state transfer. We extend the notion of adjacency strong cospectrality to arbitrary Hermitian matrices, with focus on the…
In this paper, we consider the inverse scattering problem associated with an inhomogeneous media with a conductive boundary. First, we discuss the inverse conductivity problem of reconstructing the conductivity parameter from scattering…
This paper addresses the inverse obstacle scattering problem of simultaneously reconstructing the obstacle geometry and boundary conditions from multi-frequency near-field backscattering data. We first establish rigorous high-frequency…
A novel numerical method for solving inverse scattering problem with fixed-energy data is proposed. The method contains a new important concept: the stability index of the inversion problem. This is a number, computed from the data, which…
We construct canonical quantum fields which propagate on a star graph modeling a quantum wire. The construction uses a deformation of the algebra of canonical commutation relations, encoding the interaction in the vertex of the graph. We…
We find that a gauged matrix model of rectangular fermionic matrices (a matrix version of the fermion harmonic oscillator) realizes a quantum hall droplet with manifest particle-hole symmetry. The droplet consists of free fermions on the…
We address the "inverse problem" for discrete geometry, which consists in determining whether, given a discrete structure of a type that does not in general imply geometrical information or even a topology, one can associate with it a…
The Hubbard model may be the simplest model of particles interacting on a lattice, but simulation of its dynamics remains beyond the reach of current numerical methods. In this article, we show that general quantum computations can be…
The problem of diagonalizing a class of complicated matrices, to be called ultrametric matrices, is investigated. These matrices appear at various stages in the description of disordered systems with many equilibrium phases by the technique…
We study an inverse spectral problem for arbitrary order ordinary differential equations on compact star-type graphs when differential equations have regular singularities at boundary vertices. As the main spectral characteristics we…
We study how quantum walks can be used to find structural anomalies in graphs via several examples. Two of our examples are based on star graphs, graphs with a single central vertex to which the other vertices, which we call external…
Quantum computing provides a novel avenue towards simulating dynamical phenomena, and, in particular, scattering processes relevant for exploring the structure of matter. However, preparing and evolving particle wave packets on a quantum…
We consider the inverse problem of recovering the optical properties of a highly-scattering medium from acousto-optic measurements. Using such measurements, we show that the scattering and absorption coefficients of the radiative transport…
We address the inverse Frobenius--Perron problem: given a prescribed target distribution $\rho$, find a deterministic map $M$ such that iterations of $M$ tend to $\rho$ in distribution. We show that all solutions may be written in terms of…
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…
We show that in one dimension the transfer matrix M of any scattering potential v coincides with the S-matrix of an associated time-dependent non-Hermitian 2 x 2 matrix Hamiltonian H(\tau). If v is real-valued, H(\tau) is pseudo-Hermitian…
The numerical algorithm of the inverse quantum scattering is developed. This algorithm is based on the Marchenko theory, and includes three steps. The first one is the algebraic Pade approximation of the unitary S-matrix, what is realized…
This paper concerns some inverse eigenvalue problems of the quadratic $\star$-(anti)-palindromic system $Q(\lambda)=\lambda^2 A_1^{\star}+\lambda A_0 + \epsilon A_1$, where $\epsilon=\pm 1$, $A_1, A_0 \in \mathbb{C}^{n\times n}$,…