aiqbench analysis
This research proposes quantum-inspired tensor-network circuits specifically designed for image inpainting, leveraging diagonal quantum Fourier transform relaxations to achieve invertibility with reduced computational costs. By utilizing unconstrained gradient-based phase optimization, the method eliminates explicit coherence penalties and demonstrates superior performance over fixed transforms while requiring significantly fewer parameters than traditional unitary architectures. The approach represents a parameter-efficient advancement in machine learning models that draw structural inspiration from quantum mechanics without necessitating actual quantum hardware.
Quantum-Inspired Trainable and Parameter-Efficient Tensor Networks for Image Inpainting
arXiv:2609.17298v1 Announce Type: cross Abstract: This work introduces quantum-inspired tensor-network circuits as trainable transforms for image inpainting. Among the proposed architectures, the diagonal quantum Fourier transform (QFT) relaxation is invertible with $O(N^2 \log N)$ computational cost for $N\times N$ images, inherently preserving minimum coherence throughout training via its circuit structure and eliminating the need for explicit coherence penalties. Unconstrained gradient-based phase optimization (Riemannian-optimization free) enables efficient learning from randomly sampled training data, allowing the learned transform to generalize to test images observed through fixed sampling masks. Numerical tests show that the learned models outperform fixed transforms and per-image optimization while matching the performance of much larger unitary architectures, yet with far fewer parameters.
Abstract:This work introduces quantum-inspired tensor-network circuits as trainable transforms for image inpainting. Among the proposed architectures, the diagonal quantum Fourier transform (QFT) relaxation is invertible with $O(N^2 \log N)$ computational cost for $N\times N$ images, inherently preserving minimum coherence throughout training via its circuit structure and eliminating the need for explicit coherence penalties. Unconstrained gradient-based phase optimization (Riemannian-optimization free) enables efficient learning from randomly sampled training data, allowing the learned transform to generalize to test images observed through fixed sampling masks. Numerical tests show that the learned models outperform fixed transforms and per-image optimization while matching the performance of much larger unitary architectures, yet with far fewer parameters.
5 pages, 3 figures, 1 table. Submitted to ICASSP 2027
Image and Video Processing (eess.IV); Computer Vision and Pattern Recognition (cs.CV); Machine Learning (cs.LG)
arXiv:2609.17298 [eess.IV]
(or arXiv:2609.17298v1 [eess.IV] for this version)
https://doi.org/10.48550/arXiv.2609.17298 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 223 words
Related coverage

Researchers Achieve Near Optimal Solutions for Complex Problems with New Solver
Quantum Zeitgeist · Oct 7, 2026
Deep Tree Tensor Networks
arXiv · Jun 9, 2026

News
Quantum Computing Report · Jun 7, 2026
QiT: Quantum-Inspired Transformer for Visual Recognition Task
arXiv · Sep 17, 2026