pith. sign in

arxiv: 2406.17248 · v3 · pith:MPKNPQ2Pnew · submitted 2024-06-25 · 🪐 quant-ph

MindSpore Quantum: A User-Friendly, High-Performance, and AI-Compatible Quantum Computing Framework

classification 🪐 quant-ph
keywords quantumframeworkmindsporealgorithmscomputingefficiencyperformancedesign
0
0 comments X
read the original abstract

We introduce MindSpore Quantum, a pioneering hybrid quantum-classical framework with a primary focus on the design and implementation of noisy intermediate-scale quantum (NISQ) algorithms. Leveraging the robust support of MindSpore, an advanced open-source deep learning training/inference framework, MindSpore Quantum exhibits exceptional efficiency in the design and training of variational quantum algorithms on both CPU and GPU platforms, delivering remarkable performance. Furthermore, this framework places a strong emphasis on enhancing the operational efficiency of quantum algorithms when executed on real quantum hardware. This encompasses the development of algorithms for quantum circuit compilation and qubit mapping, crucial components for achieving optimal performance on quantum processors. In addition to the core framework, we introduce QuPack, a meticulously crafted quantum computing acceleration engine. QuPack significantly accelerates the simulation speed of MindSpore Quantum, particularly in variational quantum eigensolver (VQE), quantum approximate optimization algorithm (QAOA), and tensor network simulations, providing astonishing speed. This combination of cutting-edge technologies empowers researchers and practitioners to explore the frontiers of quantum computing with unprecedented efficiency and performance.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 7 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Local-Observable-Guided Generative Quantum Circuits for Degenerate Ground Spaces

    quant-ph 2026-05 unverdicted novelty 6.0

    Hybrid generative quantum circuits guided by local observable correlators sample diverse ensembles whose span reproduces degenerate ground spaces in Majumdar-Ghosh, AKLT, and XXZ models.

  2. Resource-efficient quantum approximate optimization algorithm via Bayesian optimization and maximum-probability evaluation

    quant-ph 2026-03 unverdicted novelty 6.0

    QAOA with max-probability bitstring cut value objective, Bayesian optimization, and dual-criteria adaptive shots matches conventional MaxCut quality while using fewer total measurements.

  3. DeepQuantum: A PyTorch-based Software Platform for Quantum Machine Learning and Photonic Quantum Computing

    quant-ph 2025-12 accept novelty 6.0

    DeepQuantum is a PyTorch platform that unifies quantum circuits, photonic quantum circuits, and measurement-based quantum computing in one open-source framework for hybrid models and variational algorithms.

  4. Large-scale Efficient Molecule Geometry Optimization with Hybrid Quantum-Classical Computing

    quant-ph 2025-09 unverdicted novelty 6.0

    A DMET-VQE co-optimization framework reduces qubit requirements and enables equilibrium geometry optimization for molecules up to the size of glycolic acid C2H4O3.

  5. QHap: Quantum-Inspired Haplotype Phasing

    q-bio.GN 2026-03 unverdicted novelty 5.0

    QHap accelerates haplotype phasing by recasting it as a Max-Cut problem solved via GPU-accelerated simulated bifurcation, achieving 4-20x speedups with zero switch error on MHC regions and scaling to chromosome level ...

  6. Geometric Preconditioning and Curriculum Optimization for Trainable Variational Quantum Regression

    cs.LG 2026-01 unverdicted novelty 5.0

    A hybrid variational quantum regression design with classical geometric preconditioning and curriculum optimization improves trainability over pure quantum models while remaining behind strong classical baselines.

  7. Digitized Counter-Diabatic Quantum Optimization for Bin Packing Problem

    quant-ph 2025-02 unverdicted novelty 4.0

    DC-QAOA with CD-mixer ansatz outperforms QAOA for 1d bin packing, showing robustness and high accuracy on a 10-item instance executed on IBM quantum hardware.