Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Error analysis of gate-based quantum computers with transmon qubits

Dennis Willsch, Madita Nocon, Fengping Jin, Kristel F. L. Michielsen, Hans A. De Raedt

Published Jan 1, 2018• 0 citations
OpenAlex

Abstract

Over the past decades, tremendous effort has gone into building a universal quantum computer. In theory, such a device can solve certain problems such as factoring exponentially faster than digital computers. The leading technological prototypes are based on superconducting circuits and contain about 10-50 qubits. Controlling these fragile systems requires an enormous amount of precision, posing a difficult challenge for the experimentalists. We study such quantum systems in detail by solving the time-dependent Schrödinger equation for a generic model Hamiltonian. For this purpose, we have developed efficient product-formula algorithms that are tailored to key features of the model Hamiltonian. This allows us to simulate each individual voltage pulse that is used in experiments to realize a certain quantum gate, as dictated by the computational model of a quantum computer. By optimizing the pulse parameters, we find that even in the ideal case, the best pulses still contain undesirable errors in the realization of the intended quantum gate. The common gate metrics measured and reported in experiments or computed in theory are shown to provide insufficient practical information about the significance of these errors.

Related papers

Supercomputer simulations of transmon quantum computers

Dennis Willsch

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 supercomputers. We present results for the simulation of up to 16 transmons and resonators. Additionally, the model can be used to simulate environments, and we demonstrate the transition from an isolated system to an open quantum system governed by a Lindblad master equation. We also describe a procedure to extract model parameters from electromagnetic simulations or experiments. We compare simulation results to experiments on several NISQ processors of the IBM Q Experience. We find nearly perfect agreement between simulation and experiment for quantum circuits designed to probe crosstalk in transmon systems. By studying common gate metrics such as the fidelity or the diamond distance, we find that they cannot reliably predict the performance of repeated gate applications or practical quantum algorithms. As an alternative, we find that the results from two-transmon gate set tomography have an exceptional predictive power. Finally, we test a protocol from the theory of quantum error correction and fault tolerance. We find that the protocol systematically improves the performance of transmon quantum computers in the presence of characteristic control and measurement errors.

arXiv:2008.13490•Jan 1, 2020•8 citations

Gate-error analysis in simulations of quantum computers with transmon qubits

Dennis Willsch, Madita Nocon, Fengping Jin +2 more

Usual metrics, such as the fidelity, used to characterize the success of implementing superconducting qubit-based quantum gates are analyzed. By numerically solving time-dependent Schr\"odinger equations for a transmon system, it is found that such metrics are not reliable to predict the performance of a quantum algorithm when the gates are used repeatedly.

arXiv:1709.06600•Physical Review A•Dec 1, 2017•53 citations

Metrology of Quantum Control and Measurement in Superconducting Qubits

Zijun Chen

Quantum computers have the potential to solve problems which are classically intractable. Superconducting qubits present a promising path to building such a computer. Recent experiments with these qubits have demonstrated the principles of quantum error correction, quantum simulation, quantum annealing, and more. Current research with superconducting qubits is focused on two primary goals: creating a fully fault tolerant logical qubit out of many physical qubits using surface code error correction, and demonstrating an exponential speedup over any classical computer for a well-defined computational problem. To achieve either of these goals requires high precision control of three components: single qubit gates, two qubit gates, and qubit measurement. In this thesis, we use randomized benchmarking to characterize single qubit gates with 99.95\\% fidelity and two qubit gates wiht 99.5\\% fidelity in superconducting transmon qubits. In addition, we use standard decoherence measurements as well as newly developed extensions of randomized benchmarking to determine the limiting sources of error. Finally, we explore the surprisingly complicated dynamics of measuring the transmon state through a coupled resonator, and show that fully understanding this process requires breaking a few "standard" assumptions.

•Jan 1, 2018•35 citations

Control for Programmable Superconducting Quantum Systems

Michiel Adriaan Rol

The discovery of quantum mechanics in the 20th century forms the basis of many of the technologies that define our lives today. The ability to engineer and manipulate individual quantum systems -- even create artificial atoms -- promises a similar revolutionary leap in technology. A quantum technology of particular interest is quantum computing, which has the potential to solve problems that are intractable for classical computers, opening up new domains of computation. Meanwhile, an attractive approach to creating engineered quantum systems is circuit quantum electrodynamics (cQED). Where research initially focused on understanding the physics of cQED devices, focus has shifted to building systems capable of performing useful computations. However, this remains extremely challenging, in part due to the inherently fragile nature of the individual quantum bits, but also due to difficulties in controlling and scaling up these systems. This thesis focuses on the control aspects of building an extensible full-stack quantum computer based on superconducting transmon qubits. We define the demonstration of quantum fault-tolerance as our target application to give focus to our efforts. The QuSurf architecture for a full-stack quantum computer presented in this thesis is designed with this application in mind. We provide a detailed study of the error sources present in this system and give an overview of the relevant characterization techniques. In the second part of this thesis, we address several key challenges in the control of a quantum computer. To realize high-fidelity coherence limited gates, we present a novel tuneup protocol that achieves a tenfold speedup over the state-of-the-art. This is realized by eliminating the need for qubit initialization. We demonstrate this protocol by calibrating single-qubit gates to a coherence limited Clifford fidelity of 99.9% in one minute. Performing repeated parity checks, as is required for quantum error correction, requires reusing qubits quickly after they have been measured. By introducing a numerically optimized depletion pulse we are able to speeds up the depletion of measurement photons in a readout resonator without having to rely on specific symmetry conditions. Using this technique speed up photon depletion by more than six inverse resonator linewidths, reducing the error rate in an emulated ancilla parity check by a factor 75. Flux-pulsing based two-qubit gates are the fastest two-qubit gates. However, they are also very technically demanding. The key challenge in performing these gates is addressing the distortions that control signals experience as they traverse various electrical components. We have developed Cryoscope (short for cryogenic oscilloscope) to characterize and correct these distortions. Cryoscope is an in-situ technique that uses the qubit to sample control pulses of arbitrary shape. Even when correcting distortions to within $\\sim 0.1\\%$ two-qubit gates are history-dependent due to the long timescale upon which some of these distortions act. We have invented Net-Zero, a new type of flux-pulsing based two-qubit gate, to address this problem. It makes use of a symmetry condition of the transmon to have net-zero integral, making the gate resilient to long-timescale distortions. The gate suppresses leakage out of the computational subspace to 0.1% by making use of leakage interference and has a built-in echo effect that enhances the coherence of the gate, achieving a two-qubit gate fidelity of 99.1%. Custom software is required to perform the physics experiments needed to build and operate a quantum computer. PycQED is an open-source software framework we have developed for this purpose. We discuss the design choices and concepts of PycQED before turning our focus to characterization and calibration. Here we introduced dependency graphs as a useful abstraction and system emulation as an essential development tool for automating the characterization and calibration process. We conclude the thesis by reflecting on the limitations of our architecture and providing an outlook on the grand challenges of building a useful kilo-qubit sized quantum computer. We define these challenges as The Application Problem, The Fabrication Problem, and The Calibration Problem.

•Sep 23, 2020•3 citations

Scalability and modularity for transmon-based quantum processors

Christian Dickel

This thesis mainly summarizes two experiments that relate to building a quantum computer out of superconducting transmon qubits. Transmon qubits have emerged as one of the foremost solid state qubits, realizing processors with more than ten qubits and demonstrating small scale quantum algorithms as well as quantum error correction schemes. Right now, there is a race between different academic and industry research groups to scale up transmon qubit processors. The first experiment was a demonstration of qubit control by selective broadcasting in order to reduce the scaling of expensive electronics with the number of qubits for individual single-qubit control. We demonstrated that we can bring two transmon qubits to the same frequency (combining fabrication accuracy and in-situ fine tuning) and use the same hardware to control both, routing the pulses with a nanosecond-timescale vector switch matrix. Despite the compromises required by this technique, we show a scalable path to single qubit control beyond the threshold required for quantum error correction. In benchmarking, we take into account gate leakage due to the fact that transmons are fundamentally multi-level systems. In the second experiment we establish entanglement between two transmon qubits on different chips. We use an entanglement by measurement scheme and demonstrate that we can overcome minor fabrication imperfections by shaping our measurement pulses. Ultimately, performance is mainly limited by photon loss between the chips and up to the amplification chain. This entanglement mediated by traveling photons could be used to make a distributed transmon processor where computations are spread across several chip modules. This modularity could enable connectivities that cannot be realized on chip and ease fabrication requirements, as modules could be individually fabricated and selected. Thus, both of these experiments fit into the larger effort to converge on the hardware, control equipment and architecture of a future large-scale transmon quantum computer. Other experiments I contributed to are summarized in the conclusion chapter to show the diverse physics that can be studied in cQED experiments.

•Jan 1, 2018•2 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.05810•Physical Review Applied•Jul 9, 2021•24 citations
Over the past decades, tremendous effort has gone into building a universal quantum computer. In theory, such a device can solve certain problems such as factoring exponentially faster than digital computers. The leading technological prototypes are based on superconducting circuits and contain about 10-50 qubits. Controlling these fragile systems requires an enormous amount of precision, posing a difficult challenge for the experimentalists. We study such quantum systems in detail by solving the time-dependent Schrödinger equation for a generic model Hamiltonian. For this purpose, we have developed efficient product-formula algorithms that are tailored to key features of the model Hamiltonian. This allows us to simulate each individual voltage pulse that is used in experiments to realize a certain quantum gate, as dictated by the computational model of a quantum computer. By optimizing the pulse parameters, we find that even in the ideal case, the best pulses still contain undesirable errors in the realization of the intended quantum gate. The common gate metrics measured and reported in experiments or computed in theory are shown to provide insufficient practical information about the significance of these errors.
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 supercomputers. We present results for the simulation of up to 16 transmons and resonators. Additionally, the model can be used to simulate environments, and we demonstrate the transition from an isolated system to an open quantum system governed by a Lindblad master equation. We also describe a procedure to extract model parameters from electromagnetic simulations or experiments. We compare simulation results to experiments on several NISQ processors of the IBM Q Experience. We find nearly perfect agreement between simulation and experiment for quantum circuits designed to probe crosstalk in transmon systems. By studying common gate metrics such as the fidelity or the diamond distance, we find that they cannot reliably predict the performance of repeated gate applications or practical quantum algorithms. As an alternative, we find that the results from two-transmon gate set tomography have an exceptional predictive power. Finally, we test a protocol from the theory of quantum error correction and fault tolerance. We find that the protocol systematically improves the performance of transmon quantum computers in the presence of characteristic control and measurement errors.
Quantum computers have the potential to solve problems which are classically intractable. Superconducting qubits present a promising path to building such a computer. Recent experiments with these qubits have demonstrated the principles of quantum error correction, quantum simulation, quantum annealing, and more. Current research with superconducting qubits is focused on two primary goals: creating a fully fault tolerant logical qubit out of many physical qubits using surface code error correction, and demonstrating an exponential speedup over any classical computer for a well-defined computational problem. To achieve either of these goals requires high precision control of three components: single qubit gates, two qubit gates, and qubit measurement. In this thesis, we use randomized benchmarking to characterize single qubit gates with 99.95\\% fidelity and two qubit gates wiht 99.5\\% fidelity in superconducting transmon qubits. In addition, we use standard decoherence measurements as well as newly developed extensions of randomized benchmarking to determine the limiting sources of error. Finally, we explore the surprisingly complicated dynamics of measuring the transmon state through a coupled resonator, and show that fully understanding this process requires breaking a few "standard" assumptions.
The discovery of quantum mechanics in the 20th century forms the basis of many of the technologies that define our lives today. The ability to engineer and manipulate individual quantum systems -- even create artificial atoms -- promises a similar revolutionary leap in technology. A quantum technology of particular interest is quantum computing, which has the potential to solve problems that are intractable for classical computers, opening up new domains of computation. Meanwhile, an attractive approach to creating engineered quantum systems is circuit quantum electrodynamics (cQED). Where research initially focused on understanding the physics of cQED devices, focus has shifted to building systems capable of performing useful computations. However, this remains extremely challenging, in part due to the inherently fragile nature of the individual quantum bits, but also due to difficulties in controlling and scaling up these systems. This thesis focuses on the control aspects of building an extensible full-stack quantum computer based on superconducting transmon qubits. We define the demonstration of quantum fault-tolerance as our target application to give focus to our efforts. The QuSurf architecture for a full-stack quantum computer presented in this thesis is designed with this application in mind. We provide a detailed study of the error sources present in this system and give an overview of the relevant characterization techniques. In the second part of this thesis, we address several key challenges in the control of a quantum computer. To realize high-fidelity coherence limited gates, we present a novel tuneup protocol that achieves a tenfold speedup over the state-of-the-art. This is realized by eliminating the need for qubit initialization. We demonstrate this protocol by calibrating single-qubit gates to a coherence limited Clifford fidelity of 99.9% in one minute. Performing repeated parity checks, as is required for quantum error correction, requires reusing qubits quickly after they have been measured. By introducing a numerically optimized depletion pulse we are able to speeds up the depletion of measurement photons in a readout resonator without having to rely on specific symmetry conditions. Using this technique speed up photon depletion by more than six inverse resonator linewidths, reducing the error rate in an emulated ancilla parity check by a factor 75. Flux-pulsing based two-qubit gates are the fastest two-qubit gates. However, they are also very technically demanding. The key challenge in performing these gates is addressing the distortions that control signals experience as they traverse various electrical components. We have developed Cryoscope (short for cryogenic oscilloscope) to characterize and correct these distortions. Cryoscope is an in-situ technique that uses the qubit to sample control pulses of arbitrary shape. Even when correcting distortions to within sim0.1\\sim 0.1\\%sim0.1 two-qubit gates are history-dependent due to the long timescale upon which some of these distortions act. We have invented Net-Zero, a new type of flux-pulsing based two-qubit gate, to address this problem. It makes use of a symmetry condition of the transmon to have net-zero integral, making the gate resilient to long-timescale distortions. The gate suppresses leakage out of the computational subspace to 0.1% by making use of leakage interference and has a built-in echo effect that enhances the coherence of the gate, achieving a two-qubit gate fidelity of 99.1%. Custom software is required to perform the physics experiments needed to build and operate a quantum computer. PycQED is an open-source software framework we have developed for this purpose. We discuss the design choices and concepts of PycQED before turning our focus to characterization and calibration. Here we introduced dependency graphs as a useful abstraction and system emulation as an essential development tool for automating the characterization and calibration process. We conclude the thesis by reflecting on the limitations of our architecture and providing an outlook on the grand challenges of building a useful kilo-qubit sized quantum computer. We define these challenges as The Application Problem, The Fabrication Problem, and The Calibration Problem.
This thesis mainly summarizes two experiments that relate to building a quantum computer out of superconducting transmon qubits. Transmon qubits have emerged as one of the foremost solid state qubits, realizing processors with more than ten qubits and demonstrating small scale quantum algorithms as well as quantum error correction schemes. Right now, there is a race between different academic and industry research groups to scale up transmon qubit processors. The first experiment was a demonstration of qubit control by selective broadcasting in order to reduce the scaling of expensive electronics with the number of qubits for individual single-qubit control. We demonstrated that we can bring two transmon qubits to the same frequency (combining fabrication accuracy and in-situ fine tuning) and use the same hardware to control both, routing the pulses with a nanosecond-timescale vector switch matrix. Despite the compromises required by this technique, we show a scalable path to single qubit control beyond the threshold required for quantum error correction. In benchmarking, we take into account gate leakage due to the fact that transmons are fundamentally multi-level systems. In the second experiment we establish entanglement between two transmon qubits on different chips. We use an entanglement by measurement scheme and demonstrate that we can overcome minor fabrication imperfections by shaping our measurement pulses. Ultimately, performance is mainly limited by photon loss between the chips and up to the amplification chain. This entanglement mediated by traveling photons could be used to make a distributed transmon processor where computations are spread across several chip modules. This modularity could enable connectivities that cannot be realized on chip and ease fabrication requirements, as modules could be individually fabricated and selected. Thus, both of these experiments fit into the larger effort to converge on the hardware, control equipment and architecture of a future large-scale transmon quantum computer. Other experiments I contributed to are summarized in the conclusion chapter to show the diverse physics that can be studied in cQED experiments.
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.