Efficient, stabilized two-qubit gates on a trapped-ion quantum computer

• URL: http://arxiv.org/abs/2101.07887v1
• Date: Tue, 19 Jan 2021 22:40:28 GMT
• Title: Efficient, stabilized two-qubit gates on a trapped-ion quantum computer
• Authors: Reinhold Bl\"umel, Nikodem Grzesiak, Nhung H. Nguyen, Alaina M. Green, Ming Li, Andrii Maksymov, Norbert M. Linke, Yunseong Nam
• Abstract summary: We present two methods to construct optimal pulses for entangling gates on a pair of ions within a trapped ion chain. We illustrate these trade-offs on a trapped-ion quantum computer.
• Score: 4.547776040126478
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Quantum computing is currently limited by the cost of two-qubit entangling operations. In order to scale up quantum processors and achieve a quantum advantage, it is crucial to economize on the power requirement of two-qubit gates, make them robust to drift in experimental parameters, and shorten the gate times. In this paper, we present two methods, one exact and one approximate, to construct optimal pulses for entangling gates on a pair of ions within a trapped ion chain, one of the leading quantum computing architectures. Our methods are direct, non-iterative, and linear, and can construct gate-steering pulses requiring less power than the standard method by more than an order of magnitude in some parameter regimes. The power savings may generally be traded for reduced gate time and greater qubit connectivity. Additionally, our methods provide increased robustness to mode drift. We illustrate these trade-offs on a trapped-ion quantum computer.

Related papers

• QuantumSEA: In-Time Sparse Exploration for Noise Adaptive Quantum Circuits [82.50620782471485]
  QuantumSEA is an in-time sparse exploration for noise-adaptive quantum circuits. It aims to achieve two key objectives: (1) implicit circuits capacity during training and (2) noise robustness. Our method establishes state-of-the-art results with only half the number of quantum gates and 2x time saving of circuit executions.
  arXiv  Detail & Related papers  (2024-01-10T22:33:00Z)
• Near-Term Distributed Quantum Computation using Mean-Field Corrections and Auxiliary Qubits [77.04894470683776]
  We propose near-term distributed quantum computing that involve limited information transfer and conservative entanglement production. We build upon these concepts to produce an approximate circuit-cutting technique for the fragmented pre-training of variational quantum algorithms.
  arXiv  Detail & Related papers  (2023-09-11T18:00:00Z)
• High-fidelity parallel entangling gates on a neutral atom quantum computer [41.74498230885008]
  We report the realization of two-qubit entangling gates with 99.5% fidelity on up to 60 atoms in parallel. These advances lay the groundwork for large-scale implementation of quantum algorithms, error-corrected circuits, and digital simulations.
  arXiv  Detail & Related papers  (2023-04-11T18:00:04Z)
• Pairwise-parallel entangling gates on orthogonal modes in a trapped-ion chain [0.0]
  parallel operations are important for both near-term quantum computers and larger-scale fault-tolerant machines. We propose and implement a pairwise-parallel gate scheme on a trapped-ion quantum computer. We demonstrate the utility of this scheme by creating a GHZ state in one step using parallel gates with one overlapping qubit.
  arXiv  Detail & Related papers  (2023-02-17T21:12:14Z)
• Time-optimal universal quantum gates on superconducting circuits [1.5512702032483539]
  We propose a scheme to realize universal quantum gates on superconducting qubits in a two-dimensional square lattice configuration. In order to reduce the influence of the dephasing error, decoherence-free subspace encoding is also incorporated in our physical implementation.
  arXiv  Detail & Related papers  (2023-01-09T13:41:56Z)
• 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)
• Experimental Realization of Two Qutrits Gate with Tunable Coupling in Superconducting Circuits [11.881366909450376]
  Gate-based quantum computation has been extensively investigated using quantum circuits based on qubits. One of the essential elements for qutrit-based quantum computation, two-qutrit quantum gate, remains a major challenge. We propose and demonstrate a highly efficient and scalable two-qutrit quantum gate in superconducting quantum circuits.
  arXiv  Detail & Related papers  (2022-06-22T16:33:58Z)
• 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)
• 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)
• Boundaries of quantum supremacy via random circuit sampling [69.16452769334367]
  Google's recent quantum supremacy experiment heralded a transition point where quantum computing performed a computational task, random circuit sampling. We examine the constraints of the observed quantum runtime advantage in a larger number of qubits and gates.
  arXiv  Detail & Related papers  (2020-05-05T20:11:53Z)
• Nonadiabatic geometric quantum computation with optimal control on superconducting circuits [7.703593898562321]
  We propose a nonadiabatic geometric quantum computation scheme on superconducting circuits. Our scheme provides a promising step towards fault-tolerant solid-state quantum computation.
  arXiv  Detail & Related papers  (2020-04-21T08:34:08Z)

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.