Quantum Optimal Control with Geodesic Pulse Engineering

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.

Publication Details

Journal
ArXiv.org
Published
2025-08-22
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Quantum Optimal Control with Geodesic Pulse Engineering

ArXiv.org
Geochemistry and Geologic Mapping
article

Quantum Optimal Control with Geodesic Pulse Engineering

article en

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.

ArXiv.org
Openalex Percentile: Top 65%
Geochemistry and Geologic Mapping
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.