Discrete Schrodinger equation on graphs: An effective model for branched quantum lattice

• URL: http://arxiv.org/abs/2411.14397v1
• Date: Thu, 21 Nov 2024 18:27:18 GMT
• Title: Discrete Schrodinger equation on graphs: An effective model for branched quantum lattice
• Authors: M. Akramov, C. Trunk, J. Yusupov, D. Matrasulov,
• Abstract summary: We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and derivation of secular equation for arbitrary quantum graphs is presented.
• Score: 0.0
• License:
• Abstract: We propose an approach to quantize discrete networks (graphs with discrete edges). We introduce a new exact solution of discrete Schrodinger equation that is used to write the solution for quantum graphs. Formulation of the problem and derivation of secular equation for arbitrary quantum graphs is presented. Application of the approach for the star graph is demonstrated by obtaining eigenfunctions and eigenvalues explicitely. Practical application of the model in conducting polymers and branched molecular chains is discussed.

Related papers

• A Theoretical Framework for an Efficient Normalizing Flow-Based Solution to the Electronic Schrodinger Equation [8.648660469053342]
  A central problem in quantum mechanics involves solving the Electronic Schrodinger Equation for a molecule or material. We propose a solution via an ansatz which is cheap to sample from, yet satisfies the requisite quantum mechanical properties.
  arXiv  Detail & Related papers  (2024-05-28T15:42:15Z)
• On the construction of a quantum channel corresponding to non-commutative graph for a qubit interacting with quantum oscillator [0.0]
  We consider error correction based on the theory of non-commutative graphs. We construct a quantum channel generating the non-commutative graph as a linear envelope of the POVM. For this model the quantum anticlique which determines the error correcting subspace has an explicit expression.
  arXiv  Detail & Related papers  (2024-03-11T13:55:03Z)
• Graph Generation via Spectral Diffusion [51.60814773299899]
  We present GRASP, a novel graph generative model based on 1) the spectral decomposition of the graph Laplacian matrix and 2) a diffusion process. Specifically, we propose to use a denoising model to sample eigenvectors and eigenvalues from which we can reconstruct the graph Laplacian and adjacency matrix. Our permutation invariant model can also handle node features by concatenating them to the eigenvectors of each node.
  arXiv  Detail & Related papers  (2024-02-29T09:26:46Z)
• Quantum tomography of helicity states for general scattering processes [55.2480439325792]
  Quantum tomography has become an indispensable tool in order to compute the density matrix $rho$ of quantum systems in Physics. We present the theoretical framework for reconstructing the helicity quantum initial state of a general scattering process.
  arXiv  Detail & Related papers  (2023-10-16T21:23:42Z)
• The Thermodynamic Limit of Spin Systems on Random Graphs [0.0]
  We formulate a general, continuous description of quantum spin systems in thermal equilibrium. We derive a closed set of coupled non-linear Fredholm integral equations which govern the properties of the system. We analyse these equations for both quantum and classical spin systems, recovering known results and providing novel analytical solutions.
  arXiv  Detail & Related papers  (2023-02-27T11:56:20Z)
• Decimation technique for open quantum systems: a case study with driven-dissipative bosonic chains [62.997667081978825]
  Unavoidable coupling of quantum systems to external degrees of freedom leads to dissipative (non-unitary) dynamics. We introduce a method to deal with these systems based on the calculation of (dissipative) lattice Green's function. We illustrate the power of this method with several examples of driven-dissipative bosonic chains of increasing complexity.
  arXiv  Detail & Related papers  (2022-02-15T19:00:09Z)
• Score-based Generative Modeling of Graphs via the System of Stochastic Differential Equations [57.15855198512551]
  We propose a novel score-based generative model for graphs with a continuous-time framework. We show that our method is able to generate molecules that lie close to the training distribution yet do not violate the chemical valency rule.
  arXiv  Detail & Related papers  (2022-02-05T08:21:04Z)
• A trace formula for metric graphs with piecewise constant potentials and multi-mode graphs [0.0]
  We generalize the scattering approach to quantum graphs to quantum graphs with piecewise constant potentials and multiple excitation modes. The free single-mode case is well-known and leads to the trace formulas of Roth, Kottos and Smilansky.
  arXiv  Detail & Related papers  (2022-01-18T13:22:52Z)
• Bernstein-Greene-Kruskal approach for the quantum Vlasov equation [91.3755431537592]
  The one-dimensional stationary quantum Vlasov equation is analyzed using the energy as one of the dynamical variables. In the semiclassical case where quantum tunneling effects are small, an infinite series solution is developed.
  arXiv  Detail & Related papers  (2021-02-18T20:55:04Z)
• Ground States of Quantum Many Body Lattice Models via Reinforcement Learning [0.0]
  We introduce reinforcement learning (RL) formulations of the problem of finding the ground state of a quantum mechanical model defined on a lattice. We show that stoquastic Hamiltonians have a natural decomposition into dynamics and a potential representing a reward function. We discuss the application of this mapping to the neural representation of quantum states, spelling out the advantages over approaches based on direct representation of the wavefunction of the system.
  arXiv  Detail & Related papers  (2020-12-13T13:53:59Z)
• Multipole Graph Neural Operator for Parametric Partial Differential Equations [57.90284928158383]
  One of the main challenges in using deep learning-based methods for simulating physical systems is formulating physics-based data. We propose a novel multi-level graph neural network framework that captures interaction at all ranges with only linear complexity. Experiments confirm our multi-graph network learns discretization-invariant solution operators to PDEs and can be evaluated in linear time.
  arXiv  Detail & Related papers  (2020-06-16T21:56:22Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.