Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:1104.1048 · Physical Review A

Inverse scattering problem for quantum graph vertices

Taksu Cheon, Pavel Exner, Ondřej Turek

Published Jun 29, 2011• 4 citations
arXivHTMLPDF

Abstract

We demonstrate how the inverse scattering problem of a quantum star graph can be solved by means of diagonalization of the Hermitian unitary matrix when the vertex coupling is of the scale-invariant (or F\"ul\"op-Tsutsui) form. This enables the construction of quantum graphs with desired properties in a tailor-made fashion. The procedure is illustrated on the example of quantum vertices with equal transmission probabilities.

DOI
10.1103/physreva.83.062715

Related papers

Bosonization and scale invariance on quantum wires

Brando Bellazzini, Mihail Mintchev, P. Sorba

We develop a systematic approach to bosonization and vertex algebras on quantum wires of the form of star graphs. The related bosonic fields propagate freely in the bulk of the graph, but interact at its vertex. Our framework covers all possible interactions preserving unitarity. Special attention is devoted to the scale invariant interactions, which determine the critical properties of the system. Using the associated scattering matrices, we give a complete classification of the critical points on a star graph with any number of edges. Critical points where the system is not invariant under wire permutations are discovered. By means of an appropriate vertex algebra we perform the bosonization of fermions and solve the massless Thirring model. In this context we derive an explicit expression for the conductance and investigate its behavior at the critical points. A simple relation between the conductance and the Casimir energy density is pointed out.

arXiv:hep-th/0611090•Journal of Physics A Mathematical and Theoretical•Feb 21, 2007•67 citations

Scattering theory and quantum walks

Mark S. Hillery, Edgar Feldman

We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through the graph, to the other. The particle propagates freely on the half lines but is scattered at each vertex in the original graph. The probability of starting on one line and reaching the other after n steps can be expressed in terms of the transmission amplitude for the graph. An example is presented. Classical random walks on graphs can be used to construct algorithms that solve 2-SAT, graph connectivity problems, and for finding satsifying assignments for Boolean functions. A hope is that recently defined quantum walks will prove similarly useful in the development of quantum algorithms. In fact, it has recently been shown that it is possible to use a quantum walk to perform a search on the hypercube faster than can be done classically [1]. In this problem

•Dec 8, 2003•0 citations

Kirchhoff's rule for quantum wires. II. The inverse problem with possible applications to quantum computers

Vadim V. Kostrykin, Robert Schrader

In this article we continue our investigations of one particle quantum scattering theory for Schroedinger operators on a set of connected (idealized one-dimensional) wires forming a graph with an arbitrary number of open ends. The Hamiltonian is given as minus the Laplace operator with suitable linear boundary conditions at the vertices (the local Kirchhoff law). In ``Kirchhoff's rule for quantum wires'' [J. Phys. A: Math. Gen. 32, 595 - 630 (1999)] we provided an explicit algebraic expression for the resulting (on-shell) S-matrix in terms of the boundary conditions and the lengths of the internal lines and we also proved its unitarity. Here we address the inverse problem in the simplest context with one vertex only but with an arbitrary number of open ends. We provide an explicit formula for the boundary conditions in terms of the S-matrix at a fixed, prescribed energy. We show that any unitary $n\times n$ matrix may be realized as the S-matrix at a given energy by choosing appropriate (unique) boundary conditions. This might possibly be used for the design of elementary gates in quantum computing. As an illustration we calculate the boundary conditions associated to the unitary operators of some elementary gates for quantum computers and raise the issue whether in general the unitary operators associated to quantum gates should rather be viewed as scattering operators instead of time evolution operators for a given time associated to a quantum mechanical Hamiltonian.

•Jan 1, 2000•158 citations

Kirchhoff's Rule for Quantum Wires. II: The Inverse Problem with Possible Applications to Quantum Computers

V. Kostrykin, R. Schrader

In this article we continue our investigations of one particle quantum scattering theory for Schrödinger operators on a set of connected (idealized one-dimensional) wires forming a graph with an arbitrary number of open ends. The Hamiltonian is given as minus the Laplace operator with suitable linear boundary conditions at the vertices (the local Kirchhoff law). In “Kirchhoff's rule for quantum wires” [J. Phys. A: Math. Gen. 32, 595–630 (1999)] we provided an explicit algebraic expression for the resulting (on-shell) S-matrix in terms of the boundary conditions and the lengths of the internal lines and we also proved its unitarity. Here we address the inverse problem in the simplest context with one vertex only but with an arbitrary number of open ends. We provide an explicit formula for the boundary conditions in terms of the S-matrix at a fixed, prescribed energy. We show that any unitary n × n matrix may be realized as the S-matrix at a given energy by choosing appropriate (unique) boundary conditions. This might possibly be used for the design of elementary gates in quantum computing. As an illustration we calculate the boundary conditions associated to the unitary operators of some elementary gates for quantum computers and raise the issue whether in general the unitary operators associated to quantum gates should rather be viewed as scattering operators instead of time evolution operators for a given time associated to a quantum mechanical Hamiltonian. We also suggest an approach by which the S-matrix in our context may be obtained from “scattering experiments”, another aspect of the inverse problem. Finally we extend our previous discussion, how our approach is related to von Neumann's theory of selfadjoint extensions.

arXiv:quant-ph/9910053•Fortschritte der Physik•Aug 1, 2000•110 citations

A star-graph model via operator extension

B. S. Pavlov

Abstract One usually assumes that the Schrödinger operator on a thin quantum network (“fattened graph”) can be simulated by the ordinary Schrödinger operator on the corresponding one-dimensional quantum graph. On the other hand, each quantum graph can be constructed of standard elements – star graphs. We prove that a thin star-shaped quantum network which consists of a compact domain and a few straight semi-infinite quantum wires, with a two-dimensional Schrödinger operator on it, can be simulated by the corresponding solvable model in form of a one-dimensional star graph: an outer space, with an ordinary Schrödinger operator on the leads, a resonance vertex supplied with an inner space and a finite matrix in it and an appropriate boundary condition connecting the inner and outer components of elements from the domain of the model. The model is (locally) quantitatively consistent: the scattering matrix of the model on a certain spectral interval serves an approximation of the scattering matrix of the network. The role of the constructed star-graph model as a “jump-start” in analytic perturbation procedure on continuous spectrum is discussed.

Mathematical Proceedings of the Cambridge Philosophical Society•Mar 1, 2007•17 citations

Non-Hermitian Star-shaped Quantum Graphs

Miloslav Znojil

A compact review is given, and a few new numerical results are added to the recent studies of the q-pointed one-dimensional star-shaped quantum graphs. These graphs are assumed endowedwith certain specific, manifestly non-Hermitian point interactions, localized either in the inner vertex or in all of the outer vertices and carrying, in the latter case, an interesting zero-inflow interpretation.

arXiv:1303.4331•Acta Polytechnica•Jan 3, 2013•2 citations
We demonstrate how the inverse scattering problem of a quantum star graph can be solved by means of diagonalization of the Hermitian unitary matrix when the vertex coupling is of the scale-invariant (or F"ul"op-Tsutsui) form. This enables the construction of quantum graphs with desired properties in a tailor-made fashion. The procedure is illustrated on the example of quantum vertices with equal transmission probabilities.
We develop a systematic approach to bosonization and vertex algebras on quantum wires of the form of star graphs. The related bosonic fields propagate freely in the bulk of the graph, but interact at its vertex. Our framework covers all possible interactions preserving unitarity. Special attention is devoted to the scale invariant interactions, which determine the critical properties of the system. Using the associated scattering matrices, we give a complete classification of the critical points on a star graph with any number of edges. Critical points where the system is not invariant under wire permutations are discovered. By means of an appropriate vertex algebra we perform the bosonization of fermions and solve the massless Thirring model. In this context we derive an explicit expression for the conductance and investigate its behavior at the critical points. A simple relation between the conductance and the Casimir energy density is pointed out.
We study quantum walks on general graphs from the point of view of scattering theory. For a general finite graph we choose two vertices and attach one half line to each. We are interested in walks that proceed from one half line, through the graph, to the other. The particle propagates freely on the half lines but is scattered at each vertex in the original graph. The probability of starting on one line and reaching the other after n steps can be expressed in terms of the transmission amplitude for the graph. An example is presented. Classical random walks on graphs can be used to construct algorithms that solve 2-SAT, graph connectivity problems, and for finding satsifying assignments for Boolean functions. A hope is that recently defined quantum walks will prove similarly useful in the development of quantum algorithms. In fact, it has recently been shown that it is possible to use a quantum walk to perform a search on the hypercube faster than can be done classically [1]. In this problem
In this article we continue our investigations of one particle quantum scattering theory for Schroedinger operators on a set of connected (idealized one-dimensional) wires forming a graph with an arbitrary number of open ends. The Hamiltonian is given as minus the Laplace operator with suitable linear boundary conditions at the vertices (the local Kirchhoff law). In ``Kirchhoff's rule for quantum wires'' [J. Phys. A: Math. Gen. 32, 595 - 630 (1999)] we provided an explicit algebraic expression for the resulting (on-shell) S-matrix in terms of the boundary conditions and the lengths of the internal lines and we also proved its unitarity. Here we address the inverse problem in the simplest context with one vertex only but with an arbitrary number of open ends. We provide an explicit formula for the boundary conditions in terms of the S-matrix at a fixed, prescribed energy. We show that any unitary n×nn\times nn×n matrix may be realized as the S-matrix at a given energy by choosing appropriate (unique) boundary conditions. This might possibly be used for the design of elementary gates in quantum computing. As an illustration we calculate the boundary conditions associated to the unitary operators of some elementary gates for quantum computers and raise the issue whether in general the unitary operators associated to quantum gates should rather be viewed as scattering operators instead of time evolution operators for a given time associated to a quantum mechanical Hamiltonian.
In this article we continue our investigations of one particle quantum scattering theory for Schrödinger operators on a set of connected (idealized one-dimensional) wires forming a graph with an arbitrary number of open ends. The Hamiltonian is given as minus the Laplace operator with suitable linear boundary conditions at the vertices (the local Kirchhoff law). In “Kirchhoff's rule for quantum wires” [J. Phys. A: Math. Gen. 32, 595–630 (1999)] we provided an explicit algebraic expression for the resulting (on-shell) S-matrix in terms of the boundary conditions and the lengths of the internal lines and we also proved its unitarity. Here we address the inverse problem in the simplest context with one vertex only but with an arbitrary number of open ends. We provide an explicit formula for the boundary conditions in terms of the S-matrix at a fixed, prescribed energy. We show that any unitary n × n matrix may be realized as the S-matrix at a given energy by choosing appropriate (unique) boundary conditions. This might possibly be used for the design of elementary gates in quantum computing. As an illustration we calculate the boundary conditions associated to the unitary operators of some elementary gates for quantum computers and raise the issue whether in general the unitary operators associated to quantum gates should rather be viewed as scattering operators instead of time evolution operators for a given time associated to a quantum mechanical Hamiltonian. We also suggest an approach by which the S-matrix in our context may be obtained from “scattering experiments”, another aspect of the inverse problem. Finally we extend our previous discussion, how our approach is related to von Neumann's theory of selfadjoint extensions.
Abstract One usually assumes that the Schrödinger operator on a thin quantum network (“fattened graph”) can be simulated by the ordinary Schrödinger operator on the corresponding one-dimensional quantum graph. On the other hand, each quantum graph can be constructed of standard elements – star graphs. We prove that a thin star-shaped quantum network which consists of a compact domain and a few straight semi-infinite quantum wires, with a two-dimensional Schrödinger operator on it, can be simulated by the corresponding solvable model in form of a one-dimensional star graph: an outer space, with an ordinary Schrödinger operator on the leads, a resonance vertex supplied with an inner space and a finite matrix in it and an appropriate boundary condition connecting the inner and outer components of elements from the domain of the model. The model is (locally) quantitatively consistent: the scattering matrix of the model on a certain spectral interval serves an approximation of the scattering matrix of the network. The role of the constructed star-graph model as a “jump-start” in analytic perturbation procedure on continuous spectrum is discussed.