Supersymmetry Breaking in Graph Quantum Mechanics

• URL: http://arxiv.org/abs/2507.08889v1
• Date: Thu, 10 Jul 2025 20:28:20 GMT
• Title: Supersymmetry Breaking in Graph Quantum Mechanics
• Authors: Bek Herz, Ivan Contreras,
• Abstract summary: We show that finite graphs have a natural supersymmetric structure and use this structure to incorporate supersymmetry into an existing model of graph quantum mechanics.<n>We prove new results about the behavior of supersymmetric graph quantum systems under edge rewiring.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, we develop the groundwork for a graph theoretic toy model of supersymmetric quantum mechanics. Using discrete Witten-Morse theory, we demonstrate that finite graphs have a natural supersymmetric structure and use this structure to incorporate supersymmetry into an existing model of graph quantum mechanics. We prove that although key characteristics of continuum supersymmetric systems are preserved on finite unweighted graphs, supersymmetry cannot be spontaneously broken. Finally, we prove new results about the behavior of supersymmetric graph quantum systems under edge rewiring.

Related papers

• Meson spectroscopy of exotic symmetries of Ising criticality in Rydberg atom arrays [39.58317527488534]
  Coupling two Ising chains in a ladder leads to an even richer $mathcalD(1)_8$ symmetries.<n>Here, we probe these emergent symmetries in a Rydberg atom processing unit, leveraging its geometry to realize both chain and ladder configurations.
  arXiv  Detail & Related papers  (2025-06-26T14:19:30Z)
• Families of isospectral and isoscattering quantum graphs [0.0]
  A concept of germ graphs and the M-function formalism are employed to construct large families of isospectral and isoscattering graphs.<n>We demonstrate that the introduced formalism can also be extended to graphs with dissipation.
  arXiv  Detail & Related papers  (2025-05-22T12:54:52Z)
• Solving graph problems using permutation-invariant quantum machine learning [35.99391901074448]
  In quantum machine learning, the ansatz can be tuned to correspond to the specific symmetry of the problem.<n>We show how the symmetry can be included in the quantum circuit in a straightforward constructive method.
  arXiv  Detail & Related papers  (2025-05-19T06:44:03Z)
• Experimental observation of parity-symmetry-protected phenomena in the quantum Rabi model with a trapped ion [13.368172641201571]
  We experimentally simulate a highly controllable extended quantum Rabi model tuning into the ultra-strong or deep coupling regime.<n>We find sensitive responses for the two-level system entropy and phonon Wigner function in the deep coupling regime.<n>This work offers the prospect of exploring symmetry-controlled quantum phenomena and their applications in high-precision quantum technologies.
  arXiv  Detail & Related papers  (2025-01-10T12:23:43Z)
• Emergence of non-Abelian SU(2) invariance in Abelian frustrated fermionic ladders [37.69303106863453]
  We consider a system of interacting spinless fermions on a two-leg triangular ladder with $pi/2$ magnetic flux per triangular plaquette. Microscopically, the system exhibits a U(1) symmetry corresponding to the conservation of total fermionic charge, and a discrete $mathbbZ$ symmetry. At the intersection of the three phases, the system features a critical point with an emergent SU(2) symmetry.
  arXiv  Detail & Related papers  (2023-05-11T15:57:27Z)
• Symmetric Pruning in Quantum Neural Networks [111.438286016951]
  Quantum neural networks (QNNs) exert the power of modern quantum machines. QNNs with handcraft symmetric ansatzes generally experience better trainability than those with asymmetric ansatzes. We propose the effective quantum neural tangent kernel (EQNTK) to quantify the convergence of QNNs towards the global optima.
  arXiv  Detail & Related papers  (2022-08-30T08:17:55Z)
• Entanglement asymmetry as a probe of symmetry breaking [0.0]
  In extended quantum systems, quantifying how much a symmetry is broken is intrinsically bound to the subsystem of interest. We introduce a subsystem measure of symmetry breaking that we dub entanglement asymmetry. We find, expectedly, that larger is the subsystem, slower is the restoration, but also the counterintuitive result that more the symmetry is initially broken, faster it is restored.
  arXiv  Detail & Related papers  (2022-07-29T14:03:30Z)
• Kerr nonlinearity hinders symmetry-breaking states of coupled quantum oscillators [13.939388417767136]
  We study two types of symmetry-breaking processes, namely the inhomogeneous steady state (or quantum oscillation death state) and quantum chimera state. Remarkably, it is found that Kerr nonlinearity hinders the process of symmetry-breaking in both the cases.
  arXiv  Detail & Related papers  (2022-05-29T18:02:15Z)
• Quantum graphs: self-adjoint, and yet exhibiting a nontrivial $\mathcal{PT}$-symmetry [0.0]
  We demonstrate that a quantum graph exhibits a $mathcalPT$-symmetry provided the coefficients in the condition describing the wave function matching at the vertices are circulant matrices. We also illustrate how the transport properties of such graphs are significantly influenced by the presence or absence of the non-Robin component of the coupling.
  arXiv  Detail & Related papers  (2021-08-10T14:11:55Z)
• Information retrieval and eigenstates coalescence in a non-Hermitian quantum system with anti-$\mathcal{PT}$ symmetry [15.273168396747495]
  Non-Hermitian systems with parity-time reversal ($mathcalPT$) or anti-$mathcalPT$ symmetry have attracted a wide range of interest owing to their unique characteristics and counterintuitive phenomena. We implement a Floquet Hamiltonian of a single qubit with anti-$mathcalPT$ symmetry by periodically driving a dissipative quantum system of a single trapped ion.
  arXiv  Detail & Related papers  (2021-07-27T07:11:32Z)
• Symmetries, graph properties, and quantum speedups [3.4253416336476246]
  We show that hypergraph symmetries in the adjacency matrix model allow at most a separation between randomized and quantum query complexities. We also show that, remarkably, permutation groups constructed out of these symmetries are essentially the only permutation groups that prevent super-polynomial quantum speedups.
  arXiv  Detail & Related papers  (2020-06-23T05:00:15Z)

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.