Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits

• URL: http://arxiv.org/abs/2303.04261v3
• Date: Fri, 28 Jun 2024 16:14:10 GMT
• Title: Direct pulse-level compilation of arbitrary quantum logic gates on superconducting qutrits
• Authors: Yujin Cho, Kristin M. Beck, Alessandro R. Castelli, Kyle A. Wendt, Bram Evert, Matthew J. Reagor, Jonathan L DuBois,
• Abstract summary: 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.
• Score: 36.30869856057226
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Advanced simulations and calculations on quantum computers require high-fidelity implementations of quantum operations. The universal gateset approach builds complex unitaries from a small set of primitive gates, often resulting in a long gate sequence which is typically a leading factor in the total accumulated error. Compiling a complex unitary for processors with higher-dimensional logical elements, such as qutrits, exacerbates the accumulated error per unitary, since an even longer gate sequence is required. Optimal control methods promise time and resource efficient compact gate sequences and, therefore, higher fidelity. These methods generate pulses that can directly implement any complex unitary on a quantum device. In this work, 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 generate and test pulses for a large set of randomly selected arbitrary unitaries on several quantum processing units (QPUs): the LLNL Quantum Device and Integration Testbed (QuDIT) standard QPU and three of Rigetti QPUs: Ankaa-2, Ankaa-9Q-1, and Aspen-M-3. On the QuDIT platform's standard QPU, the average fidelity of random qutrit gates is 97.9+-0.5% measured with conventional QPT and 98.8+-0.6% from QPT with gate folding. Rigetti's Ankaa-2 achieves random qubit gates with an average fidelity of 98.4+-0.5% (conventional QPT) and 99.7+-0.1% (QPT with gate folding). On Ankaa-9Q-1 and Aspen-M-3, the average fidelities with conventional qubit QPT measurements were higher than 99%. 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. Our work promises the calibration overheads for optimal control gates can be made small enough to enable efficient quantum circuits based on this technique.

Related papers

• High-fidelity universal gates in the $^{171}$Yb ground state nuclear spin qubit [0.14213550976537648]
  We demonstrate a universal high-fidelity gate-set with individually controlled and parallel application of single-qubit gates and two-qubit gates. These results represent important milestones towards executing complex and general quantum computation with neutral atoms.
  arXiv  Detail & Related papers  (2024-11-18T16:36:32Z)
• Quantum control landscape for generation of $H$ and $T$ gates in an open qubit with both coherent and environmental drive [57.70351255180495]
  An important problem in quantum computation is generation of single-qubit quantum gates such as Hadamard ($H$) and $pi/8$ ($T$) Here we consider the problem of optimal generation of $H$ and $T$ gates using coherent control and the environment as a resource acting on the qubit via incoherent control.
  arXiv  Detail & Related papers  (2023-09-05T09:05:27Z)
• A fault-tolerant variational quantum algorithm with limited T-depth [2.7648976108201815]
  We propose a variational quantum eigensolver (VQE) algorithm that uses a fault-tolerant gate-set. VQE is suitable for implementation on a future error-corrected quantum computer.
  arXiv  Detail & Related papers  (2023-03-08T10:31:12Z)
• 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)
• 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)
• 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)
• Experimental implementation of non-Clifford interleaved randomized benchmarking with a controlled-S gate [0.1759008116536278]
  In some applications access to a non-Clifford two-qubit gate can result in more optimal circuit decompositions. We demonstrate calibration of a low error non-Clifford Controlled-$fracpi2$ phase (CS) gate on a cloud based IBM Quantum computing.
  arXiv  Detail & Related papers  (2020-07-16T18:00:02Z)
• 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.