Symmetry enhanced variational quantum spin eigensolver

• URL: http://arxiv.org/abs/2203.02444v5
• Date: Wed, 11 Jan 2023 16:20:17 GMT
• Title: Symmetry enhanced variational quantum spin eigensolver
• Authors: Chufan Lyu, Xusheng Xu, Man-Hong Yung, Abolfazl Bayat
• Abstract summary: We show that the variational quantum eigensolver can be significantly improved by exploiting the symmetries of the Hamiltonian. In the first approach, called hardware symmetry preserving, all the symmetries are included in the design of the circuit. In the second approach, the cost function is updated to include the symmetries.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The variational quantum-classical algorithms are the most promising approach for achieving quantum advantage on near-term quantum simulators. Among these methods, the variational quantum eigensolver has attracted a lot of attention in recent years. While it is very effective for simulating the ground state of many-body systems, its generalization to excited states becomes very resource demanding. Here, we show that this issue can significantly be improved by exploiting the symmetries of the Hamiltonian. The improvement is even more effective for higher energy eigenstates. We introduce two methods for incorporating the symmetries. In the first approach, called hardware symmetry preserving, all the symmetries are included in the design of the circuit. In the second approach, the cost function is updated to include the symmetries. The hardware symmetry preserving approach indeed outperforms the second approach. However, integrating all symmetries in the design of the circuit could be extremely challenging. Therefore, we introduce hybrid symmetry preserving method in which symmetries are divided between the circuit and the classical cost function. This allows to harness the advantage of symmetries while preventing sophisticated circuit design.

Related papers

• Robust Symmetry Detection via Riemannian Langevin Dynamics [39.342336146118015]
  We propose a novel symmetry detection method that marries classical symmetry detection techniques with recent advances in generative modeling. Specifically, we apply Langevin dynamics to a symmetry space to enhance robustness against noise. We provide empirical results on a variety of shapes that suggest our method is not only robust to noise, but can also identify both partial and global symmetries.
  arXiv  Detail & Related papers  (2024-09-18T02:28:20Z)
• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• 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)
• A Bottom-up Approach to Constructing Symmetric Variational Quantum Circuits [0.0]
  We show how to construct symmetric quantum circuits using representation theory. We show how to derive the particle-conserving exchange gates, which are commonly used in constructing hardware-efficient quantum circuits.
  arXiv  Detail & Related papers  (2023-08-17T10:57:15Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• 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)
• Symmetry breaking/symmetry preserving circuits and symmetry restoration on quantum computers: A quantum many-body perspective [0.0]
  We discuss some aspects related to the symmetries of a quantum many-body problem when trying to treat it on a quantum computer. Several features related to symmetry conservation, symmetry breaking, and possible symmetry restoration are reviewed.
  arXiv  Detail & Related papers  (2022-08-24T14:19:13Z)
• Symmetry enriched phases of quantum circuits [0.0]
  Quantum circuits generate a novel ensemble of quantum many-body states. We classify the phases that can be established as steady states. We discuss close analogies to the theory of spin glasses pioneered by Edwards and Anderson.
  arXiv  Detail & Related papers  (2021-02-18T05:44:22Z)
• Quantum Error Mitigation using Symmetry Expansion [0.0]
  Noise remains the biggest challenge for the practical applications of any near-term quantum devices. We develop a general framework named symmetry expansion which provides a wide spectrum of symmetry-based error mitigation schemes. We show that certain symmetry expansion schemes can achieve a smaller estimation bias than symmetry verification.
  arXiv  Detail & Related papers  (2021-01-08T18:30:48Z)
• Quantum-optimal-control-inspired ansatz for variational quantum algorithms [105.54048699217668]
  A central component of variational quantum algorithms (VQA) is the state-preparation circuit, also known as ansatz or variational form. Here, we show that this approach is not always advantageous by introducing ans"atze that incorporate symmetry-breaking unitaries. This work constitutes a first step towards the development of a more general class of symmetry-breaking ans"atze with applications to physics and chemistry problems.
  arXiv  Detail & Related papers  (2020-08-03T18:00:05Z)
• Exponentially-enhanced quantum sensing with non-Hermitian lattice dynamics [77.34726150561087]
  We show that certain asymmetric non-Hermitian tight-binding models with a $mathbbZ$ symmetry yield a pronounced sensing advantage. Our setup is directly compatible with a variety of quantum optical and superconducting circuit platforms.
  arXiv  Detail & Related papers  (2020-04-01T17:14:14Z)

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.