Quantum computing with many superconducting qubits
J. Q. You, J. S. Tsai, Franco Nori

TL;DR
This paper proposes a scalable quantum computing architecture using Josephson charge qubits, addressing key challenges of qubit scalability and controlled connectivity with an efficient scheme requiring minimal two-bit operations.
Contribution
It introduces a practical method to couple many superconducting qubits via accessible inductance and simplifies the implementation of conditional gates.
Findings
Scalable architecture for superconducting qubits using inductance coupling
Efficient quantum gate scheme requiring only one two-bit operation
Feasible experimental setup for large-scale quantum computing
Abstract
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 proposed QC architecture is scalable. In addition, we formulate an efficient and realizable QC scheme that requires only one (instead of two or more) two-bit operation to implement conditional gates.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Quantum and electron transport phenomena
