Orthogonal frequency-division multiplexing for simultaneous gate operations on multiple qubits via a shared control line
Pith reviewed 2026-05-17 19:57 UTC · model grok-4.3
The pith
Orthogonal frequency-division multiplexing allows high-fidelity simultaneous gate operations on multiple qubits using a single shared control line.
A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.
Core claim
Through theoretical and numerical analyses, orthogonal and quasi-orthogonal microwave signals in a frequency-division multiplexing scheme using rectangular pulses suppress interference in simultaneously driven qubits, thereby ensuring high gate fidelity for multi-qubit operations via a shared control line.
What carries the argument
Orthogonal frequency-division multiplexing (FDM) with rectangular microwave pulses, where appropriate frequency spacing makes signals orthogonal to minimize crosstalk and interference.
If this is right
- Simultaneous driving of multiple qubits becomes feasible without significant fidelity loss due to interference.
- Design rules for pulse duration, multiplexing count, and rotation angle ensure accurate qubit rotations.
- Reduced number of control lines mitigates thermal load issues in large-scale quantum processors.
- Scalable FDM-based microwave control suitable for processors with many qubits.
Where Pith is reading between the lines
- Implementing this on superconducting qubit hardware could validate the reduction in control lines needed.
- Similar multiplexing strategies might extend to other control modalities in different quantum systems.
- The approach assumes ideal rectangular pulses, so real-world filtering effects would need separate study.
Load-bearing premise
That interference from non-orthogonal frequency components is the primary error source and that rectangular pulses can be generated and transmitted without extra phase noise or line-induced crosstalk.
What would settle it
Measuring the gate error rates for two or more qubits driven simultaneously with orthogonal versus closely spaced non-orthogonal frequencies and comparing to the predicted fidelity.
Figures
read the original abstract
The increasing number of qubits in quantum processors necessitates a corresponding increase in the number of control lines between the processor, which is typically operated at cryogenic temperatures, and external electronics. Scaling poses significant challenges in terms of the thermal loads, forming a major bottleneck in the realization of large-scale quantum computers. In this study, we analyze simultaneous gate operations on multiple qubits using microwaves transmitted via a single cable in a frequency-division multiplexing (FDM) scheme. By employing rectangular control microwave pulses, we reveal the contribution of drive frequency spacing to gate fidelity. Through theoretical and numerical analyses, we demonstrate that orthogonal and quasi-orthogonal microwave signals suppress interference in simultaneously driven qubits, thereby ensuring high gate fidelity. Additionally, we provide design guidelines for key parameters, including pulse length, number of multiplexed microwave signals, and rotation angle, to achieve precise qubit operations. Our findings enable a scalable FDM-based microwave control scheme suitable for quantum processors with a large number of qubits.
Editorial analysis
A structured set of objections, weighed in public.
Referee Report
Summary. The paper analyzes simultaneous single-qubit gates on multiple qubits driven by rectangular microwave pulses transmitted over a shared control line in a frequency-division multiplexing scheme. Analytic integration of the drive Hamiltonian shows that frequency spacings satisfying the orthogonality condition Δf = n/T (n integer, T pulse duration) cause cross terms to integrate to zero; numerical solution of the time-dependent Schrödinger equation then yields high gate fidelities for up to several qubits. Design guidelines are given for pulse length, multiplexing count, and rotation angle.
Significance. If the ideal-pulse results survive realistic hardware imperfections, the scheme would directly address the control-line bottleneck in scaling superconducting processors. The parameter-free orthogonality derivation and the accompanying numerical fidelity estimates constitute clear technical strengths.
major comments (2)
- [§3.2, Eq. (8)] §3.2, Eq. (8): the analytic demonstration that the integrated cross-drive term vanishes relies on perfect rectangular envelopes; any finite rise time or dispersion on the shared line introduces sidebands that violate the orthogonality integral, rendering the derived fidelity an upper bound rather than an achievable value.
- [§4, Numerical Results] §4, Numerical Results: the reported fidelities (e.g., >99.9 % for four qubits) are obtained under ideal square pulses with no inclusion of amplifier nonlinearity, phase noise, or qubit-frequency drift; these omissions are load-bearing for the claim that the method “ensures high gate fidelity” in a practical large-scale processor.
minor comments (2)
- [Abstract] Abstract: the phrase “high gate fidelity” is used without a quantitative threshold or explicit list of error sources considered.
- [Figures] Figure captions: units and normalization of the fidelity metric should be stated explicitly (average gate fidelity vs. process fidelity).
Simulated Author's Rebuttal
We thank the referee for the constructive comments, which highlight key practical limitations of our ideal-pulse analysis. We address each major comment below and will revise the manuscript accordingly to clarify assumptions and strengthen the discussion of real-world applicability.
read point-by-point responses
-
Referee: [§3.2, Eq. (8)] §3.2, Eq. (8): the analytic demonstration that the integrated cross-drive term vanishes relies on perfect rectangular envelopes; any finite rise time or dispersion on the shared line introduces sidebands that violate the orthogonality integral, rendering the derived fidelity an upper bound rather than an achievable value.
Authors: We agree that the derivation of Eq. (8) assumes ideal rectangular envelopes with instantaneous rise and fall times. Any finite rise time or dispersion on the shared control line will generate sidebands that prevent the cross terms from integrating exactly to zero, so the reported fidelities constitute an upper bound for the ideal case. In the revised manuscript we will explicitly state this assumption in §3.2, add a short paragraph in the discussion section on the sensitivity to non-ideal envelopes, and note that pulse-shaping methods could be used to restore approximate orthogonality. We will also qualify the abstract and conclusions to reflect that the orthogonality condition provides a design target rather than a guaranteed result under realistic hardware conditions. revision: yes
-
Referee: [§4, Numerical Results] §4, Numerical Results: the reported fidelities (e.g., >99.9 % for four qubits) are obtained under ideal square pulses with no inclusion of amplifier nonlinearity, phase noise, or qubit-frequency drift; these omissions are load-bearing for the claim that the method “ensures high gate fidelity” in a practical large-scale processor.
Authors: We acknowledge that all numerical results in §4 are obtained with perfect square pulses and omit amplifier nonlinearity, phase noise, and qubit-frequency drift. These omissions mean the high-fidelity claims apply strictly to the ideal model and do not yet demonstrate performance in a practical processor. In the revision we will insert explicit caveats at the beginning of §4, revise the abstract and §5 to avoid implying immediate applicability to large-scale hardware, and add a brief forward-looking paragraph on how the orthogonality principle might be combined with calibration or error-mitigation techniques to address these effects. The core technical contribution—analytic identification of the orthogonality condition—remains valid as a starting point for such extensions. revision: yes
Circularity Check
Derivation uses standard drive equations and Fourier orthogonality without self-referential reductions
full rationale
The paper's central derivation computes time-integrated drive terms for rectangular microwave pulses at frequencies spaced by integer multiples of 1/T. This follows directly from the standard qubit Hamiltonian in the rotating frame and the integral property of orthogonal sinusoids; the vanishing cross terms are a mathematical identity independent of the target fidelity values. Numerical Schrödinger-equation simulations serve only as confirmation and introduce no fitted parameters that are later renamed as predictions. No self-citations are invoked to establish uniqueness of the orthogonal scheme, and the rectangular-pulse assumption is stated explicitly rather than smuggled in via prior work. The result is therefore self-contained against external benchmarks.
Axiom & Free-Parameter Ledger
axioms (2)
- domain assumption Rotating-wave approximation remains valid for the chosen drive frequencies and pulse durations
- domain assumption Qubits are two-level systems with no leakage to higher states during the drive
Lean theorems connected to this paper
-
IndisputableMonolith/Cost/FunctionalEquation.leanwashburn_uniqueness_aczel unclear?
unclearRelation between the paper passage and the cited Recognition theorem.
We assume that the microwave pulses have rectangular envelopes... τ=τ0 where the microwave signals are mutually orthogonal... sin(nΔτ0)=0 ... λx=ϕ/2, λy=0
What do these tags mean?
- matches
- The paper's claim is directly supported by a theorem in the formal canon.
- supports
- The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
- extends
- The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
- uses
- The paper appears to rely on the theorem as machinery.
- contradicts
- The paper's claim conflicts with a theorem or certificate in the canon.
- unclear
- Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.
Reference graph
Works this paper leans on
-
[1]
M. A. Nielsen and I. L. Chuang,Quantum computation and quantum information(Cambridge University Press, 2010)
work page 2010
-
[2]
P. W. Shor, Polynomial-time algorithms for prime factor- ization and discrete logarithms on a quantum computer, SIAM Rev.41, 303 (1999)
work page 1999
-
[3]
A. Kandala, A. Mezzacapo, K. Temme, M. Takita, M. Brink, J. M. Chow, and J. M. Gambetta, Hardware- efficient variational quantum eigensolver for small molecules and quantum magnets, Nature549, 242 (2017)
work page 2017
-
[4]
Google AI Quantum and Collaborators, Hartree-Fock on a superconducting qubit quantum computer, Science 369, 1084 (2020)
work page 2020
-
[5]
H. Takahashi, T. Tomaru, T. Hirano, S. Tahara, and F. Sato, Chemical reaction simulator on quantum com- puters by first quantization (II)─basic treatment: Imple- mentation, J. Chem. Theory Comput.20, 9290 (2024)
work page 2024
-
[6]
Lloyd, Universal quantum simulators, Science273, 1073 (1996)
S. Lloyd, Universal quantum simulators, Science273, 1073 (1996)
work page 1996
-
[7]
Y. Kim, A. Eddins, S. Anand, K. X. Wei, E. Van Den Berg, S. Rosenblatt, H. Nayfeh, Y. Wu, M. Zaletel, K. Temme, and A. Kandala, Evidence for the utility of quantum computing before fault tolerance, Nature618, 500 (2023)
work page 2023
-
[8]
P. C. S. Costa, S. Jordan, and A. Ostrander, Quantum algorithm for simulating the wave equation, Phys. Rev. A99, 012323 (2019)
work page 2019
-
[9]
Y. Sato, H. Tezuka, R. Kondo, and N. Yamamoto, Quan- tum algorithm for partial differential equations of non- conservative systems with spatially varying parameters, Phys. Rev. Appl.23, 014063 (2025)
work page 2025
-
[10]
L. K. Grover, A fast quantum mechanical algorithm for database search, inProceedings of the Twenty-Eighth An- nual ACM Symposium on Theory of Computing, STOC ’96 (Association for Computing Machinery, New York, NY, USA, 1996) pp. 212–219
work page 1996
-
[11]
A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum al- gorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009)
work page 2009
-
[12]
A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, A variational eigenvalue solver on a photonic quantum processor, Nat. Commun.5, 4213 (2014)
work page 2014
-
[13]
A Quantum Approximate Optimization Algorithm
E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, arXiv:1411.4028 (2014)
work page internal anchor Pith review Pith/arXiv arXiv 2014
-
[14]
P. Rebentrost, M. Mohseni, and S. Lloyd, Quantum sup- port vector machine for big data classification, Phys. Rev. Lett.113, 130503 (2014)
work page 2014
-
[15]
K. Mitarai, M. Negoro, M. Kitagawa, and K. Fujii, Quan- tum circuit learning, Phys. Rev. A98, 032309 (2018)
work page 2018
-
[16]
S. Gao, F. Hayes, S. Croke, C. Messenger, and J. Veitch, Quantum algorithm for gravitational-wave matched fil- tering, Phys. Rev. Res.4, 023006 (2022)
work page 2022
-
[17]
N. Ishida and Y. Hasegawa, Quantum-computer-based verification of quantum thermodynamic uncertainty re- lation, Phys. Rev. E112, 034124 (2025)
work page 2025
-
[18]
Y. Nakamura, Y. A. Pashkin, and J. S. Tsai, Coher- ent control of macroscopic quantum states in a single- Cooper-pair box, Nature398, 786 (1999)
work page 1999
-
[19]
A. Blais, R.-S. Huang, A. Wallraff, S. M. Girvin, and R. J. Schoelkopf, Cavity quantum electrodynamics for superconducting electrical circuits: An architecture for quantum computation, Phys. Rev. A69, 062320 (2004)
work page 2004
-
[20]
J. Koch, T. M. Yu, J. Gambetta, A. A. Houck, D. I. Schuster, J. Majer, A. Blais, M. H. Devoret, S. M. Girvin, and R. J. Schoelkopf, Charge-insensitive qubit design de- rived from the Cooper pair box, Phys. Rev. A76, 042319 (2007)
work page 2007
-
[21]
L. DiCarlo, J. M. Chow, J. M. Gambetta, L. S. Bishop, B. R. Johnson, D. I. Schuster, J. Majer, A. Blais, L. Frun- zio, S. M. Girvin, and R. J. Schoelkopf, Demonstration of two-qubit algorithms with a superconducting quantum processor, Nature460, 240 (2009)
work page 2009
-
[22]
M. Steffen, D. P. DiVincenzo, J. M. Chow, T. N. Theis, and M. B. Ketchen, Quantum computing: An IBM per- spective, IBM J. Res. Dev.55, 13:1 (2011)
work page 2011
-
[23]
Y. Zhao, Y. Ye, H.-L. Huang, Y. Zhang, D. Wu, H. Guan, Q. Zhu, Z. Wei, T. He, S. Cao, F. Chen, T.-H. Chung, H. Deng, D. Fan, M. Gong,et al., Realization of an error- correcting surface code with superconducting qubits, Phys. Rev. Lett.129, 030501 (2022)
work page 2022
-
[24]
D. Bluvstein, S. J. Evered, A. A. Geim, S. H. Li, H. Zhou, T. Manovitz, S. Ebadi, M. Cain, M. Kalinowski, D. Hangleiter, J. P. Bonilla Ataides, N. Maskara, I. Cong, X. Gao, P. Sales Rodriguez,et al., Logical quantum pro- cessor based on reconfigurable atom arrays, Nature626, 58 (2024)
work page 2024
-
[25]
A. Anferov, S. P. Harvey, F. Wan, J. Simon, and D. I. Schuster, Superconducting qubits above 20 GHz operat- ing over 200 mK, PRX Quantum5, 030347 (2024)
work page 2024
- [26]
- [27]
-
[28]
Google Quantum AI and Collaborators, Quantum error correction below the surface code threshold, Nature638, 920 (2025)
work page 2025
-
[29]
J. P. G. van Dijk, E. Kawakami, R. N. Schouten, M. Veld- horst, L. M. K. Vandersypen, M. Babaie, E. Charbon, and F. Sebastiano, Impact of classical control electronics on qubit fidelity, Phys. Rev. Appl.12, 044054 (2019)
work page 2019
-
[30]
J. M. Hornibrook, J. I. Colless, I. D. Conway Lamb, S. J. Pauka, H. Lu, A. C. Gossard, J. D. Watson, G. C. Gard- ner, S. Fallahi, M. J. Manfra, and D. J. Reilly, Cryogenic control architecture for large-scale quantum computing, Phys. Rev. Appl.3, 024010 (2015)
work page 2015
-
[31]
S. Krinner, S. Storz, P. Kurpiers, P. Magnard, J. Hein- soo, R. Keller, J. L¨ uetolf, C. Eichler, and A. Wallraff, Engineering cryogenic setups for 100-qubit scale super- conducting circuit systems, EPJ Quantum Technol.6, 2 (2019)
work page 2019
-
[32]
J. P. G. van Dijk, E. Charbon, and F. Sebastiano, The electronic interface for quantum processors, Micropro- cess. Microsyst.66, 90 (2019)
work page 2019
-
[33]
X. Xue, B. Patra, J. P. G. van Dijk, N. Samkharadze, S. Subramanian, A. Corna, B. Paquelet Wuetz, C. Jeon, F. Sheikh, E. Juarez-Hernandez, B. P. Esparza, H. Ram- purawala, B. Carlton, S. Ravikumar, C. Nieva,et al., CMOS-based cryogenic control of silicon quantum cir- cuits, Nature593, 205 (2021)
work page 2021
-
[34]
N. Takeuchi, T. Yamae, T. Yamashita, T. Yamamoto, and N. Yoshikawa, Microwave-multiplexed qubit con- troller using adiabatic superconductor logic, npj Quan- tum Inf.10, 53 (2024)
work page 2024
-
[35]
A. G. Fowler, M. Mariantoni, J. M. Martinis, and A. N. Cleland, Surface codes: Towards practical large-scale quantum computation, Phys. Rev. A86, 032324 (2012)
work page 2012
-
[36]
D. Litinski, A game of surface codes: Large-scale quan- tum computing with lattice surgery, Quantum3, 128 (2019)
work page 2019
-
[37]
J. C. Bardin, E. Jeffrey, E. Lucero, T. Huang, S. Das, D. T. Sank, O. Naaman, A. E. Megrant, R. Barends, T. White, M. Giustina, K. J. Satzinger, K. Arya, P. Roushan, B. Chiaro,et al., Design and characteri- zation of a 28-nm bulk-CMOS cryogenic quantum con- troller dissipating less than 2 mW at 3 K, IEEE J. Solid- State Circuits54, 3043 (2019)
work page 2019
-
[38]
J. P. G. Van Dijk, B. Patra, S. Subramanian, X. Xue, N. Samkharadze, A. Corna, C. Jeon, F. Sheikh, E. Juarez-Hernandez, B. P. Esparza, H. Rampurawala, B. R. Carlton, S. Ravikumar, C. Nieva, S. Kim,et al., A scalable cryo-CMOS controller for the wideband frequency-multiplexed control of spin qubits and trans- mons, IEEE J. Solid-State Circuits55, 2930 (2020)
work page 2020
- [39]
-
[40]
S. Chakraborty, D. J. Frank, K. Tien, P. Rosno, M. Yeck, J. A. Glick, R. Robertazzi, R. Richetta, J. F. Bulzac- chelli, D. Underwood, D. Ramirez, D. Yilma, A. Davies, R. V. Joshi, S. D. Chambers,et al., A cryo-CMOS low- power semi-autonomous transmon qubit state controller in 14-nm FinFET technology, IEEE J. Solid-State Cir- cuits57, 3258 (2022)
work page 2022
-
[41]
P. Zhao, R. Wang, M.-J. Hu, T. Ma, P. Xu, Y. Jin, and H. Yu, Baseband control of superconducting qubits with shared microwave drives, Phys. Rev. Appl.19, 054050 (2023)
work page 2023
-
[42]
N. Takeuchi, T. Yamae, W. Luo, F. Hirayama, T. Ya- mamoto, and N. Yoshikawa, Scalable flux controllers us- ing adiabatic superconductor logic for quantum proces- sors, Phys. Rev. Res.5, 013145 (2023)
work page 2023
-
[43]
H. Shen, N. Takeuchi, Y. Yamanashi, and N. Yoshikawa, Amplitude-controllable microwave pulse generator using single-flux-quantum pulse pairs for qubit control, Super- cond. Sci. Technol.36, 095010 (2023)
work page 2023
- [44]
-
[45]
R. Matsuda, R. Ohira, T. Sumida, H. Shiomi, A. Machino, S. Morisaka, K. Koike, T. Miyoshi, Y. Kuri- moto, Y. Sugita, Y. Ito, Y. Suzuki, P. A. Spring, S. Wang, S. Tamate,et al., Selective excitation of superconducting qubits with a shared control line through pulse shaping, arXiv:2501.10710 (2025)
-
[46]
R. W. Chang, Synthesis of band-limited orthogonal sig- nals for multichannel data transmission, Bell Labs Tech. J.45, 1775 (1966)
work page 1966
- [47]
-
[48]
J. G. Andrews, S. Buzzi, W. Choi, S. V. Hanly, A. Lozano, A. C. K. Soong, and J. C. Zhang, What will 5G be?, IEEE J. Sel. Areas Commun.32, 1065 (2014)
work page 2014
-
[49]
D. C. McKay, C. J. Wood, S. Sheldon, J. M. Chow, and J. M. Gambetta, EfficientZgates for quantum comput- ing, Phys. Rev. A96, 022330 (2017)
work page 2017
-
[50]
L. H. Pedersen, N. M. Møller, and K. Mølmer, Fidelity of quantum operations, Phys. Lett. A367, 47 (2007)
work page 2007
-
[51]
Magnus, On the exponential solution of differential equations for a linear operator, Commun
W. Magnus, On the exponential solution of differential equations for a linear operator, Commun. Pure Appl. Math.7, 649 (1954)
work page 1954
-
[52]
B. Chiaro and Y. Zhang, Active leakage cancellation in single qubit gates, Phys. Rev. Lett.135, 130601 (2025)
work page 2025
-
[53]
QuTiP 5: The Quantum Toolbox in Python
N. Lambert, E. Gigu` ere, P. Menczel, B. Li, P. Hopf, G. Su´ arez, M. Gali, J. Lishman, R. Gadhvi, R. Agar- wal, A. Galicia, N. Shammah, P. Nation, J. R. Johans- son, S. Ahmed,et al., QuTiP 5: The quantum toolbox in Python, arXiv:2412.04705 (2024)
work page internal anchor Pith review Pith/arXiv arXiv 2024
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.