We introduce Yao , an extensible, efficient open-source framework for quantum algorithm design. Yao features generic and differentiable programming of quantum circuits. It achieves state-of-the-art performance in simulating small to intermediate-sized quantum circuits that are relevant to near-term applications. We introduce the design principles and critical techniques behind Yao . These include the quantum block intermediate representation of quantum circuits, a builtin automatic differentiation engine optimized for reversible computing, and batched quantum registers with GPU acceleration. The extensibility and efficiency of Yao help boost innovation in quantum algorithm design.
We introduce Yao , an extensible, efficient open-source framework for quantum algorithm design. Yao features generic and differentiable programming of quantum circuits. It achieves state-of-the-art performance in simulating small to intermediate-sized quantum circuits that are relevant to near-term applications. We introduce the design principles and critical techniques behind Yao . These include the quantum block intermediate representation of quantum circuits, a builtin automatic differentiation engine optimized for reversible computing, and batched quantum registers with GPU acceleration. The extensibility and efficiency of Yao help boost innovation in quantum algorithm design.
We present Q u a n t u m T o o l b o x . j l , an open-source Julia package for simulating open quantum systems. Designed with a syntax familiar to users of Q u T i P (Quantum Toolbox in Python), it harnesses Julia's high-performance ecosystem to deliver fast and scalable simulations. The package includes a suite of time-evolution solvers supporting distributed computing and GPU acceleration, enabling efficient simulation of large-scale quantum systems. We also show how Q u a n t u m T o o l b o x . j l can integrate with automatic differentiation tools, making it well-suited for gradient-based optimization tasks such as quantum optimal control. Benchmark comparisons demonstrate substantial performance gains over existing frameworks. With its flexible design and computational efficiency, Q u a n t u m T o o l b o x . j l serves as a powerful tool for both theoretical studies and practical applications in quantum science.
This paper presents a novel approach to simulating quantum circuits with differentiability, enabling gradient-based optimization for quantum algorithms. The core of the method lies in combining the accuracy of quantum circuit Monte Carlo simulation with the efficiency of automatic differentiation. We introduce a framework where the quantum circuit's evolution is simulated using Monte Carlo techniques, and the resulting expectation values are computed using automatic differentiation. This allows us to calculate gradients with respect to the circuit's parameters, which can then be used with standard optimization algorithms to refine the circuit's design. The key innovation is the seamless integration of these two techniques, offering a pathway to directly optimize quantum circuits for improved performance. The presented methodology provides a foundation for exploring advanced quantum algorithms and improving their efficiency through gradient-based approaches.
Quantum simulation plays a critical role in advancing our understanding and development of quantum algorithms, quantum computing hardware, and quantum information science. Despite the availability of various quantum circuit simulators, they often face challenges in terms of maintainability and extensibility. In this paper, we introduce Lightweight Functional Quantum Simulator (LFQS), a compilation-based framework that addresses these issues by leveraging an intermediate language to synthesize efficient quantum simulators in C and CUDA. The intermediate language exploits the underlying structured sparsity behind the matrix representation of quantum gates. Our framework generates efficient code for multi-core CPUs and GPUs and outperforms state-of-the-art simulators, such as Qiskit, Catalyst, and QuEST, as well as a representative of dense tensor frameworks, NumPy, in both micro-benchmark and macro-benchmark circuits.
The design of efficient quantum algorithms frequently relies on intuitive heuristics and extensive trial-and-error processes. This research proposes a novel dynamic programming (DP) framework to systematically explore the vast space of potential quantum circuits, aiming to optimize both circuit structure and gate sequences based on computational cost and expected fidelity. The framework utilizes a bottom-up approach, building solutions from smaller subproblems, leveraging previously computed results to avoid redundant calculations. This approach contrasts with traditional, often ad-hoc, methods for quantum algorithm design. The core contribution lies in formally applying dynamic programming to this problem, providing a structured methodology for algorithm development that can potentially reduce the reliance on guesswork and accelerate the discovery of optimal quantum solutions. The presented framework incorporates key elements such as state representation, transition functions, and optimal substructure assumptions to guarantee efficiency and accuracy. This paper outlines the framework, its underlying principles, and potential applications within the broader field of quantum algorithm design.
As quantum circuits grow beyond small toy examples, preparing them for execution on physical devices becomes increasingly complex. Design automation is therefore essential for scalable quantum computing: Compilation procedures optimize resource requirements and transform circuits to a format compatible with specific hardware; resource estimation evaluates execution cost; verification methods prove circuit correctness. However, these concepts present a steep learning curve for novices, particularly when quantum circuits are introduced through low-level textual representations. To address this, we present a block-based programming framework for quantum design automation, implemented as an extension to the Scratch programming platform. This system allows users to build quantum circuits as a sequence of blocks and embed them in classical control logic to perform evaluations, compare simulation results, and directly apply different design automation techniques. We evaluated the approach in a user study with computer science students, who completed guided exercises using the platform and provided structured feedback in the form of self-reports and short knowledge assessments. Results demonstrate strong understanding and confidence in quantum design automation concepts, suggesting that the block-based approach successfully lowers the entry barrier to quantum design automation. The implemented framework is open-source and available at https://github.com/munich-quantum-toolkit/scratch-quantum.
We present the NVIDIA cuQuantum SDK [1], a state-of-the-art library of composable primitives for GPU-accelerated quantum circuit simulations. As the size of quantum devices continues to increase, making their classical simulation progressively more difficult, the availability of fast and scalable quantum circuit simulators becomes vital for quantum algorithm developers, as well as quantum hardware engineers focused on the validation and optimization of quantum devices. The cuQuantum SDK was created to accelerate and scale up quantum circuit simulators developed by the quantum information science community by enabling them to utilize efficient scalable software building blocks optimized for NVIDIA GPU-based platforms. The functional building blocks provided cover the needs of both state vector- and tensor network- based simulators, including approximate tensor network simulation methods based on matrix product state, projected entangled pair state, and other factorized tensor representations. By leveraging the enormous computing power of the latest NVIDIA GPU architectures, quantum circuit simulators that have adopted the cuQuantum SDK demonstrate significant acceleration, compared to CPU-only execution, for both the state vector and tensor network simulation methods. Furthermore, by utilizing the parallel primitives available in the cuQuantum SDK, one can easily transition to distributed GPU-accelerated platforms, including those furnished by cloud service providers and high-performance computing systems deployed by supercomputing centers, extending the scale of possible quantum circuit simulations. The rich capabilities provided by the cuQuantum SDK are conveniently made available via both Python and C application programming interfaces, where the former is directly targeting a broad Python quantum community and the latter allows tight integration with simulators written in any programming language.