Efficient Implementation of Arbitrary Two-Qubit Gates via Unified Control

• URL: http://arxiv.org/abs/2502.03612v1
• Date: Wed, 05 Feb 2025 21:00:34 GMT
• Title: Efficient Implementation of Arbitrary Two-Qubit Gates via Unified Control
• Authors: Zhen Chen, Weiyang Liu, Yanjun Ma, Weijie Sun, Ruixia Wang, He Wang, Huikai Xu, Guangming Xue, Haisheng Yan, Zhen Yang, Jiayu Ding, Yang Gao, Feiyu Li, Yujia Zhang, Zikang Zhang, Yirong Jin, Haifeng Yu, Jianxin Chen, Fei Yan,
• Abstract summary: The native gate set governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Here, we experimentally demonstrate a unified and highly versatile gate scheme capable of generating arbitrary two-qubit gates. We achieve high fidelities averaging $99.37 pm 0.07%$ across a wide range of commonly used two-qubit unitaries. Our results highlight that fully exploiting the capabilities of a single interaction can yield a comprehensive and highly accurate gate set.
• Score: 30.657387004518604
• License:
• Abstract: The native gate set is fundamental to the performance of quantum devices, as it governs the accuracy of basic quantum operations and dictates the complexity of implementing quantum algorithms. Traditional approaches to extending gate sets often require accessing multiple transitions within an extended Hilbert space, leading to increased control complexity while offering only a limited set of gates. Here, we experimentally demonstrate a unified and highly versatile gate scheme capable of natively generating arbitrary two-qubit gates using only exchange interaction and qubit driving on a superconducting quantum processor, achieving maximum expressivity. Using a state-of-the-art transmon-coupler-transmon architecture, we achieve high fidelities averaging $99.37 \pm 0.07\%$ across a wide range of commonly used two-qubit unitaries. This outstanding performance, combined with reduced complexity, enables precise multipartite entangled state preparation, as demonstrated. To further enhance its applicability, we also show the high-fidelity realization of the unique B gate, which efficiently synthesizes the entire family of two-qubit gates. Our results highlight that fully exploiting the capabilities of a single interaction can yield a comprehensive and highly accurate gate set. With maximum expressivity, gate-time optimality, demonstrated high fidelity, and easy adaptability to other quantum platforms, our unified control scheme paves the way for optimal performance in quantum devices, offering exciting prospects for advancing quantum hardware and algorithm development.

Related papers

• Direct Implementation of High-Fidelity Three-Qubit Gates for Superconducting Processor with Tunable Couplers [18.682049956714156]
  Three-qubit gates can be constructed using combinations of single-qubit and two-qubit gates, making their independent realization unnecessary. We propose and experimentally demonstrate a high-fidelity scheme for implementing a three-qubit controlled-controlled-Z (CCZ) gate in a flip-chip superconducting quantum processor with tunable couplers.
  arXiv  Detail & Related papers  (2025-01-30T12:57:57Z)
• A diverse set of two-qubit gates for spin qubits in semiconductor quantum dots [5.228819198411081]
  We propose and verify a fast composite two-qubit gate scheme to extend the available two-qubit gate types. Our gate scheme limits the parameter requirements of all essential two-qubit gates to a common JDeltaE_Z region. With this versatile composite gate scheme, broad-spectrum two-qubit operations allow us to efficiently utilize the hardware and the underlying physics resources.
  arXiv  Detail & Related papers  (2024-04-29T13:37:43Z)
• Optimal control in large open quantum systems: the case of transmon readout and reset [44.99833362998488]
  We present a framework that combines the adjoint-state method together with reverse-time backpropagation to solve prohibitively large open-system quantum control problems. We apply this framework to optimize two inherently dissipative operations in superconducting qubits. Our results show that while standard pulses for dispersive readout are nearly optimal, adding a transmon drive during the protocol can yield 2x improvements in fidelity and duration.
  arXiv  Detail & Related papers  (2024-03-21T18:12:51Z)
• Optimizing quantum gates towards the scale of logical qubits [78.55133994211627]
  A foundational assumption of quantum gates theory is that quantum gates can be scaled to large processors without exceeding the error-threshold for fault tolerance. Here we report on a strategy that can overcome such problems. We demonstrate it by choreographing the frequency trajectories of 68 frequency-tunablebits to execute single qubit while superconducting errors.
  arXiv  Detail & Related papers  (2023-08-04T13:39:46Z)
• 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)
• Realization of Scalable Cirac-Zoller Multi-Qubit Gates [5.309268373861329]
  The universality in quantum computing states that any quantum computational task can be decomposed into a finite set of logic gates operating on one and two qubits. Practical processor designs benefit greatly from availability of multi-qubit gates that operate on more than two qubits. Here, we take advantage of novel performance benefits of long ion chains to realize fully programmable and scalable high-fidelity Cirac-Zoller gates.
  arXiv  Detail & Related papers  (2023-01-18T14:34:24Z)
• Effective non-local parity-dependent couplings in qubit chains [0.0]
  We harness the simultaneous coupling of qubits on a chain and engineer a set of non-local parity-dependent quantum operations. The resulting effective long-range couplings directly implement a parametrizable Trotter-step for Jordan-Wigner fermions. We present numerical simulations of the gate operation in a superconducting quantum circuit architecture.
  arXiv  Detail & Related papers  (2022-03-14T17:33:40Z)
• 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)
• Quantum control landscape for ultrafast generation of single-qubit phase shift quantum gates [68.8204255655161]
  We consider the problem of ultrafast controlled generation of single-qubit phase shift quantum gates. Globally optimal control is a control which realizes the gate with maximal possible fidelity. Trap is a control which is optimal only locally but not globally.
  arXiv  Detail & Related papers  (2021-04-26T16:38:43Z)
• High-fidelity software-defined quantum logic on a superconducting qudit [23.29920768537117]
  Modern solid-state quantum processors approach quantum computation with a set of discrete qubit operations (gates) In principle, this approach is highly flexible, allowing full control over the qubits' Hilbert space without necessitating the development of specific control protocols for each application. Current error rates on quantum hardware place harsh limits on the number of primitive gates that can bed together (with compounding error rates) and remain viable. Here, we report our efforts at implementing a software-defined $0leftarrow2$ SWAP gate that does not rely on a primitive gate set and achieves an average gate fidelity of $99.4
  arXiv  Detail & Related papers  (2020-05-27T05:12:51Z)
• 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.