Noncyclic Geometric Quantum Gates with Smooth Paths via Invariant-based Shortcuts

• URL: http://arxiv.org/abs/2102.00893v2
• Date: Thu, 10 Jun 2021 12:41:28 GMT
• Title: Noncyclic Geometric Quantum Gates with Smooth Paths via Invariant-based Shortcuts
• Authors: Li-Na Ji, Cheng-Yun Ding, Tao Chen and Zheng-Yuan Xue
• Abstract summary: 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.
• Score: 4.354697470999286
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nonadiabatic geometric quantum computation is dedicated to the realization of high-fidelity and robust quantum gates, which are necessary for fault-tolerant quantum computation. However, it is limited by cyclic and mutative evolution path, which usually requires longer gate-time and abrupt pulse control, weakening the gate performance. Here, we propose a scheme to realize geometric quantum gates with noncyclic and nonadiabatic evolution via invariant-based shortcuts, where universal quantum gates can be induced in one step without path mutation and the gate time is also effectively shortened. Our numerical simulations show that, comparing with the conventional dynamical gates, the constructed geometric gates have stronger resistance not only to systematic errors, induced by both qubit-frequency drift and the deviation of the amplitude of the driving fields, but also to environment-induced decoherence effect. In addition, our scheme can also be implemented on a superconducting circuit platform, with the fidelities of single-qubit and two-qubit gates are higher than 99.97$\%$ and 99.84$\%$, respectively. Therefore, our scheme provides a promising way to realize high-fidelity fault-tolerant quantum gates for scalable quantum computation.

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)
• Quantum process tomography of continuous-variable gates using coherent states [49.299443295581064]
  We demonstrate the use of coherent-state quantum process tomography (csQPT) for a bosonic-mode superconducting circuit. We show results for this method by characterizing a logical quantum gate constructed using displacement and SNAP operations on an encoded qubit.
  arXiv  Detail & Related papers  (2023-03-02T18:08:08Z)
• 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)
• Robust Nonadiabatic Holonomic Quantum Gates on Decoherence-Protected Qubits [4.18804572788063]
  We propose a scheme for quantum manipulation by combining the geometric phase approach with the dynamical correction technique. Our scheme is implemented on the superconducting circuits, which also simplifies previous implementations.
  arXiv  Detail & Related papers  (2021-10-06T14:39:52Z)
• Engineering fast bias-preserving gates on stabilized cat qubits [64.20602234702581]
  bias-preserving gates can significantly reduce resource overhead for fault-tolerant quantum computing. In this work, we apply a derivative-based leakage suppression technique to overcome non-adiabatic errors.
  arXiv  Detail & Related papers  (2021-05-28T15:20:21Z)
• 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)
• 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)
• High-fidelity geometric quantum gates with short paths on superconducting circuits [5.666193021459319]
  We propose a scheme to realize nonadiabatic geometric quantum gates with short paths based on simple pulse control techniques. Specifically, we illustrate the idea on a superconducting quantum circuit, which is one of the most promising platforms for realizing practical quantum computer.
  arXiv  Detail & Related papers  (2021-02-06T10:13:05Z)
• 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)
• Robust and Fast Holonomic Quantum Gates with Encoding on Superconducting Circuits [4.354697470999286]
  We propose a simplified implementation of universal holonomic quantum gates on superconducting circuits. Our scheme is more robust than the conventional ones, and thus provides a promising alternative strategy for scalable fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2020-04-23T13:26:18Z)

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.