Reuse & Permissions

It is not necessary to obtain permission to reuse this article or its components as it is available under the terms of the Creative Commons Attribution 4.0 International license. This license permits unrestricted use, distribution, and reproduction in any medium, provided attribution to the author(s) and the published article's title, journal citation, and DOI are maintained. Please note that some figures may have been included with permission from other third parties. It is your responsibility to obtain the proper permission from the rights holder directly for these figures.

Export citation

Export citation

Choose format for download:

Download Citation
  • Open Access

Classical neural networks on quantum devices via tensor network disentanglers: A case study in image classification

Borja Aizpurua1,2,*, Sukhbinder Singh3, and Román Orús1,4,5

  • *Contact author: borja.aizpurua@multiversecomputing.com

Phys. Rev. Research 8, 023030 – Published 8 April, 2026

DOI: https://doi.org/10.1103/fmps-tjwy

Abstract

We address the problem of implementing bottleneck layers from classical pretrained neural networks on a quantum computer, with the goal of exploring intrinsically quantum ansatz for representing large linear layers within hybrid classical-quantum models. Our approach begins with a compression step in which the target linear layer is represented as an effective matrix product operator (MPO) without degrading model performance. The MPO is then further disentangled into a more compact form. This enables a hybrid classical-quantum execution scheme, where the disentangling circuits are deployed on a quantum computer while the remainder of the network—including the disentangled MPO—runs on classical hardware. We introduce two complementary algorithms for MPO disentangling: (1) an explicitly disentangling variational method leveraging standard tensor network optimization techniques and (2) an implicitly disentangling gradient-descent-based approach. We validate these methods through a proof-of-concept translation of simple classical neural networks for MNIST and CIFAR-10 image classification into a hybrid classical-quantum form.

View figure in article

Physics Subject Headings (PhySH)

Article Text

References (33)

  1. G. Acampora, A. Ambainis, N. Ares, L. Banchi, P. Bhardwaj, D. Binosi, G. A. D. Briggs, T. Calarco, V. Dunjko, J. Eisert, et al., Quantum computing and artificial intelligence: Status and perspectives, arXiv:2505.23860.
  2. A. Peruzzo, J. McClean, P. Shadbolt, M.-H. Yung, X.-Q. Zhou, P. J. Love, A. Aspuru-Guzik, and J. L. O’Brien, A variational eigenvalue solver on a photonic quantum processor, Nat. Commun. 5, 4213 (2014).
  3. J. Tilly, H. Chen, S. Cao, D. Picozzi, K. Setia, Y. Li, E. Grant, L. Wossnig, I. Rungger, G. H. Booth, and J. Tennyson, The variational quantum eigensolver: A review of methods and best practices, Phys. Rep. 986, 1 (2022).
  4. E. Farhi, J. Goldstone, and S. Gutmann, A quantum approximate optimization algorithm, arXiv:1411.4028.
  5. K. Blekos, D. Brand, A. Ceschini, C.-H. Chou, R.-H. Li, K. Pandya, and A. Summer, A review on quantum approximate optimization algorithm and its variants, Phys. Rep. 1068, 1 (2024).
  6. M. H. Amin, E. Andriyash, J. Rolfe, B. Kulchytskyy, and R. Melko, Quantum Boltzmann machine, Phys. Rev. X 8, 021050 (2018).
  7. V. Havlíček, A. D. Córcoles, K. Temme, A. W. Harrow, A. Kandala, J. M. Chow, and J. M. Gambetta, Supervised learning with quantum-enhanced feature spaces, Nature (London) 567, 209 (2019).
  8. A. Poggiali, A. Berti, A. Bernasconi, G. M. Del Corso, and R. Guidotti, Quantum clustering with k-means: A hybrid approach, Theor. Comput. Sci. 992, 114466 (2024).
  9. S. Lloyd, M. Mohseni, and P. Rebentrost, Quantum principal component analysis, Nat. Phys. 10, 631 (2014).
  10. A. W. Harrow, A. Hassidim, and S. Lloyd, Quantum algorithm for linear systems of equations, Phys. Rev. Lett. 103, 150502 (2009).
  11. J.-G. Liu and L. Wang, Differentiable learning of quantum circuit Born machines, Phys. Rev. A 98, 062324 (2018).
  12. Z. Holmes, K. Sharma, M. Cerezo, and P. J. Coles, Connecting ansatz expressibility to gradient magnitudes and barren plateaus, PRX Quantum 3, 010313 (2022).
  13. S. Sim, P. D. Johnson, and A. Aspuru-Guzik, Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms, Adv. Quantum Technol. 2, 1900070 (2019).
  14. J. Preskill, Quantum computing in the NISQ era and beyond, Quantum 2, 79 (2018).
  15. M. Cerezo, A. Arrasmith, R. Babbush, S. C. Benjamin, S. Endo, K. Fujii, J. R. McClean, K. Mitarai, X. Yuan, L. Cincio, et al., Variational quantum algorithms, Nat. Rev. Phys. 3, 625 (2021).
  16. J. R. McClean, S. Boixo, V. N. Smelyanskiy, R. Babbush, and H. Neven, Barren plateaus in quantum neural network training landscapes, Nat. Commun. 9, 4812 (2018).
  17. S.-J. Ran, Encoding of matrix product states into quantum circuits of one- and two-qubit gates, Phys. Rev. A 101, 032310 (2020).
  18. A. Novikov, D. Podoprikhin, A. Osokin, and D. P. Vetrov, Tensorizing neural networks, in Advances in Neural Information Processing Systems, edited by C. Cortes, N. D. Lawrence, D. D. Lee, M. Sugiyama, and R. Garnett (Curran Associates, Inc., Red Hook, NY, USA, 2015), Vol. 28.
  19. M. Wang, Y. Pan, Z. Xu, G. Li, X. Yang, D. Mandic, and A. Cichocki, Tensor networks meet neural networks: A survey and future perspectives, arXiv:2302.09019.
  20. A. Tomut, S. S. Jahromi, A. Sarkar, U. Kurt, S. Singh, F. Ishtiaq, C. Muñoz, P. S. Bajaj, A. Elborady, G. del Bimbo, et al., CompactifAI: Extreme compression of large language models using quantum-inspired tensor networks, arXiv:2401.14109.
  21. B. Aizpurua, S. S. Jahromi, S. Singh, and R. Orus, Quantum large language models via tensor network disentanglers, arXiv:2410.17397.
  22. L. Deng, The mnist database of handwritten digit images for machine learning research, IEEE Signal Process. Mag. 29, 141 (2012).
  23. Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, Gradient-based learning applied to document recognition, Proc. IEEE 86, 2278 (1998).
  24. A. Krizhevsky, Learning multiple layers of features from tiny images, Technical Report, University of Toronto (2009).
  25. M. A. Nielsen and I. L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2010).
  26. J. Jiang, J. Chen, N. Schuch, and D. Hangleiter, Positive bias makes tensor-network contraction tractable, in Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC 2025) (ACM, New York, 2025), pp. 471–482.
  27. G. Vidal, Entanglement renormalization, Phys. Rev. Lett. 99, 220405 (2007).
  28. G. Evenbly and G. Vidal, Algorithms for entanglement renormalization, Phys. Rev. B 79, 144108 (2009).
  29. S.-J. Ran, E. Tirrito, C. Peng, X. Chen, L. Tagliacozzo, G. Su, and M. Lewenstein, Tensor Network Contractions, Lecture Notes in Physics (Springer, Cham, 2020).
  30. J. Gray and G. K.-L. Chan, Hyperoptimized approximate contraction of tensor networks with arbitrary geometry, Phys. Rev. X 14, 011009 (2024).
  31. J. Chen, J. Jiang, D. Hangleiter, and N. Schuch, Sign problem in tensor-network contraction, PRX Quantum 6, 010312 (2025).
  32. https://docs.pytorch.org/tutorials/beginner/nn_tutorial.html.
  33. A. M. Saxe, J. L. McClelland, and S. Ganguli, Exact solutions to the nonlinear dynamics of learning in deep linear neural networks, arXiv:1312.6120.

Outline

Information

Sign In to Your Journals Account

Filter

Filter

Article Lookup

Enter a citation