Quantum circuit algorithm for topological invariants of second order topological many-body quantum magnets

• URL: http://arxiv.org/abs/2512.19615v1
• Date: Mon, 22 Dec 2025 17:50:16 GMT
• Title: Quantum circuit algorithm for topological invariants of second order topological many-body quantum magnets
• Authors: Sebastián Domínguez-Calderón, Marcel Niedermeier, Jose L. Lado, Pascal M. Vecsei,
• Abstract summary: We show how to compute the many-body topological invariant of a second-order topological quantum magnet encoded in qubits.<n>Our work puts forward an algorithm to leverage quantum computers to characterize many-body topological quantum matter.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Topological quantum matter represents a flexible playground to engineer unconventional excitations. While non-interacting topological single-particle systems have been studied in detail, topology in quantum many-body systems remains an open problem. Specifically, in the quantum many-body limit, one of the challenges lies in the computational complexity of obtaining the many-body ground state and its many-body topological invariant. While algorithms to compute ground states with quantum computers have been heavily investigated, algorithms to compute topological invariants in a quantum computer are still under active development. Here we demonstrate a quantum circuit to compute the many-body topological invariant of a second-order topological quantum magnet encoded in qubits. Our algorithm relies on a quantum circuit adiabatic evolution in transverse paths in parameter space, and we uncover hidden topological invariants depending on the traversed path. Our work puts forward an algorithm to leverage quantum computers to characterize many-body topological quantum matter.

Related papers

• Digital quantum simulation of many-body systems: Making the most of intermediate-scale, noisy quantum computers [51.56484100374058]
  This thesis is centered around simulating quantum dynamics on quantum devices.<n>We present an overview of the most relevant quantum algorithms for quantum dynamics.<n>We identify relevant problems within quantum dynamics that could benefit from quantum simulation in the near future.
  arXiv  Detail & Related papers  (2025-08-29T10:37:19Z)
• Topological control of quantum speed limits [55.2480439325792]
  We show that even if the quantum state is completely dispersionless, QFI in this state remains momentum-resolved.<n>We find bounds on quantum speed limit which scales as $sqrt|C|$ in a (dispersionless) topological phase.
  arXiv  Detail & Related papers  (2025-07-21T18:00:07Z)
• Quantum computing topological invariants of two-dimensional quantum matter [0.0]
  We present two quantum circuits for calculating Chern numbers of two-dimensional quantum matter on quantum computers.<n>First algorithm uses many qubits, and we analyze it using a tensor-network simulator of quantum circuits.<n>Second circuit uses fewer qubits, and we implement it experimentally on a quantum computer based on superconducting qubits.
  arXiv  Detail & Related papers  (2024-04-09T06:22:50Z)
• Quantum Subroutine for Variance Estimation: Algorithmic Design and Applications [80.04533958880862]
  Quantum computing sets the foundation for new ways of designing algorithms. New challenges arise concerning which field quantum speedup can be achieved. Looking for the design of quantum subroutines that are more efficient than their classical counterpart poses solid pillars to new powerful quantum algorithms.
  arXiv  Detail & Related papers  (2024-02-26T09:32:07Z)
• Quantum algorithms: A survey of applications and end-to-end complexities [88.57261102552016]
  The anticipated applications of quantum computers span across science and industry.<n>We present a survey of several potential application areas of quantum algorithms.<n>We outline the challenges and opportunities in each area in an "end-to-end" fashion.
  arXiv  Detail & Related papers  (2023-10-04T17:53:55Z)
• Quantum-circuit algorithms for many-body topological invariant and Majorana zero mode [0.0]
  Topological states of matter are promising resources for composing fault-tolerant quantum computers. Existing quantum-circuit algorithms to examine topological properties remain limited. We introduce three quantum-circuit algorithms designed to (i) determine the ground state within a specified parity subspace, (ii) identify the many-body topological invariant, and (iii) visualize zero-energy edge modes.
  arXiv  Detail & Related papers  (2023-04-26T09:41:58Z)
• Learning the Complexity of Weakly Noisy Quantum States [0.5662299435213419]
  We present an efficient learning algorithm, that leverages the classical shadow representation of target quantum states, to predict the circuit complexity of weakly noisy quantum states.<n>Our result builds a bridge between the learning algorithm and quantum state complexity, highlighting the power of the learning algorithm in characterizing intrinsic properties of quantum states.
  arXiv  Detail & Related papers  (2023-03-31T06:02:44Z)
• Quantum computational intelligence for traveltime seismic inversion [0.0]
  We implement an approach for traveltime seismic inversion through a near-term quantum algorithm based on gradient-free quantum circuit learning. We demonstrate that a quantum computer with thousands of qubits, even if noisy, can solve geophysical problems.
  arXiv  Detail & Related papers  (2022-08-11T12:36:58Z)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Long-Time Error-Mitigating Simulation of Open Quantum Systems on Near Term Quantum Computers [38.860468003121404]
  We study an open quantum system simulation on quantum hardware, which demonstrates robustness to hardware errors even with deep circuits containing up to two thousand entangling gates. We simulate two systems of electrons coupled to an infinite thermal bath: 1) a system of dissipative free electrons in a driving electric field; and 2) the thermalization of two interacting electrons in a single orbital in a magnetic field -- the Hubbard atom. Our results demonstrate that algorithms for simulating open quantum systems are able to far outperform similarly complex non-dissipative algorithms on noisy hardware.
  arXiv  Detail & Related papers  (2021-08-02T21:36:37Z)
• Synthesis of Quantum Circuits with an Island Genetic Algorithm [44.99833362998488]
  Given a unitary matrix that performs certain operation, obtaining the equivalent quantum circuit is a non-trivial task. Three problems are explored: the coin for the quantum walker, the Toffoli gate and the Fredkin gate. The algorithm proposed proved to be efficient in decomposition of quantum circuits, and as a generic approach, it is limited only by the available computational power.
  arXiv  Detail & Related papers  (2021-06-06T13:15:25Z)
• Imaginary Time Propagation on a Quantum Chip [50.591267188664666]
  Evolution in imaginary time is a prominent technique for finding the ground state of quantum many-body systems. We propose an algorithm to implement imaginary time propagation on a quantum computer.
  arXiv  Detail & Related papers  (2021-02-24T12:48:00Z)
• Robust measurement of wave function topology on NISQ quantum computers [1.8523441396284195]
  We present a strategy to measure topological invariants on quantum computers. We show that our strategy can be easily integrated with the variational quantum eigensolver (VQE) so that the topological properties of generic quantum many-body states can be characterized on current quantum hardware.
  arXiv  Detail & Related papers  (2021-01-18T19:01:38Z)
• An Application of Quantum Annealing Computing to Seismic Inversion [55.41644538483948]
  We apply a quantum algorithm to a D-Wave quantum annealer to solve a small scale seismic inversions problem. The accuracy achieved by the quantum computer is at least as good as that of the classical computer.
  arXiv  Detail & Related papers  (2020-05-06T14:18:44Z)

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.