Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “quantum circuits”

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.

At least 685 records · Page 38

Sampling on NISQ Devices: "Who’s the Fairest One of All?"

Modern NISQ devices are subject to a variety of biases and sources of noise that degrade the solution quality of computations carried out on these devices. A natural question that arises in the NISQ era, is how fairly do these devices sample ground state solutions. To this end, we run five fair sampling problems (each with at least three ground state solutions) that are based both on quantum annealing and, on the Grover Mixer, -QAOA algorithm for gate-based NISQ hardware. In particular, we use seven IBM Q devices, the Aspen-9 Rigetti device, the IonQ device, and three D-Wave quantum annealers. For each of the fair sampling problems, we measure the ground state probability, the relative fairness of the frequency of each ground state solution with respect to the other ground state solutions, and the aggregate error as given by each hardware provider. Overall, our results show that NISQ devices do not achieve fair sampling yet. Furthermore, we also observe differences in the software stack with a particular focus on compilation techniques that illustrate what work will still need to be done to achieve a seamless integration of frontend (i.e., quantum circuit description) and backend compilation.

Computer Science↗

A Game-Theoretic Quantum Algorithm for Solving Magic Squares

Variational quantum algorithms (VQAs) offer a promising near-term approach to finding optimal quantum strategies for playing non-local games. These games test quantum correlations beyond classical limits and enable entanglement verification. In this work, we present a variational framework for the Magic Square Game (MSG), a two-player non-local game with perfect quantum advantage. We construct a value Hamiltonian that encodes the game’s parity and consistency constraints, then optimize parameterize quantum circuits to minimize this cost. Our approach build on the stabilizer formalism, leverages commutation structure for circuit design, and is hardware-efficient. Compared to existing work, our contribution emphasizes algebraic structure an interpretability. We validate our method through numerical experiments and outline generalizations to larger games.

Chehade, Sarah [ORNL]↗

Temperature-dependent dielectric function of tantalum nitride formed by atomic layer deposition for tunnel barriers in Josephson junctions

Here, we report the dielectric functions of insulating tantalum nitride (TaN) films deposited by atomic layer deposition (ALD) on 300 mm Si/SiO 2 substrates to evaluate their suitability as tunnel barriers in tantalum-based Josephson junctions (JJs) for superconducting quantum circuits. Temperature-dependent ellipsometric angles were measured for ALD TaN films with nominal thicknesses of 13 and 25 nm at an incidence angle of 70°, over photon energy ranges of 0.03–0.7 eV (80–300 K) and 0.5–6.5 eV (80–600 K). These data were used to develop a dispersion model for insulating ALD TaN that incorporates a Tauc–Lorentz oscillator with an optical bandgap of 1.5–1.8 eV to describe interband transitions. The extracted dielectric function shows insulating behavior (mid-infrared transparency) at all temperatures and for both film thicknesses tested. In particular, ALD TaN does not exhibit infrared absorption due to free carriers, even at elevated temperatures, consistent with the insulating behavior required for a JJ tunnel barrier. Results from transmission electron microscopy (including selected area electron diffraction) and x-ray diffraction are also discussed. Sputter depth-profile x-ray photoelectron spectroscopy shows an N/Ta ratio of ∼1.2 throughout the film. The lower bandgap, low roughness, and thermal stability of ALD TaN compared to AlO x suggest the possibility of fabricating JJs with thicker barriers while achieving critical current densities required for qubits, enabling improved thickness and composition control, reduced topography, and resistance to aging.

36 MATERIALS SCIENCE↗

Probing critical phenomena in open quantum systems using atom arrays

At continuous phase transitions, quantum many-body systems exhibit complex, emergent behavior. Most notably, at a quantum critical point, correlations decay as a power law, with exponents determined by a set of universal scaling dimensions. Experimentally probing such power law correlations is extremely challenging, owing to the interplay between decoherence, the vanishing energy gap, and boundary effects. In this work, we used a Rydberg quantum simulator to adiabatically prepare critical ground states of both a one-dimensional ring and a two-dimensional square lattice. By accounting for and tuning the openness of our quantum system, which is well-captured by a single phenomenological length scale, we directly observed power law correlations and extracted the corresponding scaling dimensions. Our work complements recent studies of quantum criticality that use the Kibble-Zurek mechanism and digital quantum circuits.

Fang, Fang [Harvard Univ., Cambridge, MA (United S↗

Quantum Algorithm Implementations for Beginners

As quantum computers become available to the general public, the need has arisen to train a cohort of quantum programmers, many of whom have been developing classical computer programs for most of their careers. While currently available quantum computers have less than 100 qubits, quantum computing hardware is widely expected to grow in terms of qubit count, quality, and connectivity. This review aims at explaining the principles of quantum programming, which are quite different from classical programming, with straightforward algebra that makes understanding of the underlying fascinating quantum mechanical principles optional. We give an introduction to quantum computing algorithms and their implementation on real quantum hardware. We survey 20 different quantum algorithms, attempting to describe each in a succinct and self-contained fashion. We show how these algorithms can be implemented on IBM’s quantum computer, and in each case, we discuss the results of the implementation with respect to differences between the simulator and the actual hardware runs. This article introduces computer scientists, physicists, and engineers to quantum algorithms and provides a blueprint for their implementations.

97 MATHEMATICS AND COMPUTING↗

Dancing the Quantum Waltz: Compiling Three-Qubit Gates on Four Level Architectures

Superconducting quantum devices are a leading technology for quantum computation, but they face several challenges. Gate errors, coherence errors and a lack of connectivity all contribute to low fidelity results. In particular, connectivity restrictions enforce a gate set that requires three-qubit gates to be decomposed into one- or two-qubit gates. This substantially increases the number of two-qubit gates that need to be executed. However, many quantum devices have access to higher energy levels. We can expand the qubit abstraction of |0〉 and |1〉 to a ququart which has access to the |2〉 and |3〉 state, but with shorter coherence times. This allows for two qubits to be encoded in one ququart, enabling increased virtual connectivity between physical units from two adjacent qubits to four fully connected qubits. This connectivity scheme allows us to more efficiently execute three-qubit gates natively between two physical devices.We present direct-to-pulse implementations of several three-qubit gates, synthesized via optimal control, for compilation of three-qubit gates onto a superconducting-based architecture with access to four-level devices with the first experimental demonstration of four-level ququart gates designed through optimal control. We demonstrate strategies that temporarily use higher level states to perform Toffoli gates and always use higher level states to improve fidelities for quantum circuits. We find that these methods improve expected fidelities with increases of 2x across circuit sizes using intermediate encoding, and increases of 3x for fully-encoded ququart compilation.

Litteken, Andrew↗

Tensor Network Quantum Virtual Machine (TNQVM)

There is a lack of state-of-the-art quantum computing simulation software that scales on heterogeneous systems like Titan. Tensor Network Quantum Virtual Machine (TNQVM) provides a quantum simulator that leverages a distributed network of GPUs to simulate quantum circuits in a manner that leverages recent results from tensor network theory.

McCaskey, AlexanderJ.↗

Quantum Search Compiler (Qsearch) v2.0

Quantum Gate Synthesis is the process of taking a desired quantum gate operation, in this case specified as a unitary matrix, and decomposing it into a list of operations that can actually be performed on a quantum computer. Qsearch is an implementation of a quantum synthesis algorithm based on combining A* search with numerical optimization. It is designed to minimize CNOT count at the expense of having a long runtime. It produces particularly efficient quantum circuits in terms of CNOT count, up until about 4 qubits. It is generally impractical to run Qsearch on circuits with more than 4 qubits, but it can be used as a subroutine in algorithms designed to work with these larger circuits. Qsearch takes the form of a Python package, taking advantage of Numpy and Scipy, with part of the package written in Rust and taking advantage of OpenBLAS, NLOPT, and Google Ceres for faster runtime.

Lancu, Costin↗

QCLAB++ v0.1

QCLAB++ is a high-level C++ library of template headers for quantum gates and quantum circuits.

Van Beeumen, RoelMaria Franciscus↗

F3C++ v0.1

Fast Free Fermion Compiler (F3C) is an application-specific quantum circuit compiler for time-evolution circuits of spin Hamiltonian systems that can be mapped to free fermions.

Van Beeumen, RoelMaria Franciscus↗

F3C v0.1

Fast Free Fermion Compiler (F3C) is an application-specific quantum circuit compiler for time-evolution circuits of spin Hamiltonian systems that can be mapped to free fermions. F3C is the Matlab software version and the related F3C++ is the C++ software version.

Van Beeumen, RoelMaria Franciscus↗

Gauss Sum Strong Simulation v.0.1

Universal quantum circuits can be formulated in the Pauli measurement-based formalism as input T gate magic states, Clifford gates, and then multi-Pauli measurements. This code simulates single-Pauli measurements to show some theoretical bounds on the cost of full multi-Pauli measurements. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525. SAND2020-14080 O

SciDAC↗

QuanSimBench

QuanSimBench is a software program that performs a gate-by-gate simulation of a quantum computer with a full state vector formulation. It simulates a simplified version of Shor's algorithm with increasing number of qubits until resources are exhausted. The score (states/s) is how fast the Approximate Quantum Fourier Transform can be computed (the modular exponentiation is not timed). The goal is to quantify the ability of a computer to simulate ideal quantum circuits.

Pakin, Scott↗

FABLE v0.1

FABLE is a s light-weight software package for easy generation of quantum circuits that block encode arbitrary matrices.

Camps, Daan↗

NWQ-sim

NWQSim is a quantum circuit simulation environment developed at PNNL. It currently includes two major components: a state-vector simulator (SV-Sim) and a density matrix simulator (DM-Sim) and we may add more components, such as a Clifford simulator, in the future effort. NWQSim has two language interface: C/C++ and Python. It supports Q#/QDK frontend through QIR and QIR-runtime. It supports Qiskit and Cirq frontends through OpenQASM. NWQSim runs on several backends: Intel-CPU, Intel-Xeon-Phi, AMD-CPU, AMD-GPU, NVIDIA-GPU, and IBM-CPU. It supports three modes: (1) single processor, such as a single CPU (with and without AVX2 and AVX512 acceleration), a single NVIDIA GPU or a single AMD GPU; (2) single-node-multi-processors, such as multi-CPUs/Xeon-Phis, multi-NVIDA/AMD GPUs; (3) multi-nodes, such as a CPU cluster, a Xeon-Phi cluster (e.g., ANL Theta, NERSC Cori), an NVIDIA cluster (e.g., ORNL Summit, NERSC Perlmutter).

Li, Ang↗

OpenQudit v1.0

OpenQudit is a library that packages a quantum circuit representation using a domain-specific language for gates with a highly optimized simulator for very small circuits. No other package is well optimized for small circuits, which is something another DOE-packaged tool, BQSKit, will benefit from.

Younis, Ed↗

Active 2D materials for on-chip nanophotonics and quantum optics

Two-dimensional materials have emerged as promising candidates to augment existing optical networks for metrology, sensing, and telecommunication, both in the classical and quantum mechanical regimes. Here, we review the development of several on-chip photonic components ranging from electro-optic modulators, photodetectors, bolometers, and light sources that are essential building blocks for a fully integrated nanophotonic and quantum photonic circuit.

2D materials↗

Characterization and Optimization of Building Blocks for Specialized Computing Platforms

As noise limits the performance of quantum processors, the ability to characterize this noise and develop methods to overcome it is essential for the future of quantum computing. In this report, we develop a complete set of tools for improving quantum processor performance at the application level, including low-level physical models of quantum gates, a numerically efficient method of producing process matrices that span a wide range of model parameters, and full-channel quantum simulations. We then provide a few examples of how to use these tools to study the effects of noise on quantum circuits.

42 ENGINEERING↗