A Functional Architecture for Scalable Quantum Computing
Total Page:16
File Type:pdf, Size:1020Kb
A Functional Architecture for Scalable Quantum Computing Eyob A. Sete, William J. Zeng, Chad T. Rigetti Rigetti Computing Berkeley, California Email: feyob,will,[email protected] Abstract—Quantum computing devices based on supercon- ducting quantum circuits have rapidly developed in the last few years. The building blocks—superconducting qubits, quantum- limited amplifiers, and two-qubit gates—have been demonstrated by several groups. Small prototype quantum processor systems have been implemented with performance adequate to demon- strate quantum chemistry simulations, optimization algorithms, and enable experimental tests of quantum error correction schemes. A major bottleneck in the effort to devleop larger systems is the need for a scalable functional architecture that combines all thee core building blocks in a single, scalable technology. We describe such a functional architecture, based on Fig. 1. A schematic of a functional layout of a quantum computing system. a planar lattice of transmon and fluxonium qubits, parametric amplifiers, and a novel fast DC controlled two-qubit gate. kBT should be much less than the energy of the photon at the Keywords—quantum computing, superconducting integrated qubit transition energy ~!01. In a large system where supercon- circuits, computer architecture. ducting circuits are packed together, unwanted crosstalk among devices is inevitable. To reduce or minimize crosstalk, efficient I. INTRODUCTION packaging and isolation of individual devices is imperative and substantially improves the performance of the system. The underlying hardware for quantum computing has ad- vanced to make the design of the first scalable quantum Superconducting qubits are made using Josephson tunnel computers possible. Superconducting chips with 4–9 qubits junctions which are formed by two superconducting thin have been demonstrated with the performance required to electrodes separated by a dielectric material. The dielectric run quantum simulation algorithms [1]–[3], quantum machine material is thin enough (a few nm) to allow tunneling of learning [4], and quantum error correction benchmarks [5]–[7]. discrete charges (Cooper pairs) through the insulating barrier. These new hardware demonstrations have been matched One of the requirements of gate-based quantum computer with advances in applications for relatively small and is a universal set of quantum gates. Although it is possible noisy quantum computing systems. Quantum-classical hybrid to generate these gates using microwave signals applied to algorithms—including variational quantum eigensolvers [8]– the circuits, controllability and scalability remains a challenge. [10], correlated material simulations [11], and approximate op- One can instead generate the single qubit gates via microwaves timization [12]—have much promise in reducing the overhead and two qubit gates using DC controlled frequency tunable required for valuable applications. In machine learning and qubits. In the architecture proposed here, fixed frequency quantum simulation, particularly for catalysts [13] and high transmon qubits and frequency tunable fluxonium qubits are temperature superconductivity [9], scalable quantum comput- used. On one hand, transmons are easy to design and are robust ers promise performance unrivaled by classical supercomput- to charge noise, thus yielding improved coherence time [14]. ers. On the other hand, fluxonium qubits are also designed to be insensitive to charge noise and have wide frequency tunablity A. Superconducting Qubits with strong nonlinearity [15]. In particular, strong nonlinearity of the fluxonium along with DC tunability allows us to Unlike conventional integrated circuits, a quantum inte- generate fast high fidelity two qubit gates. grated circuit requires ultra-low dissipation and ultra-low noise operation. Superconducting qubits with cryogenic operation B. Quantum limited amplifiers and superconducting materials, meet these requirements. The non-dissipative nature of these circuits allows electric signals Quantum limited amplifier is an essential component of a to be carried without energy loss, preserving quantum coher- scalable quantum computing system. It allows fast high-fidelity ence. Information is stored in non-linear resonators, where single-shot readout of qubits. Each qubit is measured using the presence or absence of a photon at the resonant qubit the method of dispersive readout, where the qubit is weakly frequency !01 encodes the j1i or j0i state of the qubit. The coupled to a superconducting linear resonator. This weak cou- technology requires that the energy of the thermal fluctuations pling imparts a qubit-state dependent resonator frequency shift, . which appears as a phase shift in a reflected or transmitted . microwave signal. By measuring this signal via the homodyne . method, we can infer the state of the qubit. Quantum limited amplifiers [16]–[18] such as Joseph- . son parametric amplifier, Josephson bifurcation amplifier, and Josephson parametric converter are nonlinear superconducting resonators made of Josephson junctions and thus operates at . cryogenic temperature. Quantum limited amplifiers are de- signed by exploiting nondissipative and nonlinear properties of Josephson junction at very low temperature. These devices . are characterized by amplifier bandwidth, gain and dynamic . range. In a scalable quantum computing system, integration of Fig. 2. Solid blue circles are lower transmon qubits and solid red circles are quantum limited amplifiers on a chip is needed. Depending on upper transmon qubits. Empty circles are fluxonium qubits. Qubit couplings the bandwidth of these amplifiers each qubit readout can have are indicated by the edges and allow two different sets of natural two-qubit a dedicated amplifier or multiple qubits can be read out by gates, as described in the text. Blue edges indicate a coupling between a fluxonium and a lower transmon, allowing two-qubit gates from of the SWAP a single broadband amplifier. Figure 1 illustrates an example class. Red edges indicate a coupling between a fluxonium and an upper setup of a quantum computing system. transmon, allowing CPhase class gates II. FUNCTIONAL ARCHITECTURE III. THEORY OF TWO-QUBIT GATES We propose a functional architecture of coupled fluxonium A. The transmon-fluxonium SWAP class gate and transmon qubits. Fixed-frequency transmon qubits are Transmon and fluxonium qubits are coupled capacitively. placed at the vertices of a square lattice, while fluxonium Treating both fluxonium and transmon qubits as having arbi- qubits are placed at on the edges. The parking frequency of trary energy-level systems, the Hamiltonian can be described each fluxonium is chosen to be between the frequencies of its as (~ = 1) two neighboring transmons, so that we label one as the lower X T X F X transmon and the other as the upper transmon respectively. H = !j j jihjj + !m(t)jmihmj + gij;kmjiihjj ⊗ jkihmj; An example 40-qubit segment of this architecture, comprising j m ijkm (1) 16 transmons and 24 fluxoniums is illustrated in Figure 2. T Equivalently, the architecture is a bi-partite graph of transmon where !j is the frequency jth energy level of the transmon and F and fluxonium qubits, where edges are one of two colors. !m(t) is the frequency of the mth level of fluxonium which is tunable in time; gij;km is the coupling between the jii ! On each transmon or fluxonium qubit the single-qubit ro- j ji transition of transmon and the jki ! jmi transition of θ θ tation gates RX (θ) = exp[−i 2 X] and RY (θ) = exp[−i 2 Y] form fluxonium. Fluxnoium qubit energy levels have a strong non- a parametrized class of primitive gates, where X and Y are the linearity, and so this qubit can be accurately modeled by a two- usual Pauli matrices. The rotation angle θ may be implemented level system. As the transmon is relatively linear, we include to high enough accuracy that gates are decoherence limited, at least the j2i in our model. In view of this, the Hamiltonian i.e., it suffices to consider θ as exactly accurate, but with a of the coupled system reduces to limited gate fidelity due to finite qubit lifetimes. In practice a limited set of gates from this class are chosen for tune-up, 0 0 0 !T (2) e.g., θ 2 f±π; ±π=2; ±π=4; ±π=8; ±π=16; ±π=32g. H = 0 01 0 ⊗ I (2) 0 0 !T + !T * 01 12 + In addition to being a qubit itself, the fluxonium qubits . / 1 F (1) y y y y act as tunable couplers, enabling two classes of two- + ! (t)I ⊗ σ2z + g(σ1σ + σ σ2 + σ σ + σ1σ2); , 2 01 - 2 1 1 2 qubit gates between the transmons and fluxoniums. The T T T − T j i ! j i first class, called SWAP class, allows gates from the set where !01 and !12 = !01 η are the 0 1 and the p T fiSWAP; iSWAP; iSWAP1=4;:::g, and can be applied between j1i ! j2i transition frequencies of the transmon, with η being F any fluxonium and transmon pair. A second two-qubit gate the anharmonicity of the transmon, and !01(t) is the j0i ! class (called CPhase class) is available between a fluxonium j1i transition frequency of the fluxonium; g is the coupling and an upper transmon. This is a parametrized class of the four strength between the j0i ! j1i transition of the transmon and the fluxonium. Here I (1) and I (2) are 3 × 3 and 2 × 2 identity controlled phase gate types fC00(φ); C01(φ); C10(φ); C11(φ)g, matrices respectively, and the lowering operators of the qubits where Cij performs a phase shift of φ on input of the two qubit state jiji. are given by 0 1 0 ! The CPhase class and SWAP class two-qubit gate primi- p 0 0 σ = ⊗ I (1); σ = I (1) ⊗ : (3) tives, along with single qubit rotations on the transmons and 1 0 0 2 2 1 0 fluxoniums, enable universal quantum computation. Other two- 0 0 0 .* /+ qubit gates, such as the controlled-not can be synthesized from Instead of directly tuning the coupling strength we are tune these primitives [19].