Quick Navigation
Topics
Trapped Ion Quantum Computing
Quantum Simulation
Compact Multi-Threshold Quantum Information Driven Ansatz For Strongly Interactive Lattice Spin Models
arXiv
Authors: Fabio Tarocco, Davide Materia, Leonardo Ratini, Leonardo Guidoni
Year
2024
Paper ID
64576
Status
Preprint
Abstract Read
~2 min
Abstract Words
183
Citations
N/A
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ätze. 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.
Why This Paper Matters
- This paper contributes to the Quantum Simulation research area in the Quantum Articles archive.
- It adds a 2024 reference point for readers tracking recent quantum research.
- Quantum algorithms based on the variational principle have found applications in diverse areas with a huge flexibility.
Paper Tools
Become a member to use research tools
Sign in to open papers, visit source links, share, cite, compare, copy DOI links, request category corrections, and build your reading list.
Show Paper arXiv Publisher Share
Cite This Paper
Copy URL
Compare
Copy DOI Add to Reading List
Category Correction Request
Category Correction Request
Help us improve classification quality by proposing a better category. Every request is reviewed by an admin.
Sign in to submit a category correction request for this paper.
Log In to SubmitReferences & Citation Signals
Community Reactions
Quick sentiment from readers on this paper.
Score:
0
Likes: 0
Dislikes: 0
Sign in to react to this paper.
Discussion & Reviews (Moderated)
Average Rating: 0.0 / 5 (0 ratings)
No written reviews yet.