Single-atom verification of the noise-resilient and fast characteristics of universal nonadiabatic noncyclic geometric quantum gates

• URL: http://arxiv.org/abs/2106.09961v1
• Date: Fri, 18 Jun 2021 07:30:04 GMT
• Title: Single-atom verification of the noise-resilient and fast characteristics of universal nonadiabatic noncyclic geometric quantum gates
• Authors: J. W. Zhang, L.-L. Yan, J. C. Li, G. Y. Ding, J. T. Bu, L. Chen, S.-L. Su, F. Zhou, M. Feng
• Abstract summary: We experimentally implement the nonadiabatic noncyclic geometric quantum computation (NNGQC) in a single trapped ultracold $40$Ca$+$ ion. Our results provide the first evidence confirming the possibility of accelerated quantum information processing with limited systematic errors even in the imperfect situation.
• Score: 0.11242503819703256
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum gates induced by geometric phases are intrinsically robust against noise due to their global properties of the evolution paths. Compared to conventional nonadiabatic geometric quantum computation (NGQC), the recently proposed nonadiabatic noncyclic geometric quantum computation (NNGQC) works in a faster fashion, while still remaining the robust feature of the geometric operations. Here, we experimentally implement the NNGQC in a single trapped ultracold $^{40}$Ca$^{+}$ ion for verifying the noise-resilient and fast feature. By performing unitary operations under imperfect conditions, we witness the advantages of the NNGQC with measured fidelities by quantum process tomography in comparison with other two quantum gates by conventional NGQC and by straightforwardly dynamical evolution. Our results provide the first evidence confirming the possibility of accelerated quantum information processing with limited systematic errors even in the imperfect situation.

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)
• Nonadiabatic Geometric Quantum Computation in Non-Hermitian Systems [2.9848983009488936]
  We show how to perform nonadiabatic geometric quantum computation (NGQC) in non-Hermitian quantum systems. By utilizing a novel geometric phase generated by non-unitary evolution of the system, a universal set of geometric gates can be realized with a high fidelity.
  arXiv  Detail & Related papers  (2023-04-13T01:24:54Z)
• Quantum Imitation Learning [74.15588381240795]
  We propose quantum imitation learning (QIL) with a hope to utilize quantum advantage to speed up IL. We develop two QIL algorithms, quantum behavioural cloning (Q-BC) and quantum generative adversarial imitation learning (Q-GAIL) Experiment results demonstrate that both Q-BC and Q-GAIL can achieve comparable performance compared to classical counterparts.
  arXiv  Detail & Related papers  (2023-04-04T12:47:35Z)
• 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)
• QuanGCN: Noise-Adaptive Training for Robust Quantum Graph Convolutional Networks [124.7972093110732]
  We propose quantum graph convolutional networks (QuanGCN), which learns the local message passing among nodes with the sequence of crossing-gate quantum operations. To mitigate the inherent noises from modern quantum devices, we apply sparse constraint to sparsify the nodes' connections. Our QuanGCN is functionally comparable or even superior than the classical algorithms on several benchmark graph datasets.
  arXiv  Detail & Related papers  (2022-11-09T21:43:16Z)
• Entangling Quantum Generative Adversarial Networks [53.25397072813582]
  We propose a new type of architecture for quantum generative adversarial networks (entangling quantum GAN, EQ-GAN) We show that EQ-GAN has additional robustness against coherent errors and demonstrate the effectiveness of EQ-GAN experimentally in a Google Sycamore superconducting quantum processor.
  arXiv  Detail & Related papers  (2021-04-30T20:38:41Z)
• Experimental Realization of Nonadiabatic Holonomic Single-Qubit Quantum Gates with Two Dark Paths in a Trapped Ion [41.36300605844117]
  We show nonadiabatic holonomic single-qubit quantum gates on two dark paths in a trapped $171mathrmYb+$ ion based on four-level systems with resonant drives. We find that nontrivial holonomic two-qubit quantum gates can also be realized within current experimental technologies.
  arXiv  Detail & Related papers  (2021-01-19T06:57:50Z)
• 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)
• Nonadiabatic noncyclic geometric quantum computation in Rydberg atoms [0.0]
  Nonadiabatic geometric quantum computation (NGQC) has been developed to realize fast and robust geometric gate. We propose an unconventional scheme, called nonadiabatic noncyclic geometric quantum computation(NNGQC), that arbitrary single- and two-qubit geometric gate can be constructed via noncyclic non-Abeliangeometric phase.
  arXiv  Detail & Related papers  (2020-05-14T13:29:09Z)
• Using Quantum Metrological Bounds in Quantum Error Correction: A Simple Proof of the Approximate Eastin-Knill Theorem [77.34726150561087]
  We present a proof of the approximate Eastin-Knill theorem, which connects the quality of a quantum error-correcting code with its ability to achieve a universal set of logical gates. Our derivation employs powerful bounds on the quantum Fisher information in generic quantum metrological protocols.
  arXiv  Detail & Related papers  (2020-04-24T17:58:10Z)

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.