Gate-based counterdiabatic driving with complexity guarantees
- URL: http://arxiv.org/abs/2406.08064v1
- Date: Wed, 12 Jun 2024 10:29:21 GMT
- Title: Gate-based counterdiabatic driving with complexity guarantees
- Authors: Dyon van Vreumingen,
- Abstract summary: We propose a gate-based quantum algorithm for counterdiabatic driving.
It exploits regularisation of the adiabatic gauge potential to suppress only the transitions from the eigenstate of interest.
This calls into question the perception of counterdiabatic driving as a general shortcut to adiabaticity.
- Score: 0.0
- License: http://creativecommons.org/licenses/by-nc-sa/4.0/
- 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 $\Delta$ around this target eigenstate. We find that the algorithm requires at most $\tilde O(\Delta^{-(3 + o(1))} \epsilon^{-(1 + o(1))})$ quantum gates to achieve a target state fidelity of at least $1 - \epsilon^2$, which is nearly equivalent to the gate complexity of gate-based adiabatic state preparation. This calls into question the perception of counterdiabatic driving as a general shortcut to adiabaticity.
Related papers
- Quantum control landscape for generation of $H$ and $T$ gates in an open
qubit with both coherent and environmental drive [57.70351255180495]
An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$)
Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
arXiv Detail & Related papers (2023-09-05T09:05:27Z) - GRAPE optimization for open quantum systems with time-dependent
decoherence rates driven by coherent and incoherent controls [77.34726150561087]
The GRadient Ascent Pulse Engineering (GRAPE) method is widely used for optimization in quantum control.
We adopt GRAPE method for optimizing objective functionals for open quantum systems driven by both coherent and incoherent controls.
The efficiency of the algorithm is demonstrated through numerical simulations for the state-to-state transition problem.
arXiv Detail & Related papers (2023-07-17T13:37:18Z) - Decomposition Algorithm of an Arbitrary Pauli Exponential through a
Quantum Circuit [5.800032532382661]
We review the staircase algorithm to decompose the exponential of a generalized Pauli matrix.
We propose two alternative methods which offer more efficient quantum circuits.
arXiv Detail & Related papers (2023-05-08T16:05:27Z) - Even shorter quantum circuit for phase estimation on early
fault-tolerant quantum computers with applications to ground-state energy
estimation [5.746732081406236]
We develop a phase estimation method with a distinct feature.
The total cost of the algorithm satisfies the Heisenberg-limited scaling $widetildemathcalO(epsilon-1)$.
Our algorithm may significantly reduce the circuit depth for performing phase estimation tasks on early fault-tolerant quantum computers.
arXiv Detail & Related papers (2022-11-22T03:15:40Z) - Multi-squeezed state generation and universal bosonic control via a
driven quantum Rabi model [68.8204255655161]
Universal control over a bosonic degree of freedom is key in the quest for quantum-based technologies.
Here we consider a single ancillary two-level system, interacting with the bosonic mode of interest via a driven quantum Rabi model.
We show that it is sufficient to induce the deterministic realization of a large class of Gaussian and non-Gaussian gates, which in turn provide universal bosonic control.
arXiv Detail & Related papers (2022-09-16T14:18:53Z) - Experimentally feasible computational advantage from quantum
superposition of gate orders [0.0]
In an ordinary quantum algorithm the gates are applied in a fixed order on the systems.
The introduction of indefinite causal structures allows to relax this constraint and control the order of the gates with an additional quantum state.
It is known that this quantum-controlled ordering of gates can reduce the query complexity in deciding a property of black-box unitaries with respect to the best algorithm in which gates are applied in a fixed order.
arXiv Detail & Related papers (2021-12-29T13:36:27Z) - Approaching the theoretical limit in quantum gate decomposition [0.0]
We propose a novel numerical approach to decompose general quantum programs in terms of single- and two-qubit quantum gates with a $CNOT$ gate count.
Our approach is based on a sequential optimization of parameters related to the single-qubit rotation gates involved in a pre-designed quantum circuit used for the decomposition.
arXiv Detail & Related papers (2021-09-14T15:36:22Z) - Quantum simulation of $\phi^4$ theories in qudit systems [53.122045119395594]
We discuss the implementation of quantum algorithms for lattice $Phi4$ theory on circuit quantum electrodynamics (cQED) system.
The main advantage of qudit systems is that its multi-level characteristic allows the field interaction to be implemented only with diagonal single-qudit gates.
arXiv Detail & Related papers (2021-08-30T16:30:33Z) - Quantum Gate for Kerr Nonlinear Parametric Oscillator Using Effective
Excited States [0.0]
We propose a method for a high-fidelity $R_x$ gate by exciting the KPO outside the qubit space with parity-selective transitions.
The proposed method can realize a continuous $R_x$ gate and thus is expected to be useful for, e.g., recently proposed variational quantum algorithms.
arXiv Detail & Related papers (2021-08-06T12:59:29Z) - Random quantum circuits anti-concentrate in log depth [118.18170052022323]
We study the number of gates needed for the distribution over measurement outcomes for typical circuit instances to be anti-concentrated.
Our definition of anti-concentration is that the expected collision probability is only a constant factor larger than if the distribution were uniform.
In both the case where the gates are nearest-neighbor on a 1D ring and the case where gates are long-range, we show $O(n log(n)) gates are also sufficient.
arXiv Detail & Related papers (2020-11-24T18:44:57Z) - Improving the Performance of Deep Quantum Optimization Algorithms with
Continuous Gate Sets [47.00474212574662]
Variational quantum algorithms are believed to be promising for solving computationally hard problems.
In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances.
Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
arXiv Detail & Related papers (2020-05-11T17:20:51Z)
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.