Arbitrary parallel entangling gates with independent calibration on a trapped ion quantum computer
Pith reviewed 2026-05-07 16:17 UTC · model grok-4.3
The pith
Trapped-ion quantum computers can run arbitrary parallel entangling gates with independent per-pair calibration and single-gate speed for disjoint pairs.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
We demonstrate parallel entangling gates on a trapped-ion processor that support simultaneous operation on arbitrary qubit pairs, with pulse synthesis and calibration performed independently for each pair. Execution time for disjoint pairs matches that of a single gate, while fidelities for star, ring, and disconnected graphs remain comparable to sequential single-pair gates.
What carries the argument
Independent per-pair pulse synthesis and calibration that is agnostic to the overall qubit connectivity graph.
If this is right
- Algorithms using only disjoint entangling operations finish in time comparable to a single gate, independent of the number of pairs.
- Star and ring graphs still finish faster than sequential execution while retaining single-gate fidelity.
- Calibration effort scales with the number of pairs rather than requiring joint optimization of the entire graph.
- Hardware designs can favor multiple medium-length ion chains, each running its own set of parallel gates.
Where Pith is reading between the lines
- The same independent-calibration idea could be tested on longer chains to check how far crosstalk remains tolerable.
- Similar parallel-gate techniques might be explored on other platforms where individual qubit control pulses can be synthesized separately.
- Fault-tolerance overhead could decrease if parallel gates allow shorter circuit depths on modular ion architectures.
Load-bearing premise
Crosstalk and pulse interference stay small enough that independent calibration of each pair continues to work without needing a global re-optimization when more pairs run together.
What would settle it
A measured fidelity drop larger than a few percent, or a runtime increase beyond single-gate duration, when parallel gates are applied to a connected ring or star pattern with three or more pairs.
Figures
read the original abstract
Parallel processing of information plays a critical role in accelerating computation. This includes quantum computers, where parallel processing of quantum information will play a critical role in practical quantum advantage. Here, we demonstrate a new type of parallel entangling gates in a trapped-ion quantum computer, that simultaneously provides efficient gate-pulse synthesis and calibration, as well as graph-pattern-agnostic implementation. We demonstrate the resulting reduced execution time in three well-known algorithms, exhibiting disjoint gates, a star graph and a ring graph respectively. For disjoint qubit pairs the execution time of our parallel gates is comparable to that of a single-pair entangling gate resulting in an approximately linear speed up. For all graph patterns our parallel gate fidelities are comparable to the fidelity of a single-pair entangling gate. These advantages motivate architectures featuring multiple medium length ion chains in future quantum computing devices.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The manuscript demonstrates a technique for implementing arbitrary parallel entangling gates on a trapped-ion quantum computer. The approach enables efficient pulse synthesis, independent per-pair calibration, and graph-pattern-agnostic operation. Experimental results are shown for three patterns (disjoint qubit pairs, star graph, ring graph) in small algorithms, claiming approximately linear execution-time speedup for disjoint pairs and fidelities comparable to single-pair gates, motivating multi-chain ion-trap architectures.
Significance. If the central claims hold, the work provides a practical route to parallelizing entangling operations in ion traps without proportional time or fidelity penalties, which could accelerate near-term quantum algorithms and support scalable architectures with multiple medium-length chains. The experimental demonstration on hardware, including the reported linear speedup for disjoint pairs and the independent-calibration procedure, constitutes a concrete strength that distinguishes it from purely theoretical proposals.
major comments (1)
- [Results / Experimental demonstrations] The claim of graph-pattern-agnostic implementation with independent calibration (abstract and results sections) rests on the assumption that motional-mode coupling and laser crosstalk remain negligible and do not require global re-optimization when moving beyond the three demonstrated small patterns. The manuscript provides no quantitative analysis or additional data showing how crosstalk scales with graph density or chain length; if this assumption fails, the reported advantages in execution time and fidelity comparability would not generalize to arbitrary graphs.
minor comments (2)
- [Abstract] The abstract refers to 'three well-known algorithms' without naming them; adding the specific algorithm names and a brief description of the qubit mapping would improve clarity for readers.
- [Figures and Methods] Error bars, raw fidelity values, and full calibration details are referenced but not fully presented in the provided text; ensuring these appear in the main figures or supplementary material would strengthen verifiability.
Simulated Author's Rebuttal
We thank the referee for their careful reading of the manuscript and for identifying this important point regarding the generalization of our claims. We address the major comment below.
read point-by-point responses
-
Referee: [Results / Experimental demonstrations] The claim of graph-pattern-agnostic implementation with independent calibration (abstract and results sections) rests on the assumption that motional-mode coupling and laser crosstalk remain negligible and do not require global re-optimization when moving beyond the three demonstrated small patterns. The manuscript provides no quantitative analysis or additional data showing how crosstalk scales with graph density or chain length; if this assumption fails, the reported advantages in execution time and fidelity comparability would not generalize to arbitrary graphs.
Authors: We agree that the manuscript would benefit from an explicit discussion of the assumptions underlying the graph-pattern-agnostic claim. Our approach achieves independent per-pair calibration by synthesizing and optimizing pulses separately for each entangling interaction while sharing the same motional modes; this procedure is designed to absorb local effects of motional-mode coupling and laser crosstalk into the calibration of each pair without requiring a global re-optimization across the entire graph. The three demonstrated patterns (disjoint pairs, star, and ring) were chosen precisely to test qualitatively different connectivity while keeping the ion chain length fixed, and the resulting fidelities remained comparable to the single-pair case. We acknowledge, however, that no quantitative scaling of crosstalk versus graph density or chain length is reported. In the revised manuscript we will add a dedicated paragraph in the discussion section that (i) states the hardware regime in which crosstalk remains negligible, (ii) explains why the per-pair calibration removes the need for global re-optimization, and (iii) reiterates the motivation for multi-chain architectures to keep individual chains at medium length, thereby avoiding the very scaling regime the referee correctly flags as uncharacterized. revision: partial
Circularity Check
No circularity: experimental demonstration relies on hardware benchmarks
full rationale
The paper is an experimental demonstration of parallel entangling gates on trapped-ion hardware. Claims of reduced execution time for disjoint pairs and comparable fidelities across graph patterns (disjoint, star, ring) are validated by direct measurements against single-pair gates using standard ion-trap pulse synthesis and calibration methods. No load-bearing mathematical derivations, fitted parameters renamed as predictions, or self-referential equations appear; the work is self-contained against external hardware benchmarks and does not reduce any result to its own inputs by construction.
Axiom & Free-Parameter Ledger
axioms (1)
- domain assumption Laser pulses can be synthesized to produce entangling interactions between selected ion pairs with controllable crosstalk.
Reference graph
Works this paper leans on
-
[1]
Our approach employs a smooth pulse throughout the pulse duration τ
-
[2]
Our approach can stabilize the pulse solutions against drift in the mode frequencies
-
[3]
Our approach admits a single pulse solution set for all two-qubit entangling gates, from which we can draw a subset to form any graph pattern, avoiding the need to synthesize solutions for every gate pattern (see [17]). Finding a parallel gate solution set proceeds in three steps. Step 1: Define basis functions and constraints – We use pulse solution basis...
work page 2000
-
[4]
C. Figgatt, A. Ostrander, N. M. Linke, K. A. Landsman, D. Zhu, D. Maslov, and C. Monroe, Nature 572, 368 (2019)
work page 2019
-
[5]
N. Grzesiak, R. Bl¨ umel, K. Wright, K. M. Beck, N. C. Pisenti, M. Li, V. Chaplin, J. M. Amini, S. Debnath, J.-S. Chen, et al. , Nature communications 11, 2963 (2020)
work page 2020
-
[6]
Y. Lu, S. Zhang, K. Zhang, W. Chen, Y. Shen, J. Zhang, J.-N. Zhang, and K. Kim, Nature 572, 363 (2019)
work page 2019
-
[7]
S. J. Evered, D. Bluvstein, M. Kalinowski, S. Ebadi, T. Manovitz, H. Zhou, S. H. Li, A. A. Geim, T. T. Wang, N. Maskara, et al. , Nature 622, 268 (2023)
work page 2023
- [8]
- [9]
-
[10]
S. Debnath, N. M. Linke, C. Figgatt, K. A. Landsman, K. Wright, and C. Monroe, Nature 536, 63 (2016)
work page 2016
-
[11]
T. G. Draper, S. A. Kutin, E. M. Rains, and K. M. Svore, Quantum Info. Comput. 6, 351–369 (2006)
work page 2006
- [12]
- [13]
-
[14]
A. Maksymov, J. Nguyen, V. Chaplin, Y. Nam, and I. L. Markov, in 2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA) (IEEE, 2022) pp. 387–399
work page 2022
-
[15]
R. Bl¨ umel, N. Grzesiak, N. H. Nguyen, A. M. Green, M. Li, A. Maksymov, N. M. Linke, and Y. Nam, Physical Review Letters 126, 220503 (2021)
work page 2021
- [16]
- [17]
- [18]
-
[19]
R. Bl¨ umel, N. Grzesiak, N. Pisenti, K. Wright, and Y. Nam, npj Quantum Information 7, 147 (2021)
work page 2021
-
[20]
In principle, the method of [2] allows some patterns with- out synthesizing a new gate solution. For example, for a given pattern G(V, E ) for which a set of pulse solu- tions are solved, where G is a gate pattern graph de- fined over qubits (vertices) V and entangling gate (edges) E, a subset G′(V ′, E ′) can be implemented without re- synthesizing pulse ...
- [21]
-
[22]
C. A. Sackett, D. Kielpinski, B. E. King, C. Langer, V. Meyer, C. J. Myatt, M. Rowe, Q. Turchette, W. M. Itano, D. J. Wineland, et al. , Nature 404, 256 (2000)
work page 2000
-
[23]
C. J. Ballance, T. P. Harty, N. M. Linke, M. A. Sepiol, and D. M. Lucas, Phys. Rev. Lett. 117, 060504 (2016)
work page 2016
-
[24]
W. Van Dam, S. Hallgren, and L. Ip, SIAM Journal on Computing 36, 763 (2006)
work page 2006
-
[25]
M. R¨ otteler, in Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms (SIAM,
-
[26]
E. Bernstein and U. Vazirani, SIAM Journal on Comput- ing 26, 1411 (1997)
work page 1997
-
[27]
A. M. Childs, D. Maslov, Y. Nam, N. J. Ross, and Y. Su, Proceedings of the National Academy of Sciences 115, 9456 (2018). 9
work page 2018
-
[28]
F. Bonechi, E. Celeghini, R. Giachetti, E. Sorace, and M. Tarlini, Journal of Physics A: Mathematical and Gen- eral 25, L939 (1992)
work page 1992
-
[29]
Maslov, New Journal of Physics 19, 023035 (2017)
D. Maslov, New Journal of Physics 19, 023035 (2017)
work page 2017
-
[30]
Suzuki, Journal of Mathematical Physics 32, 400 (1991)
M. Suzuki, Journal of Mathematical Physics 32, 400 (1991)
work page 1991
-
[31]
J. E. Savage, Models of computation , Vol. 136 (Addison- Wesley Reading, MA, 1998)
work page 1998
-
[32]
J.-S. Chen, E. Nielsen, M. Ebert, V. Inlek, K. Wright, V. Chaplin, A. Maksymov, E. P´ aez, A. Poudel, P. Maunz, et al. , Quantum 8, 1516 (2024)
work page 2024
-
[33]
S. A. Moses, C. H. Baldwin, M. S. Allman, R. Ancona, L. Ascarrunz, C. Barnes, J. Bartolotta, B. Bjork, P. Blan- chard, M. Bohn, et al. , Physical Review X 13, 041052 (2023)
work page 2023
-
[34]
Y. Zhu, A. M. Green, N. H. Nguyen, C. Huerta Alderete, E. Mossman, and N. M. Linke, Advanced Quantum Technologies 6, 2300056 (2023)
work page 2023
-
[35]
M. Kang, Q. Liang, M. Li, and Y. Nam, Quantum Sci- ence and Technology 8, 024002 (2023)
work page 2023
- [36]
-
[37]
A. M. Steane, Fortschritte der Physik: Progress of Physics 46, 443 (1998)
work page 1998
-
[38]
D. Aharonov and M. Ben-Or, in Proceedings of the twenty-ninth annual ACM symposium on Theory of com- puting (1997) pp. 176–188
work page 1997
-
[39]
“Mode and eta values,” https://github.com/ athan42-umd/mode-parameters. Appendix A: Different parallel pulse protocols In this section, we show three different protocols that may be used to implement parallel two-qubit gates in a trapped-ion quantum computer. In particular, we discuss their implementation details and pros and cons. We note the protocol used...
-
[40]
Sequencing protocol Consider a scenario where two-qubit gate pulses g(t) are solved individually such that each gate pulse, when implemented, results in a single two-qubit gate. Denot- ing the different pulses for different pairs as gν (t) with index ν ∈ { 1, 2, .., N }, the following steps may be used to implement N two-qubit gates simultaneously. Hereafte...
-
[41]
Let gν (t) be a gate pulse that, when implemented, results in χ ν = ( π/ 2) for every ν. For example, pulses gν (t) may be solved using Fourier basis func- tions, as in [12, 16], admitting power optimality
-
[42]
Synthesize a pulse sequence GN := ( s1, s 2, .., s N ) for N pairs, where sm are the sequences for pair m, with the following recursion relation: GN = (GN / 2, G N / 2) ∥ (GN / 2, − GN / 2), where ∥ denotes concatenation and it is assumed that, in an example sequence (GN / 2, − GN / 2), GN / 2 is applicable to the first N / 2 pairs and − GN / 2 is applicab...
-
[43]
For each pair ν, the sequence is of length N
Apply gν (t) for each ν with signs implied by GN . For each pair ν, the sequence is of length N . The above sequence-based protocol hinges on the fact that, when applying − gν (t) to each qubit of pair ν, the induced entanglement phase angle is still χ ν , not − χ ν , and a negative phase angle is obtained only when two qubits see opposite-signed pulses. ...
-
[44]
Disjoint null-space protocol Another method to implement N two-qubit entangling gates simultaneously may be as follows. Recall from main text our basis function of choice is sine functions and that the pulse constraints include α ip = 0. We may opt to satisfy these constraints by first assigning sine functions with differerent frequencies l/τ into N mutuall...
-
[45]
Common null-space protocol The protocol used in the main text is the common null- space protocol, detailed in this section. Unlike the dis- joint null-space protocol detailed in the previous section, here, the null space that satisfies α ip = 0 is solved once, over the entire frequency range of the sine basis functions, the same as a conventional single en...
-
[46]
Power Scaling Figure 6(a) shows pulse power requirement as a func- tion of gate duration for a chosen number of ions N = 13. We use an ideal set of mode frequencies and Lamb-Dicke parameters obtained by assuming We observe that there is a one-to-one power-time tradeoff, just as in the series pulses. This allows us to implement the power rebal- ancing techn...
-
[47]
Motional-Mode Stabilization Our approach allows for additional constraints to be added to the gate pulse solver as in previous methods [16]. One such example is to stabilize the gate pulses, in par- ticular ion-mode decoupling represented by α ip, against motional-mode frequency drifts. This is achieved by modifying the α ip constraint in (2) to be ∂ kα i...
work page 2000
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.