Optimally Driven Dressed Qubits

• URL: http://arxiv.org/abs/2601.19719v1
• Date: Tue, 27 Jan 2026 15:42:17 GMT
• Title: Optimally Driven Dressed Qubits
• Authors: Alon Salhov, Sagi Nechushtan, Alex Retzker,
• Abstract summary: We introduce a dressed-qubit control protocol that optimally removes the CRT and delivers substantial improvements in multiple performance metrics.<n>These advances position our scheme as the state-of-the-art strategy for qubit control, paving the way for a wider class of quantum technologies.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The applicability and performance of qubits dressed by classical fields are limited because their control protocols give rise to an undesired counter-rotating term (CRT). This in turn forces operation in a regime where a (dressed) rotating-wave approximation (RWA) is valid, thereby restricting key aspects of their operation. Here, using only a single coupling axis in the laboratory frame, we introduce a dressed-qubit control protocol that optimally removes the CRT, eliminating the need for the RWA and delivering substantial improvements in multiple performance metrics, including single-qubit gate speed, two-qubit gate fidelity, spectroscopic range, clock stability, and coherence preservation. In addition, we provide a general parameterization together with a Floquet-based coherence-time expression, which elucidates the protocol's working principles and lowers the barrier to adoption. Collectively, these advances position our scheme as the state-of-the-art strategy for qubit control, paving the way for a wider class of quantum technologies to be realized using dressed-qubit architectures.

Related papers

• Rethinking Multi-Condition DiTs: Eliminating Redundant Attention via Position-Alignment and Keyword-Scoping [61.459927600301654]
  Multi-condition control is bottlenecked by the conventional concatenate-and-attend'' strategy.<n>Our analysis reveals that much of this cross-modal interaction is spatially or semantically redundant.<n>We propose Position-aligned and Keyword-scoped Attention (PKA), a highly efficient framework designed to eliminate these redundancies.
  arXiv  Detail & Related papers  (2026-02-06T16:39:10Z)
• Single-modulated-pulse two-qubit gates for Rydberg atoms with noncyclic geometric control [4.902211702175651]
  We present a convenient approach for implementing a two-qubit controlled-phase gate using Rydberg blockade. The robustness of the proposal against systematic errors will be remarkably improved due to the geometric characteristic. The proposed scheme will provide an analytical waveforms for arbitrary two-qubit gates and may have important use in the experiments of atomic arrays.
  arXiv  Detail & Related papers  (2024-02-02T03:08:56Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits [36.30869856057226]
  We demonstrate any arbitrary qubit and qutrit gate can be realized with high-fidelity, which can significantly reduce the length of a gate sequence. We show that optimal control gates are robust to drift for at least three hours and that the same calibration parameters can be used for all implemented gates.
  arXiv  Detail & Related papers  (2023-03-07T22:15:43Z)
• Fast and Robust Geometric Two-Qubit Gates for Superconducting Qubits and beyond [0.0]
  We propose a scheme to realize robust geometric two-qubit gates in multi-level qubit systems. Our scheme is substantially simpler than STIRAP-based gates that have been proposed for atomic platforms. We show how our gate can be accelerated using a shortcuts-to-adiabaticity approach.
  arXiv  Detail & Related papers  (2022-08-08T16:22:24Z)
• Data post-processing for the one-way heterodyne protocol under composable finite-size security [62.997667081978825]
  We study the performance of a practical continuous-variable (CV) quantum key distribution protocol. We focus on the Gaussian-modulated coherent-state protocol with heterodyne detection in a high signal-to-noise ratio regime. This allows us to study the performance for practical implementations of the protocol and optimize the parameters connected to the steps above.
  arXiv  Detail & Related papers  (2022-05-20T12:37:09Z)
• Enhanced-Fidelity Ultrafast Geometric Quantum Computation Using Strong Classical Drives [6.363345013314321]
  We propose a general approach to implement nonadiabatic geometric single- and two-qubit gates beyond the rotating wave approximation (RWA) This protocol is compatible with most optimal control methods used in previous RWA protocols.
  arXiv  Detail & Related papers  (2022-03-14T03:06:15Z)
• Counterdiabatic Optimised Local Driving [0.0]
  Adiabatic protocols are employed across a variety of quantum technologies. The problem of speeding up these processes has garnered a large amount of interest. Two approaches are complementary: optimal control manipulates control fields to steer the dynamics. shortcuts to adiabaticity aim to retain the adiabatic condition upon speed-up.
  arXiv  Detail & Related papers  (2022-03-03T19:00:00Z)
• Ultrafast Holonomic Quantum Gates [4.354697470999286]
  We propose a nonadiabatic holonomic quantum scheme with detuned interactions on $Delta$-type three-level system. Our numerical simulations show that the gate robustness is also stronger than previous schemes. We present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding.
  arXiv  Detail & Related papers  (2021-08-03T14:31:38Z)
• Shortest-Path Constrained Reinforcement Learning for Sparse Reward Tasks [59.419152768018506]
  We show that any optimal policy necessarily satisfies the k-SP constraint. We propose a novel cost function that penalizes the policy violating SP constraint, instead of completely excluding it. Our experiments on MiniGrid, DeepMind Lab, Atari, and Fetch show that the proposed method significantly improves proximal policy optimization (PPO)
  arXiv  Detail & Related papers  (2021-07-13T21:39:21Z)
• Accurate methods for the analysis of strong-drive effects in parametric gates [94.70553167084388]
  We show how to efficiently extract gate parameters using exact numerics and a perturbative analytical approach. We identify optimal regimes of operation for different types of gates including $i$SWAP, controlled-Z, and CNOT.
  arXiv  Detail & Related papers  (2021-07-06T02:02:54Z)
• Guided Constrained Policy Optimization for Dynamic Quadrupedal Robot Locomotion [78.46388769788405]
  We introduce guided constrained policy optimization (GCPO), an RL framework based upon our implementation of constrained policy optimization (CPPO) We show that guided constrained RL offers faster convergence close to the desired optimum resulting in an optimal, yet physically feasible, robotic control behavior without the need for precise reward function tuning.
  arXiv  Detail & Related papers  (2020-02-22T10:15:53Z)

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.