Variational quantum compiling for three-qubit gates design in quantum dots

• URL: http://arxiv.org/abs/2412.06276v1
• Date: Mon, 09 Dec 2024 07:49:54 GMT
• Title: Variational quantum compiling for three-qubit gates design in quantum dots
• Authors: Yuanyang Zhou, Huaxin He, Fengtao Pang, Hao Lyu, Yongping Zhang, Xi Chen,
• Abstract summary: We design efficient three-qubit gates using a time-independent Hamiltonian composed of only physical interaction terms. The resulting gates, including the Toffoli and Fredkin gates, demonstrate high fidelity and robustness against both coherent and incoherent noise sources.
• Score: 3.1334925219615797
• License:
• Abstract: Semiconductor quantum dots offer a promising platform for controlling spin qubits and realizing quantum logic gates, essential for scalable quantum computing. In this work, we utilize a variational quantum compiling algorithm to design efficient three-qubit gates using a time-independent Hamiltonian composed of only physical interaction terms. The resulting gates, including the Toffoli and Fredkin gates, demonstrate high fidelity and robustness against both coherent and incoherent noise sources, including charge and nuclear spin noise. This method is applicable to a wide range of physical systems, such as superconducting qubits and trapped ions, paving the way for more resilient and universal quantum computing architectures.

Related papers

• Universal quantum computation using quantum annealing with the transverse-field Ising Hamiltonian [0.0]
  We present a practical method for implementing universal quantum computation using the transverse-field Ising Hamiltonian. Our proposal is compatible with D-Wave devices, opening up possibilities for realizing large-scale gate-based quantum computers.
  arXiv  Detail & Related papers  (2024-02-29T12:47:29Z)
• A Quantum-Classical Collaborative Training Architecture Based on Quantum State Fidelity [50.387179833629254]
  We introduce a collaborative classical-quantum architecture called co-TenQu. Co-TenQu enhances a classical deep neural network by up to 41.72% in a fair setting. It outperforms other quantum-based methods by up to 1.9 times and achieves similar accuracy while utilizing 70.59% fewer qubits.
  arXiv  Detail & Related papers  (2024-02-23T14:09:41Z)
• 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)
• Universal quantum computation using atoms in cross-cavity systems [0.0]
  We theoretically investigate a single-step implementation of both a universal two- (CNOT) and three-qubit (quantum Fredkin) gates in a cross-cavity setup. Within a high-cooper regime, the system exhibits an atomic-state-dependent $pi$-phase gate involving the two-mode single-photon bright and dark states.
  arXiv  Detail & Related papers  (2023-08-28T20:09:54Z)
• SAT-Based Quantum Circuit Adaptation [0.9784637657097822]
  Adapting a quantum circuit from a universal quantum gate set to the quantum gate set of a target hardware modality has a crucial impact on the fidelity and duration of the intended quantum computation. We develop a satisfiability modulo theories model that determines an optimized quantum circuit adaptation given a set of allowed substitutions and decompositions.
  arXiv  Detail & Related papers  (2023-01-27T14:09:29Z)
• Modelling semiconductor spin qubits and their charge noise environment for quantum gate fidelity estimation [0.9406493726662083]
  The spin of an electron confined in semiconductor quantum dots is a promising candidate for quantum bit (qubit) implementations. We present here a co-modelling framework for double quantum dot (DQD) devices and their charge noise environment. We find an inverse correlation between quantum gate errors and quantum dot confinement.
  arXiv  Detail & Related papers  (2022-10-10T10:12:54Z)
• Optimal Stochastic Resource Allocation for Distributed Quantum Computing [50.809738453571015]
  We propose a resource allocation scheme for distributed quantum computing (DQC) based on programming to minimize the total deployment cost for quantum resources. The evaluation demonstrates the effectiveness and ability of the proposed scheme to balance the utilization of quantum computers and on-demand quantum computers.
  arXiv  Detail & Related papers  (2022-09-16T02:37:32Z)
• Cavity-enhanced quantum network nodes [0.0]
  A future quantum network will consist of quantum processors that are connected by quantum channels. I will describe how optical resonators facilitate quantum network nodes.
  arXiv  Detail & Related papers  (2022-05-30T18:50:35Z)
• Realization of arbitrary doubly-controlled quantum phase gates [62.997667081978825]
  We introduce a high-fidelity gate set inspired by a proposal for near-term quantum advantage in optimization problems. By orchestrating coherent, multi-level control over three transmon qutrits, we synthesize a family of deterministic, continuous-angle quantum phase gates acting in the natural three-qubit computational basis.
  arXiv  Detail & Related papers  (2021-08-03T17:49:09Z)
• Information Scrambling in Computationally Complex Quantum Circuits [56.22772134614514]
  We experimentally investigate the dynamics of quantum scrambling on a 53-qubit quantum processor. We show that while operator spreading is captured by an efficient classical model, operator entanglement requires exponentially scaled computational resources to simulate.
  arXiv  Detail & Related papers  (2021-01-21T22:18:49Z)
• QUANTIFY: A framework for resource analysis and design verification of quantum circuits [69.43216268165402]
  QUANTIFY is an open-source framework for the quantitative analysis of quantum circuits. It is based on Google Cirq and is developed with Clifford+T circuits in mind. For benchmarking purposes QUANTIFY includes quantum memory and quantum arithmetic circuits.
  arXiv  Detail & Related papers  (2020-07-21T15:36:25Z)

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.