A Quantum Algorithmic Approach to Multiconfigurational Valence Bond Theory: Insights from Interpretable Circuit Design

• URL: http://arxiv.org/abs/2302.10660v2
• Date: Mon, 18 Mar 2024 15:31:41 GMT
• Title: A Quantum Algorithmic Approach to Multiconfigurational Valence Bond Theory: Insights from Interpretable Circuit Design
• Authors: Jakob S. Kottmann, Francesco Scala,
• Abstract summary: In this work, we combine interpretable circuit designs with an effective basis approach to optimize a multiconfigurational bond wavefunction. Based on selected model systems, we show how this leads to explainable performance. We demonstrate that the developed methodology outperforms related methods in terms of the size of the effective basis as well as individual quantum resources for the involved circuits.
• Score: 1.03590082373586
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Efficient ways to prepare fermionic ground states on quantum computers are in high demand and different techniques have been developed over the last years. Despite having a vast set of methods, it is still unclear which method performs well for which system. In this work, we combine interpretable circuit designs with an effective basis approach in order to optimize a multiconfigurational valence bond wavefunction. Based on selected model systems, we show how this leads to explainable performance. We demonstrate that the developed methodology outperforms related methods in terms of the size of the effective basis as well as individual quantum resources for the involved circuits.

Related papers

• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Surrogate optimization of variational quantum circuits [1.0546736060336612]
  Variational quantum eigensolvers are touted as a near-term algorithm capable of impacting many applications. Finding algorithms and methods to improve convergence is important to accelerate the capabilities of near-term hardware for VQE.
  arXiv  Detail & Related papers  (2024-04-03T18:00:00Z)
• Learning ground states of gapped quantum Hamiltonians with Kernel Methods [0.0]
  We introduce a statistical learning approach that makes the optimization trivial by using kernel methods. Our scheme is an approximate realization of the power method, where supervised learning is used to learn the next step of the power.
  arXiv  Detail & Related papers  (2023-03-15T19:37:33Z)
• SEQUENT: Towards Traceable Quantum Machine Learning using Sequential Quantum Enhanced Training [5.819818547073678]
  We propose an improved architecture and training process for the traceable application of quantum computing methods to hybrid machine learning. We provide formal evidence for the disadvantage of current methods and preliminary experimental results as a proof-of-concept for the applicability of SEQUENT.
  arXiv  Detail & Related papers  (2023-01-06T16:55:59Z)
• Guaranteed Conservation of Momentum for Learning Particle-based Fluid Dynamics [96.9177297872723]
  We present a novel method for guaranteeing linear momentum in learned physics simulations. We enforce conservation of momentum with a hard constraint, which we realize via antisymmetrical continuous convolutional layers. In combination, the proposed method allows us to increase the physical accuracy of the learned simulator substantially.
  arXiv  Detail & Related papers  (2022-10-12T09:12:59Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Exploiting subspace constraints and ab initio variational methods for quantum chemistry [0.0]
  We employ methods described in a sister paper to the present report to solve problems using adaptively evolving quantum circuits. We find that this approach can outperform human-designed circuits such as the coupled-cluster or hardware-efficient ans"atze. We also introduce a novel approach to constraining the circuit evolution in the physically relevant subspace.
  arXiv  Detail & Related papers  (2022-06-22T17:48:30Z)
• Quantum circuit debugging and sensitivity analysis via local inversions [62.997667081978825]
  We present a technique that pinpoints the sections of a quantum circuit that affect the circuit output the most. We demonstrate the practicality and efficacy of the proposed technique by applying it to example algorithmic circuits implemented on IBM quantum machines.
  arXiv  Detail & Related papers  (2022-04-12T19:39:31Z)
• Simulation Paths for Quantum Circuit Simulation with Decision Diagrams [72.03286471602073]
  We study the importance of the path that is chosen when simulating quantum circuits using decision diagrams. We propose an open-source framework that allows to investigate dedicated simulation paths.
  arXiv  Detail & Related papers  (2022-03-01T19:00:11Z)
• Quantum algorithms for quantum dynamics: A performance study on the spin-boson model [68.8204255655161]
  Quantum algorithms for quantum dynamics simulations are traditionally based on implementing a Trotter-approximation of the time-evolution operator. variational quantum algorithms have become an indispensable alternative, enabling small-scale simulations on present-day hardware. We show that, despite providing a clear reduction of quantum gate cost, the variational method in its current implementation is unlikely to lead to a quantum advantage.
  arXiv  Detail & Related papers  (2021-08-09T18:00:05Z)
• Certificates of quantum many-body properties assisted by machine learning [0.0]
  We propose a novel approach combining the power of relaxation techniques with deep reinforcement learning. We illustrate the viability of the method in the context of finding the ground state energy of many transfer systems. We provide tools to generalize the approach to other common applications in the field of quantum information processing.
  arXiv  Detail & Related papers  (2021-03-05T17:47:26Z)

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.