Dynamically Corrected Nonadiabatic Holonomic Quantum Gates

• URL: http://arxiv.org/abs/2012.09034v2
• Date: Wed, 6 Oct 2021 14:55:43 GMT
• Title: Dynamically Corrected Nonadiabatic Holonomic Quantum Gates
• Authors: Sai Li, Zheng-Yuan Xue
• Abstract summary: The noise-resilience feature of nonadiabatic holonomic quantum computation (NHQC) still needs to be improved. We propose a general protocol of universal NHQC with simplified control, which can greatly suppress the effect of accompanied X errors. Numerical simulation shows that the performance of our gate can be much better than previous protocols.
• Score: 2.436681150766912
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: The key for realizing fault-tolerant quantum computation lies in maintaining the coherence of all qubits so that high-fidelity and robust quantum manipulations on them can be achieved. One of the promising approaches is to use geometric phases in the construction of universal quantum gates, due to their intrinsic robustness against certain types of local noises. However, due to limitations in previous implementations, the noise-resilience feature of nonadiabatic holonomic quantum computation (NHQC) still needs to be improved. Here, combining with the dynamical correction technique, we propose a general protocol of universal NHQC with simplified control, which can greatly suppress the effect of the accompanied X errors, retaining the main merit of geometric quantum operations. Numerical simulation shows that the performance of our gate can be much better than previous protocols. Remarkably, when incorporating a decoherence-free subspace encoding for the collective dephasing noise, our scheme can also be robust against the involved Z errors. In addition, we also outline the physical implementation of the protocol that is insensitive to both X and Z errors. Therefore, our protocol provides a promising strategy for scalable fault-tolerant quantum computation.

Related papers

• Optimal Quantum Purity Amplification [2.05170973574812]
  Quantum purity amplification (QPA) offers a novel approach to counteract the pervasive noise that degrades quantum states. We present the optimal QPA protocol for general quantum systems against global depolarizing noise. Our findings suggest that QPA could improve the performance of quantum information processing tasks.
  arXiv  Detail & Related papers  (2024-09-26T17:46:00Z)
• Fault-tolerant quantum architectures based on erasure qubits [49.227671756557946]
  We exploit the idea of erasure qubits, relying on an efficient conversion of the dominant noise into erasures at known locations. We propose and optimize QEC schemes based on erasure qubits and the recently-introduced Floquet codes. Our results demonstrate that, despite being slightly more complex, QEC schemes based on erasure qubits can significantly outperform standard approaches.
  arXiv  Detail & Related papers  (2023-12-21T17:40:18Z)
• Deep Quantum Error Correction [73.54643419792453]
  Quantum error correction codes (QECC) are a key component for realizing the potential of quantum computing. In this work, we efficiently train novel emphend-to-end deep quantum error decoders. The proposed method demonstrates the power of neural decoders for QECC by achieving state-of-the-art accuracy.
  arXiv  Detail & Related papers  (2023-01-27T08:16:26Z)
• Decomposition of Matrix Product States into Shallow Quantum Circuits [62.5210028594015]
  tensor network (TN) algorithms can be mapped to parametrized quantum circuits (PQCs) We propose a new protocol for approximating TN states using realistic quantum circuits. Our results reveal one particular protocol, involving sequential growth and optimization of the quantum circuit, to outperform all other methods.
  arXiv  Detail & Related papers  (2022-09-01T17:08:41Z)
• Robust nonadiabatic geometric quantum computation by dynamical correction [0.0]
  We propose a robust scheme for nonadiabatic geometric quantum computation (NGQC) combining with the dynamical correction technique. We numerically show that our scheme can greatly improve the gate robustness in previous protocols. Our scheme provides a promising alternation for the future scalable fault-tolerant quantum computation.
  arXiv  Detail & Related papers  (2022-08-02T14:09:48Z)
• Circuit Symmetry Verification Mitigates Quantum-Domain Impairments [69.33243249411113]
  We propose circuit-oriented symmetry verification that are capable of verifying the commutativity of quantum circuits without the knowledge of the quantum state. In particular, we propose the Fourier-temporal stabilizer (STS) technique, which generalizes the conventional quantum-domain formalism to circuit-oriented stabilizers.
  arXiv  Detail & Related papers  (2021-12-27T21:15:35Z)
• Error-Tolerant Geometric Quantum Control for Logical Qubits with Minimal Resource [4.354697470999286]
  We propose a new fast and robust geometric scheme, with the decoherence-free-subspace encoding, and present its physical implementation on superconducting quantum circuits. Our scheme can consolidate both error suppression methods for logical-qubit control, which sheds light on the future large-scale quantum computation.
  arXiv  Detail & Related papers  (2021-12-16T12:10:41Z)
• 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)
• 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)
• Error mitigation and quantum-assisted simulation in the error corrected regime [77.34726150561087]
  A standard approach to quantum computing is based on the idea of promoting a classically simulable and fault-tolerant set of operations. We show how the addition of noisy magic resources allows one to boost classical quasiprobability simulations of a quantum circuit.
  arXiv  Detail & Related papers  (2021-03-12T20:58:41Z)
• 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.