Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

APS March Meeting Abstracts

QSCOUT: Continuously parameterized Mølmer-Sørensen gates for quantum computing circuits (Part II)

Christopher G. Yale, Ashlyn D. Burch, Matthew N. H. Chow, Daniel Lobser, Megan Ivory, Melissa Revelle, Swarnadeep Majumder, Titus Morris, Raphael C. Pooser, Ryan Shaffer, Hang Ren, Emiliia Dyrenkova, Hartmut Häffner, Susan Clark

Published Mar 1, 2023• 0 citations
Publisher

Abstract

Continuously Parameterized Mølmer-Sørensen Gates 2 • The MS gate has an entangling interaction of the form: 𝑀𝑆 𝜃, 𝜙 = exp -𝑖 𝜃 2 cos 𝜙 𝜎 𝑥 + sin 𝜙 𝜎 𝑦 ⊗2• 𝜃 is related to the amount of entanglement from the gate • Most quantum computers have not previously offered arbitrary 𝜃 for the two-qubit gate (IonQ only offers 𝑀𝑆( 𝜋 2 ), Quantinuum recently announced 𝑀𝑆(𝜃)) Enables: • Reduction in quantum circuit depth • Less error / more coherence per gate for smaller 𝜽 Key Elements of 𝑀𝑆(𝜃) 3• How do we realize an arbitrary-angle 𝑴𝑺(𝜽) gate?• Global tone and two individual tones to form the needed red-and blue-detuned Raman transition• All tones have a Gaussian pulse envelope to limit displacement errors [see B. Ruzic B67.00012 (this session)]• To set the angular enclosure, we adjust the global beam power Distortion correctionSources of Error:• 𝜹𝜽 (coherent rotation errors) → distortion/saturation in global beam control electronics• 𝜹𝝓 (coherent phase errors) → resulting AC Stark shifts

DOI
10.2172/2431885

Related papers

Global entangling gates for trapped ions: Numerical design and gate-efficient compilation for Hamiltonian simulation

Shen Zhe-yu, Lin Cheng, Sheng-Chen Liu +2 more

As quantum computing scales up, circuits relying on sequential two-qubit gates face severe challenges from excessive depth and decoherence. In trapped-ion systems, global entangling gates offer a highly parallel alternative but are hindered by complex numerical optimization. We propose an efficient numerical framework for piecewise-constant amplitude-modulated global gates. Based on the Mølmer-Sørensen protocol, we utilize null-space projection for linear constraints of spin-motion coupling and tangent-space gradient descent to minimize laser power, while achieving high-order robustness against frequency drifts. At the application level, we identify a structural correspondence between hardware-native global interactions and Pauli strings in Hamiltonian simulation and propose an efficient compilation scheme. By reducing common physical models to fundamental X X interactions and formulating interaction graph partitioning as a Set Cover problem, we leverage global gates to significantly optimize the compilation process. Explicit pulse-level benchmarks further show that, for the tested weighted interaction graphs, the reduction in entangling-gate count can translate into a substantial reduction in total entangling duration. These results demonstrate that integrating hardware-native operations with tailored compilation strategies can substantially reduce circuit overhead, providing a practical roadmap for the codesign of near-term quantum simulators.

APS Open Science•Oct 14, 2026•1 citation

Optimisation and synthesis of quantum circuits with global gates

Alejandro Villoria, Henning Basold, Alfons Laarman

Abstract Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum hardware, and has the potential to significantly improve their performance when optimisation techniques are added to the process. One such optimisation technique is reducing the number of quantum gates that are needed to execute a circuit. For instance, methods for reducing the number of non-Clifford gates or CNOT gates from a circuit are an extensive research area that has gathered significant interest over the years. For certain hardware platforms such as trapped-ion quantum computers, we can leverage some of their special properties to further reduce the cost of executing a quantum circuit in them. In this work we use global interactions, such as the Global Mølmer–Sørensen (MS) gate present in trapped-ion hardware, to optimise and synthesise quantum circuits. We design and implement an algorithm that is able to compile an arbitrary quantum circuit into another circuit that uses global gates as the entangling operation, while optimising the number of global interactions needed. The algorithm is based on the ZX -calculus and uses a specialised circuit extraction routine that groups entangling gates into Global MS gates. We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations in comparison to a naive algorithm and the Qiskit optimiser.

arXiv:2507.20694•Quantum Science and Technology•Dec 22, 2025•7 citations

Realization and Calibration of Continuously Parameterized Two-Qubit Gates on a Trapped-Ion Quantum Processor

Christopher G. Yale, Ashlyn D. Burch, Matthew N. H. Chow +5 more

Continuously parameterized two-qubit gates are a key feature of state-of-the-art trapped-ion quantum processors as they have favorable error scalings and show distinct improvements in circuit performance over more restricted maximally entangling gatesets. In this work, we provide a comprehensive and pedagogical discussion on how to practically implement these continuously parameterized Mølmer Sørensen gates on the Quantum Scientific Computing Open User Testbed (QSCOUT), a low-level trappedion processor. To generate the arbitrary entangling angles, θ, we simply scale the amplitude of light used to generate the entanglement. However, doing so requires careful consideration of amplifier saturation as well as the variable light shifts that result. As such, we describe a method to calibrate and cancel the dominant fourth-order effects, followed by a dynamic virtual phase advance during the gate to cancel any residual light shifts, and find a linear scaling between θ and the residual light shift. Once, we have considered and calibrated these effects, we demonstrate performance improvement with decreasing θ. Finally, we describe nuances of hardware control to transform the XX-type interaction of the arbitraryangle Mølmer-Sørensen gate into a phase-agnostic and crosstalk-mitigating ZZ interaction.

arXiv:2504.06259•IEEE Transactions on Quantum Engineering•Jan 1, 2025•7 citations

Noise-Aware Circuit Compilations for a Continuously Parameterized Two-Qubit Gateset

Christopher G. Yale

•Mar 1, 2024•0 citations

Nested Bloch-Sphere Rotations Achieve Arbitrarily Accurate SU(2) Gates — E8 Intelligence Research

Andrew Stewart Caldin

FINDING: Composite pulse sequences on the Bloch sphere achieve arbitrarily accurate SU(2) rotations by nesting error-compensating rotations, with the key structural insight being that any single-qubit gate is a 3D rotation in SU(2) ≅ SO(3), parameterized by Euler angles on the sphere. MATH: - Qubit state: |ψ⟩ = cos(θ/2)|0⟩ + e^{iφ} sin(θ/2)|1⟩, with θ ∈ [0,π], φ ∈ [0,2π) — the Bloch sphere coordinates. - SU(2) generators: Pauli matrices σ_x, σ_y, σ_z, satisfying [σ_i, σ_j] = 2iε_{ijk}σ_k. - Rotation operator: R_n̂(θ) = exp(−iθ n̂·σ/2) = cos(θ/2)I − i sin(θ/2)(n̂·σ). - Composite pulse: U_total = Π_k R_{n̂_k}(θ_k), designed so that first-order (and higher) error terms in pulse amplitude/duration vanish: ∂U_total/∂ε |_{ε=0} = 0, up to desired order N. - The arXiv paper (1810.03833) explicitly constructs sequences with arbitrary N, using nested commutators of rotation axes to cancel error terms — a Lie-algebraic approach. CONNECTION: - The Bloch sphere is the unit sphere S², and SU(2) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com

•Oct 1, 2026•0 citations

Sample-efficient verification of continuously-parameterized quantum gates for small quantum processors

Ryan Shaffer, Hang Ren, Emiliia Dyrenkova +7 more

APS March Meeting Abstracts•Mar 1, 2023•0 citations
Continuously Parameterized Mølmer-Sørensen Gates 2 • The MS gate has an entangling interaction of the form: 𝑀𝑆 𝜃, 𝜙 = exp -𝑖 𝜃 2 cos 𝜙 𝜎 𝑥 + sin 𝜙 𝜎 𝑦 ⊗2• 𝜃 is related to the amount of entanglement from the gate • Most quantum computers have not previously offered arbitrary 𝜃 for the two-qubit gate (IonQ only offers 𝑀𝑆( 𝜋 2 ), Quantinuum recently announced 𝑀𝑆(𝜃)) Enables: • Reduction in quantum circuit depth • Less error / more coherence per gate for smaller 𝜽 Key Elements of 𝑀𝑆(𝜃) 3• How do we realize an arbitrary-angle 𝑴𝑺(𝜽) gate?• Global tone and two individual tones to form the needed red-and blue-detuned Raman transition• All tones have a Gaussian pulse envelope to limit displacement errors [see B. Ruzic B67.00012 (this session)]• To set the angular enclosure, we adjust the global beam power Distortion correctionSources of Error:• 𝜹𝜽 (coherent rotation errors) → distortion/saturation in global beam control electronics• 𝜹𝝓 (coherent phase errors) → resulting AC Stark shifts
As quantum computing scales up, circuits relying on sequential two-qubit gates face severe challenges from excessive depth and decoherence. In trapped-ion systems, global entangling gates offer a highly parallel alternative but are hindered by complex numerical optimization. We propose an efficient numerical framework for piecewise-constant amplitude-modulated global gates. Based on the Mølmer-Sørensen protocol, we utilize null-space projection for linear constraints of spin-motion coupling and tangent-space gradient descent to minimize laser power, while achieving high-order robustness against frequency drifts. At the application level, we identify a structural correspondence between hardware-native global interactions and Pauli strings in Hamiltonian simulation and propose an efficient compilation scheme. By reducing common physical models to fundamental X X interactions and formulating interaction graph partitioning as a Set Cover problem, we leverage global gates to significantly optimize the compilation process. Explicit pulse-level benchmarks further show that, for the tested weighted interaction graphs, the reduction in entangling-gate count can translate into a substantial reduction in total entangling duration. These results demonstrate that integrating hardware-native operations with tailored compilation strategies can substantially reduce circuit overhead, providing a practical roadmap for the codesign of near-term quantum simulators.
Abstract Compiling quantum circuits to account for hardware restrictions is an essential part of the quantum computing stack. Circuit compilation allows us to adapt algorithm descriptions into a sequence of operations supported by real quantum hardware, and has the potential to significantly improve their performance when optimisation techniques are added to the process. One such optimisation technique is reducing the number of quantum gates that are needed to execute a circuit. For instance, methods for reducing the number of non-Clifford gates or CNOT gates from a circuit are an extensive research area that has gathered significant interest over the years. For certain hardware platforms such as trapped-ion quantum computers, we can leverage some of their special properties to further reduce the cost of executing a quantum circuit in them. In this work we use global interactions, such as the Global Mølmer–Sørensen (MS) gate present in trapped-ion hardware, to optimise and synthesise quantum circuits. We design and implement an algorithm that is able to compile an arbitrary quantum circuit into another circuit that uses global gates as the entangling operation, while optimising the number of global interactions needed. The algorithm is based on the ZX -calculus and uses a specialised circuit extraction routine that groups entangling gates into Global MS gates. We benchmark the algorithm in a variety of circuits, and show how it improves their performance under state-of-the-art hardware considerations in comparison to a naive algorithm and the Qiskit optimiser.
Continuously parameterized two-qubit gates are a key feature of state-of-the-art trapped-ion quantum processors as they have favorable error scalings and show distinct improvements in circuit performance over more restricted maximally entangling gatesets. In this work, we provide a comprehensive and pedagogical discussion on how to practically implement these continuously parameterized Mølmer Sørensen gates on the Quantum Scientific Computing Open User Testbed (QSCOUT), a low-level trappedion processor. To generate the arbitrary entangling angles, θ, we simply scale the amplitude of light used to generate the entanglement. However, doing so requires careful consideration of amplifier saturation as well as the variable light shifts that result. As such, we describe a method to calibrate and cancel the dominant fourth-order effects, followed by a dynamic virtual phase advance during the gate to cancel any residual light shifts, and find a linear scaling between θ and the residual light shift. Once, we have considered and calibrated these effects, we demonstrate performance improvement with decreasing θ. Finally, we describe nuances of hardware control to transform the XX-type interaction of the arbitraryangle Mølmer-Sørensen gate into a phase-agnostic and crosstalk-mitigating ZZ interaction.
FINDING: Composite pulse sequences on the Bloch sphere achieve arbitrarily accurate SU(2) rotations by nesting error-compensating rotations, with the key structural insight being that any single-qubit gate is a 3D rotation in SU(2) ≅ SO(3), parameterized by Euler angles on the sphere. MATH: - Qubit state: |ψ⟩ = cos(θ/2)|0⟩ + e^{iφ} sin(θ/2)|1⟩, with θ ∈ [0,π], φ ∈ [0,2π) — the Bloch sphere coordinates. - SU(2) generators: Pauli matrices σ_x, σ_y, σ_z, satisfying [σ_i, σ_j] = 2iε_{ijk}σ_k. - Rotation operator: R_n̂(θ) = exp(−iθ n̂·σ/2) = cos(θ/2)I − i sin(θ/2)(n̂·σ). - Composite pulse: U_total = Π_k R_{n̂_k}(θ_k), designed so that first-order (and higher) error terms in pulse amplitude/duration vanish: ∂U_total/∂ε |_{ε=0} = 0, up to desired order N. - The arXiv paper (1810.03833) explicitly constructs sequences with arbitrary N, using nested commutators of rotation axes to cancel error terms — a Lie-algebraic approach. CONNECTION: - The Bloch sphere is the unit sphere S², and SU(2) Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com