Composite nonadiabatic geometric quantum gates with optimization on superconducting circuits

• URL: http://arxiv.org/abs/2509.24737v1
• Date: Mon, 29 Sep 2025 13:00:49 GMT
• Title: Composite nonadiabatic geometric quantum gates with optimization on superconducting circuits
• Authors: Cheng-Yun Ding, Wan-Fang Liu, Li-Hua Zhang, Jian Zhou, Zheng-Yuan Xue,
• Abstract summary: We propose a scheme for optimized composite nonadiabatic geometric quantum gates (OCNGQGs)<n>Specifically, by optimizing the path parameter, our scheme effectively resists systematic errors in both directions.<n> Numerical simulations demonstrate that our scheme offers superior gate robustness against these two types of errors.
• Score: 22.182957953733915
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Due to its fast and robust characteristics, nonadiabatic geometric quantum computation with various optimized techniques has received much attention. However, these strategies either require precise pulse control or can only mitigate partial systematic errors, hindering their experimental development. Here, we propose a scheme for optimized composite nonadiabatic geometric quantum gates (OCNGQGs), which can further enhance the gate performance of the composite nonadiabatic geometric scheme. Specifically, by optimizing the path parameter, our scheme effectively resists systematic errors in both directions, i.e., Rabi frequency and detuning errors, while preserving the flexibility of pulse shapes. Numerical simulations demonstrate that our scheme offers superior gate robustness against these two types of errors compared to conventional schemes. Additionally, we propose to implement our scheme on superconducting transmon qubits, where the numerical results show the robustness of universal gates remaining evident within current technology. Therefore, our proposal provides a promising approach to achieve robust quantum gates for future scalable quantum computation.

Related papers

• Quantum Approximate Optimization Algorithm for MIMO with Quantized b-bit Beamforming [47.98440449939344]
  Multiple-input multiple-output (MIMO) is critical for 6G communication, offering improved spectral efficiency and reliability.<n>This paper explores the use of the Quantum Approximate Optimization Algorithm (QAOA) and alternating optimization to address the problem of b-bit quantized phase shifters both at the transmitter and the receiver.<n>We demonstrate that the structure of this quantized beamforming problem aligns naturally with hybrid-classical methods like QAOA, as the phase shifts used in beamforming can be directly mapped to rotation gates in a quantum circuit.
  arXiv  Detail & Related papers  (2025-10-07T17:53:02Z)
• Bayesian Parameterized Quantum Circuit Optimization (BPQCO): A task and hardware-dependent approach [49.89480853499917]
  Variational quantum algorithms (VQA) have emerged as a promising quantum alternative for solving optimization and machine learning problems. In this paper, we experimentally demonstrate the influence of the circuit design on the performance obtained for two classification problems. We also study the degradation of the obtained circuits in the presence of noise when simulating real quantum computers.
  arXiv  Detail & Related papers  (2024-04-17T11:00:12Z)
• Nonadiabatic geometric quantum gates with on-demand trajectories [2.5539863252714636]
  We propose a general protocol for constructing geometric quantum gates with on-demand trajectories. Our scheme adopts reverse engineering of the target Hamiltonian using smooth pulses. Because a particular geometric gate can be induced by various different trajectories, we can further optimize the gate performance.
  arXiv  Detail & Related papers  (2024-01-20T06:57:36Z)
• Efficient estimation of trainability for variational quantum circuits [43.028111013960206]
  We find an efficient method to compute the cost function and its variance for a wide class of variational quantum circuits. This method can be used to certify trainability for variational quantum circuits and explore design strategies that can overcome the barren plateau problem.
  arXiv  Detail & Related papers  (2023-02-09T14:05:18Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Robust nonadiabatic geometric quantum computation by dynamical correction [0.0]
  We propose a robust scheme for nonadiabatic geometric quantum computation (NGQC) combining with the dynamical correction technique. We numerically show that our scheme can greatly improve the gate robustness in previous protocols. Our scheme provides a promising alternation for the future scalable fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2022-08-02T14:09:48Z)
• Nonadiabatic geometric quantum computation with shortened path on superconducting circuits [3.0726135239588164]
  We present an effective scheme to find the shortest geometric path under the conventional conditions of geometric quantum computation. High-fidelity and robust geometric gates can be realized by only single-loop evolution. Our scheme is promising for large-scale fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2021-11-02T08:03:38Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• 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)
• Nonadiabatic geometric quantum gates that are insensitive to qubit-frequency drifts [8.750801670077806]
  In the current implementation of nonadiabatic geometric phases, operational and/or random errors tend to destruct the conditions that induce geometric phases. Here, we apply the path-design strategy to explain in detail why both configurations can realize universal quantum gates in a single-loop way. Our scheme provides a promising way towards practical realization of high-fidelity and robust nonadiabatic geometric quantum gates.
  arXiv  Detail & Related papers  (2021-03-16T12:05:45Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)
• Improving the Performance of Deep Quantum Optimization Algorithms with Continuous Gate Sets [47.00474212574662]
  Variational quantum algorithms are believed to be promising for solving computationally hard problems. In this paper, we experimentally investigate the circuit-depth-dependent performance of QAOA applied to exact-cover problem instances. Our results demonstrate that the use of continuous gate sets may be a key component in extending the impact of near-term quantum computers.
  arXiv  Detail & Related papers  (2020-05-11T17:20:51Z)

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.