Symmetry-Checking in Band Structure Calculations on a Noisy Quantum Computer

• URL: http://arxiv.org/abs/2506.20483v1
• Date: Wed, 25 Jun 2025 14:27:55 GMT
• Title: Symmetry-Checking in Band Structure Calculations on a Noisy Quantum Computer
• Authors: Shaobo Zhang, Akib Karim, Harry M. Quiney, Muhammad Usman,
• Abstract summary: Band crossings in electronic band structures play an important role in determining the electronic, topological, and transport properties in solid-state systems.<n>The emergence of noisy intermediate-scale quantum (NISQ) processors has sparked great interest in developing quantum algorithms to compute band structure properties of materials.<n>We propose a method for identifying the symmetry of bands around crossings and anti-crossings in the band structure of bilayer graphene with two distinct configurations on a NISQ device.
• Score: 2.6327434138210095
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Band crossings in electronic band structures play an important role in determining the electronic, topological, and transport properties in solid-state systems, making them central to both condensed matter physics and materials science. The emergence of noisy intermediate-scale quantum (NISQ) processors has sparked great interest in developing quantum algorithms to compute band structure properties of materials. While significant research has been reported on computing ground state and excited state energy bands in the presence of noise that breaks the degeneracy, identifying the symmetry at crossing points using quantum computers is still an open question. In this work, we propose a method for identifying the symmetry of bands around crossings and anti-crossings in the band structure of bilayer graphene with two distinct configurations on a NISQ device. The method utilizes eigenstates at neighbouring $\mathbf{k}$ points on either side of the touching point to recover the local symmetry by implementing a character-checking quantum circuit that uses ancilla qubit measurements for a probabilistic test. We then evaluate the performance of our method under a depolarizing noise model, using four distinct matrix representations of symmetry operations to assess its robustness. Finally, we demonstrate the reliability of our method by correctly identifying the correct band crossings of AA-stacked bilayer graphene around $K$ point, using the character-checking circuit implemented on a noisy IBM quantum processor $ibm\_marrakesh$.

Related papers

• 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)
• Phase transitions, symmetries, and tunneling in Kerr parametric oscillators [37.69303106863453]
  We study the onset of ground-state and excited-state quantum phase transitions in KPOs.<n>We identify the critical points associated with quantum phase transitions and analyze their influence on the energy spectrum and tunneling dynamics.<n>Our findings provide insights into the engineering of robust quantum states, quantum dynamics control, and onset of quantum phase transitions with implications for critical quantum sensing.
  arXiv  Detail & Related papers  (2025-04-21T18:00:19Z)
• Variational Quantum Subspace Construction via Symmetry-Preserving Cost Functions [39.58317527488534]
  We propose a variational strategy based on symmetry-preserving cost functions to iteratively construct a reduced subspace for extraction of low-lying energy states.<n>As a proof of concept, we test the proposed algorithms on H4 chain and ring, targeting both the ground-state energy and the charge gap.
  arXiv  Detail & Related papers  (2024-11-25T20:33:47Z)
• Computational Characterization of Symmetry-Protected Topological Phases in Open Quantum Systems [0.0]
  Gate fidelity is a measure of the computational power of the measurement-based quantum computation. We show that the fidelity for the identity gate, which is given by the sum of the non-local string order parameters, plays an important role.
  arXiv  Detail & Related papers  (2024-05-28T17:00:17Z)
• Spectra of noisy parameterized quantum circuits: Single-Ring universality [1.2617078020344619]
  We generate random unitaries on an IBM Quantum processor and model these implementations as quantum maps.<n>We find the spectrum of a map to be either an annulus or a disk depending on the circuit depth and detect an annulus-disk transition.<n>Our results establish, via Dissipative Quantum Chaos theory, a connection between intrinsic properties of present-day noisy intermediate-scale quantum (NISQ) computing platforms and non-Hermitian random matrix theory.
  arXiv  Detail & Related papers  (2024-05-19T17:36:55Z)
• Quantum State Transfer in Interacting, Multiple-Excitation Systems [41.94295877935867]
  Quantum state transfer (QST) describes the coherent passage of quantum information from one node to another. We describe Monte Carlo techniques which enable the discovery of a Hamiltonian that gives high-fidelity QST. The resulting Jaynes-Cummings-Hubbard and periodic Anderson models can, in principle, be engineered in appropriate hardware to give efficient QST.
  arXiv  Detail & Related papers  (2024-05-10T23:46:35Z)
• Neutron-nucleus dynamics simulations for quantum computers [49.369935809497214]
  We develop a novel quantum algorithm for neutron-nucleus simulations with general potentials. It provides acceptable bound-state energies even in the presence of noise, through the noise-resilient training method. We introduce a new commutativity scheme called distance-grouped commutativity (DGC) and compare its performance with the well-known qubit-commutativity scheme.
  arXiv  Detail & Related papers  (2024-02-22T16:33:48Z)
• Mitigating Errors on Superconducting Quantum Processors through Fuzzy Clustering [38.02852247910155]
  A new Quantum Error Mitigation (QEM) technique uses Fuzzy C-Means clustering to specifically identify measurement error patterns. We report a proof-of-principle validation of the technique on a 2-qubit register, obtained as a subset of a real NISQ 5-qubit superconducting quantum processor. We demonstrate that the FCM-based QEM technique allows for reasonable improvement of the expectation values of single- and two-qubit gates based quantum circuits.
  arXiv  Detail & Related papers  (2024-02-02T14:02:45Z)
• Efficient quantum algorithms for testing symmetries of open quantum systems [17.55887357254701]
  In quantum mechanics, it is possible to eliminate degrees of freedom by leveraging symmetry to identify the possible physical transitions. Previous works have focused on devising quantum algorithms to ascertain symmetries by means of fidelity-based symmetry measures. We develop alternative symmetry testing quantum algorithms that are efficiently implementable on quantum computers.
  arXiv  Detail & Related papers  (2023-09-05T18:05:26Z)
• Numerical Simulations of Noisy Quantum Circuits for Computational Chemistry [51.827942608832025]
  Near-term quantum computers can calculate the ground-state properties of small molecules. We show how the structure of the computational ansatz as well as the errors induced by device noise affect the calculation.
  arXiv  Detail & Related papers  (2021-12-31T16:33:10Z)
• Approximate Equivalence Checking of Noisy Quantum Circuits [8.36229449571485]
  We study the problem of equivalence checking in the NISQ (Noisy Intermediate-Scale Quantum) computing realm where quantum noise is present inevitably. The notion of approximate equivalence of (possibly noisy) quantum circuits is defined based on the Jamiolkowski fidelity. We present two algorithms, aiming at different situations where the number of noises varies, for computing the fidelity between an ideal quantum circuit and its noisy implementation.
  arXiv  Detail & Related papers  (2021-03-22T05:47:41Z)
• Symmetry assisted preparation of entangled many-body states on a quantum computer [0.0]
  A method is proposed to construct entangled states that describe correlated many-body systems on quantum computers. Using operators for which the discrete set of eigenvalues is known, the QPE approach is followed by measurements that serve as projectors on the entangled states. These states can then be used as inputs for further quantum or hybrid quantum-classical processing.
  arXiv  Detail & Related papers  (2020-06-11T14:59: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.