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:math-ph/0603044 · Journal of Mathematical Physics

Quantum graphs as holonomic constraints

Gianfausto Dell’Antonio, Lucattilio Tenuta

Published Jul 1, 2006• 41 citations
arXivHTMLPDF

Abstract

We consider the dynamics on a quantum graph as the limit of the dynamics generated by a one-particle Hamiltonian in R2 with a potential having a deep strict minimum on the graph, when the width of the well shrinks to zero. For a generic graph we prove convergence outside the vertices to the free dynamics on the edges. For a simple model of a graph with two edges and one vertex, we prove convergence of the dynamics to the one generated by the Laplacian with Dirichlet boundary conditions in the vertex.

DOI
10.1063/1.2213789

Related papers

Quantum networks modelled by graphs

Pavel Exner, Olaf Post, Jacob S. Møller +1 more

Quantum networks are often modelled using Schrödinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article we give a survey, technically not too heavy, of several recent results which serve this purpose. Specifically, we consider approximations by means of “fat graphs”—in other words, suitable families of shrinking manifolds—and discuss convergence of the spectra and resonances in such a setting.

arXiv:0706.0481•AIP conference proceedings•Jan 1, 2008•11 citations

Effective Schrödinger dynamics on ε-thin Dirichlet waveguides via quantum graphs: I. Star-shaped graphs

G F Dell'Antonio, E Costa

We describe the boundary conditions at the vertex that one must choose to obtain a dynamical system that best describes the low-energy part of the evolution of a quantum system confined to a very small neighbourhood of a star-shaped metric graph.

arXiv:1004.4750•Journal of Physics A Mathematical and Theoretical•Nov 9, 2010•16 citations

Driven transparent quantum graphs

Jambul Yusupov, Matthias Ehrhardt, Kh. Sh. Matyokubov +1 more

Abstract In this paper, we discuss the concept of quantum graphs with transparent vertices by considering the case, where the graph interacts with an external time-independent field. In particular, we address the problem of transparent boundary conditions for quantum graphs, building on previous works on transparent boundary conditions for the stationary Schrödinger equation on a line. Physically relevant constraints that make the vertex transparent under boundary conditions in the form of (weight) continuity and Kirchhoff rules are derived using two approaches, where transparent boundary conditions for the time-independent Schrödinger equation are found. The latter is derived by extending the transparent boundary condition concept to the time-independent Schrödinger equation on driven quantum graphs. For the constant potential, these constraints are also obtained using the scattering approach. We also discuss how the eigenvalues and eigenfunctions of a quantum graph are influenced not only by its topology, but also by the shape/type of a potential when an external field is involved.

arXiv:2312.01448•Physica Scripta•Jun 3, 2025•8 citations

Statics and dynamics of quantum XY and Heisenberg systems on graphs

Tobias J. Osborne

We consider the statics and dynamics of distinguishable spin-$\frac{1}{2}$ systems on an arbitrary graph $G$ with $N$ vertices. In particular, we consider systems of quantum spins evolving according to one of two Hamiltonians: (i) the $XY$ Hamiltonian ${H}_{XY}$, which contains an $XY$ interaction for every pair of spins connected by an edge in $G$; and (ii) the Heisenberg Hamiltonian ${H}_{\mathrm{Heis}}$, which contains a Heisenberg interaction term for every pair of spins connected by an edge in $G$. We find that the action of the $XY$ (respectively, Heisenberg) Hamiltonian on state space is equivalent to the action of the adjacency matrix (respectively, combinatorial Laplacian) of a sequence ${G}_{k}$, $k=0,\dots{},N$ of graphs derived from $G$ (with ${G}_{1}=G$). This equivalence of actions demonstrates that the dynamics of these two models is the same as the evolution of a free particle hopping on the graphs ${G}_{k}$. Thus we show how to replace the complicated dynamics of the original spin model with simpler dynamics on a more complicated geometry. A simple corollary of our approach allows us to write an explicit spectral decomposition of the $XY$ model in a magnetic field on the path consisting of $N$ vertices. We also use our approach to utilize results from spectral graph theory to solve new spin models: the $XY$ model and Heisenberg model in a magnetic field on the complete graph.

arXiv:quant-ph/0312126•Physical Review B•Sep 12, 2006•28 citations

Transparent vertex boundary conditions for quantum graphs: Simplified approach

Мерсаид Арипов, K.K. Sabirov, Jambul Yusupov

We consider quantum graphs providing reflectionless wave transmission at the vertices.Imposing Kuska's version of so-called absorbing boundary conditions we derive the constraints, which make usual continuity and Kirchhoff conditions equivalent to transparent boundary conditions.

Nanosystems Physics Chemistry Mathematics•Oct 31, 2019•6 citations

Consensus of quantum networks with continuous-time markovian dynamics

Guodong Shi, Daoyi Dong, Ian R. Petersen +1 more

In this paper, we investigate the convergence of the state of a quantum network to a consensus (symmetric) state. The state evolution of the quantum network with continuous-time swapping operators can be described by a Lindblad master equation, which also introduces an underlying interaction graph for the network. For a fixed quantum interaction graph, we prove that the state of a quantum network with continuous-time Markovian dynamics converges to a consensus state, with convergence rate given by the smallest nonzero eigenvalue of a matrix serving as the Laplacian of the quantum interaction graph. We show that this convergence rate can be optimized via standard convex programming given a fixed amount of edge weights. For switching quantum interaction graphs, we establish necessary and sufficient conditions for exponential quantum consensus and asymptotic quantum consensus, respectively. The convergence analysis is based on a bridge built between the proposed quantum consensus scheme and classical consensus dynamics, in that quantum consensus of n qubits naturally defines a consensus process on an induced classical graph with 22nnodes. Existing consensus results on classical networks can thus be adopted to establish the quantum consensus convergence.

World Congress on Intelligent Control and Automation•Jun 1, 2014•12 citations
We consider the dynamics on a quantum graph as the limit of the dynamics generated by a one-particle Hamiltonian in R2 with a potential having a deep strict minimum on the graph, when the width of the well shrinks to zero. For a generic graph we prove convergence outside the vertices to the free dynamics on the edges. For a simple model of a graph with two edges and one vertex, we prove convergence of the dynamics to the one generated by the Laplacian with Dirichlet boundary conditions in the vertex.
Quantum networks are often modelled using Schrödinger operators on metric graphs. To give meaning to such models one has to know how to interpret the boundary conditions which match the wave functions at the graph vertices. In this article we give a survey, technically not too heavy, of several recent results which serve this purpose. Specifically, we consider approximations by means of “fat graphs”—in other words, suitable families of shrinking manifolds—and discuss convergence of the spectra and resonances in such a setting.
Abstract In this paper, we discuss the concept of quantum graphs with transparent vertices by considering the case, where the graph interacts with an external time-independent field. In particular, we address the problem of transparent boundary conditions for quantum graphs, building on previous works on transparent boundary conditions for the stationary Schrödinger equation on a line. Physically relevant constraints that make the vertex transparent under boundary conditions in the form of (weight) continuity and Kirchhoff rules are derived using two approaches, where transparent boundary conditions for the time-independent Schrödinger equation are found. The latter is derived by extending the transparent boundary condition concept to the time-independent Schrödinger equation on driven quantum graphs. For the constant potential, these constraints are also obtained using the scattering approach. We also discuss how the eigenvalues and eigenfunctions of a quantum graph are influenced not only by its topology, but also by the shape/type of a potential when an external field is involved.
We consider the statics and dynamics of distinguishable spin-12\frac{1}{2}21​ systems on an arbitrary graph GGG with NNN vertices. In particular, we consider systems of quantum spins evolving according to one of two Hamiltonians: (i) the XYXYXY Hamiltonian HXY{H}_{XY}HXY​, which contains an XYXYXY interaction for every pair of spins connected by an edge in GGG; and (ii) the Heisenberg Hamiltonian HHeis{H}_{\mathrm{Heis}}HHeis​, which contains a Heisenberg interaction term for every pair of spins connected by an edge in GGG. We find that the action of the XYXYXY (respectively, Heisenberg) Hamiltonian on state space is equivalent to the action of the adjacency matrix (respectively, combinatorial Laplacian) of a sequence Gk{G}_{k}Gk​, k=0,…,Nk=0,\dots{},Nk=0,…,N of graphs derived from GGG (with G1=G{G}_{1}=GG1​=G). This equivalence of actions demonstrates that the dynamics of these two models is the same as the evolution of a free particle hopping on the graphs Gk{G}_{k}Gk​. Thus we show how to replace the complicated dynamics of the original spin model with simpler dynamics on a more complicated geometry. A simple corollary of our approach allows us to write an explicit spectral decomposition of the XYXYXY model in a magnetic field on the path consisting of NNN vertices. We also use our approach to utilize results from spectral graph theory to solve new spin models: the XYXYXY model and Heisenberg model in a magnetic field on the complete graph.
In this paper, we investigate the convergence of the state of a quantum network to a consensus (symmetric) state. The state evolution of the quantum network with continuous-time swapping operators can be described by a Lindblad master equation, which also introduces an underlying interaction graph for the network. For a fixed quantum interaction graph, we prove that the state of a quantum network with continuous-time Markovian dynamics converges to a consensus state, with convergence rate given by the smallest nonzero eigenvalue of a matrix serving as the Laplacian of the quantum interaction graph. We show that this convergence rate can be optimized via standard convex programming given a fixed amount of edge weights. For switching quantum interaction graphs, we establish necessary and sufficient conditions for exponential quantum consensus and asymptotic quantum consensus, respectively. The convergence analysis is based on a bridge built between the proposed quantum consensus scheme and classical consensus dynamics, in that quantum consensus of n qubits naturally defines a consensus process on an induced classical graph with 22nnodes. Existing consensus results on classical networks can thus be adopted to establish the quantum consensus convergence.