Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models

• URL: http://arxiv.org/abs/2408.02639v1
• Date: Mon, 5 Aug 2024 17:07:08 GMT
• Title: Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models
• Authors: Fabio Tarocco, Davide Materia, Leonardo Ratini, Leonardo Guidoni,
• Abstract summary: We introduce a systematic procedure for ansatz building based on approximate Quantum Mutual Information (QMI) Our approach generates a layered-structured ansatz, where each layer's qubit pairs are selected based on their QMI values, resulting in more efficient state preparation and optimization routines. Our results show that the Multi-QIDA method reduces the computational complexity while maintaining high precision, making it a promising tool for quantum simulations in lattice spin models.
• Score: 0.0
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Quantum algorithms based on the variational principle have found applications in diverse areas with a huge flexibility. But as the circuit size increases the variational landscapes become flattened, causing the so-called Barren plateau phenomena. This will lead to an increased difficulty in the optimization phase, due to the reduction of the cost function parameters gradient. One of the possible solutions is to employ shallower circuits or adaptive ans\"atze. We introduce a systematic procedure for ansatz building based on approximate Quantum Mutual Information (QMI) with improvement on each layer based on the previous Quantum Information Driven Ansatz (QIDA) approach. Our approach generates a layered-structured ansatz, where each layer's qubit pairs are selected based on their QMI values, resulting in more efficient state preparation and optimization routines. We benchmarked our approach on various configurations of the Heisenberg model Hamiltonian, demonstrating significant improvements in the accuracy of the ground state energy calculations compared to traditional heuristic ansatz methods. Our results show that the Multi-QIDA method reduces the computational complexity while maintaining high precision, making it a promising tool for quantum simulations in lattice spin models.

Related papers

• Memory-Augmented Hybrid Quantum Reservoir Computing [0.0]
  We present a hybrid quantum-classical approach that implements memory through classical post-processing of quantum measurements. We tested our model on two physical platforms: a fully connected Ising model and a Rydberg atom array.
  arXiv  Detail & Related papers  (2024-09-15T22:44:09Z)
• Fast Quantum Process Tomography via Riemannian Gradient Descent [3.1406146587437904]
  Constrained optimization plays a crucial role in the fields of quantum physics and quantum information science. One specific issue is that of quantum process tomography, in which the goal is to retrieve the underlying quantum process based on a given set of measurement data.
  arXiv  Detail & Related papers  (2024-04-29T16:28:14Z)
• Scalable Imaginary Time Evolution with Neural Network Quantum States [0.0]
  The representation of a quantum wave function as a neural network quantum state (NQS) provides a powerful variational ansatz for finding the ground states of many-body quantum systems. We introduce an approach that bypasses the computation of the metric tensor and instead relies exclusively on first-order descent with Euclidean metric. We make this method adaptive and stable by determining the optimal time step and keeping the target fixed until the energy of the NQS decreases.
  arXiv  Detail & Related papers  (2023-07-28T12:26:43Z)
• A self-consistent field approach for the variational quantum eigensolver: orbital optimization goes adaptive [52.77024349608834]
  We present a self consistent field approach (SCF) within the Adaptive Derivative-Assembled Problem-Assembled Ansatz Variational Eigensolver (ADAPTVQE) This framework is used for efficient quantum simulations of chemical systems on nearterm quantum computers.
  arXiv  Detail & Related papers  (2022-12-21T23:15:17Z)
• 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)
• Collaborative Intelligent Reflecting Surface Networks with Multi-Agent Reinforcement Learning [63.83425382922157]
  Intelligent reflecting surface (IRS) is envisioned to be widely applied in future wireless networks. In this paper, we investigate a multi-user communication system assisted by cooperative IRS devices with the capability of energy harvesting.
  arXiv  Detail & Related papers  (2022-03-26T20:37:14Z)
• 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)
• 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)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Exploring entanglement and optimization within the Hamiltonian Variational Ansatz [0.4881924950569191]
  We study a family of quantum circuits called the Hamiltonian Variational Ansatz (HVA) HVA exhibits favorable structural properties such as mild or entirely absent barren plateaus and a restricted state space. HVA can find accurate approximations to the ground states of a modified Haldane-Shastry Hamiltonian on a ring.
  arXiv  Detail & Related papers  (2020-08-07T01:28: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.