Generative machine learning with tensor networks: benchmarks on near-term quantum computers
Michael L. Wall, Matthew R. Abernathy, Gregory Quiroz

TL;DR
This paper develops tensor network-based quantum-assisted machine learning models optimized for near-term noisy quantum devices, demonstrating their design, compilation, and performance evaluation on benchmark and real datasets.
Contribution
It introduces a framework for designing and optimizing tensor network models for quantum hardware, including novel compilation heuristics and performance analysis methods.
Findings
Greedy heuristics outperform generic compilation methods in reducing entangling gates.
Benchmark problem effectively assesses MPS QAML model performance.
Hardware noise and topology significantly affect model accuracy and distribution inference.
Abstract
Noisy, intermediate-scale quantum (NISQ) computing devices have become an industrial reality in the last few years, and cloud-based interfaces to these devices are enabling exploration of near-term quantum computing on a range of problems. As NISQ devices are too noisy for many of the algorithms with a known quantum advantage, discovering impactful applications for near-term devices is the subject of intense research interest. We explore quantum-assisted machine learning (QAML) on NISQ devices through the perspective of tensor networks (TNs), which offer a robust platform for designing resource-efficient and expressive machine learning models to be dispatched on quantum devices. In particular, we lay out a framework for designing and optimizing TN-based QAML models using classical techniques, and then compiling these models to be run on quantum hardware, with demonstrations for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
