Benchmarking the performance of quantum computing software for quantum circuit creation, manipulation and compilation
Not Available
Nation, Paul D. (ORCID:0000000200456118)↗
SEARCH · Engineering Papers
Results for “quantum compilation”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
ASDF: A Compiler for Qwerty, a Basis-Oriented Quantum Programming Language
Qwerty is a high-level quantum programming language built on bases and functions rather than circuits. This new paradigm introduces new challenges in compilation, namely synthesizing circuits from basis translations and automatically specializing adjoint or predicated forms of functions. This paper presents ASDF, an open-source compiler for Qwerty that answers these challenges in compiling basis-oriented languages. Enabled with a novel high-level quantum IR implemented in the MLIR framework, our compiler produces OpenQASM 3 or QIR for either simulation or execution on hardware. Our compiler is evaluated by comparing the fault-tolerant resource requirements of generated circuits with other compilers, finding that ASDF produces circuits with comparable cost to prior circuit-oriented compilers.
Adams, Austin J [Georgia Tech]↗
Blueprint for DOE Quantum Supercomputing: Ensuring U.S. Leadership in the Quantum Decade
Quantum computing stands at the threshold of a transformative decade, where the field will evolve from small-scale demonstrations toward practical scientific computing at scale. This Blueprint identifies fault-tolerant quantum computers (FTQCs) as a viable, scalable, and broadly applicable path to achieving “quantum scientific utility,” defined as solving scientifically valuable problems beyond the reach of conventional, classical computers. This capability is expected to show scientific demonstrations in the late 2020s and to mature in the early-to-mid 2030s. This Blueprint outlines a strategy to prepare the U.S. Department of Energy (DOE) for FTQCs and their integration into the U.S. national scientific computing infrastructure. Its purpose is to identify the steps, milestones, and research directions necessary for DOE to enable initial deployment of FTQCs in 2028 as a scientific tool for the nation and mature this capability into the 2030s. DOE has a long history of supporting quantum information science and technology, contributing significantly to research advancements, training a quantum-ready workforce, and providing access to early small-scale quantum hardware. Given recent demonstrations of logical operations on error-corrected logical qubits and the advancement of commercial hardware roadmaps, DOE should begin preparations for large-scale, fault-tolerant quantum computing deployment for DOE science missions. This Blueprint proposes that DOE focus on (1) deploying first-generation scientifically relevant quantum computers with at least 100 logical qubits and performing at least 10,000 to 100,000 hard logical operations in scientifically relevant calculations; (2) developing essential FTQC programming competencies, system software, and facility readiness; and (3) investing in cutting edge focused R&D that fosters breakthroughs in scientific applications, algorithms, and logical architectures needed to accelerate the advent of scientific utility. This effort will position DOE to transition to larger systems: production-scale quantum computers that comprise 1,000 to 10,000 logical qubits, perform 1 to 10 billion hard logical operations, and execute scientifically useful computations at scale. Achieving these goals will require DOE facilities to evolve with urgency to support scientific campaigns that integrate quantum and classical computing resources into efficient workflows, novel software and firmware environments for compiling and routing quantum programs on FTQC machines, and suitable infrastructure for quantum hardware. It will also require further development and optimization of scientific applications from the fields of materials science, quantum chemistry, and high-energy and nuclear physics. The Blueprint calls for transformative R&D and collective action to accelerate the advent of scientific quantum utility and bring it within reach by 2028.
97 MATHEMATICS AND COMPUTING↗
Leveraging Hamiltonian simulation techniques to compile operations on bosonic devices
Circuit quantum electrodynamics enables the combined use of qubits and oscillator modes. Despite a variety of available gate sets, many hybrid qubit-boson (i.e. qubit-oscillator) operations are realizable only through optimal control theory, which is oftentimes intractable and uninterpretable. We introduce an analytic approach with rigorously proven error bounds for realizing specific classes of operations via two matrix product formulas commonly used in Hamiltonian simulation, the Lie–Trotter–Suzuki and Baker–Campbell–Hausdorff product formulas. We show how this technique can be used to realize a number of operations of interest, including polynomials of annihilation and creation operators, namely (a) p (a † ) q for integer p, q. We show examples of this paradigm including obtaining universal control within a subspace of the entire Fock space of an oscillator, state preparation of a fixed photon number in the cavity, simulation of the Jaynes–Cummings Hamiltonian, and simulation of the Hong-Ou-Mandel effect. This work demonstrates how techniques from Hamiltonian simulation can be applied to better control hybrid qubit-boson devices.
bosonic qubits↗
Resilience–runtime tradeoff relations for quantum algorithms
Abstract A leading approach to algorithm design aims to minimize the number of operations in an algorithm’s compilation. One intuitively expects that reducing the number of operations may decrease the chance of errors. This paradigm is particularly prevalent in quantum computing, where gates are hard to implement and noise rapidly decreases a quantum computer’s potential to outperform classical computers. Here, we find that minimizing the number of operations in a quantum algorithm can be counterproductive, leading to a noise sensitivity that induces errors when running the algorithm in non-ideal conditions. To show this, we develop a framework to characterize the resilience of an algorithm to perturbative noises (including coherent errors, dephasing, and depolarizing noise). Some compilations of an algorithm can be resilient against certain noise sources while being unstable against other noises. We condense these results into a tradeoff relation between an algorithm’s number of operations and its noise resilience. We also show how this framework can be leveraged to identify compilations of an algorithm that are better suited to withstand certain noises.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Revisions to Photochemical Data for Use in Atmospheric Modeling
Solar and stellar flux incident on an atmosphere can cause molecules to dissociate into highly reactive species and allows for photochemical processes to play a fundamental role in atmospheric chemistry. While models have tried to simulate such processes, they are extremely sensitive to photoabsorption cross-sections and quantum yields: two parameters that are important in determining the photodissociation rate, and hence the lifetime, of atmospheric compounds. Obtaining high-resolution and current data for these parameters is therefore highly desirable. Due to this, database and literature searches for high-quality cross-sections and quantum yields were performed and compiled for KINETICS, a Caltech/JPL Chemical Transport Model that can be used in modeling planetary atmospheres. Furthermore, photodissociation rates determined by running a Titan 1-D model were used to verify the completeness of these latest revisions.
Chemical Transport Model (CTM)↗
Thermodynamic Analysis of Boundary Layer Species During Ablation
The focus of this work is on carbon clusters, hydrocarbons and other carbonaceous species which are constituents of pyrolysis gases injected into the boundary layer. Some of these molecules are observed to have absorption spectra in the VUV and UV region that match the emission spectra of atomic nitrogen and oxygen. Hence, they can potentially absorb the radiation impinging on the heat shield. Accurate thermodynamic data is not available for many of these species over the relevant temperature range for reentry. The objective of this work is to determine the thermochemical properties of potential radiation absorbing molecules using accurate ab initio quantum chemistry calculations. We have compiled a database of formation enthalpies, anharmonic vibrational frequencies and rotational constants for the ground and low-lying excited electronic states of these carbonaceous species. Using these thermochemical properties, we compute equilibrium mole fractions and observe that the mole fractions of some species of interest are significant, thus they could affect the radiative heat flux. Furthermore, comparisons of the formation enthalpies and mole fractions are made with data from literature.
heatshields↗
Noise-aware circuit compilations for a continuously parameterized two-qubit gateset
State-of-the-art noisy-intermediate-scale quantum processors are currently implemented across a variety of hardware platforms, each with their own distinct gatesets. As such, circuit compilation should not only be aware of but also deeply connect to the native gateset and noise properties of each. Trapped-ion processors are one such platform that provides a gateset that can be continuously parameterized across both one- and two-qubit gates. Here we use the Quantum Scientific Computing Open User Testbed to study noise-aware compilations focused on continuously parameterized two-qubit 𝑍𝑍 gates (based on the Mølmer-Sørensen interaction) using $\scriptsize{SUPERSTAQ}$, a quantum software platform for hardware-aware circuit compiler optimizations. We discuss the realization of 𝑍𝑍 gates with arbitrary angle on the all-to-all connected trapped-ion system. Then we discuss a variety of different compiler optimizations that innately target these 𝑍𝑍 gates and their noise properties. These optimizations include moving from a restricted maximally entangling gateset to a continuously parameterized one, swap mirroring to further reduce the total entangling angle of the operations, focusing the heaviest 𝑍𝑍 angle participation on the best-performing gate pairs, and circuit approximation to remove the least impactful 𝑍𝑍 gates. We demonstrate these compilation approaches on the hardware with randomized quantum volume circuits, observing the potential to realize a larger quantum volume as a result of these optimizations. Using differing yet complementary analysis techniques, we observe the distinct improvements in system performance provided by these noise-aware compilations and study the role of stochastic and coherent error channels for each compilation choice.
Noise↗
Solovay-Kitaev Algorithm and Randomized Compilation Data Availability
This zipped folder contains simulation notebooks, simulated data, and experimental data from the QSCOUT trapped-ion device that were used in the publication "Solovay-Kitaev Algorithm and Randomized Compilation" (https://doi.org/10.1103/ll6m-dbl7). The raw data is in the form of measurement outcomes of simple tomographic quantum circuits that were executed on the QSCOUT device and simulated using JAQALPAQ. These data are used to create plots within the jupyter notebooks that were included in the publication.
Quantum benchmarking↗
A cross-platform execution engine for the quantum intermediate representation
Hybrid languages like the quantum intermediate representation (QIR) are essential for programming systems that mix quantum and conventional computing models, while execution of these programs is often deferred to a system-specific implementation. Here, we develop the QIR Execution Engine (QIR-EE) for parsing, interpreting, and executing QIR across multiple hardware platforms. QIR-EE uses LLVM to execute hybrid instructions specifying quantum programs and, by design, presents extension points that support customized runtime and hardware environments. We demonstrate an implementation that uses the XACC quantum hardware-accelerator library to dispatch prototypical quantum programs on different commercial quantum platforms and numerical simulators, and we validate execution of QIR-EE on IonQ, Quantinuum, and IBM hardware. Our results highlight the efficiency of hybrid executable architectures for handling mixed instructions, managing mixed data, and integrating with quantum computing frameworks to realize cross-platform execution.
LLVM↗
A time-parallel multiple-shooting method for large-scale quantum optimal control
Quantum optimal control plays a crucial role in quantum computing by providing the interface between compiler and hardware. Solving the optimal control problem is particularly challenging for multi-qubit gates, due to the exponential growth in computational complexity with the system's dimensionality and the deterioration of optimization convergence. To ameliorate the computational complexity of time-integration, this paper introduces a multiple-shooting approach in which the time domain is divided into multiple windows and the intermediate states at window boundaries are treated as additional optimization variables. Further, this enables parallel computation of state evolution across time-windows, significantly accelerating objective function and gradient evaluations. Since the initial state matrix in each window is only guaranteed to be unitary upon convergence of the optimization algorithm, the conventional gate trace infidelity is replaced by a generalized infidelity that is convex for non-unitary state matrices. Continuity of the state across window boundaries is enforced by equality constraints. A quadratic penalty optimization method is used to solve the constrained optimal control problem, and an efficient adjoint technique is employed to calculate the gradients in each iteration. We demonstrate the effectiveness of the proposed method through numerical experiments on quantum Fourier transform gates in systems with 2, 3, and 4 qubits, noting a speedup of 80x for evaluating the gradient in the 4-qubit case, highlighting the method's potential for optimizing control pulses in multi-qubit quantum systems.
71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
Pulse control of superconducting cavity-based qudits with a Fock-state basis
Fock-basis-encoding qudits allow quantum gates to operate on multiple qudit levels simultaneously. This capability is advantageous for applications involving complex local gate operations, such as the digital quantum simulation of non-Abelian gauge theories. However, compiling unitary operations to native qudit gates remains a challenging task, often requiring substantial computational resources. In this work, we theoretically investigate the direct pulse control of a superconducting radio-frequency cavity coupled to an ancilla transmon for gate synthesis. We will discuss the improvements and limitations applicable to high Fock states. This work paves the way toward more efficient and robust qudit-gate synthesis.
Li, Andy C.Y. [Fermilab] (ORCID:0000000345423739)↗
Pulse control of superconducting cavity-based qudits with a Fock-state basis
Fock-basis-encoding qudits allow quantum gates to operate on multiple qudit levels simultaneously. This capability is advantageous for applications involving complex local gate operations, such as the digital quantum simulation of non-Abelian gauge theories. However, compiling unitary operations to native qudit gates remains a challenging task, often requiring substantial computational resources. In this work, we theoretically investigate the direct pulse control of a superconducting radio-frequency cavity coupled to an ancilla transmon for gate synthesis. We will discuss the improvements and limitations applicable to high Fock states. This work paves the way toward more efficient and robust qudit-gate synthesis.
Li, Andy C.Y. [Fermilab] (ORCID:0000000345423739)↗
QAOA Tutorial Outline
In this tutorial we discuss the quantum alternating operator ansatz (QAOA), which is a variational algorithm that can be used for approximate optimization of combinatorial problems with soft and hard constraints.We go through the design of the quantum circuit and its actual implementation in real hardware, discussing compilation issues such as gate synthesis and scheduling of all the required gates and qubit-swapping overhead.
Venturelli, Davide↗
Dynamical Decoupling for Measuring and Suppressing Crosstalk
Dynamical decoupling (DD) is a noise-mitigating strategy in which sequences of pulses are applied to single qubits to average out their interaction with the environment. DD has been extensively studied and demonstrated for suppressing single-qubit decoherence and can be tailored for different noise spectrum. We report another important adaptation of DD where crosstalk between qubits are suppressed. We demonstrate the efficiency of this procedure on quantum circuits on superconducting transmon-based quantum devices. We designed a family of syncopated DD sequences that effectively suppress ZZ coupling between qubit pairs, which is the dominating crosstalk form on the device. We insert DD to a quantum circuit whenever single qubits are idle (often during two-qubits gates on other qubits). While standard periodic DD suppress crosstalk between these qubits and their neighbors, the syncopated DD further decouples crosstalk between these qubits. We further designed short sequences that maximize the application of DD without adding time to the quantum circuit execution. Such DD sequences yield significant improvement of the performance of the algorithm on the hardware. The performance is further boosted by combining DD with another mitigation strategy, randomized compilation. Our work demonstrated that syncopated DD is effective and practical way to suppress crosstalk in quantum circuits and serves as a great probe to characterize the crosstalk and inform hardware design.
Quantum Computing↗
A Quantum Volume Metric for Qudit Quantum Computers
Qudit-based quantum computers, such as the high-Q superconducting radio frequency resonator cavities being pursued by the SQMS Center hosted at Fermilab, may provide computational advantages relative to qubit-based machines for some problems. However, the novel system’s hardware and software will present different errors that must be understood and mitigated, along with other unforeseen inefficiencies across the entire stack. It is essential to benchmark these qudit platforms against existing systems. We propose such a benchmark by generalizing the qubit-based quantum volume metric to qudit devices. In particular, we show that the performance depends on the available gateset used to compile unitary operations, as well as realistic noise sources.
Quantum Computing↗
Recommended Nuclear Structure and Decay Data for A=206 Isobars
Here, evaluated nuclear structure and decay data for all nuclei with mass number A=206 ( 206 Pt, 206 Au, 206 Hg, 206 Tl, 206 Pb, 206 Bi, 206 Po, 206 At, 206 Rn, 206 Fr, 206 Ra and 206 Ac), are presented. All available experimental data are compiled and evaluated, and best values for level and γ-ray energies, quantum numbers, lifetimes, γ-ray intensities and transition probabilities, as well as other nuclear properties, are recommended. Inconsistencies and discrepancies that exist in the literature are discussed. A number of computer codes (https://www-nds.iaea.org/public/ensdf_pgm/) developed by members of the NSDD network were used during the evaluation process. This work supersedes the earlier evaluation by F.G. Kondev (2008Ko21), published in Nuclear Data Sheets 109, 1527 (2008).
Kondev, F. G. [Argonne National Laboratory (ANL), ↗
Shearing approach to gauge-invariant Trotterization
Universal quantum simulations of gauge field theories are exposed to the risk of gauge symmetry violations when it is not known how to compile the desired operations exactly using the available gate set. In this article, we show how time evolution can be compiled in an Abelian gauge theory—if only approximately—without compromising gauge invariance, by graphically motivating a block-diagonalization procedure. When gauge-invariant interactions are associated with a “spatial network” in the space of discrete quantum numbers, it is seen that cyclically shearing the spatial network converts simultaneous updates to many quantum numbers into conditional updates of a single quantum number; ultimately, this eliminates any need to pass through (and acquire overlap onto) unphysical intermediate configurations. Shearing is explicitly applied to gauge-matter and magnetic interactions of lattice quantum electrodynamics. The features that make shearing successful at preserving Abelian gauge symmetry may also be found in non-Abelian theories, bringing one closer to gauge-invariant simulations of quantum chromodynamics.
Gauge theories↗