Quantum computing utilizes quantum mechanics to perform computations with superconducting qubits being the more mature technology as of writing in realizing a quantum computer. In this thesis, we describe an implementation of a Quantum Processor Unit (QPU), which is used to execute instructions in the form of microwave pulses on a superconducting qubit device through the use of signal generators and to perform qubit readout. We further extend the QPU as a platform to perform qubit characterization tasks such as spectroscopy and decoherence measurements in order to determine and optimize the working parameters to perform quantum gate operations. We also demonstrate the use of the QPU in performing qubit experiments such as Gauss Sum Factorization in determining the factors of an integer and the Bell Inequality test in examining the entanglement strength between a pair of qubits. We bridge the divide of quantum computation and qubit hardware in the compilation of quantum circuits into microwave pulse sequences for the QPU to execute. The process of compilation, as well as hardware limitations and pre-compilation optimization procedures are discussed. Finally, we show an example of executing a variational quantum algorithm and break down this example in all layers from the quantum circuit provided by the user to the pulse sequence that will be executed on the QPU.
Quantum computing utilizes quantum mechanics to perform computations with superconducting qubits being the more mature technology as of writing in realizing a quantum computer. In this thesis, we describe an implementation of a Quantum Processor Unit (QPU), which is used to execute instructions in the form of microwave pulses on a superconducting qubit device through the use of signal generators and to perform qubit readout. We further extend the QPU as a platform to perform qubit characterization tasks such as spectroscopy and decoherence measurements in order to determine and optimize the working parameters to perform quantum gate operations. We also demonstrate the use of the QPU in performing qubit experiments such as Gauss Sum Factorization in determining the factors of an integer and the Bell Inequality test in examining the entanglement strength between a pair of qubits. We bridge the divide of quantum computation and qubit hardware in the compilation of quantum circuits into microwave pulse sequences for the QPU to execute. The process of compilation, as well as hardware limitations and pre-compilation optimization procedures are discussed. Finally, we show an example of executing a variational quantum algorithm and break down this example in all layers from the quantum circuit provided by the user to the pulse sequence that will be executed on the QPU.
The thesis investigates three challenges in superconducting quantum computing: efficient quantum gate compilation, scalable microwave interfacing of quantum processors (QPUs), and electrical annealing of Josephson junctions.The first part addresses an inefficiency in contemporary two-qubit gate compilation. Universal quantum computation requires only a single entangling two-qubit gate alongside single-qubit rotations, but this minimal gate set requires up to three additional two-qubit gates for every unsupported gate. I show how access to multiple inequivalent two-qubit gate classes overcomes this inefficiency. I experimentally realised an unsupported SWAP operation using one parametric CZ and one parametric iSWAP gate on a circuit-QED architecture. A Kraus-Cirac analysis shows that this combination belongs to the SWAP equivalency class, the fundamental reason for the reduction in two-qubit gates. The experiment demonstrates a rare case of simultaneous CZ and iSWAP support in the same quantum circuit, illustrating how access to multiple inequivalent gate classes can reduce compilation overhead on real hardware.The second part explores direct digital synthesis of microwave signals for interfacing with quantum processors. Conventional control uses heterodyne upconversion with IQ mixers, requiring compensation of LO leakage and IQ skew. I investigated a mixerless architecture based on high-speed DAC/ADC systems to generate and analyse the required microwave signals. CZ and iSWAP gate experiments subsequently verify that the platform is equivalent to conventional QPU setups.The third part investigates post-fabrication electrical tuning of Josephson junctions, in which voltage pulses modify junction resistance to correct fabrication-induced transmon-frequency variations. The speed of resistance change was found to depend exponentially on pulse amplitude. A novel stepwise protocol achieved a 270% resistance increase in an 11-month-old 11.5 kΩ junction, corresponding to a ~2 GHz reduction in transmon frequency, the largest reported selective resistance modification to date. Simulations show that resistance, charging-energy, and superconducting-gap uncertainties contribute equally to the uncertainty in the final qubit frequency. The results support a picture where electrical manipulation modifies the energy landscape, accelerating natural junction ageing.The thesis demonstrates that investigating gate-level compilation strategies, fully digital QPU control, and post-fabrication tuning, helps advance the understanding of how to approach scalable superconducting quantum processors.
Quantum interactions are strikingly different from their classical counterparts, and they lead to counter-intuitive effects such as quantum entanglement. The advances in quantum science and technology over the past two decades have shown that such interactions can be harnessed in quantum devices to address hard computational problems. The field of quantum computation has emerged, and superconducting circuits have become a leading platform for quantum processors. Because of the large design space and the difficulty to simulate design prototypes on a classical computer, a key challenge in quantum processor engineering is to translate desired quantum characteristics into a circuit design. A particular obstacle has been the implementation of interactions between multiple quantum bits (qubits) in one coupling mechanism. Multi-qubit interactions are necessary for a number of applications in quantum annealing, analog quantum simulation, and digital quantum computation. In this work, we develop classical and quantum computational methods to address the challenge of implementing such interactions. We present a computational method for automated design of superconducting circuits. Our method performs a parallelized, closed-loop optimization to design superconducting circuit diagrams that match predefined properties, such as dispersion features and noise sensitivities. We employ it to design a coupler for superconducting flux qubits that mediates 4-qubit interactions. The coupler circuit is then realized experimentally. We find that it has the desired ground state dispersion properties versus flux and that it does not adversely affect the lifetime of a connected flux qubit. Moreover, the coupling concept can be extended by systematically adding loops to the coupler. In a second iteration, we implement a circuit architecture in which the coupler mediates interactions between three flux qubits. The system Hamiltonian is estimated via multi-qubit pulse sequences that implement Ramsey-type interferometry between all neighboring excitation manifolds. We verify that the multi-qubit system exhibits a 3-qubit coupling that is coherently tunable, which is important for practical applications. Finally, we address the challenge that complex multi-qubit circuits are difficult to simulate accurately on a classical computer as they become larger. As a solution, we propose quantum algorithms to design and test the performance of next-generation quantum hardware on a quantum computer. We have therefore addressed the challenge of quantum device design both from a classical optimization and from a quantum computational angle.
After years of academic development, the circuit quantum electrodynamics is entering the age of applications. This thesis was realized in this context of creating tools to bridge the gap between an astounding academic quantum system, superconducting circuits, and a grand goal, the universal quantum computer. A likely blueprint for quantum processors consists in the assembly of a large number of elementary modules arranged in a network.In this experimental thesis, a possible node for such a network, the quantum node, was developed and fabricated using state-of-the-art techniques for 2D superconducting microwave circuits. This node was first used to implement a novel sequential readout method for a superconducting qubit. This experiment, first proposed in 2013 by Sete et al., potentially allows for faster, more accurate read out of superconducting qubits. The read out of qubits is one of the several bottlenecks limiting the development of fault-tolerant superconducting quantum computers, which made this project both useful as a demonstration of the quantum node and for applications. This novel readout method achieves readout performances close to state-of-the-art of superconducting qubit readout even though the chip was not optimized for that purpose.During this work, we also contributed to two other experiments engineering quantum measurement and dissipation with superconducting circuits. First, a dedicated circuit was developed to demonstrate a new form of quantum measurement: the multiplexed photon number measurement. In that experiment led by A. Essig and Q. Ficheux, a superconducting transmon quantum bit is read out at multiple frequencies simultaneously to extract more than one bit of information about the number of photons contained in a microwave resonator coupled to that quantum bit.Second, we contributed to the experimental demonstration of the exponential suppression of bit-flips in a qubit encoded in a Schrödinger Cat state of a microwave mode. This experiment led by R. Lescanne and Z. Leghtas, demonstrates the improvement by a factor 300 of the lifetime of a qubit thanks to the autonomous error correction realized through the engineering of the dissipation of a microwave mode.
Quantum computing holds the promise of solving problems that are intractable for classical computers, with applications ranging from optimization and materials simulation to cryptography. It achieves this by leveraging the exponentially scaling dimensionality of the space encoding quantum information and by executing algorithms on quantum registers in superposition states – a feature often referred to as quantum parallelism. However, while encoding information in computational units capable of exploring a continuous set of quantum states enables exponential scaling of computational power with system size, quantum systems are also more susceptible to errors than their classical counterparts. These errors take the form of both control errors, where miscalibration of the control pulses causes coherent errors on the qubit states, as well as incoherent errors due to energy relaxation and dephasing. Scaling quantum systems to run useful algorithms involving hundreds or thousands of logical qubits will require quantum error correction. In this approach, quantum information is redundantly encoded across an entangled state of many physical qubits. This has enabled experimental demonstrations across various platforms – including ion traps, superconducting circuits, and neutral atoms – showing that encoded quantum states can be preserved beyond the coherence times of the constituting physical qubits. However, quantum state preservation is only one component needed for scalable quantum computing. To execute algorithms, it is also necessary to implement quantum gates on and between encoded qubits, in a way that maintains fault tolerance by preserving the ability to correct errors as they occur during the computation. In the first part of this thesis, we demonstrate the implementation of an error-corrected quantum operation that entangles two logical qubits. This is achieved by performing lattice surgery on a distance-three surface code qubit, resulting in a logical Bell state encoded in distance-three repetition codes, which enable the correction of single bit-flip errors. We further introduce techniques to benchmark and characterize the performance of logical operations, including applying the protocol to arbitrary logical input states and performing logical quantum process tomography. Together, these results constitute one of the first realizations of error-corrected lattice surgery in superconducting circuits. While quantum error correction can correct errors provided they occur with sufficiently low frequency, it may fail when many qubits experience errors simultaneously. In the second part of this thesis, we therefore shift focus to a specific error mechanism known to cause correlated errors in superconducting circuits – quasiparticle-induced decoherence. In this case, various forms of energy deposition on the quantum device can break Cooper pairs into quasiparticles, which may subsequently diffuse to the tunnel junction and interact with the qubit state, thereby causing decoherence. In this thesis, we investigate the impact of quasiparticle tunneling on qubit performance, with a focus on infrared-induced quasiparticles. We compare the sensitivity of niobium-based qubits to those made from tantalum – a material that has gained interest in recent years following demonstrations of qubits with improved coherence times based on this material. Using a thermal radiator source, we show that the performance of tantalum qubits may be limited by infrared-induced quasiparticles in typical superconducting circuit experimental setups. By employing both ambient and in-line infrared filters, we investigate the effectiveness of different filtering strategies and develop best practices for engineering cryogenic environments for superconducting quantum processors. The results presented in this thesis contribute to the advancement of quantum computing based on superconducting circuits by implementing and characterizing quantum error-corrected operations, and by investigating quasiparticles as a source of decoherence, along with strategies to improve infrared filtering and signal conditioning in cryogenic environments for future fault-tolerant quantum computing.
Advanced simulations and calculations on quantum computers require high-fidelity implementations of quantum operations. The universal gateset approach builds complex unitaries from a small set of primitive gates, often resulting in a long gate sequence, which is typically a leading factor in the total accumulated error. Compiling a complex unitary for processors with higher-dimensional logical elements, such as qutrits, exacerbates the accumulated error per unitary, since an even longer gate sequence is required. Optimal control methods promise time- and resource-efficient compact gate sequences and, therefore, higher fidelity. These methods generate pulses that can directly implement any complex unitary on a quantum device. In this work, we demonstrate that any arbitrary qubit and qutrit gate can be realized with high fidelity, which can significantly reduce the length of a gate sequence. We generate and test pulses for a large set of randomly selected arbitrary unitaries on several quantum processing units (QPUs): the Lawrence Livermore National Laboratory Quantum Device and Integration Testbed's (QuDIT's) standard QPU and three of Rigetti's QPUs: Ankaa-2, Ankaa-9Q-1, and Aspen-M-3. On the QuDIT platform's standard QPU, the average fidelity of random qutrit gates is $97.9\ifmmode\pm\else\textpm\fi{}0.5\mathrm{%}$ measured with conventional QPT and $98.8\ifmmode\pm\else\textpm\fi{}0.6\mathrm{%}$ from QPT with gate folding. Rigetti's Ankaa-2 achieves random qubit gates with an average fidelity of $98.4\ifmmode\pm\else\textpm\fi{}0.5\mathrm{%}$ (conventional QPT) and $99.7\ifmmode\pm\else\textpm\fi{}0.1\mathrm{%}$ (QPT with gate folding). On Ankaa-9Q-1 and Aspen-M-3, the average fidelities with conventional qubit QPT measurements were higher than 99% (see Appendix). We show that optimal control gates are robust to drift for at least 3 h and that the same calibration parameters can be used for all implemented gates. Our work promises that the calibration overheads for optimal control gates can be made small enough to enable efficient quantum circuits based on this technique.
Quantum computing is a novel paradigm for information processing that promises computational speedup for certain computational tasks while not being driven by Moore's law. Superconducting circuits based on Josephson junctions are one of the leading approaches for implementing the quantum bits, or qubits, in a quantum processor. Most superconducting qubit architectures involve circuit quantum electrodynamics, where the qubits are analogous to artificial atoms that are coupled to superconducting linear resonant cavities. This scheme allows for the readout of individual qubits, the manipulation of single-qubit states, and the generation of entanglement between qubits. The performance of current state-of-the-art systems is limited by decoherence of the qubits and associated gate errors. Nonetheless, experiments have been performed that already demonstrate a significant computational speedup compared to classical processing. Future implementations of fault-tolerant quantum computers will require the development of quantum error correction. Initial tests of elements of error correction in superconducting qubit arrays are underway.