Comparison of Two Optimization Methods for a Rydberg Quantum Gate

• URL: http://arxiv.org/abs/2511.08450v1
• Date: Wed, 12 Nov 2025 01:59:10 GMT
• Title: Comparison of Two Optimization Methods for a Rydberg Quantum Gate
• Authors: Luis S. Yagüe Bosch, Sandro Wimberger,
• Abstract summary: A shortcut-to-adiabatic protocol is compared with a numerically optimized protocol for implementing a high-fidelity quantum gate on Rydberg atoms.<n>The study serves as an example of the performance of analytic shortcut-to-adiabatic-inspired protocols.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: A shortcut-to-adiabaticity is compared with a numerically optimized protocol for implementing a high-fidelity quantum gate on Rydberg atoms. The counterdiabatic method offers an analytical framework for accelerating high-fidelity gates by mimicking the time evolution of a counterdiabatic Hamiltonian using fast-oscillating fields. This approach is contrasted with a numerically optimized gate designed using the Boulder Opal platform. The numerically optimized gate achieves higher fidelities while demonstrating robustness against errors similar to that of the effective counterdiabatic gate. The study serves as an example of the performance of analytic shortcut-to-adiabatic-inspired protocols compared to brute-force numerical optimization techniques for state-of-the-art quantum computing platforms. It stresses the important role played by constraints on the optimized pulses in time and in amplitude that are crucial in determining the quality of the optimization method.

Related papers

• Optimizing a parameterized controlled gate using Free Quaternion Selection [0.4353365283165517]
  In this study, we parameterize a generalized controlled gate and propose an algorithm to minimize the cost function by maximally optimizing these parameters.<n>This method extends the Free Quaternion Selection (FQS) technique, which was originally developed for single-qubit gate optimization.
  arXiv  Detail & Related papers  (2024-09-20T14:46:00Z)
• Batched Line Search Strategy for Navigating through Barren Plateaus in Quantum Circuit Training [0.0]
  Variational quantum algorithms are viewed as promising candidates for demonstrating quantum advantage on near-term devices.<n>This work introduces a novel optimization approach designed to alleviate the adverse effects of barren plateau (BP) problems during circuit training.<n>We have successfully applied our optimization strategy to quantum circuits comprising 21 qubits and 15000 entangling gates.
  arXiv  Detail & Related papers  (2024-02-07T20:06:29Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• Optimizing Counterdiabaticity by Variational Quantum Circuits [3.4092751295027997]
  We propose a technique of finding optimal coefficients of the CD terms using a variational quantum circuit. By classical optimizations routines, the parameters of this circuit are optimized to provide the coefficients corresponding to the CD terms. Their improved performance is exemplified in Greenberger-Horne-Zeilinger state preparation on nearest-neighbor Ising model.
  arXiv  Detail & Related papers  (2022-08-03T14:12:26Z)
• Ultrafast Holonomic Quantum Gates [4.354697470999286]
  We propose a nonadiabatic holonomic quantum scheme with detuned interactions on $Delta$-type three-level system. Our numerical simulations show that the gate robustness is also stronger than previous schemes. We present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding.
  arXiv  Detail & Related papers  (2021-08-03T14:31:38Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Robust Quantum Optimal Control with Trajectory Optimization [5.042313273982193]
  We propose a derivative-based approach to suppress gate errors arising from system parameter uncertainty. We employ a computationally efficient model and utilize time-optimal control to achieve high-fidelity gates in the presence of depolarization.
  arXiv  Detail & Related papers  (2021-03-29T15:58:16Z)
• Acceleration Methods [57.202881673406324]
  We first use quadratic optimization problems to introduce two key families of acceleration methods. We discuss momentum methods in detail, starting with the seminal work of Nesterov. We conclude by discussing restart schemes, a set of simple techniques for reaching nearly optimal convergence rates.
  arXiv  Detail & Related papers  (2021-01-23T17:58:25Z)
• 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)
• Cross Entropy Hyperparameter Optimization for Constrained Problem Hamiltonians Applied to QAOA [68.11912614360878]
  Hybrid quantum-classical algorithms such as Quantum Approximate Optimization Algorithm (QAOA) are considered as one of the most encouraging approaches for taking advantage of near-term quantum computers in practical applications. Such algorithms are usually implemented in a variational form, combining a classical optimization method with a quantum machine to find good solutions to an optimization problem. In this study we apply a Cross-Entropy method to shape this landscape, which allows the classical parameter to find better parameters more easily and hence results in an improved performance.
  arXiv  Detail & Related papers  (2020-03-11T13:52:41Z)

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.