You're viewing papers too quickly. Please wait a moment.<br>This helps keep the archive available for everyone.
Quick Navigation
Topics
Trapped Ion Quantum Computing
Variational Coherent Quantum Annealing
arXiv
Authors: N. Barraza, G. Alvarado Barrios, I. Montalban, E. Solano, F. Albarrán-Arriagada
Year
2023
Paper ID
54178
Status
Preprint
Abstract Read
~2 min
Abstract Words
155
Citations
N/A
Abstract
We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer, a method we call variational coherent quantum annealing (VCQA). It involves optimizing the schedule functions governing the quantum dynamics by employing a piecewise family of tailored functions. We also introduce auxiliary Hamiltonians that vanish at the beginning and end of the evolution to increase the energy gap during the process, subsequently reducing the algorithm times. We develop numerical tests using z-local terms as the auxiliary Hamiltonian while considering linear, cyclic, and star connectivity. Moreover, we test our algorithm for a non-stoquastic Hamiltonian such as a Heisenberg chain, showing the potential of the VCQA proposal in different scenarios. In this manner, we achieve a substantial reduction in the ground-state error with just six variational parameters and a duration within the device coherence times. Therefore, the proposed VCQA paradigm offers exciting prospects for current quantum annealers.
Why This Paper Matters
- This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
- It adds a 2023 reference point for readers tracking recent quantum research.
- We present a hybrid classical-quantum computing paradigm where the quantum part strictly runs within the coherence time of a quantum annealer, a method we call variational...
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.