Fast Evolution of Single Qubit Gate in Non-Adiabatic Geometric Quantum Computing

• URL: http://arxiv.org/abs/2205.08165v2
• Date: Mon, 29 Aug 2022 13:31:18 GMT
• Title: Fast Evolution of Single Qubit Gate in Non-Adiabatic Geometric Quantum Computing
• Authors: Ge Tang, Xiao-Yong Yang, Ying Yan and Jie Lu
• Abstract summary: We implement arbitrary single qubit gates of geometric quantum computing for a three-level system in a single-shot manner. The duration of gates grows from zero with the rotation angle $gamma$, and the tested T gate time can be reduced to $sim$40% of those in the traditional orange-sliced-shaped path non-adiabatic holonomic quantum computing scheme.
• Score: 15.46216456374962
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: We implemented arbitrary single qubit gates of geometric quantum computing for a three-level system in a single-shot manner. The evolution time of the gate has been minimized by considering the shortest trajectory of the state on the Bloch sphere. The duration of gates grows from zero with the rotation angle $\gamma$, and the tested T gate time can be reduced to $\sim$40\% of those in the traditional orange-sliced-shaped path non-adiabatic holonomic quantum computing (NHQC) scheme by the parametrization of Rabi frequency. We also demonstrated that certain pulses are robust against static detuning errors and Rabi errors. The time-dependent detuning and Rabi frequency are found to be proportional to each other by a constant which is determined by the geometric phase. In this way, some previous NHQC schemes can be treated as special cases in our generalized model.

Related papers

• Geometric Quantum Machine Learning with Horizontal Quantum Gates [41.912613724593875]
  We propose an alternative paradigm for the symmetry-informed construction of variational quantum circuits. We achieve this by introducing horizontal quantum gates, which only transform the state with respect to the directions to those of the symmetry. For a particular subclass of horizontal gates based on symmetric spaces, we can obtain efficient circuit decompositions for our gates through the KAK theorem.
  arXiv  Detail & Related papers  (2024-06-06T18:04:39Z)
• Accelerated super-robust nonadiabatic holonomic quantum gates [4.5867495327952845]
  In previous conventional schemes, the states of the calculation subspace have always leaked to the noncomputation subspace. We propose a solution to the problem without the severe limitation of the much longer gate time. Our numerical simulations indicate that the decoherence-induced gate errors of our scheme are greatly decreased.
  arXiv  Detail & Related papers  (2023-04-04T08:19:33Z)
• Quantum Gate Generation in Two-Level Open Quantum Systems by Coherent and Incoherent Photons Found with Gradient Search [77.34726150561087]
  We consider an environment formed by incoherent photons as a resource for controlling open quantum systems via an incoherent control. We exploit a coherent control in the Hamiltonian and an incoherent control in the dissipator which induces the time-dependent decoherence rates.
  arXiv  Detail & Related papers  (2023-02-28T07:36:02Z)
• State Independent Nonadiabatic Geometric Quantum Gates [2.8126458426164436]
  We propose a state independent nonadiabatic geometric quantum gates scheme, which can realize a more fully geometric gate. Our scheme provides a promising way for fault-tolerant quantum computation in atomic systems.
  arXiv  Detail & Related papers  (2022-11-17T03:02:06Z)
• Simulating scalar field theories on quantum computers with limited resources [62.997667081978825]
  We present a quantum algorithm for implementing $phi4$ lattice scalar field theory on qubit computers. The algorithm allows efficient $phi4$ state preparation for a large range of input parameters in both the normal and broken symmetry phases.
  arXiv  Detail & Related papers  (2022-10-14T17:28:15Z)
• Experimental Implementation of Noncyclic and Nonadiabatic Geometric Quantum Gates in a Superconducting Circuit [14.92931729758348]
  We experimentally implement a set of noncyclic and nonadiabatic geometric quantum gates in a superconducting circuit. Our results provide a promising routine to achieve fast, high-fidelity, and error-resilient quantum gates.
  arXiv  Detail & Related papers  (2022-10-07T04:56:58Z)
• 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)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• 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)
• Noncyclic Geometric Quantum Gates with Smooth Paths via Invariant-based Shortcuts [4.354697470999286]
  We propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant-based shortcuts. Our scheme provides a promising way to realize high-fidelity fault-tolerant quantum gates for scalable quantum computation.
  arXiv  Detail & Related papers  (2021-02-01T15:05:29Z)
• 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)

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.