High-fidelity superconducting quantum processors via laser-annealing of transmon qubits
Eric J. Zhang, Srikanth Srinivasan, Neereja Sundaresan, Daniela F. Bogorin, Yves Martin, Jared B. Hertzberg, John Timmerwilke, Emily J. Pritchett, Jeng-Bang Yau… 展开作者
Eric J. Zhang, Srikanth Srinivasan, Neereja Sundaresan, Daniela F. Bogorin, Yves Martin, Jared B. Hertzberg, John Timmerwilke, Emily J. Pritchett, Jeng-Bang Yau, Cindy Wang, William Landers, Eric P. Lewandowski, Adinath Narasgond, Sami Rosenblatt, George A. Keefe, Isaac Lauer, Mary Beth Rothwell, Douglas T. McClure, Oliver E. Dial, Jason S. Orcutt, Markus Brink, Jerry M. Chow
Scaling the number of qubits while maintaining high-fidelity quantum gates remains a key challenge for quantum computing. Presently, superconducting quantum processors with >50-qubits are actively available. For such systems, fixed-frequency transmons are attractive due to their long coherence and noise immunity. However, scaling fixed-frequency architectures proves challenging due to precise relative frequency requirements. Here we employ laser annealing to selectively tune transmon qubits into desired frequency patterns. Statistics over hundreds of annealed qubits demonstrate an empirical tuning precision of 18.5 MHz, with no measurable impact on qubit coherence. We quantify gate error statistics on a tuned 65-qubit processor, with median two-qubit gate fidelity of 98.7%. Baseline tuning statistics yield a frequency-equivalent resistance precision of 4.7 MHz, sufficient for high-yield scaling beyond 1000-qubit levels. Moving forward, we anticipate selective laser annealing to play a central role in scaling fixed-frequency architectures.
Measurement-induced state transitions in multi-qubit transmon processors
Quantum Algorithms and Applications Collaboratory, Sandia National Laboratories（桑迪亚国家实验室量子算法与应用协作组）；Institut Quantique and Département de Physique, Université de Sherbrooke（舍布鲁克大学量子研究所与物理系）
We report the characterization of a two-qubit processor implemented with two capacitively coupled tunable superconducting qubits of the transmon type, each qubit having its own non-destructive single-shot readout. The fixed capacitive coupling yields the \sqrt{iSWAP} two-qubit gate for a suitable interaction time. We reconstruct by state tomography the coherent dynamics of the two-bit register as a function of the interaction time, observe a violation of the Bell inequality by 22 standard deviations after correcting readout errors, and measure by quantum process tomography a gate fidelity of 9…
We propose quantum circuits to test interferometric complementarity using symmetric two-way interferometers coupled to a which-path detector. First, we consider the two-qubit setup in which the controlled transfer of path information to the detector subsystem depletes interference on the probed subspace, testing the visibility-distinguishability trade-off via minimum-error state discrimination measurements. Next, we consider the quantum eraser setup, in which reading out path information in the right basis recovers an interference pattern. These experiments are then carried out in an IBM super…
Controlled-NOT (CNOT) gates are commonly included in the standard gate set of quantum processors and provide an important way to entangle qubits. For fixed-frequency qubits using the cross-resonance entangling technique, using the higher-frequency qubit to control the lower-frequency qubit enables much shorter entangling times than using the lower-frequency qubit as the control. Consequently, when implementing a CNOT gate where logical control by the lower-frequency qubit is needed, compilers may implement this functionality by using an equivalent circuit such as placing Hadamard gates on both…
Processing quantum information using quantum three-level systems or qutrits as the fundamental unit is an alternative to contemporary qubit-based architectures with the potential to provide significant computational advantages. We demonstrate a fully programmable two-qutrit quantum processor by utilizing the third energy eigenstates of two transmons. We develop a parametric coupler to achieve excellent connectivity in the nine-dimensional Hilbert space enabling efficient implementations of two-qutrit gates. We characterize our processor by realizing several algorithms like Deutsch-Jozsa, Berns…
In the evaluation of quantum annealers, metrics based on ground state success rates have two major drawbacks. First, evaluation requires computation time for both quantum and classical processors that grows exponentially with problem size. This makes evaluation itself computationally prohibitive. Second, results are heavily dependent on the effects of analog noise on the quantum processors, which is an engineering issue that complicates the study of the underlying quantum annealing algorithm. We introduce a novel "time-to-target" metric which avoids these two issues by challenging software sol…
Qubit connectivity is an important property of a quantum processor, with an ideal processor having random access -- the ability of arbitrary qubit pairs to interact directly. Here, we implement a random access superconducting quantum information processor, demonstrating universal operations on a nine-bit quantum memory, with a single transmon serving as the central processor. The quantum memory uses the eigenmodes of a linear array of coupled superconducting resonators. The memory bits are superpositions of vacuum and single-photon states, controlled by a single superconducting transmon couple…
Advancements in computing based on qubit networks, and in particular the flux-qubit processor architecture developed by D-Wave System's Inc., have enabled the physical simulation of quantum-dot cellular automata (QCA) networks beyond the limit of classical methods. However, the embedding of QCA networks onto the available processor architecture is a key challenge in preparing such simulations. In this work, two approaches to embedding QCA circuits are characterized: a dense placement algorithm that uses a routing method based on negotiated congestion; and a heuristic method implemented in D-Wa…
We introduce the sudden variant (SNZ) of the Net Zero scheme realizing controlled-$Z$ (CZ) gates by baseband flux control of transmon frequency. SNZ CZ gates operate at the speed limit of transverse coupling between computational and non-computational states by maximizing intermediate leakage. The key advantage of SNZ is tuneup simplicity, owing to the regular structure of conditional phase and leakage as a function of two control parameters. We realize SNZ CZ gates in a multi-transmon processor, achieving $99.93\pm0.24\%$ fidelity and $0.10\pm0.02\%$ leakage. SNZ is compatible with scalable s…
Early generations of superconducting quantum annealing processors have provided a valuable platform for studying the performance of a scalable quantum computing technology. These studies have directly informed our approach to the design of the next-generation processor. Our design priorities for this generation include an increase in per-qubit connectivity, a problem Hamiltonian energy scale similar to previous generations, reduced Hamiltonian specification errors, and an increase in the processor scale that also leaves programming and readout times fixed or reduced. Here we discuss the specif…
Improved error correction with leakage reduction units built into qubit measurement in a superconducting quantum processor
QuTech（夸特克）；Delft University of Technology（代尔夫特理工大学）；Kavli Institute of Nanoscience, Delft University of Technology（代尔夫特理工大学卡弗里纳米科学研究所）；SRON Netherlands Institute for Space Research（荷兰空间研究协会）
Quantum annealing is a heuristic quantum optimization algorithm that can be used to solve combinatorial optimization problems. In recent years, advances in quantum technologies have enabled the development of small- and intermediate-scale quantum processors that implement the quantum annealing algorithm for programmable use. Specifically, quantum annealing processors produced by D-Wave Systems have been studied and tested extensively in both research and industrial settings across different disciplines. In this paper we provide a literature review of the theoretical motivations for quantum ann…
Large-scale quantum computers will inevitably need quantum error correction to protect information against decoherence. Traditional error correction typically requires many qubits, along with high-efficiency error syndrome measurement and real-time feedback. Autonomous quantum error correction (AQEC) instead uses steady-state bath engineering to perform the correction in a hardware-efficient manner. We realize an AQEC scheme, implemented with only two transmon qubits in a 2D scalable architecture, that actively corrects single-photon loss and passively suppresses low-frequency dephasing using …
We propose and experimentally demonstrate a simple and efficient scheme for photonic communication between two remote superconducting modules. Each module consists of a random access quantum information processor with eight-qubit multimode memory and a single flux tunable transmon. The two processor chips are connected through a one-meter long coaxial cable that is coupled to a dedicated "communication" resonator on each chip. The two communication resonators hybridize with a mode of the cable to form a dark "communication mode" that is highly immune to decay in the coaxial cable. We modulate …
Transmon qubits are ubiquitously used in superconducting quantum information processor architectures. Strong drives are required to realize fast, high-fidelity, gates and measurements, including parametrically activated processes. Here, we show that even off-resonant drives, in regimes routinely used in experiments, can cause strong modifications to the structure of the transmon spectrum rendering a large part of it chaotic. Accounting for the full nonlinear dynamics of the transmon in a Floquet-Markov formalism, we find that these chaotic states, often neglected through the hypothesis that th…
With the increasing size of quantum processors, sub-modules that constitute the processor hardware will become too large to accurately simulate on a classical computer. Therefore, one would soon have to fabricate and test each new design primitive and parameter choice in time-consuming coordination between design, fabrication, and experimental validation. Here we show how one can design and test the performance of next-generation quantum hardware -- by using existing quantum computers. Focusing on superconducting transmon processors as a prominent hardware platform, we compute the static and d…
Building a scalable quantum computer requires developing appropriate models to understand and verify its complex quantum dynamics. We focus on superconducting quantum processors based on transmons for which full numerical simulations are already challenging at the level of qubytes. It is thus highly desirable to develop accurate methods of modeling qubit networks that do not rely solely on numerical computations. Using systematic perturbation theory to large orders in the transmon regime, we derive precise analytic expressions of the transmon parameters. We apply our results to the case of par…
The observation of an unequivocal quantum speedup remains an elusive objective for quantum computing. The D-Wave quantum annealing processors have been at the forefront of experimental attempts to address this goal, given their relatively large numbers of qubits and programmability. A complete determination of the optimal time-to-solution (TTS) using these processors has not been possible to date, preventing definitive conclusions about the presence of a scaling advantage. The main technical obstacle has been the inability to verify an optimal annealing time within the available range. Here we…
Achieving individual qubit readout is a major challenge in the development of scalable superconducting quantum processors. We have implemented the multiplexed readout of a four transmon qubit circuit using non-linear resonators operated as Josephson bifurcation amplifiers. We demonstrate the simultaneous measurement of Rabi oscillations of the four transmons. We find that multiplexed Josephson bifurcation is a high-fidelity readout method, the scalability of which is not limited by the need of a large bandwidth nearly quantum-limited amplifier as is the case with linear readout resonators.
Implementing transferable annealing protocols for combinatorial optimisation on neutral atom quantum processors: a case study on smart-charging of electric vehicles
Both simulated quantum annealing and physical quantum annealing have shown the emergence of "heavy tails" in their performance as optimizers: The total time needed to solve a set of random input instances is dominated by a small number of very hard instances. Classical simulated annealing, in contrast, does not show such heavy tails. Here we explore the origin of these heavy tails, which appear for inputs with high local degeneracy---large isoenergetic clusters of states in Hamming space. This category includes the low-precision Chimera-structured problems studied in recent benchmarking work c…
We develop a simulator for quantum computers composed of superconducting transmon qubits. The simulation model supports an arbitrary number of transmons and resonators. Quantum gates are implemented by time-dependent pulses. Nontrivial effects such as crosstalk, leakage to non-computational states, entanglement between transmons and resonators, and control errors due to the pulses are inherently included. The time evolution of the quantum computer is obtained by solving the time-dependent Schrödinger equation. The simulation algorithm shows excellent scalability on high-performance supercomput…
Quantum annealing is a promising approach for solving optimization problems, but like all other quantum information processing methods, it requires error correction to ensure scalability. In this work we experimentally compare two quantum annealing correction codes in the setting of antiferromagnetic chains, using two different quantum annealing processors. The lower temperature processor gives rise to higher success probabilities. The two codes differ in a number of interesting and important ways, but both require four physical qubits per encoded qubit. We find significant performance differe…
Quantum information processing offers dramatic speedups, yet is famously susceptible to decoherence, the process whereby quantum superpositions decay into mutually exclusive classical alternatives, thus robbing quantum computers of their power. This has made the development of quantum error correction an essential and inescapable aspect of both theoretical and experimental quantum computing. So far little is known about protection against decoherence in the context of quantum annealing, a computational paradigm which aims to exploit ground state quantum dynamics to solve optimization problems …
Entanglement lies at the core of quantum algorithms designed to solve problems that are intractable by classical approaches. One such algorithm, quantum annealing (QA), provides a promising path to a practical quantum processor. We have built a series of scalable QA processors consisting of networks of manufactured interacting spins (qubits). Here, we use qubit tunneling spectroscopy to measure the energy eigenspectrum of two- and eight-qubit systems within one such processor, demonstrating quantum coherence in these systems. We present experimental evidence that, during a critical portion of …
Cross-Resonant Gates in Hybrid Fluxonium-Transmon Systems
University of Wisconsin-Madison（威斯康星大学麦迪逊分校）；SEEQC, Inc.（SEEQC公司）；University of Massachusetts-Amherst（马萨诸塞大学阿默斯特分校）；Ecole Polytechnique Federale de Lausanne（洛桑联邦理工学院）
