arXiv:2303.01282 · IEEE International Conference on Quantum Software (QSW)
Real-time hybrid quantum-classical computations for trapped ions with Python control-flow
Tobias Schmale, Bence Temesi, Niko Trittschanke, Nicolas Pulido-Mateo, Ilya Elenskiy, Ludwig Krinner, T. Dubielzig, C. Ospelkaus, Hendrik Weimer, Daniel Borcherding
In recent years, the number of hybrid algorithms that combine quantum and classical computations has been continuously increasing. These two approaches to computing can mutually enhance each others’ performances thus bringing the promise of more advanced algorithms that can outmatch their pure counterparts. In order to accommodate this new class of codes, a proper environment has to be created, which enables the interplay between the quantum and classical hardware.For many of these hybrid processes the coherence time of the quantum computer arises as a natural time constraint, making it crucial to minimize the classical overhead. For ion-trap quantum computers however, this is a much less limiting factor than with superconducting technologies, since the relevant timescale is on the order of seconds instead of microseconds. In fact, we show that the operating time-scales of trapped-ion quantum computers are compatible with the execution speed of the Python programming language, enabling us to develop an interpreted scheme for real-time control of quantum computations. In particular, compilation of all instructions in advance is not necessary, unlike with superconducting qubits. This keeps the implementation of hybrid algorithms simple and also lets users benefit from the rich environment of existing Python libraries.In order to show that this approach of interpreted quantum-classical computations (IQCC) is feasible, we bring real-world examples and evaluate them in realistic benchmarks.
In recent years, the number of hybrid algorithms that combine quantum and classical computations has been continuously increasing. These two approaches to computing can mutually enhance each others’ performances thus bringing the promise of more advanced algorithms that can outmatch their pure counterparts. In order to accommodate this new class of codes, a proper environment has to be created, which enables the interplay between the quantum and classical hardware.For many of these hybrid processes the coherence time of the quantum computer arises as a natural time constraint, making it crucial to minimize the classical overhead. For ion-trap quantum computers however, this is a much less limiting factor than with superconducting technologies, since the relevant timescale is on the order of seconds instead of microseconds. In fact, we show that the operating time-scales of trapped-ion quantum computers are compatible with the execution speed of the Python programming language, enabling us to develop an interpreted scheme for real-time control of quantum computations. In particular, compilation of all instructions in advance is not necessary, unlike with superconducting qubits. This keeps the implementation of hybrid algorithms simple and also lets users benefit from the rich environment of existing Python libraries.In order to show that this approach of interpreted quantum-classical computations (IQCC) is feasible, we bring real-world examples and evaluate them in realistic benchmarks.
Quantum computers hold the potential of solving problems that are intractable using classical means. Yet, to date no quantum computer has actually solved a problem of general interest that could not have been solved otherwise. Bridging this gap from promised theoretical usefulness to practical relevance is an interdisciplinary challenge, requiring experimental progress, solutions of classical software challenges as well as advances in quantum algorithm design. It is these final two points in which this thesis aims to contribute. One of the most promising quantum computing architectures is based on trapping ions in surface-electrode ion-traps. In order to productively operate such trapped-ion quantum computers, we develop and benchmark a compiler that optimizes ion shuttling sequences in order to efficiently map abstract quantum circuits onto a physical trapped-ion chip. This is a necessary component of the infrastructure of a quantum computing setup, however it is alone not sufficient to execute arbitrary quantum algorithms. In particular, a very promising class of quantum algorithms are so-called hybrid quantum-classical algorithms which leverage the computational resources of both quantum and classical computers. To effectively implement such algorithms, a suitable software setup is necessary to allow for tight interplay between the two types of computers without wasting precious coherence time. To solve this challenge, we propose, implement and benchmark our setup for Interpreted Quantum-Classical Computations (IQCCs), demonstrating its feasibility for trapped-ion quantum computers. For the second part of this thesis we focus on the development of quantum algorithms that make use of this setup. As a first application, we investigate quantum simulations of gauge theories. Such theories are prevalent throughout modern physics and are characterized by local constraints that the dynamics are subject to. Errors in noisy simulations of such theories results in these constraints being violated and the simulations becoming unphysical. We show that this problem can be remedied by measuring gauge operators, decoding possible errors on a classical computer and actively correcting them, which reduces simulation errors. Additionally we interpret the scheme as a sympathetic cooling setup, which allows thermal control of the simulation. We finally turn to the task of preparing ground states of frustration-free Hamiltonians in quantum computers. Studying ground states of various systems is of paramount importance for solving optimization problems and understanding phenomena such as magnetism, superconductivity and superfluidity. We frame the ground-state preparation problem as an error correction problem, wherein energy is measured locally, measurements are decoded and corrections are applied to reduce the energy. In physically relevant examples we show up to exponentially improved runtimes over previous, similar algorithms and give a general run-time bound in terms of the Hamiltonian gap.
This thesis describes the design of a real-time control system for trapped ion quantum computer experiments. It is framed in the context of the QuantumIon project, a project at the University of Waterloo’s Institute for Quantum Computing that aims to provide a scalable, remote-operation ion trap for a wide variety of quantum research without the need for ‘expert’ ion-trap knowledge. The target users span the range of ion-trap researchers,algorithms researchers, performance benchmarking researchers, and quantum simulation researchers.The control system features a user programming language, remote access to a compiling server, a sub-nanosecond time sequencing engine, arbitrary waveform generation for pulse shaping, and fully adjustable internal parameters. This platform affords the user extraordinary flexibility for many research use cases without requiring physical access. High-speed precision timing is achieved through the use of FPGA technology, while internal consistency (necessary for usability by non-experts) is achieved through an abstraction layer approach. Supercomputing-grade network infrastructure is employed to meet the strict timing requirements. An extensive suite of calibration tools and results is available to monitor machine-dependent parameters of the experiment. A sophisticated symbolic algebra system is used to create powerful calculations of precision timing sequences. Extensive automation is employed to remove the need for physical access, thus providing quantum computing to a wide audience. Under this model even the lowest-level control is avail-able to support innovative new designs, while a “library” of pre-defined sequences is also available to leverage “best practice” gates for those wishing rapid results. Finally, the user language itself is designed to be portable, allowing bindings to current popular classical languages such as Matlab and Python, and can be expanded for use in quantum-specific languages such as Cirq, Quill, and QASM .Through this approach the control system for QuantumIon is a flexible, powerful, scalable, and robust platform that is expected to be in use for a long time
Abstract Effectively manipulating quantum computing (QC) hardware in the presence of imperfect devices and control systems is a central challenge in realizing useful quantum computers. Susceptibility to noise critically limits the performance and capabilities of today’s so-called noisy intermediate-scale quantum devices, as well as any future QC technologies. Fortunately, quantum control enables efficient execution of quantum logic operations and quantum algorithms with built-in robustness to errors, and without the need for complex logical encoding. In this manuscript we introduce software tools for the application and integration of quantum control in QC research, serving the needs of hardware R&D teams, algorithm developers, and end users. We provide an overview of a set of Python-based classical software tools for creating and deploying optimized quantum control solutions at various layers of the QC software stack. We describe a software architecture leveraging both high-performance distributed cloud computation and local custom integration into hardware systems, and explain how key functionality is integrable with other software packages and quantum programming languages. Our presentation includes a detailed mathematical overview of key features including a flexible optimization toolkit, engineering-inspired filter functions for analyzing noise susceptibility in high-dimensional Hilbert spaces, and new approaches to noise and hardware characterization. Pseudocode is presented in order to elucidate common programming workflows for these tasks, and performance benchmarking is reported for numerically intensive tasks, highlighting the benefits of the selected cloud-compute architecture. Finally, we present a series of case studies demonstrating the application of quantum control solutions derived from these tools in real experimental settings using both trapped-ion and superconducting quantum computer hardware.
The technology of Quantum Computing (QC) is continuously evolving, as researchers explore new technologies and the public gains access to quantum computers with an increasing number of qubits. In addition, the research community and industry are increasingly interested in the potential use, application, and contribution of QCs to large-scale problems in the real world as a result of this technological enhancement. QCs operations are based on quantum mechanics, and their special properties are mainly exploited to solve computationally intensive problems in polynomial time, problems that are commonly unsolvable, even by High-Performance Computing systems (HPCs) in a feasible time. However, since QCs cannot perform as general-purpose computing machines, alternative computational approaches aiming to boost further their enormous computing abilities are requested, and their combination as an additional computing resource to HPC systems is considered as one of the most promising ones. In the proposed hybrid HPCs, the Quantum Processing Units (QPUs), similar to GPUs and CPUs, target specific problems that, through Quantum Algorithms, can exploit quantum properties like quantum entanglement and superposition to achieve substantial performance gains from the HPC point of view. This interconnection between classical HPC systems and QCs towards the creation of Hybrid Quantum-Classical computing systems is neither straightforward nor standardized while crucial for unlocking the real potential of QCs and achieving real performance improvements. The interconnection between the classical and quantum systems can be performed in the hardware, software (system), or application layer. In this study, a concise overview of the existing architectures for the interconnection interface between HPCs and QCs is provided, focusing mainly on hardware approaches that enable effective hybrid quantum-classical operation.
Python is a popular programming language known for its flexibility, usability, readability, and focus on developer productivity. The quantum software community has adopted Python on a number of large-scale efforts due to these characteristics, as well as the remote nature of near-term quantum processors. The use of Python has enabled quick prototyping for quantum code that directly benefits pertinent research and development efforts in quantum scientific computing. However, this rapid prototyping ability comes at the cost of future performant integration for tightly coupled CPU-QPU architectures with fast-feedback. Here, we present a language extension to Python that enables heterogeneous quantum-classical computing via a robust C++ infrastructure for quantum just-in-time (QJIT) compilation. Our work builds off the QCOR C++ language extension and compiler infrastructure to enable a single-source, quantum hardware-agnostic approach to quantum-classical computing that retains the performance required for tightly coupled CPU-QPU compute models. We detail this Python extension, its programming model and underlying software architecture, and provide a robust set of examples to demonstrate the utility of our approach.
The use of mid-circuit measurement and qubit reset within quantum programs has been introduced recently and several applications demonstrated that perform conditional branching based on these measurements. In this work, we go a step further and describe a next-generation implementation of classical computation embedded within quantum programs that enables the real-time calculation and adjustment of program variables based on the mid-circuit state of measured qubits. A full-featured Quantum Intermediate Representation (QIR) model is used to describe the quantum circuit including its embedded classical computation. This integrated approach eliminates the need to evaluate and store a potentially prohibitive volume of classical data within the quantum program in order to explore multiple solution paths. It enables a new type of quantum algorithm that requires fewer round-trips between an external classical driver program and the execution of the quantum program, significantly reducing computational latency, as much of the classical computation can be performed during the coherence time of quantum program execution. We review practical challenges to implementing this approach along with developments underway to address these challenges. An implementation of this novel and powerful quantum programming pattern, a random walk phase estimation algorithm, is demonstrated on a physical quantum computer with an analysis of its benefits and feasibility as compared to existing quantum computing methods.