• Corpus ID: 246035197

# A two-qubit entangling gate based on a two-spin gadget

@inproceedings{Yang2022ATE,
title={A two-qubit entangling gate based on a two-spin gadget},
author={Rui Yang},
year={2022}
}
• Rui Yang
• Published 15 January 2022
• Physics
The faster speed and operational convenience of two-qubit gate with flux bias control makes it an important candidate for future large-scale quantum computers based on high coherence flux qubits. Based on a properly designed two-spin gadget which has small gaps during the evolution of energy levels, we build a CNOT-equivalent gate which can reach a fidelity larger than 99.9% within 40ns. Moreover, we also use the Schrieffer-Wolff Transformation to translate the spin model Ising coefficients…

## References

SHOWING 1-10 OF 21 REFERENCES
Demonstration of two-qubit algorithms with a superconducting quantum processor
• Physics
Nature
• 2009
A two-qubit superconducting processor and the implementation of the Grover search and Deutsch–Jozsa quantum algorithms are demonstrated and the generation of highly entangled states with concurrence up to 94 per cent is allowed.
Demonstration of a parametrically activated entangling gate protected from flux noise
• Physics
Physical Review A
• 2020
In state-of-the-art quantum computing platforms, including superconducting qubits and trapped ions, imperfections in the 2-qubit entangling gates are the dominant contributions of error to
Superconducting quantum circuits at the surface code threshold for fault tolerance
• Physics, Computer Science
Nature
• 2014
The results demonstrate that Josephson quantum computing is a high-fidelity technology, with a clear path to scaling up to large-scale, fault-tolerant quantum circuits.
Operation and intrinsic error budget of a two-qubit cross-resonance gate
• Physics
Physical Review A
• 2019
We analyze analytically, semi-analytically, and numerically the operation of Cross-Resonance (CR) gate for superconducting qubits (transmons). We find that a relatively simple semi-analytical method
Qubit Architecture with High Coherence and Fast Tunable Coupling.
• Physics
Physical review letters
• 2014
A superconducting qubit architecture that combines high-coherence qubits and tunable qubit-qubit coupling that can be tuned dynamically with nanosecond resolution is introduced, making this architecture a versatile platform with applications ranging from quantum logic gates to quantum simulation.
Strong Quantum Computational Advantage Using a Superconducting Quantum Processor.
• Physics
Physical review letters
• 2021
This work develops a two-dimensional programmable superconducting quantum processor, Zuchongzhi, which is composed of 66 functional qubits in a tunable coupling architecture and establishes an unambiguous quantum computational advantage that is infeasible for classical computation in a reasonable amount of time.
Fast adiabatic qubit gates using only σ z control
• Physics
• 2014
A controlled-phase gate was demonstrated in superconducting Xmon transmon qubits with fidelity reaching 99.4%, relying on the adiabatic interaction between the $|11\ensuremath{\rangle}$ and
Effective Hamiltonians for interacting superconducting qubits: local basis reduction and the Schrieffer–Wolff transformation
• Physics
• 2020
An open question in designing superconducting quantum circuits is how best to reduce the full circuit Hamiltonian which describes their dynamics to an effective two-level qubit Hamiltonian which is
Quantum supremacy using a programmable superconducting processor
• Physics, Computer Science
Nature
• 2019
Quantum supremacy is demonstrated using a programmable superconducting processor known as Sycamore, taking approximately 200 seconds to sample one instance of a quantum circuit a million times, which would take a state-of-the-art supercomputer around ten thousand years to compute.
A double-slit proposal for quantum annealing
• Physics
npj Quantum Information
• 2019
We formulate and analyze a double-slit proposal for quantum annealing, which involves observing the probability of finding a two-level system (TLS) undergoing evolution from a transverse to a