Cited by 40Quantum Computing Algorithms and ArchitectureQuantum many-body systemsQuantum Information and Cryptography

Quantum-train: Rethinking hybrid quantum-classical machine learning in the model compression perspective

Open access
Liu, Chen-Yu, Kuo, En-Jui, Abraham Lin, Chu-Hsuan, Gemsun Young, Jason, Chang, Yeong-Jar, Hsieh, Min-Hsiu, Goan, Hsi-Sheng·2025·Quantum Machine Intelligence

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1007/s42484-025-00305-0

Cites

67 of 68 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • The QT framework reduces QNN parameters to O(polylog(M)) compared to M for classical NNs.

    “scaling down from M parameters in classical NNs to O ( polylog ( M )) by using QNNs [21].”
  • The QT framework has demonstrated effectiveness in image classification on MNIST and CIFAR-10, reinforcement learning, time-series forecasting for flood prediction, and federated learning.

    “QT has demonstrated its versatility and effectiveness in various applications, including image classification on datasets like MNIST and CIFAR-10 [21], [25], reinforcement learning [23], and time-series forecasting for flood prediction [24]. It further shows potential in federated learning by compressing models and maintaining performance while reducing computational overhead [22].”

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

8 of the 76 references couldn’t be matched to a known paper.

Research works printed but not linked: 19

  1. E.-J. Kuo, Y.-L. L. Fang, and S. Y.-C. Chen, Quan- tum architecture search via deep reinforcement learning (2021), arXiv:2104.07715 [quant-ph]. · arXiv
  2. E. Farhi and H. Neven, Classification with quan- tum neural networks on near term processors (2018), arXiv:1802.06002 [quant-ph]. · arXiv
  3. K.-C. Chen, X. Li, X. Xu, Y.-Y. Wang, and C.-Y. Liu, Multi-gpu-enabled hybrid quantum-classical workflow in quantum-hpc middleware: Applications in quantum sim- ulations (2024), arXiv:2403.05828 [quant-ph]. · arXiv
  4. I. Kerenidis and A. Prakash, Quantum recommendation systems (2016), arXiv:1603.08675 [quant-ph]. · arXiv
  5. J. Y.-C. Hu, D. Yang, D. Wu, C. Xu, B.-Y. Chen, and H. Liu, On sparse modern hopfield model (2023), arXiv:2309.12673 [cs.LG]. · arXiv
  6. Y. Du, M.-H. Hsieh, T. Liu, and D. Tao, A grover-search based quantum learning scheme for classification, New Journal of Physics 23, 023020 (2021). · DOI
  7. K. Zhang, M.-H. Hsieh, L. Liu, and D. Tao, To- ward trainability of quantum neural networks (2020), arXiv:2011.06258 [quant-ph]. · arXiv
  8. K. Zhang, L. Liu, M.-H. Hsieh, and D. Tao, Es- caping from the barren plateau via gaussian initial- izations in deep variational quantum circuits (2022), arXiv:2203.09376 [quant-ph]. · arXiv
  9. S. Chen, J. Cotler, H.-Y. Huang, and J. Li, The complex- ity of nisq (2022), arXiv:2210.07234 [quant-ph]. · arXiv
  10. N.-H. Chia, M.-H. Hsieh, S.-H. Hung, and E.-J. Kuo, Or- acle separation between noisy quantum polynomial time and the polynomial hierarchy (2024), arXiv:2405.07137 [quant-ph]. · arXiv
  11. V. Bergholm, J. Izaac, M. Schuld, C. Gogolin, S. Ahmed, V. Ajith, M. S. Alam, G. Alonso-Linaje, B. Akash- Narayanan, A. Asadi, J. M. Arrazola, U. Azad, S. Ban- ning, C. Blank, T. R. Bromley, B. A. Cordier, J. Ceroni, A. Delgado, O. D. Matteo, A. Dusko, T. Garg, D. Guala, A. Hayes, R. Hill, A. Ijaz, T. Isacsson, D. Ittah, S. Ja- hangiri, P. Jain, E. Jiang, A. Khandelwal, K. Kottmann, R. A. Lang, C. Lee, T. Loke, A. Lowe, K. McKiernan, J. J. Meyer, J. A. Montañez-Barrera, R. Moyard, Z. Niu, L. J. O'Riordan, S. Oud, A. Panigrahi, C.-Y. Park, D. Polatajko, N. Quesada, C. Roberts, N. Sá, I. Schoch, B. Shi, S. Shu, S. Sim, A. Singh, I. Strandberg, J. Soni, A. Száva, S. Thabet, R. A. Vargas-Hernández, T. Vin- cent, N. Vitucci, M. Weber, D. Wierichs, R. Wiersema, M. Willmann, V. Wong, S. Zhang, and N. Killoran, Pen- nylane: Automatic differentiation of hybrid quantum- classical computations (2022), arXiv:1811.04968 [quant- ph]. · arXiv
  12. P. Villalobos, J. Sevilla, T. Besiroglu, L. Heim, A. Ho, and M. Hobbhahn, Machine learning model sizes and the parameter gap (2022), arXiv:2207.02852 [cs.LG]. · arXiv
  13. D. Kingma and J. Ba, Adam: A method for stochas- tic optimization, in International Conference on Learning Representations (ICLR) (San Diega, CA, USA, 2015).
  14. H. Xiao, K. Rasul, and R. Vollgraf, Fashion-mnist: a novel image dataset for benchmarking machine learning algorithms (2017), arXiv:1708.07747 [cs.LG]. · arXiv
  15. J. Alman and Z. Song, The fine-grained complexity of gradient computation for training large language models (2024), arXiv:2402.04497 [cs.LG]. · arXiv
  16. J. Y.-C. Hu, T. Lin, Z. Song, and H. Liu, On computa- tional limits of modern hopfield models: A fine-grained complexity analysis (2024), arXiv:2402.04520 [cs.LG]. · arXiv
  17. J. Y.-C. Hu, M. Su, E.-J. Kuo, Z. Song, and H. Liu, Computational limits of low-rank adaptation (lora) for transformer-based models (2024), arXiv:2406.03136 [cs.LG]. · arXiv
  18. M. Boyer, G. Brassard, P. Høyer, and A. Tapp, Tight bounds on quantum searching, Fortschritte der Physik: Progress of Physics 46, 493 (1998).
  19. H. Buhrman, S. Patro, and F. Speelman, The quantum strong exponential-time hypothesis (2019), arXiv:1911.05686 [quant-ph]. · arXiv

Cited by

Sorted by citations

Authors
Liu, C.-Y., Kuo, E.-J., Abraham Lin, C.-H., Gemsun Young, J., Chang, Y.-J., Hsieh, M.-H., & Goan, H.-S.
Affiliations
  • National Taiwan University (TW)
  • National Yang Ming Chiao Tung University (TW)
  • Industrial Technology Research Institute (TW)
  • Foxconn (Taiwan) (TW)
Corresponding author
  • Liu, Chen-Yu
  • Goan, Hsi-Sheng
Venue
Quantum Machine Intelligence
Published
2025-08-05
Volume
7
Issue
2
ISSN
  • 2524-4906 (ISSN-L)
  • 2524-4914
OpenAlex
W4412956029
Cited by
40
References
76
Citations by year
2026: 19 · 2025: 17 · 2024: 4
FWCI
14.49
Type
journal article
Language
en
Open access
Locations
  • Quantum Machine Intelligence (publishedVersion)
  • arXiv (Cornell University) (submittedVersion, cc-by-nc-nd)
  • arXiv (Cornell University)
Funders
  • National Science and Technology Council (NSTC 113-2119-M-002 -021)
  • Air Force Office of Scientific Research (FA2386-20-1-4052)
  • National Taiwan University (NTU-CC-112L893404)
  • National Center for Theoretical Sciences (112-2124-M-002-003)
  • Industrial Technology Research Institute (EOSL 2022 project Quantum Circuit Design and Application)
  • Center for Advanced Computing and Imaging in Biomedicine (NTU-113L900702)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Computing Algorithms and Architecture
  • Physical Sciences › Physics and Astronomy › Atomic and Molecular Physics, and Optics › Quantum many-body systems
  • Physical Sciences › Computer Science › Artificial Intelligence › Quantum Information and Cryptography
Keywords
hybrid quantum-classical machine learning, quantum neural networks, model compression, parameter efficiency, LoRa, barren plateaus, quantum resource efficiency, quantum information encoding, noise robustness

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review