Improved FRQI on superconducting processors and its restrictions in the NISQ era

• URL: http://arxiv.org/abs/2110.15672v1
• Date: Fri, 29 Oct 2021 10:42:43 GMT
• Title: Improved FRQI on superconducting processors and its restrictions in the NISQ era
• Authors: Alexander Geng, Ali Moghiseh, Claudia Redenbach, Katja Schladitz
• Abstract summary: 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.
• Score: 62.997667081978825
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: In image processing, the amount of data to be processed grows rapidly, in particular when imaging methods yield images of more than two dimensions or time series of images. Thus, efficient processing is a challenge, as data sizes may push even supercomputers to their limits. Quantum image processing promises to encode images with logarithmically less qubits than classical pixels in the image. In theory, this is a huge progress, but so far not many experiments have been conducted in practice, in particular on real backends. Often, the precise conversion of classical data to quantum states, the exact implementation, and the interpretation of the measurements in the classical context are challenging. We investigate these practical questions in this paper. In particular, we study the feasibility of the Flexible Representation of Quantum Images (FRQI). Furthermore, we check experimentally what is the limit in the current noisy intermediate-scale quantum era, i.e. up to which image size an image can be encoded, both on simulators and on real backends. Finally, we propose a method for simplifying the circuits needed for the FRQI. With our alteration, the number of gates needed, especially of the error-prone controlled-NOT gates, can be reduced. As a consequence, the size of manageable images increases.

Related papers

• AdaBM: On-the-Fly Adaptive Bit Mapping for Image Super-Resolution [53.23803932357899]
  We introduce the first on-the-fly adaptive quantization framework that accelerates the processing time from hours to seconds. We achieve competitive performance with the previous adaptive quantization methods, while the processing time is accelerated by x2000.
  arXiv  Detail & Related papers  (2024-04-04T08:37:27Z)
• Efficient MPS representations and quantum circuits from the Fourier modes of classical image data [0.4326762849037007]
  We show that classical data with a quickly decaying Fourier spectrum can be well-approximated by states with a small Schmidt rank. These approximated states can, in turn, be prepared on a quantum computer with a linear number of nearest-neighbor two-qubit gates. We also consider different variational circuit ans"atze and demonstrate numerically that one-dimensional sequential circuits achieve the same compression quality as more powerful ans"atze.
  arXiv  Detail & Related papers  (2023-11-13T19:00:33Z)
• 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)
• 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)
• A novel state connection strategy for quantum computing to represent and compress digital images [10.20554144865699]
  We propose a new SCMFRQI (state connection modification FRQI) approach for further reducing the required bits. Unlike other existing methods, we compress images using block-level for further reduction of required qubits. The experimental results confirm that the proposed method outperforms the existing methods in terms of both image representation and compression points of view.
  arXiv  Detail & Related papers  (2022-12-14T08:10:40Z)
• A hybrid-qudit representation of digital RGB images [7.766921168069532]
  We use two entangled quantum registers constituting of total 7 qutrits to encode the color channels and their intensities. We generalize the existing encoding methods by using both qubits and qutrits to encode the pixel positions of a rectangular image. This hybrid-qudit approach aligns well with the current progress of NISQ devices in incorporating higher dimensional quantum systems.
  arXiv  Detail & Related papers  (2022-07-25T21:57:46Z)
• 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)
• CNNs for JPEGs: A Study in Computational Cost [49.97673761305336]
  Convolutional neural networks (CNNs) have achieved astonishing advances over the past decade. CNNs are capable of learning robust representations of the data directly from the RGB pixels. Deep learning methods capable of learning directly from the compressed domain have been gaining attention in recent years.
  arXiv  Detail & Related papers  (2020-12-26T15:00:10Z)
• Powers of layers for image-to-image translation [60.5529622990682]
  We propose a simple architecture to address unpaired image-to-image translation tasks. We start from an image autoencoder architecture with fixed weights. For each task we learn a residual block operating in the latent space, which is iteratively called until the target domain is reached.
  arXiv  Detail & Related papers  (2020-08-13T09:02:17Z)

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.