Fast Super Robust Nonadiabatic Geometric Quantum Computation

• URL: http://arxiv.org/abs/2404.06562v1
• Date: Tue, 9 Apr 2024 18:26:17 GMT
• Title: Fast Super Robust Nonadiabatic Geometric Quantum Computation
• Authors: Yifu Zhang, Lei Ma,
• Abstract summary: Nonadiabatic geometric quantum computation (NGQC) provides a means to perform fast and robust quantum gates. We introduce Fast Super Robust NGQC(FSR-NGQC) This approach achieves faster speeds when operating small-angle rotation gates.
• Score: 7.539343895771086
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Nonadiabatic geometric quantum computation (NGQC) provides a means to perform fast and robust quantum gates. To enhance the robustness of NGQC against control errors, numerous solutions have been proposed by predecessors. However, these solutions typically result in extended operation times for quantum gates. In order to maintain the robustness of quantum gates to control errors while shortening operation times to minimize the effects of decoherence, we introduce Fast Super Robust NGQC(FSR-NGQC). This approach achieves faster speeds when operating small-angle rotation gates. Through numerical calculations, we have demonstrated the performance of our scheme in a decoherence environment. The results show that our scheme achieves higher fidelity, thus enabling fast and robust geometric quantum computing.

Related papers

• Quantum Compiling with Reinforcement Learning on a Superconducting Processor [55.135709564322624]
  We develop a reinforcement learning-based quantum compiler for a superconducting processor. We demonstrate its capability of discovering novel and hardware-amenable circuits with short lengths. Our study exemplifies the codesign of the software with hardware for efficient quantum compilation.
  arXiv  Detail & Related papers  (2024-06-18T01:49:48Z)
• Robust Control of Single-Qubit Gates at the Quantum Speed Limit [0.0]
  We investigate the underlying robust time-optimal control problem so as to make the best balance. Based on the Taylor expansion of the system's unitary propagator, we formulate the design problem as the optimal control of an augmented finite-dimensional system. Numerical simulations for single-qubit systems show that the obtained time-optimal control pulses can effectively suppress gate errors.
  arXiv  Detail & Related papers  (2023-09-11T10:10:58Z)
• Quantum Annealing for Single Image Super-Resolution [86.69338893753886]
  We propose a quantum computing-based algorithm to solve the single image super-resolution (SISR) problem. The proposed AQC-based algorithm is demonstrated to achieve improved speed-up over a classical analog while maintaining comparable SISR accuracy.
  arXiv  Detail & Related papers  (2023-04-18T11:57:15Z)
• Experimental Implementation of Short-Path Non-adiabatic Geometric Gates in a Superconducting Circuit [7.892850133997947]
  We experimentally realize a universal short-path non-adiabatic geometric gate set (SPNGQC) with a 2-times shorter evolution path on a superconducting quantum processor. Characterizing with both quantum process tomography and randomized benchmarking methods, we report an average single-qubit gate fidelity of 99.86% and a two-qubit gate fidelity of 97.9%.
  arXiv  Detail & Related papers  (2023-03-22T13:05:06Z)
• 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)
• Ultrafast Holonomic Quantum Gates [4.354697470999286]
  We propose a nonadiabatic holonomic quantum scheme with detuned interactions on $Delta$-type three-level system. Our numerical simulations show that the gate robustness is also stronger than previous schemes. We present an implementation of our proposal on superconducting quantum circuits, with a decoherence-free subspace encoding.
  arXiv  Detail & Related papers  (2021-08-03T14:31:38Z)
• Fast Swapping in a Quantum Multiplier Modelled as a Queuing Network [64.1951227380212]
  We propose that quantum circuits can be modeled as queuing networks. Our method is scalable and has the potential speed and precision necessary for large scale quantum circuit compilation.
  arXiv  Detail & Related papers  (2021-06-26T10:55:52Z)
• Quantum circuit architecture search for variational quantum algorithms [88.71725630554758]
  We propose a resource and runtime efficient scheme termed quantum architecture search (QAS) QAS automatically seeks a near-optimal ansatz to balance benefits and side-effects brought by adding more noisy quantum gates. We implement QAS on both the numerical simulator and real quantum hardware, via the IBM cloud, to accomplish data classification and quantum chemistry tasks.
  arXiv  Detail & Related papers  (2020-10-20T12:06:27Z)
• Super-robust nonadiabatic geometric quantum control [0.0]
  Nonadiabatic geometric quantum computation (NGQC) and nonadiabatic holonomic quantum computation (NHQC) have been proposed to reduce the run time of geometric quantum gates. We show that NGQC and NHQC scenarios have no advantage over standard dynamical gates in most cases. We propose a scheme of super-robust nonadiabatic geometric quantum control, in which the super-robust condition can guarantee both high speed and robustness.
  arXiv  Detail & Related papers  (2020-08-05T14:50:56Z)
• 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)

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.