Computational chemistry is the leading application to demonstrate the advantage of quantum computing in the near term. However, large-scale simulation of chemical systems on quantum computers is currently hindered due to a mismatch between the computational resource needs of the program and those available in today’s technology. In this paper we argue that significant new optimizations can be discovered by co-designing the application, compiler, and hardware. We show that multiple optimization objectives can be coordinated through the key abstraction layer of Pauli strings, which are the basic building blocks of computational chemistry programs. In particular, we leverage Pauli strings to identify critical program components that can be used to compress program size with minimal loss of accuracy. We also leverage the structure of Pauli string simulation circuits to tailor a novel hardware architecture and compiler, leading to significant execution overhead reduction by up to 99%. While exploiting the high-level domain knowledge reveals significant optimization opportunities, our hardware/software framework is not tied to a particular program instance and can accommodate the full family of computational chemistry problems with such structure. We believe the co-design lessons of this study can be extended to other domains and hardware technologies to hasten the onset of quantum advantage.
Computational chemistry is the leading application to demonstrate the advantage of quantum computing in the near term. However, large-scale simulation of chemical systems on quantum computers is currently hindered due to a mismatch between the computational resource needs of the program and those available in today’s technology. In this paper we argue that significant new optimizations can be discovered by co-designing the application, compiler, and hardware. We show that multiple optimization objectives can be coordinated through the key abstraction layer of Pauli strings, which are the basic building blocks of computational chemistry programs. In particular, we leverage Pauli strings to identify critical program components that can be used to compress program size with minimal loss of accuracy. We also leverage the structure of Pauli string simulation circuits to tailor a novel hardware architecture and compiler, leading to significant execution overhead reduction by up to 99%. While exploiting the high-level domain knowledge reveals significant optimization opportunities, our hardware/software framework is not tied to a particular program instance and can accommodate the full family of computational chemistry problems with such structure. We believe the co-design lessons of this study can be extended to other domains and hardware technologies to hasten the onset of quantum advantage.
A quantum computing system naturally consists of two components, the software system and the hardware system. Quantum applications are programmed using the quantum software and then executed on the quantum hardware. However, the performance of existing quantum computing system is still limited. Solving a practical problem that is beyond the capability of classical computers on a quantum computer has not yet been demonstrated. In this review, we point out that the quantum software and hardware systems should be designed collaboratively to fully exploit the potential of quantum computing. We first review three related works, including one hardware-aware quantum compiler optimization, one application-aware quantum hardware architecture design flow, and one co-design approach for the emerging quantum computational chemistry. Then we discuss some potential future directions following the co-design principle.
Quantum computing is positioned to be a transformative technology to key areas of scientific interest such as quantum chemistry, material science, and cryptography. At a hardware level, recent years have seen broad progress in a variety of qubit modalities, however, error rates are still orders of magnitude higher than what is necessary for large-scale quantum programs. This gap in error rates motivates the use of quantum error correction (QEC) and the realization of fault-tolerant quantum computing (FTQC), yet today, although the theory of FTQC is promising, effectively connecting it to real devices poses significant challenges. In this dissertation we study opportunities for more efficient and scalable FTQC architectures through the co-design of quantum hardware and software. We first look at how unique hardware capabilities in quantum computers made from 2D arrays of optically trapped atoms can improve QEC performance. For computation, we study how longer-range interactions between atoms can enable a novel embedding of QEC blocks on physical qubits that improves logical-level connectivity. For memory, we study how mid-circuit movement of atoms can effectively implement higher encoding rate QEC codes, creating a qubit-efficient memory system. We next consider the performance impact of real-time classical systems in FTQC architectures, and explore the use of speculation to improve large-scale decoding systems. Finally, we study how software systems can be used to improve QEC designs. We consider the problem of QEC circuit optimization, and study an automated approach based on iterative optimization of performance-reducing subcircuits.
Traditional compiler optimization focuses on maximizing performance within the constraints of classical architectures. However, quantum computing presents a fundamentally different paradigm, demanding a new approach to software optimization. This paper proposes a hardware-aware compiler optimization technique, inspired by quantum computing principles, to bridge the gap between high-level programming languages and the specific characteristics of quantum hardware. The core idea is to translate high-level code into quantum circuits while explicitly considering factors like qubit connectivity, gate fidelity, and decoherence. This approach allows for optimization strategies tailored to the unique limitations and opportunities of quantum devices, potentially leading to significant performance improvements compared to generic quantum compilation methods. The compiler operates by analyzing the algorithmic complexity, identifying quantum-native operations, and strategically mapping them onto the available quantum hardware, thereby minimizing the impact of hardware constraints. This paper outlines the framework, key components, and potential optimizations within this hardware-aware compiler.
Quantum computing promises revolutionary advancements across various fields, but its practical realization hinges on overcoming significant challenges in algorithm execution. Traditional hardware-software co-design approaches for quantum computing often rely on pre-defined architectures and compilation strategies, which can be suboptimal for diverse quantum algorithms. This paper proposes an adaptive hardware-software co-design framework that dynamically adjusts the quantum computing system's configuration – encompassing both hardware architecture and software compilation – in response to the specific requirements of the algorithm being executed. The core claim is that optimized co-design is pivotal for efficient quantum algorithm execution. This framework leverages a dynamic optimization loop, continuously monitoring algorithm performance and adjusting parameters such as qubit connectivity, gate set selection, and compilation strategies. The system utilizes a mathematical model to represent the algorithm's computational demands and hardware capabilities, enabling real-time adaptation. This approach moves beyond static design methodologies, offering a pathway towards significantly improved performance and resource utilization in quantum computing systems. The framework's ability to adapt in real-time represents a crucial step towards unlocking the full potential of quantum algorithms.
Reliable quantum computing requires co-design across the full stack, including algorithm structure, compilation, and execution, rather than isolated optimization of any single layer. This talk presents a unified framework in which these layers are jointly optimized under realistic hardware constraints. Structure-aware compilation exploits algorithmic interaction graphs to reduce circuit depth; joint optimization across mapping, term ordering, and algorithm parameters yields significantly improved success probability; and execution-layer analysis reveals that error mitigation effectiveness depends critically on circuit symmetry and native gate choice. While demonstrated on superconducting quantum processors, the underlying co-design principles are potentially transferable across architectures. Building on this foundation, the talk highlights machine learning as the key enabler for closing the feedback loop: data-efficient, parameterized noise models learned directly from workload execution data achieve substantially improved predictive fidelity over vendor models without the overhead of dedicated characterization. These insights situate the co-design perspective within the emerging framework of quantum deep learning. In this broader setting, the talk also presents an operational definition, a unifying taxonomy, and a benchmarking protocol grounded in explicit resource contracts.
Quantum computing is poised to revolutionize computational paradigms by leveraging quantum mechanics principles such as superposition and entanglement.However, the full-scale deployment of quantum applications remains constrained by hardware limitations, including high error rates and quantum decoherence.Quantum Software Engineering (QSE) emerges as a critical field addressing these challenges by optimizing algorithm design, error mitigation, and compiler strategies to enhance fault tolerance.Algorithm design in QSE focuses on developing quantum algorithms that efficiently exploit quantum parallelism while minimizing resource overhead.Key advancements include quantum variational algorithms, hybrid quantum-classical frameworks, and novel quantum heuristics tailored for optimization and cryptographic problems.Error mitigation techniques play a pivotal role in extending quantum circuit reliability without requiring full quantum error correction.Methods such as zero-noise extrapolation, probabilistic error cancellation, and quantum embedding techniques help reduce computational inaccuracies.Additionally, compiler optimization ensures efficient quantum program execution by minimizing gate depth, optimizing qubit mapping, and leveraging noise-adaptive scheduling to enhance quantum hardware performance.This paper explores the synergy between these three pillars of QSE, analyzing their impact on improving the feasibility of fault-tolerant quantum computing.It also examines emerging trends, including AI-driven quantum compilers, adaptive error mitigation techniques, and hardware-aware quantum software development.By bridging the gap between theoretical advancements and practical implementations, QSE provides a structured approach to accelerating quantum computing adoption across domains such as cryptography, materials science, and artificial intelligence.The findings underscore the necessity of interdisciplinary collaboration in developing robust quantum software solutions that maximize computational efficiency while mitigating inherent quantum hardware limitations.