Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Quantum software”

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 37 records · Page 2

NISQ Benchmarking

Test suite of quantum algorithms for Noisy Intermediate Scale Quantum (NISQ) computers. The test suite includes benchmark-style code for quantum volume circuits (QV), fairness sampling circuits, quantum telecloning circuits, and other NISQ benchmark style algorithms on small problems (i.e., up to 100 qubits), such as Variational Quantum Eigensolver (VQE), Hamiltonian Simulation, and Grover unstructured search example circuits. These benchmark-style applications are implemented in quantum software packages, mostly IBM's QISKIT, but may include vendor-specific frameworks, such as PyQuil (for Rigetti) or Q\# for Microsoft, or CirQ (for Google) as the test suite grows with the vendor sample. The test suite also includes numerical simulation code for Quantum Alternating Operator Ansatz (QAOA) algorithms, VQE, Hamiltonian Simulation and search examples. Numerical simulation code simulates quantum computers on classical computers, which is only possible for small problem instances; the implementation framework of choice is typically within Python, using the numpy/scipy libraries as well as extensions to the Julia language.

Pelofske, Elijah↗

A promising intersection of excited‐state‐specific methods from quantum chemistry and quantum Monte Carlo

Abstract We present a discussion of recent progress in excited‐state‐specific quantum chemistry and quantum Monte Carlo alongside a demonstration of how a combination of methods from these two fields can offer reliably accurate excited state predictions across singly excited, doubly excited, and charge transfer states. Both of these fields have seen important advances supporting excited state simulation in recent years, including the introduction of more effective excited‐state‐specific optimization methods, improved handling of complicated wave function forms, and ways of explicitly balancing the quality of wave functions for ground and excited states. To emphasize the promise that exists at this intersection, we provide demonstrations using a combination of excited‐state‐specific complete active space self‐consistent field theory, selected configuration interaction, and state‐specific variance minimization. These demonstrations show that combining excited‐state‐specific quantum chemistry and variational Monte Carlo can be more reliably accurate than either equation of motion coupled cluster theory or multi‐reference perturbation theory, and that it can offer new clarity in cases where existing high‐level methods do not agree. This article is categorized under: Electronic Structure Theory > Ab Initio Electronic Structure Methods Software > Quantum Chemistry

Otis, Leon↗

Alternative approach to quantum imaginary time evolution

There is increasing interest in quantum algorithms (QAs) that are based on the imaginary time evolution (ITE), a successful classical numerical approach to obtain ground states. However, most of the proposals so far require heavy postprocessing computational steps on a classical computer, such as solving linear equations. Here we provide an alternative approach to implement ITE. A key feature in our approach is the use of an orthogonal basis set: the propagated state is efficiently expressed in terms of orthogonal basis states at every step of the evolution. We argue that the number of basis states needed at those steps to achieve an accurate solution can be kept on the order of n , the number of qubits, by controlling the precision (number of significant digits) and the imaginary time increment. The number of quantum gates per imaginary time step is estimated to be polynomial in n . Additionally, while in many QAs the locality of the Hamiltonian is a key assumption, in our algorithm this restriction is not required. This characteristic of our algorithm renders it useful for studying highly nonlocal systems, such as the occupation-representation nuclear shell model. Here, we illustrate our algorithm through numerical implementation on an IBM quantum simulator.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Topology-aware task-assIGnment mappER (TIGER) v0.1

The general topology-aware task assignment problem is an NP-complete graph isomorphism problem. Existing task scheduling approaches are either heuristic or based on physical optimization algorithms, providing different speed and solution quality trade-offs. Physical Ising machines such as quantum and digital annealers have recently become available offering an alternative hardware solution to solve certain types of optimization problems. We propose an algorithm that allows expressing the problem in the compatible format. We present a domain specific partition strategy that enables to execute larger scale problems. TIGER - topology-aware task assignment mapper tool - implements the proposed algorithm and automatically integrates task- communication graph and an architecture graph into the quantum software environment.

Donofrio, David↗

XACC: a system-level software infrastructure for heterogeneous quantum–classical computing

Quantum programming techniques and software have advanced significantly over the past five years, with a majority focusing on high-level language frameworks targeting remote REST library APIs. As quantum computing architectures advance and become more widely available, lower-level, system software infrastructures will be needed to enable tighter, co-processor programming and access models. In this work, we present XACC, a system-level software infrastructure for quantum–classical computing that promotes a service-oriented architecture to expose interfaces for core quantum programming, compilation, and execution tasks. Additionally, we detail XACC's interfaces, their interactions, and its implementation as a hardware-agnostic framework for both near-term and future quantum–classical architectures. We provide concrete examples demonstrating the utility of this framework with paradigmatic tasks. Our approach lays the foundation for the development of compilers, associated runtimes, and low-level system tools tightly integrating quantum and classical workflows.

97 MATHEMATICS AND COMPUTING↗

PySpawn: Software for Nonadiabatic Quantum Molecular Dynamics

The ab initio multiple spawning (AIMS) method enables nonadiabatic quantum molecular dynamics simulations in an arbitrary number of dimensions, with potential energy surfaces provided by electronic structure calculations performed on-the-fly. However, the intricacy of the AIMS algorithm complicates software development, deployment on modern shared computer resources, and post-simulation data analysis. PySpawn is a nonadiabatic molecular dynamics software package that addresses these issues. Here, the program is designed to be easily interfaced with electronic structure software, and an interface to the TeraChem software package is described here. PySpawn introduces a task-based reorganization of the AIMS algorithm, allowing fine-grained restart capability and setting the stage for efficient parallelization in a future release. PySpawn includes a user-friendly and interactive Python analysis module that will enable novice users to painlessly adopt AIMS. As a demonstration of PySpawn’s simulation capability and analysis module, we report complete active space self-consistent field–based AIMS simulations of the 1,2- dithienyl-1,2-dicyanoethene molecule, a promising molecular photoswitch.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Introduction to the Special Issue on Software Tools for Quantum Computing: Part 1

Quantum computing is emerging as a remarkable technology that offers the possibility of achieving major scientific breakthroughs in many areas. Here, by leveraging the unique features of quantum mechanics, quantum computers may be instrumental in advancing many areas, including science, energy, defense, medicine, and finance. This includes solving complex problems whose solution lies well beyond the capacity of contemporary and even future supercomputers that are based on conventional computing technologies. As a foundation for future generations of computing and information processing, quantum computing represents an exciting area for developing new ideas in computer science and computational engineering.

97 MATHEMATICS AND COMPUTING↗

Introduction to the Special Issue on Software Tools for Quantum Computing: Part 2

Quantum computing is emerging as a remarkable technology that offers the possibility of achieving major scientific breakthroughs in many areas. By leveraging the unique features of quantum mechanics, quantum computers may be instrumental in advancing many areas, including science, energy, defense, medicine, and finance. This includes solving complex problems whose solution lies well beyond the capacity of contemporary and even future supercomputers that are based on conventional computing technologies. As a foundation for future generations of computing and information processing, quantum computing represents an exciting area for developing new ideas in computer science and computational engineering.

97 MATHEMATICS AND COMPUTING↗

A Reference Implementation for a Quantum Message Passing Interface

Practical applications of quantum computing are currently limited by the number of qubits that can be set with reasonable fidelities for each system. Therefore, a distributed quantum computing system with multiple quantum computers coherently connected is highly demanding. To realize the internode communication of quantum information, the software interface, Quantum Message Passing Interface (QMPI), leveraging the framework built for classical MPI but taking advantage of quantum teleportation to communicate between different quantum nodes was proposed. In this project, we develop the QMPI with point-to-point and collective operations in Qiskit and characterize its performance by demonstrating the application implementations. Moreover, we developed a new technique for optimizing collective communication of the distributed quantum programs with Multi-Controlled Toffoli gates. This technique beats the state-of-the-art in terms of fidelity and the number of remote EPR pairs consumed in both simulations and experiments.

Shi, Yue↗

QuCLEAR

SF-25-008 This software optimizes quantum circuits using a two-step process. The first step, Clifford Extraction, moves the Clifford gates to the end of the circuit and includes circuit optimizations. The second step, Clifford Absorption, then addresses these extracted gates on a classical computer. By reducing the number of gates that need to run on the quantum device, the software achieves a significantly lower gate count.

LIU, JI [Argonne National Laboratory (ANL), Argonn↗

A Perspective on Sustainable Computational Chemistry Software Development and Integration

The power of quantum chemistry to predict the ground and excited state properties of complex chemical systems has driven the development of computational quantum chemistry software, integrating advances in theory, applied mathematics, and computer science. The emergence of new computational paradigms associated with exascale technologies also poses significant challenges that require a flexible forward strategy to take full advantage of existing and forthcoming computational resources. In this context, the sustainability and interoperability of computational chemistry software development are among the most pressing issues. In this perspective, we discuss software infrastructure needs and investments with an eye to fully utilize exascale resources and provide unique computational tools for next-generation science problems and scientific discoveries.

36 MATERIALS SCIENCE↗

Quantum Chemistry Common Driver and Databases (QCDB) and Quantum Chemistry Engine (QCEngine): Automation and interoperability among computational chemistry programs

We report that community efforts in the computational molecular sciences (CMS) are evolving toward modular, open, and interoperable interfaces that work with existing community codes to provide more functionality and composability than could be achieved with a single program. The Quantum Chemistry Common Driver and Databases (QCDB) project provides such capability through an application programming interface (API) that facilitates interoperability across multiple quantum chemistry software packages. In tandem with the Molecular Sciences Software Institute and their Quantum Chemistry Archive ecosystem, the unique functionalities of several CMS programs are integrated, including CFOUR, GAMESS, NWChem, OpenMM, Psi4, Qcore, TeraChem, and Turbomole, to provide common computational functions, i.e., energy, gradient, and Hessian computations as well as molecular properties such as atomic charges and vibrational frequency analysis. Both standard users and power users benefit from adopting these APIs as they lower the language barrier of input styles and enable a standard layout of variables and data. These designs allow end-to-end interoperable programming of complex computations and provide best practices options by default.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Review of Software for Designing and Operating Quantum Networks

Quantum networks development is crucial to realizing a production-grade network that can support distributed sensing, secure communication, and utility-scale quantum computation. However, the transition from laboratory demonstration to deployable networks requires software implementations of architectures and protocols tailored to the unique constraints of quantum systems. This paper reviews the current state of software implementations for quantum networks, organized around a three-plane abstraction of infrastructure, logical, and control/service planes. We cover software for both designing quantum network protocols (e.g., SeQUeNCe, QuISP, and NetSquid) and operating testbeds, with a focus on essential control/service plane functions such as entanglement, topology, and resource management, in a proposed taxonomy. Our review highlights a persistent gap between theoretical architecture and protocol proposals and their realization in simulators or testbeds, particularly in dynamic topology and network management. We conclude by outlining open challenges and proposing a roadmap for developing scalable software architectures to enable hybrid, large-scale quantum networks.

Network Design↗