Gate-based superconducting quantum computing

نویسندگان

چکیده

Abstract

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High-fidelity CZ gate for resonator-based superconducting quantum computers

Joydip Ghosh, ∗ Andrei Galiautdinov, 2 Zhongyuan Zhou, Alexander N. Korotkov, John M. Martinis, and Michael R. Geller † Department of Physics and Astronomy, University of Georgia, Athens, Georgia 30602, USA Department of Electrical Engineering, University of California, Riverside, California 92521, USA Department of Physics, University of California, Santa Barbara, California 93106, USA (Dated:...

متن کامل

Superconducting circuits for quantum computing

Superconducting circuits provide one of the numerous current candidate routes for the realization of quantum computing (QC) technology. In this paper I review the basic physics behind this candidature and outline some superconducting QC proposals currently on the table, demonstrating their common origins. More detailed discussion of the proposals follows, assessing how they measure up to the \D...

متن کامل

Superconducting Quantum Computing without Switches

This paper presents a very simple architecture for a large-scale superconducting quantum computer. All of the SQUID qubits are fixed-coupled to a single large superconducting loop.

متن کامل

Quantum computing with many superconducting qubits

Two of the major obstacles to achieve quantum computing (QC) are (i) scalability to many qubits and (ii) controlled connectivity between any selected qubits. Using Josephson charge qubits, here we propose an experimentally realizable method to efficiently solve these two central problems. Since any two charge qubits can be effectively coupled by an experimentally accessible inductance, the prop...

متن کامل

Type-II Quantum computing Using superconducting Qubits

Most algorithms designed for quantum computers will not best their classical counterparts until they are implemented with thousands of qubits. For example, the factoring of binary numbers with a quantum computer is estimated to be faster than a classical computer only when the length of the number is greater than about 500 digits [1]. In contrast, the Factorized Quantum Lattice-Gas Algorithm (F...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Applied Physics

سال: 2021

ISSN: ['1089-7550', '0021-8979', '1520-8850']

DOI: https://doi.org/10.1063/5.0029735