Furthering Free-Fermion Findability From Fratricides

• URL: http://arxiv.org/abs/2509.09092v1
• Date: Thu, 11 Sep 2025 01:56:38 GMT
• Title: Furthering Free-Fermion Findability From Fratricides
• Authors: Jannis Ruh, Samual J. Elman,
• Abstract summary: We present a novel graph-theoretic approach to simplifying generic many-body Hamiltonians.<n>Our approach expands the class of models that can be mapped to non-interacting fermionic Hamiltonians.<n>This framework provides new insights into Hamiltonian simplification techniques, free-fermion solutions, and group-theoretical characterizations relevant for quantum chemistry, condensed matter physics, and quantum computation.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We present a novel graph-theoretic approach to simplifying generic many-body Hamiltonians. Our primary result introduces a recursive twin-collapse algorithm, leveraging the identification and elimination of symmetric vertex pairs (twins), as well as line-graph modules, within the frustration graph of the Hamiltonian. This method systematically block-diagonalizes Hamiltonians, significantly reducing complexity while preserving the energetic spectrum. Importantly, our approach expands the class of models that can be mapped to non-interacting fermionic Hamiltonians (free-fermion solutions), thereby broadening the applicability of classical solvability methods. Through numerical experiments on spin Hamiltonians arranged in periodic lattice configurations and Majorana Hamiltonians, we demonstrate that the twin-collapse increases the identification of simplicial and claw-free graph structures, which characterize free-fermion solvability. Finally, we extend our framework by presenting a generalized discrete Stone-von Neumann theorem. This comprehensive framework provides new insights into Hamiltonian simplification techniques, free-fermion solutions, and group-theoretical characterizations relevant for quantum chemistry, condensed matter physics, and quantum computation.

Related papers

• Quantum algorithms for viscosity solutions to nonlinear Hamilton-Jacobi equations based on an entropy penalisation method [40.18480271945435]
  We present a framework for efficient extraction of the viscosity solutions of nonlinear Hamilton-Jacobi equations with convex Hamiltonians.<n>These viscosity solutions play a central role in areas such as front propagation, mean-field games, optimal control, machine learning, and a direct application to the forced Burgers' equation.<n>We provide quantum algorithms, both analog and digital, for extracting pointwise values, gradients, minima, and function evaluations at the minimiser of the viscosity solution.
  arXiv  Detail & Related papers  (2025-12-08T14:19:32Z)
• Kernpiler: Compiler Optimization for Quantum Hamiltonian Simulation with Partial Trotterization [38.59115551211364]
  Existing compilation techniques for Hamiltonian simulation struggle to provide gate counts feasible on current quantum computers.<n>We propose partial Trotterization, where sets of non-commuting Hamiltonian terms are directly compiled allowing for less error per Trotter step.<n>We demonstrate with numerical simulations across spin and fermionic Hamiltonians that compared to state of the art methods such as Qiskit's Rustiq and Qiskit's Paulievolutiongate, our novel compiler presents up to 10x gate and depth count reductions.
  arXiv  Detail & Related papers  (2025-04-09T18:41:31Z)
• Interacting chiral fermions on the lattice with matrix product operator norms [37.69303106863453]
  We develop a Hamiltonian formalism for simulating interacting chiral fermions on the lattice. The fermion doubling problem is circumvented by constructing a Fock space endowed with a semi-definite norm. We demonstrate that the scaling limit of the free model recovers the chiral fermion field.
  arXiv  Detail & Related papers  (2024-05-16T17:46:12Z)
• Learning Symmetric Hamiltonian [9.79122046962129]
  Hamiltonian Learning is a process of recovering system Hamiltonian from measurements. In this study, we investigate the problem of learning the symmetric Hamiltonian from its eigenstate.
  arXiv  Detail & Related papers  (2024-04-09T01:38:32Z)
• Coherence generation with Hamiltonians [44.99833362998488]
  We explore methods to generate quantum coherence through unitary evolutions. This quantity is defined as the maximum derivative of coherence that can be achieved by a Hamiltonian. We identify the quantum states that lead to the largest coherence derivative induced by the Hamiltonian.
  arXiv  Detail & Related papers  (2024-02-27T15:06:40Z)
• Coarse-Graining Hamiltonian Systems Using WSINDy [0.0]
  We show that WSINDy can successfully identify a reduced Hamiltonian system in the presence of large intrinsics. WSINDy naturally preserves the Hamiltonian structure by restricting to a trial basis of Hamiltonian vector fields. We also provide a contribution to averaging theory by proving that first-order averaging at the level of vector fields preserves Hamiltonian structure in nearly-periodic Hamiltonian systems.
  arXiv  Detail & Related papers  (2023-10-09T17:20:04Z)
• Extension of exactly-solvable Hamiltonians using symmetries of Lie algebras [0.0]
  We show that a linear combination of operators forming a modest size Lie algebra can be substituted by determinants of the Lie algebra symmetries. The new class of solvable Hamiltonians can be measured efficiently using quantum circuits with gates that depend on the result of a mid-circuit measurement of the symmetries.
  arXiv  Detail & Related papers  (2023-05-29T17:19:56Z)
• Bootstrapping the gap in quantum spin systems [0.7106986689736826]
  We use the equations of motion to develop an analogue of the conformal block expansion for matrix elements. The method can be applied to any quantum mechanical system with a local Hamiltonian.
  arXiv  Detail & Related papers  (2022-11-07T19:07:29Z)
• Iterative Quantum Optimization with Adaptive Problem Hamiltonian [19.4417702222583]
  We describe an iterative algorithm in which a solution obtained with such a restricted problem Hamiltonian is used to define a new problem Hamiltonian that is better suited than the previous one. In numerical examples of the shortest vector problem, we show that the algorithm with a sequence of improved problem Hamiltonians converges to the desired solution.
  arXiv  Detail & Related papers  (2022-04-28T12:04:03Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• A simple approach to characterizing band topology in bosonic pairing Hamiltonians [0.0]
  We revisit the problem of characterizing band topology in dynamically-stable quadratic bosonic Hamiltonians that do not conserve particle number. We show this problem can be rigorously addressed by a smooth and local adiabatic mapping procedure to a particle number conserving Hamiltonian. Our approach shows that particle non-conserving bosonic Hamiltonians can be classified using known approaches for fermionic models.
  arXiv  Detail & Related papers  (2021-04-13T04:40:19Z)
• Nonseparable Symplectic Neural Networks [23.77058934710737]
  We propose a novel neural network architecture, Nonseparable Symplectic Neural Networks (NSSNNs) NSSNNs uncover and embed the symplectic structure of a nonseparable Hamiltonian system from limited observation data. We show the unique computational merits of our approach to yield long-term, accurate, and robust predictions for large-scale Hamiltonian systems.
  arXiv  Detail & Related papers  (2020-10-23T19:50:13Z)
• Non-Convex Exact Community Recovery in Stochastic Block Model [31.221745716673546]
  Community detection in graphs that are generated according to symmetric block models (SBMs) has received much attention lately. We show that in the logarithmic sparsity regime of the problem, with high probability the proposed two-stage method can exactly recover the two communities down to the information-theoretic limit in $mathcalO(nlog2n/loglog n)$ time. We also conduct numerical experiments on both synthetic and real data sets to demonstrate the efficacy of our proposed method and complement our theoretical development.
  arXiv  Detail & Related papers  (2020-06-29T07:03:27Z)

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.