Quantum Software Ecosystem Design

Abstract

The rapid advancements in quantum computing necessitate a scientific and rigorous approach to the construction of a corresponding software ecosystem, a topic underexplored and primed for systematic investigation. This chapter takes an important step in this direction: It presents scientific considerations essential for building a quantum software ecosystem that makes quantum computing available for scientific and industrial problem solving. Central to this discourse is the concept of hardware-software co-design, which fosters a bidirectional feedback loop from the application layer at the top of the software stack down to the hardware. This approach begins with compilers and low-level software that are specifically designed to align with the unique specifications and constraints of the quantum processor, proceeds with algorithms developed with a clear understanding of underlying hardware and computational model features, and extends to applications that effectively leverage the capabilities to achieve a quantum advantage. We analyze the ecosystem from two critical perspectives: the conceptual view, focusing on theoretical foundations, and the technical infrastructure, addressing practical implementations around real quantum devices necessary for a functional ecosystem. This approach ensures that the focus is towards promising applications with optimized algorithm-circuit synergy, while ensuring a user-friendly design, an effective data management and an overall orchestration. Our chapter thus offers a guide to the essential concepts and practical strategies necessary for developing a scientifically grounded quantum software ecosystem.

References in corpus (90)

• Quantum Computing in the NISQ era and beyond
• Supplementary information for "Quantum supremacy using a programmable superconducting processor"
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Mixed State Entanglement and Quantum Error Correction
• Quantum Machine Learning
• A variational eigenvalue solver on a quantum processor
• Charge insensitive qubit design derived from the Cooper pair box
• Quantum algorithm for solving linear systems of equations
• Variational Quantum Algorithms
• The Physical Implementation of Quantum Computation
• Quantum Annealing in the Transverse Ising Model
• Quantum support vector machine for big data classification
• A Quantum Approximate Optimization Algorithm
• Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance
• Manipulating the Quantum State of an Electrical Circuit
• Dynamical suppression of decoherence in two-state quantum systems
• Adiabatic Quantum Computing
• Quantum random walks - an introductory overview
• Error mitigation for short-depth quantum circuits
• Multiple Particle Interference and Quantum Error Correction
• Quantum Computation and Decision Trees
• Environment-Assisted Quantum Walks in Photosynthetic Energy Transfer
• Quantum computing with trapped ions
• Measurement-based quantum computation
• Quantum algorithms: an overview
• The Variational Quantum Eigensolver: a review of methods and best practices
• Universal computation by quantum walk
• A Theory of Fault-Tolerant Quantum Computation
• Simple pulses for elimination of leakage in weakly nonlinear qubits
• Resource-efficient linear optical quantum computation
• Coherent manipulation of electronic states in a double quantum dot
• Large Scale Modular Quantum Computer Architecture with Atomic Memory and Photonic Interconnects
• The European Quantum Technologies Roadmap
• A meet-in-the-middle algorithm for fast synthesis of depth-optimal quantum circuits
• Variational ansatz-based quantum simulation of imaginary time evolution
• Quantum Computation by Adiabatic Evolution
• Universal quantum computation using the discrete time quantum walk
• Quantum Process Tomography: Resource Analysis of Different Strategies
• Quantum Error Correction: An Introductory Guide
• Resource-Aware Quantum Programming with General Recursion and Quantum Control
• Decoherence-Free Subspaces and Subsystems
• Blueprint for a microwave trapped-ion quantum computer
• A practical heuristic for finding graph minors
• Q#: Enabling scalable quantum computing and development with a high-level domain-specific language
• Automated optimization of large quantum circuits with continuous parameters
• Experimental quantum speed-up in reinforcement learning agents
• How Powerful is Adiabatic Quantum Computation?
• Quantum State Preparation with Optimal Circuit Depth: Implementations and Applications
• Verification of quantum computation: An overview of existing approaches
• An Introduction to Quantum Error Correction and Fault-Tolerant Quantum Computation
• Quantum Annealing Applied to De-Conflicting Optimal Trajectories for Air Traffic Management
• Randomized Benchmarking of Multi-Qubit Gates
• Quantum stochastic walks: A generalization of classical random walks and quantum walks
• Efficient estimation of Pauli channels
• Life after charge noise: recent results with transmon qubits
• Classification and characterization of nonequilibrium Higgs modes in unconventional superconductors
• An Experimental Study of Shor's Factoring Algorithm on IBM Q
• Demonstration of Shor's factoring algorithm for N=21 on IBM quantum processors
• Two-dimensional cluster-state preparation with linear ion traps
• Flight Gate Assignment with a Quantum Annealer
• Quantum walks on graphs representing the firing patterns of a quantum neural network
• Image Acquisition Planning for Earth Observation Satellites with a Quantum Annealer
• Digital Quantum Simulation of Non-Equilibrium Quantum Many-Body Systems
• Detecting superconductivity out-of-equilibrium
• Performance of a Quantum Annealer for Ising Ground State Computations on Chimera Graphs
• Perfect Quantum Error Correction Code
• Optimization of Lattice Surgery is NP-Hard
• Understanding domain-wall encoding theoretically and experimentally
• An application benchmark for fermionic quantum simulations
• Laser pulse driven control of charge and spin order in the two-dimensional Kondo lattice
• A Quantum von Neumann Architecture for Large-Scale Quantum Computing
• Mean-Field Approximate Optimization Algorithm
• A SAT Encoding for Optimal Clifford Circuit Synthesis
• Embedding of Complete Graphs in Broken Chimera Graphs
• Minor Embedding in Broken Chimera and Pegasus Graphs is NP-complete
• Efficient algorithms for the dynamics of large and infinite classical central spin models
• Multi-Particle Spectral Properties in the Transverse Field Ising Model by Continuous Unitary Transformations
• An LLVM-based C++ Compiler Toolchain for Variational Hybrid Quantum-Classical Algorithms and Quantum Accelerators
• Quantum computing Floquet energy spectra
• Arline Benchmarks: Automated Benchmarking Platform for Quantum Compilers
• SupermarQ: A Scalable Quantum Benchmark Suite
• Performance of the low-rank tensor-train SVD (TT-SVD) for large dense tensors on modern multi-core CPUs
• Proq: Projection-based Runtime Assertions for Debugging on a Quantum Computer
• Hybrid simplification rules for boundaries of quantum circuits
• Quantum Simulation of a Discrete-Time Quantum Stochastic Walk
• Bugs4Q: A Benchmark of Real Bugs for Quantum Programs
• QBugs: A Collection of Reproducible Bugs in Quantum Algorithms and a Supporting Infrastructure to Enable Controlled Quantum Software Testing and Debugging Experiments
• Towards Quantum Software Requirements Engineering
• Optimal Sufficient Requirements on the Embedded Ising Problem in Polynomial Time
• Coherent and non-unitary errors in ZZ-generated gates