Quantum Optimal Control with Geodesic Pulse Engineering

• URL: http://arxiv.org/abs/2508.16029v1
• Date: Fri, 22 Aug 2025 01:14:04 GMT
• Title: Quantum Optimal Control with Geodesic Pulse Engineering
• Authors: Dylan Lewis, Roeland Wiersema, Sougato Bose,
• Abstract summary: We develop a new quantum optimal control algorithm for finding unitary transformations with constraints on the Hamiltonian.<n>We demonstrate significant improvements over the widely used gradient-based method, GRAPE, for designing multi-qubit quantum gates.
• Score: 1.5632754424046598
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Designing multi-qubit quantum logic gates with experimental constraints is an important problem in quantum computing. Here, we develop a new quantum optimal control algorithm for finding unitary transformations with constraints on the Hamiltonian. The algorithm, geodesic pulse engineering (GEOPE), uses differential programming and geodesics on the Riemannian manifold of $\textrm{SU}(2^n)$ for $n$ qubits. We demonstrate significant improvements over the widely used gradient-based method, GRAPE, for designing multi-qubit quantum gates. Instead of a local gradient descent, the parameter updates of GEOPE are designed to follow the geodesic to the target unitary as closely as possible. We present numerical results that show that our algorithm converges significantly faster than GRAPE for a range of gates and can find solutions that are not accessible to GRAPE in a reasonable amount of time. The strength of the method is illustrtated with varied multi-qubit gates in 2D neutral Rydberg atom platforms.

Related papers

• Variational quantum algorithms with exact geodesic transport [0.0]
  Variational quantum algorithms (VQAs) are promising candidates for near-term applications of quantum computers.<n>We introduce exact-geodesic VQAs, a curvature-aware framework that enables analytic Riemannian optimization of variational quantum circuits.
  arXiv  Detail & Related papers  (2025-06-20T18:00:10Z)
• Parametrized multiqubit gate design for neutral-atom based quantum platforms [0.0]
  A clever choice and design of gate sets can reduce the depth of a quantum circuit, and can improve the quality of the solution one obtains from a quantum algorithm.<n>Parametrized gates in particular have found use in both near-term algorithms and circuit compilation.
  arXiv  Detail & Related papers  (2024-11-29T15:47:19Z)
• Efficient Learning for Linear Properties of Bounded-Gate Quantum Circuits [62.46800898243033]
  Recent progress in quantum learning theory prompts a question: can linear properties of a large-qubit circuit be efficiently learned from measurement data generated by varying classical inputs?<n>We prove that the sample complexity scaling linearly in $d$ is required to achieve a small prediction error, while the corresponding computational complexity may scale exponentially in d.<n>We propose a kernel-based method leveraging classical shadows and truncated trigonometric expansions, enabling a controllable trade-off between prediction accuracy and computational overhead.
  arXiv  Detail & Related papers  (2024-08-22T08:21:28Z)
• Nonadiabatic geometric quantum gates with on-demand trajectories [2.5539863252714636]
  We propose a general protocol for constructing geometric quantum gates with on-demand trajectories. Our scheme adopts reverse engineering of the target Hamiltonian using smooth pulses. Because a particular geometric gate can be induced by various different trajectories, we can further optimize the gate performance.
  arXiv  Detail & Related papers  (2024-01-20T06:57:36Z)
• Geodesic Algorithm for Unitary Gate Design with Time-Independent Hamiltonians [1.7809113449965783]
  We present an algorithm that finds the time-independent Hamiltonian for a target quantum gate on $n$ qubits.<n>Our algorithm outperforms gradient descent methods for standard multi-qubit gates such as Toffoli and Fredkin.
  arXiv  Detail & Related papers  (2024-01-11T15:20:16Z)
• 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)
• 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)
• Quantum algorithms for grid-based variational time evolution [36.136619420474766]
  We propose a variational quantum algorithm for performing quantum dynamics in first quantization. Our simulations exhibit the previously observed numerical instabilities of variational time propagation approaches.
  arXiv  Detail & Related papers  (2022-03-04T19:00:45Z)
• Variational Quantum Optimization with Multi-Basis Encodings [62.72309460291971]
  We introduce a new variational quantum algorithm that benefits from two innovations: multi-basis graph complexity and nonlinear activation functions. Our results in increased optimization performance, two increase in effective landscapes and a reduction in measurement progress.
  arXiv  Detail & Related papers  (2021-06-24T20:16:02Z)
• Quantum control landscape for ultrafast generation of single-qubit phase shift quantum gates [68.8204255655161]
  We consider the problem of ultrafast controlled generation of single-qubit phase shift quantum gates. Globally optimal control is a control which realizes the gate with maximal possible fidelity. Trap is a control which is optimal only locally but not globally.
  arXiv  Detail & Related papers  (2021-04-26T16:38:43Z)
• Special-Purpose Quantum Processor Design [2.275405513780208]
  Full connectivity of qubits is necessary for most quantum algorithms. inserting swap gate to enable the two-qubit gates between uncoupled qubits significantly decreases the computation result fidelity. We propose a Special-Purpose Quantum Processor Design method that can design suitable structures for different quantum algorithms.
  arXiv  Detail & Related papers  (2021-02-01T23:26:15Z)
• Quantum Geometric Machine Learning for Quantum Circuits and Control [78.50747042819503]
  We review and extend the application of deep learning to quantum geometric control problems. We demonstrate enhancements in time-optimal control in the context of quantum circuit synthesis problems. Our results are of interest to researchers in quantum control and quantum information theory seeking to combine machine learning and geometric techniques for time-optimal control problems.
  arXiv  Detail & Related papers  (2020-06-19T19:12:14Z)
• 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.