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

Lecture notes in physics

Recent developments in quantum scattering theory

J. M. Combes

Published Jan 1, 1980• 2 citations
Publisher
DOI
10.1007/3-540-09964-6_296

Related papers

Some recent developments in n-particle scattering theory

F. S. Levin

Nuclear Physics A•Feb 1, 1981•23 citations

Elements of Quantum Scattering Theory

Brian J. McParland

Springer eBooks•Aug 6, 2013•1 citation

Transfermatrix in scattering theory: a survey of basic properties and recent developments

Ali MOSTAFAZADEH

We give a pedagogical introduction to time-independent scattering theory in one dimension focusing on the basic properties and recent applications of transfer matrices. In particular, we begin surveying some basic notions of potential scattering such as transfer matrix and its analyticity, multidelta-function and locally periodic potentials, Jost solutions, spectral singularities and their time-reversal, and unidirectional reflectionlessness and invisibility. We then offer a simple derivation of the Lippmann-Schwinger equation and the Born series, and discuss the Born approximation. Next, we outline a recently developed dynamical formulation of time-independent scattering theory in one dimension. This formulation relates the transfer matrix and therefore the solution of the scattering problem for a given potential to the solution of the time-dependent Schrödinger equation for an effective nonunitary two-level quantum system. We providea self-containedtreatment of this formulationand some of its most important applications. Specifically, weuse it to devise a powerful alternative to the Born series and Born approximation, derive dynamical equations for the reflection and transmission amplitudes, discuss their application in constructing exact tunable unidirectionally invisible potentials, and use them to provide an exact solution for single-mode inverse scattering problems. The latter, which has important applications in designing optical devices with a variety of functionalities, amounts to providing an explicit construction for a finite-range complex potential whose reflection and transmission amplitudes take arbitrary prescribed values at any given wavenumber.

arXiv:2009.10507•TURKISH JOURNAL OF PHYSICS•Nov 6, 2020•43 citations

QUANTUM THEORY OF SCATTERING

A.S. Davydov

Elsevier eBooks•Jan 1, 1965•1 citation

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

Quantum scattering theory : selected papers

Marc Ross

Indiana University Press eBooks•Jan 1, 1964•1 citation
We give a pedagogical introduction to time-independent scattering theory in one dimension focusing on the basic properties and recent applications of transfer matrices. In particular, we begin surveying some basic notions of potential scattering such as transfer matrix and its analyticity, multidelta-function and locally periodic potentials, Jost solutions, spectral singularities and their time-reversal, and unidirectional reflectionlessness and invisibility. We then offer a simple derivation of the Lippmann-Schwinger equation and the Born series, and discuss the Born approximation. Next, we outline a recently developed dynamical formulation of time-independent scattering theory in one dimension. This formulation relates the transfer matrix and therefore the solution of the scattering problem for a given potential to the solution of the time-dependent Schrödinger equation for an effective nonunitary two-level quantum system. We providea self-containedtreatment of this formulationand some of its most important applications. Specifically, weuse it to devise a powerful alternative to the Born series and Born approximation, derive dynamical equations for the reflection and transmission amplitudes, discuss their application in constructing exact tunable unidirectionally invisible potentials, and use them to provide an exact solution for single-mode inverse scattering problems. The latter, which has important applications in designing optical devices with a variety of functionalities, amounts to providing an explicit construction for a finite-range complex potential whose reflection and transmission amplitudes take arbitrary prescribed values at any given wavenumber.
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