Quick Navigation

Overview Topics Abstract Importance Paper Tools References Reactions Discussion Publication

Topics

Trapped Ion Quantum Computing

Gate-based counterdiabatic driving with complexity guarantees

arXiv
Authors: Dyon van Vreumingen

Year

2024

Paper ID

66629

Status

Preprint

Abstract Read

~2 min

Abstract Words

107

Citations

N/A

Abstract

We propose a general, fully gate-based quantum algorithm for counterdiabatic driving. The algorithm does not depend on heuristics as in previous variational methods, and exploits regularisation of the adiabatic gauge potential to suppress only the transitions from the eigenstate of interest. This allows for a rigorous quantum gate complexity upper bound in terms of the minimum gap Δ around this eigenstate. We find that, in the worst case, the algorithm requires at most O\(Δ-(3 + o(1\)) ε-(1 + o(1))) quantum gates to achieve a target state fidelity of at least 1 - ε2, where Δ is the minimum spectral gap. In certain cases, the gap dependence can be improved to quadratic.

Why This Paper Matters

  • This paper contributes to the Trapped-Ion Quantum Computing research area in the Quantum Articles archive.
  • It adds a 2024 reference point for readers tracking recent quantum research.
  • We propose a general, fully gate-based quantum algorithm for counterdiabatic driving.

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.

Become a member Sign in
Show Paper arXiv Publisher Share Cite This Paper Copy URL Compare Copy DOI Add to Reading List Category Correction Request

References & Citation Signals

[1] DOI https://doi.org/arXiv:2406.08064 [2] arXiv https://arxiv.org/abs/2406.08064 [3] Publisher https://arxiv.org/abs/2406.08064

Local Citation Graph (Related-Paper Links)

Current Paper #66629

External citation index: OpenAlex citation signal

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.