Quantum-Classical-Quantum Workflow in Quantum-HPC Middleware with GPU Acceleration
Bibliographic record
Abstract
Achieving high-performance computation on quantum systems is challenging, requiring integration between quantum and classical computing resources. This study presents a distribution-aware Quantum-Classical-Quantum (QCQ) architecture that combines advanced quantum software frameworks with high-performance classical computing to improve quantum simulations for materials and condensed matter physics, including the prediction of quantum phase transitions. The architecture employs Variational Quantum Eigensolver (VQE) algorithms on Quantum Processing Units (QPUs) for efficient quantum state preparation, and Tensor Network states and Quantum Convolutional Neural Networks (QCNNs) on classical hardware for state classification. Utilizing the cuQuantum SDK and PennyLane's Lightning plugin, the QCQ architecture achieves up to tenfold increases in computational speed for complex phase transition classification tasks compared to traditional CPU-based methods, demonstrating 99.5% accuracy in predicting phase transitions in models like the transverse field Ising and XXZ systems. This framework integrates quantum algorithms, machine learning, and Quantum-HPC capabilities, offering transformative insights into the behavior of quantum systems across different scales. As quantum hardware continues to improve, the QCQ framework will play a crucial role in realizing the full potential of quantum computing by seamlessly integrating distributed quantum resources with state-of-the-art classical computing infrastructure.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.003 | 0.004 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.008 | 0.003 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".