Schmidt Decomposition-Based Methods for Efficient Quantum Image Encoding

• URL: http://arxiv.org/abs/2606.10874v1
• Date: Tue, 09 Jun 2026 13:50:48 GMT
• Title: Schmidt Decomposition-Based Methods for Efficient Quantum Image Encoding
• Abstract summary: In quantum image processing, a fundamental step is encoding classical image data into quantum states.<n>On real quantum hardware, these encodings can quickly lead to circuits with many gates, large circuit depth, and high qubit usage.<n>We investigate whether low-rank state approximation, formulated via Schmidt decomposition, can help reduce this complexity.
• Score: 35.53196395403282
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In quantum image processing, a fundamental step is encoding classical image data into quantum states. This can be achieved using methods such as Flexible Representation of Quantum Images (FRQI), Quantum Probability Image Encoding (QPIE), and Novel Enhanced Quantum Representation (NEQR). However, on real quantum hardware, these encodings can quickly lead to circuits with many gates, large circuit depth, and high qubit usage, which is a problem for Noisy Intermediate-Scale Quantum (NISQ) devices. In this work, we investigate whether low-rank state approximation, formulated via Schmidt decomposition, can help reduce this complexity. The method keeps only the most significant parts of a quantum state's entanglement structure, making state preparation more efficient while preserving most of the image information. We compare the three encoding techniques in their original form and with low-rank approximation, evaluating metrics such as circuit depth, CNOT count, MSE, and visual quality of reconstructed images. The results reveal meaningful trade-offs between accuracy and resource efficiency, with the FRQI model achieving a 97 percent reduction in circuit depth while maintaining a near-perfect reconstruction (MSE of about 0.27). This demonstrates the potential of low-rank techniques for advancing practical quantum image processing on near-term hardware.

Related papers

• Q-PIPE A Practical Quantum Phase Encoding Method [0.0]
  A major hurdle in Quantum Image Processing (QIMP) is efficiently transferring classical, high-dimensional image data into quantum states.<n>Current methods face trade-offs: amplitude encoding (FRQI) is computationally expensive in gate complexity and limited arithmetic capabilities, while basis encoding (NEQR) incurs heavy overhead scaling with image resolution and intensity bit-depth.<n>Q-PIPE efficiently maps continuous intensity values into the computational basis with an elementary gate count of $O(qN)$ a $O(textlogN)$ improvement over standard basis encoding.
  arXiv  Detail & Related papers  (2026-04-10T19:59:25Z)
• Minimal Quantum Reservoirs with Hamiltonian Encoding [72.27323884094953]
  We investigate a minimal architecture for quantum reservoir computing based on Hamiltonian encoding.<n>This approach circumvents many of the experimental overheads typically associated with quantum machine learning.
  arXiv  Detail & Related papers  (2025-05-28T16:50:05Z)
• A Quantum Range-Doppler Algorithm for Synthetic Aperture Radar Image Formation [47.1482540145286]
  We show how in general reference functions, a key element in many SAR focusing algorithms, can be mapped to quantum gates.<n>We find that the core of the quantum range-Doppler algorithm has a computational complexity $O(N)$, less than its classical counterpart.
  arXiv  Detail & Related papers  (2025-04-29T14:24:23Z)
• Deep learning as a tool for quantum error reduction in quantum image processing [0.0]
  We report the successful use of a generative adversarial network trained for image-to-image translation, in conjunction with Phase Unraveling error reduction method, for reducing overall error in images encoded using LPIQE. Despite the limited availability and quantum volume of quantum computers, quantum image representation is a widely researched area.
  arXiv  Detail & Related papers  (2023-11-08T10:14:50Z)
• Tensor Network Based Efficient Quantum Data Loading of Images [0.0]
  We present a novel method for creating quantum states that approximately encode images as amplitudes. We experimentally demonstrate our technique on 8 qubits of a trapped ion quantum computer for complex images of road scenes.
  arXiv  Detail & Related papers  (2023-10-09T17:40:41Z)
• Hybrid quantum transfer learning for crack image classification on NISQ hardware [62.997667081978825]
  We present an application of quantum transfer learning for detecting cracks in gray value images. We compare the performance and training time of PennyLane's standard qubits with IBM's qasm_simulator and real backends.
  arXiv  Detail & Related papers  (2023-07-31T14:45:29Z)
• Achieving quantum advantages for image filtering [0.3441021278275805]
  We show that for images with efficient encoding and a lower bound on the signal-to-noise ratio, a quantum filtering algorithm can be constructed. Our work provides insights into the types of images that can achieve a substantial quantum speedup.
  arXiv  Detail & Related papers  (2023-06-12T17:20:30Z)
• A hybrid quantum image edge detector for the NISQ era [62.997667081978825]
  We propose a hybrid method for quantum edge detection based on the idea of a quantum artificial neuron. Our method can be practically implemented on quantum computers, especially on those of the current noisy intermediate-scale quantum era.
  arXiv  Detail & Related papers  (2022-03-22T22:02:09Z)
• Improved FRQI on superconducting processors and its restrictions in the NISQ era [62.997667081978825]
  We study the feasibility of the Flexible Representation of Quantum Images (FRQI) We also check experimentally what is the limit in the current noisy intermediate-scale quantum era. We propose a method for simplifying the circuits needed for the FRQI.
  arXiv  Detail & Related papers  (2021-10-29T10:42:43Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.