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:0708.0839 · Journal of Physics A Mathematical and Theoretical

Quantum graphs where back-scattering is prohibited

J M Harrison, U Smilansky, B Winn

Published Nov 6, 2007• 28 citations
arXivHTMLPDF

Abstract

We describe a new class of scattering matrices for quantum graphs in which back-scattering is prohibited. We discuss some properties of quantum graphs with these scattering matrices and explain the advantages and interest in their study. We also provide two methods to build the vertex scattering matrices needed for their construction.
DOI
10.1088/1751-8113/40/47/010

Related papers

Inverse scattering problem for quantum graph vertices

Taksu Cheon, Pavel Exner, Ondřej Turek

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.

arXiv:1104.1048•Physical Review A•Jun 29, 2011•5 citations

Direct computation of scattering matrices for general quantum graphs

Vincent Caudrelier, E. Ragoucy

arXiv:0907.5359•Nuclear Physics B•Oct 14, 2009•13 citations

Unitary and open scattering quantum walks on graphs

Alain Joye

In this paper, we consider a class of Unitary Quantum Walks on arbitrary graphs, parameterized by a family of scattering matrices. These Scattering Quantum Walks model the discrete dynamics of a system on the graph’s edges, where a scattering process at the vertices is governed by the scattering matrices assigned to each vertex. We show the Scattering Quantum Walks encompass several known Quantum Walks. We further introduce two classes of Scattering Open Quantum Walks on arbitrary graphs, also parameterized by scattering matrices: one defined on the edges, the other on the vertices of the graph. We show these walks give rise to proper quantum channels and describe their main spectral and dynamical properties, relating them to naturally associated classical Markov chains.

arXiv:2409.08428•Reviews in Mathematical Physics•Apr 17, 2026•6 citations

Two-particle scattering on general graphs

Luna Lima Keller, Daniel J. Brod

Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then be translated into subgraphs – gadgets – that implement such unitaries on the logical qubits, simulated by particles traveling along a sparse graph. In this work, we start to develop a full theory of multi-particle scattering on graphs and give initial applications to build multi-particle gadgets with different properties.

arXiv:2503.11823•Quantum•Mar 23, 2026•0 citations

Completely positive graphs and entanglement of quantum states

Abraham Berman

We present a short survey on completely positive matrices and on their application to quantum information

AKCE International Journal of Graphs and Combinatorics•May 4, 2023•1 citation

Characterizing the Relationship Between Unitary Quantum Walks and Non-Homogeneous Random Walks

Matheus Guedes de Andrade, Franklin de Lima Marquezino, Daniel R. Figueiredo

Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.

•Jun 29, 2021•0 citations
In this paper, we consider a class of Unitary Quantum Walks on arbitrary graphs, parameterized by a family of scattering matrices. These Scattering Quantum Walks model the discrete dynamics of a system on the graph’s edges, where a scattering process at the vertices is governed by the scattering matrices assigned to each vertex. We show the Scattering Quantum Walks encompass several known Quantum Walks. We further introduce two classes of Scattering Open Quantum Walks on arbitrary graphs, also parameterized by scattering matrices: one defined on the edges, the other on the vertices of the graph. We show these walks give rise to proper quantum channels and describe their main spectral and dynamical properties, relating them to naturally associated classical Markov chains.
Quantum walks in general graphs, or more specifically scattering on graphs, encompass enough complexity to perform universal quantum computation. Any given quantum circuit can be broken down into single- and two-qubit gates, which can then be translated into subgraphs – gadgets – that implement such unitaries on the logical qubits, simulated by particles traveling along a sparse graph. In this work, we start to develop a full theory of multi-particle scattering on graphs and give initial applications to build multi-particle gadgets with different properties.
Quantum walks on graphs are ubiquitous in quantum computing finding a myriad of applications. Likewise, random walks on graphs are a fundamental building block for a large number of algorithms with diverse applications. While the relationship between quantum and random walks has been recently discussed in specific scenarios, this work establishes a formal equivalence between the two processes on arbitrary finite graphs and general conditions for shift and coin operators. It requires empowering random walks with time heterogeneity, where the transition probability of the walker is non-uniform and time dependent. The equivalence is obtained by equating the probability of measuring the quantum walk on a given node of the graph and the probability that the random walk is at that same node, for all nodes and time steps. The first result establishes procedure for a stochastic matrix sequence to induce a random walk that yields the exact same vertex probability distribution sequence of any given quantum walk, including the scenario with multiple interfering walkers. The second result establishes a similar procedure in the opposite direction. Given any random walk, a time-dependent quantum walk with the exact same vertex probability distribution is constructed. Interestingly, the matrices constructed by the first procedure allows for a different simulation approach for quantum walks where node samples respect neighbor locality and convergence is guaranteed by the law of large numbers, enabling efficient (polynomial-time) sampling of quantum graph trajectories. Furthermore, the complexity of constructing this sequence of matrices is discussed in the general case.