Efficient VQE Approach for Accurate Simulations on the Kagome Lattice

• URL: http://arxiv.org/abs/2306.00467v1
• Date: Thu, 1 Jun 2023 09:14:34 GMT
• Title: Efficient VQE Approach for Accurate Simulations on the Kagome Lattice
• Authors: Jyothikamalesh S, Kaarnika A, Dr.Mohankumar.M, Sanjay Vishwakarma, Srinjoy Ganguly, Yuvaraj P
• Abstract summary: This study focuses on using multiple ansatz models to create an effective Variational Quantum Eigensolver (VQE) on the Kagome lattice. By comparing various optimisation methods and optimising the VQE ansatz models, the main goal is to estimate ground state attributes with high accuracy.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: The Kagome lattice, a captivating lattice structure composed of interconnected triangles with frustrated magnetic properties, has garnered considerable interest in condensed matter physics, quantum magnetism, and quantum computing.The Ansatz optimization provided in this study along with extensive research on optimisation technique results us with high accuracy. This study focuses on using multiple ansatz models to create an effective Variational Quantum Eigensolver (VQE) on the Kagome lattice. By comparing various optimisation methods and optimising the VQE ansatz models, the main goal is to estimate ground state attributes with high accuracy. This study advances quantum computing and advances our knowledge of quantum materials with complex lattice structures by taking advantage of the distinctive geometric configuration and features of the Kagome lattice. Aiming to improve the effectiveness and accuracy of VQE implementations, the study examines how Ansatz Modelling, quantum effects, and optimization techniques interact in VQE algorithm. The findings and understandings from this study provide useful direction for upcoming improvements in quantum algorithms,quantum machine learning and the investigation of quantum materials on the Kagome Lattice.

Related papers

• Quantum Approximate Optimization: A Computational Intelligence Perspective [1.756184965281354]
  We introduce quantum computing and variational quantum algorithms (VQAs) We explain Farhi et al.'s quantum approximate optimization algorithm (Farhi's QAOA) We discuss connections of QAOA to relevant domains, such as computational learning theory and genetic algorithms.
  arXiv  Detail & Related papers  (2024-07-09T19:40:23Z)
• 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 reservoir complexity by Krylov evolution approach [0.0]
  We introduce a precise quantitative method, with strong physical foundations based on the Krylov evolution, to assess the wanted good performance in machine learning tasks. Our results show that the Krylov approach to complexity strongly correlates with quantum reservoir performance, making it a powerful tool in the quest for optimally designed quantum reservoirs.
  arXiv  Detail & Related papers  (2023-10-01T21:06:25Z)
• Comparative study of variations in quantum approximate optimization algorithms for the Traveling Salesman Problem [0.06524460254566902]
  We tackle the Traveling Salesman Problem (TSP) using the quantum approximate optimization algorithm (QAOA) approach. We present numerical results obtained from the gate-based digital quantum simulator. We find a well-balanced QAOA mixer design exhibits more promising potential for gate-based simulators and realistic quantum devices in the long run.
  arXiv  Detail & Related papers  (2023-07-14T09:35:58Z)
• QNEAT: Natural Evolution of Variational Quantum Circuit Architecture [95.29334926638462]
  We focus on variational quantum circuits (VQC), which emerged as the most promising candidates for the quantum counterpart of neural networks. Although showing promising results, VQCs can be hard to train because of different issues, e.g., barren plateau, periodicity of the weights, or choice of architecture. We propose a gradient-free algorithm inspired by natural evolution to optimize both the weights and the architecture of the VQC.
  arXiv  Detail & Related papers  (2023-04-14T08:03:20Z)
• An introduction to variational quantum algorithms on gate-based quantum computing for combinatorial optimization problems [0.0]
  This tutorial provides a mathematical description of the class of Variational Quantum Algorithms. We introduce precisely the key aspects of these hybrid algorithms on the quantum side and the classical side. We devote a particular attention to QAOA, detailing the quantum circuits involved in that algorithm, as well as the properties satisfied by its possible guiding functions.
  arXiv  Detail & Related papers  (2022-12-22T14:27:52Z)
• Quantum circuit architecture search on a superconducting processor [56.04169357427682]
  Variational quantum algorithms (VQAs) have shown strong evidences to gain provable computational advantages for diverse fields such as finance, machine learning, and chemistry. However, the ansatz exploited in modern VQAs is incapable of balancing the tradeoff between expressivity and trainability. We demonstrate the first proof-of-principle experiment of applying an efficient automatic ansatz design technique to enhance VQAs on an 8-qubit superconducting quantum processor.
  arXiv  Detail & Related papers  (2022-01-04T01:53:42Z)
• Portfolio Optimization with Digitized-Counterdiabatic Quantum Algorithms [1.1682745573995112]
  We consider digitized-counterdiabatic quantum computing as an advanced paradigm to approach quantum advantage for industrial applications in the NISQ era. Our analysis shows a drastic improvement in the success probabilities of the resulting digital quantum algorithm when approximate counterdiabatic techniques are introduced.
  arXiv  Detail & Related papers  (2021-12-15T18:55:02Z)
• On exploring practical potentials of quantum auto-encoder with advantages [92.19792304214303]
  Quantum auto-encoder (QAE) is a powerful tool to relieve the curse of dimensionality encountered in quantum physics. We prove that QAE can be used to efficiently calculate the eigenvalues and prepare the corresponding eigenvectors of a high-dimensional quantum state. We devise three effective QAE-based learning protocols to solve the low-rank state fidelity estimation, the quantum Gibbs state preparation, and the quantum metrology tasks.
  arXiv  Detail & Related papers  (2021-06-29T14:01:40Z)
• Benchmarking adaptive variational quantum eigensolvers [63.277656713454284]
  We benchmark the accuracy of VQE and ADAPT-VQE to calculate the electronic ground states and potential energy curves. We find both methods provide good estimates of the energy and ground state. gradient-based optimization is more economical and delivers superior performance than analogous simulations carried out with gradient-frees.
  arXiv  Detail & Related papers  (2020-11-02T19:52:04Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06: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.