arXiv:1809.01304

Universal quantum computing with superconducting charge qubits

Nian-Quan Jiang, Yao Chen, Chuanbing Cai, Ming-FengWang, Junwang Tang

Published Sep 5, 2018• 0 citations

Abstract

Superconducting quantum circuit is a promising system for building quantum computer. With this system we demonstrate the universal quantum computations, including the preparing of initial states, the single-qubit operations, the two-qubit universal gate operations between arbitrary qubits, the multiple pairs of two-qubit gate operations in parallel, the coupling operations on a group of qubits in parallel, the coupling operations on multiple groups of qubits in parallel, the coupling operations on multiple pairs and multiple groups of qubits in parallel. Within available technology, a universal quantum computer consists of more than 50 qubits allowing operations is achievable with the design.

DOI: 10.48550/arxiv.1809.01304

Related papers

Programmable quantum processor implemented with superconducting circuit

Nian-Quan Jiang, Xi Liang, Mingfeng Wang

Abstract A quantum processor might execute certain computational tasks exponentially faster than a classical processor. Here, using superconducting quantum circuits we design a powerful universal quantum processor with the structure of symmetric all-to-all capacitive connection. We present the Hamiltonian and use it to demonstrate a full set of qubit operations needed in the programmable universal quantum computations. With the device the unwanted crosstalk and ZZ -type couplings between qubits can be effectively suppressed by tuning gate voltages, and the design allows efficient and high-quality couplings of qubits. Within available technology, the scheme may enable a practical programmable universal quantum computer.

Communications in Theoretical PhysicsFeb 10, 20211 citation

SCB Quantum Computers Using iSWAP and 1-Qubit Rotations

Colin P. Williams, Pierre Echtemach

Units of superconducting circuitry that exploit the concept of the single- Cooper-pair box (SCB) have been built and are undergoing testing as prototypes of logic gates that could, in principle, constitute building blocks of clocked quantum computers. These units utilize quantized charge states as the quantum information-bearing degrees of freedom. An SCB is an artificial two-level quantum system that comprises a nanoscale superconducting electrode connected to a reservoir of Cooper-pair charges via a Josephson junction. The logical quantum states of the device, .0. and .1., are implemented physically as a pair of charge-number states that differ by 2e (where e is the charge of an electron). Typically, some 109 Cooper pairs are involved. Transitions between the logical states are accomplished by tunneling of Cooper pairs through the Josephson junction. Although the two-level system contains a macroscopic number of charges, in the superconducting regime, they behave collectively, as a Bose-Einstein condensate, making possible a coherent superposition of the two logical states. This possibility makes the SCB a candidate for the physical implementation of a qubit. A set of quantum logic operations and the gates that implement them is characterized as universal if, in principle, one can form combinations of the operations in the set to implement any desired quantum computation. To be able to design a practical quantum computer, one must first specify how to decompose any valid quantum computation into a sequence of elementary 1- and 2-qubit quantum gates that are universal and that can be realized in hardware that is feasible to fabricate. Traditionally, the set of universal gates has been taken to be the set of all 1-qubit quantum gates in conjunction with the controlled-NOT (CNOT) gate, which is a 2-qubit gate. Also, it has been known for some time that the SWAP gate, which implements square root of the simple 2-qubit exchange interaction, is as computationally universal as is the CNOT operation.

Jul 1, 20050 citations

Universal construction of quantum computational networks in superconducting Josephson junctions

Xijia Miao

Any quantum computational network can be constructed with a sequence of the two-qubit diagonal quantum gates and one-qubit gates in two-state quantum systems. The universal construction of these quantum gates in the quantum systems and of the quantum computational networks with these gates may be achieved with the help of the operator algebra structure of Hamiltonians of the systems and the properties of the multiple-quantum operator algebra subspaces of the Liouville operator space and the specific properties of the quantum algorithm corresponding to the quantum network. As an example, the two-qubit diagonal gates are exactly prepared in detail in superconducting Josephson junctions.

arXiv:quant-ph/0003113Mar 24, 20002 citations

Superconducting qutrit-qubit circuit: A toolbox for efficient quantum gates

Thomas Bækkegaard, Lasse Bjørn Kristensen, Niels Jakob Søe Loft +3 more

As classical computers struggle to keep up with Moore's law, quantum computing may represent a big step in technology and yield significant improvement over classical computing for many important tasks. Building a quantum computer, however, is a daunting challenge since it requires good control but also good isolation from the environment to minimize decoherence. It is therefore important to realize quantum gates efficiently, using as few operations as possible, to reduce the amount of required control and operation time and thus improve the quantum state coherence. Here we propose a superconducting circuit for implementing a tunable spin chain consisting of a qutrit (three-level system analogous to spin-1) coupled to two qubits (spin-1/2). Our system can efficiently accomplish various quantum information tasks, including generation of entanglement of the two qubits and conditional three-qubit quantum gates, such as the Toffoli and Fredkin gates, which are universal for reversible classical computations. Furthermore, our system realizes a conditional geometric gate which may be used for holonomic (non-adiabatic) quantum computing. The efficiency, robustness and universality of our circuit makes it a promising candidate to serve as a building block for larger spin networks capable of performing involved quantum computational tasks.

Feb 12, 20183 citations

Nano-electronic circuits as quantum bits

Yuriy Makhlin, Gerd Schön, Alexander Shnirman

Quantum information processing systems can be used in a variety of applications. Among proposed realizations of quantum bits nano-electronic circuits appear most promising for integration in electronic circuits and large-scale applications. We discuss Josephson junction circuits in two regimes where they can be used for quantum computing. In one limit, two logic states of the quantum bit differ by a Cooper pair charge, 2e, on a superconducting island. In the other limit different magnetic fluxes penetrate a superconducting loop in two states. Single-qubit and two-qubit logic operations can be performed by means of voltage or current pulses. Weak coupling to the environment allows a series of these elementary steps before the phase coherence is lost. To read out the result of the computation a quantum measurement is needed. For charge qubits this can be accomplished by coupling a single-electron transistor (SET) capacitively to the qubit. Monitoring the current in the transistor one can extract the information about the state of the qubit. We discuss recent experiments and present a suitable set of circuit parameters available with the present-day technology.

IEEE International Symposium on Circuits and Systems proceedingsNov 7, 20024 citations

Quantum Computing with Superconducting Circuits in the Picosecond Regime

Daoquan Zhu, Tuomas Jaako, Qiongyi He +1 more

We discuss the realization of a universal set of ultrafast single- and two-qubit operations with superconducting quantum circuits and investigate the most relevant physical and technical limitations that arise when pushing for faster and faster gates. With the help of numerical optimization techniques, we establish a fundamental bound on the minimal gate time, which is determined independently of the qubit design solely by its nonlinearity. In addition, important practical restrictions arise from the finite qubit transition frequency and the limited bandwidth of the control pulses. We show that, for highly anharmonic flux qubits and commercially available control electronics, elementary single- and two-qubit operations can be implemented in about 100 ps with residual gate errors below ${10}^{\ensuremath{-}4}$. Under the same conditions, we simulate the complete execution of a compressed version of Shor's algorithm for factoring the number 15 in about 1 ns. These results demonstrate that, compared to state-of-the-art implementations with transmon qubits, a hundredfold increase in the speed of gate operations with superconducting circuits is still feasible.

arXiv:2101.05810Physical Review AppliedJul 9, 202118 citations