Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Electronics Letters

Comments on “Quantum Communications for Image Transmission Over Error‐Prone Channels”

Abel C. H. Chen

Published Jan 1, 2026• 0 citations
Publisher

Abstract

ABSTRACT The state‐of‐the‐art study entitled “quantum communications for image transmission over error‐prone channels” proposes a quantum channel model based on the properties of quantum superposition and applies it to image transmission. The work presents practical insights and valuable findings in the field. However, although the article introduces two measurement operators, and , it provides a formal proof only for the measurement operator. The proof for the measurement operator is not included. Therefore, this study aims to supplement the original paper by providing a complete proof for the measurement operator.

DOI
10.1049/ell2.70582

Related papers

Quantum communications for image transmission over error‐prone channels

Udara Jayasinghe, Prabhath Samarathunga, Yasith Ganearachchi +2 more

Abstract The introduction of quantum communications, enabled by advancements in quantum computing, is expected to play a significant role in the field of communications. Inherent properties of quantum objects, such as superposition and entanglement, have the potential to provide novel solutions to overcome the challenges encountered by classical communication systems in bandwidth‐intensive applications such as media transmission. This research explores the performance of a quantum communication system in image transmission using quantum superposition and investigates its performance using a simple quantum channel model. With an increase in channel noise, there are significant gains in the rate distortion performance of images transmitted over the quantum channel compared to an ideal classical channel. This novel attempt at constructing a quantum communication‐based image transmission system indicates the potential of the approach to be applied to satisfy the ever‐increasing demands of high‐quality media transmission applications.

Electronics Letters•Jul 30, 2024•27 citations

Practical Advances in Quantum Error Correction & Communication

Daniel Benjamin Criger

Quantum computing exists at the intersection of mathematics, physics, chemistry, and engineering; the main goal of quantum computing is the creation of devices and algorithms which use the properties of quantum mechanics to store, manipulate and measure information. There exist many families of algorithms, which, using non-classical logical operations, can outperform traditional, classical algorithms in terms of memory and processing requirements. In addition, quantum computing devices are fundamentally smaller than classical processors and memory elements; since the physical models governing their performance are applicable on all scales, as opposed to classical logic elements, whose underlying principles rely on the macroscopic nature of the device in question. \n \nQuantum algorithms, for the most part, are predicated on a theory of resources. It is often assumed that quantum computers can be placed in a precise fiducial state prior to computation, and that logical operations are perfect, inducing no error on the system which they affect. These assumptions greatly simplify algorithmic design, but are fundamentally unrealistic. In order to justify their use, it is necessary to develop a framework for using a large number of imperfect devices to simulate the action of a perfect device, with some acceptable probability of failure. This is the study of fault-tolerant quantum computing. In order to pursue this study effectively, it is necessary to understand the fundamental nature of generic quantum states and operations, as well as the means by which one can correct quantum errors. Additionally, it is important to attempt to minimize the use of computational resources in achieving error reduction and fault-tolerant computing. \n \nThis thesis is concerned with three projects related to the use of error-prone quantum systems to transmit and manipulate information. The first of these is concerned with the use of imperfectly-prepared states in error-correction routines. Using optimal quantum error correction, we are able to deduce a method of partially protecting encoded quantum information against preparation errors prior to encoding, using no additional qubits. The second of these projects details the search for entangled states which can be used to transmit classical information over quantum channels at a rate superior to classical states. The third of these projects concerns the transcoding of data from one quantum code into another using few ancillary resources. The descriptions of these projects are preceded by a brief introduction to representations of quantum states and channels, for completeness. \n \nThree techniques of general interest are presented in appendices. The first is an introduction to, and a minor advance in the development of optimal error correction codes. The second is a more efficient means of calculating the action of a quantum channel on a given state, given that the channel acts non-trivially only on a subsystem, rather than the entire system. Finally, we include documentation on a software package developed to aid the search for quantum transcoding operations.

•Oct 25, 2013•1 citation

Ideal Quantum Communication over Noisy Channels: A Quantum Optical Implementation

S. J. van Enk, J. I. Cirac, P. Zoller

We consider transmission of a quantum state between two distant atoms via photons. Based on a quantum-optical realistic model, we define a noisy quantum channel which includes systematic errors as well as errors due to coupling to the environment. We present a protocol that allows one to accomplish ideal transmission by repeating the transfer operation as many times as needed.

arXiv:quant-ph/9702036•Physical Review Letters•Jun 2, 1997•227 citations

Reply to “Comment on ‘Arbitrated quantum-signature scheme’ ”

Guihua Zeng

To reply to the Comment on our original paper entitled ``Arbitrated quantum-signature scheme'' [Phys. Rev. A 65, 042312 (2002)], we present more detailed presentations and proofs of the quantum-signature scheme in our paper. We feel our further investigation has shown that the original quantum-signature scheme is secure and operationally well defined. In addition, proofs illustrate that the quantum-signature scheme with unknown quantum states is also suitable in principle.

Physical Review A•Jul 28, 2008•112 citations

Coding theorems for quantum communication channels

Alexander Semenovich Holevo

The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during when a number of direct quantum coding theorems were discovered. To a considerable extent this progress is due to an interplay between the quantum communication theory and quantum information ideas related to more recent development in quantum computing. It is remarkable, however, that many probabilistic tools underlying the treatment of the quantum case have their roots, and in some cases direct prototypes, in the classical Shannon theory.

arXiv:quant-ph/9708046•IEEE International Symposium on Information Theory (ISIT)•Nov 27, 2002•17 citations

Circular Polarization-Based Quantum Encoding for Image Transmission over Error-Prone Channels

Udara Jayasinghe, Anil Fernando

Quantum image transmission over noisy communication channels remains a challenge due to the fragility of quantum states and their susceptibility to channel impairments. Existing quantum encoding schemes often exhibit limited noise resilience, while advanced approaches introduce computational and implementation complexity. To address these limitations, this paper proposes a circular polarization-based quantum encoding framework for image transmission over error-prone channels. In the proposed approach, source images are compressed and source-encoded using standard image coding formats, including the joint photographic experts group (JPEG) standard and the high-efficiency image file format (HEIF), and converted into classical bitstreams. The resulting bitstreams are protected using channel coding and mapped onto quantum states via circular polarization representations, where left- and right-hand circularly polarized states encode binary information. The encoded quantum states are transmitted over noisy quantum channels to model channel impairments. At the receiver, appropriate quantum decoding and channel decoding operations are applied to recover the classical bitstream, followed by source decoding to reconstruct the image. The performance of the proposed framework is evaluated using image quality metrics, including peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), and universal quality index (UQI). Simulation results demonstrate that the proposed circular polarization-based encoding scheme outperforms existing quantum image encoding techniques, achieving channel SNR gains of 4 dB over state-of-the-art Hadamard-based encoding and 3 dB over frequency-domain quantum encoding methods under severe noise conditions. These results indicate that circular polarization-based quantum encoding provides improved noise robustness and reconstruction fidelity for practical quantum image transmission systems.

Signals•Apr 8, 2026•0 citations
ABSTRACT The state‐of‐the‐art study entitled “quantum communications for image transmission over error‐prone channels” proposes a quantum channel model based on the properties of quantum superposition and applies it to image transmission. The work presents practical insights and valuable findings in the field. However, although the article introduces two measurement operators, and , it provides a formal proof only for the measurement operator. The proof for the measurement operator is not included. Therefore, this study aims to supplement the original paper by providing a complete proof for the measurement operator.
Abstract The introduction of quantum communications, enabled by advancements in quantum computing, is expected to play a significant role in the field of communications. Inherent properties of quantum objects, such as superposition and entanglement, have the potential to provide novel solutions to overcome the challenges encountered by classical communication systems in bandwidth‐intensive applications such as media transmission. This research explores the performance of a quantum communication system in image transmission using quantum superposition and investigates its performance using a simple quantum channel model. With an increase in channel noise, there are significant gains in the rate distortion performance of images transmitted over the quantum channel compared to an ideal classical channel. This novel attempt at constructing a quantum communication‐based image transmission system indicates the potential of the approach to be applied to satisfy the ever‐increasing demands of high‐quality media transmission applications.
Quantum computing exists at the intersection of mathematics, physics, chemistry, and engineering; the main goal of quantum computing is the creation of devices and algorithms which use the properties of quantum mechanics to store, manipulate and measure information. There exist many families of algorithms, which, using non-classical logical operations, can outperform traditional, classical algorithms in terms of memory and processing requirements. In addition, quantum computing devices are fundamentally smaller than classical processors and memory elements; since the physical models governing their performance are applicable on all scales, as opposed to classical logic elements, whose underlying principles rely on the macroscopic nature of the device in question. \n \nQuantum algorithms, for the most part, are predicated on a theory of resources. It is often assumed that quantum computers can be placed in a precise fiducial state prior to computation, and that logical operations are perfect, inducing no error on the system which they affect. These assumptions greatly simplify algorithmic design, but are fundamentally unrealistic. In order to justify their use, it is necessary to develop a framework for using a large number of imperfect devices to simulate the action of a perfect device, with some acceptable probability of failure. This is the study of fault-tolerant quantum computing. In order to pursue this study effectively, it is necessary to understand the fundamental nature of generic quantum states and operations, as well as the means by which one can correct quantum errors. Additionally, it is important to attempt to minimize the use of computational resources in achieving error reduction and fault-tolerant computing. \n \nThis thesis is concerned with three projects related to the use of error-prone quantum systems to transmit and manipulate information. The first of these is concerned with the use of imperfectly-prepared states in error-correction routines. Using optimal quantum error correction, we are able to deduce a method of partially protecting encoded quantum information against preparation errors prior to encoding, using no additional qubits. The second of these projects details the search for entangled states which can be used to transmit classical information over quantum channels at a rate superior to classical states. The third of these projects concerns the transcoding of data from one quantum code into another using few ancillary resources. The descriptions of these projects are preceded by a brief introduction to representations of quantum states and channels, for completeness. \n \nThree techniques of general interest are presented in appendices. The first is an introduction to, and a minor advance in the development of optimal error correction codes. The second is a more efficient means of calculating the action of a quantum channel on a given state, given that the channel acts non-trivially only on a subsystem, rather than the entire system. Finally, we include documentation on a software package developed to aid the search for quantum transcoding operations.
The more than thirty years old issue of the information capacity of quantum communication channels was dramatically clarified during when a number of direct quantum coding theorems were discovered. To a considerable extent this progress is due to an interplay between the quantum communication theory and quantum information ideas related to more recent development in quantum computing. It is remarkable, however, that many probabilistic tools underlying the treatment of the quantum case have their roots, and in some cases direct prototypes, in the classical Shannon theory.
Quantum image transmission over noisy communication channels remains a challenge due to the fragility of quantum states and their susceptibility to channel impairments. Existing quantum encoding schemes often exhibit limited noise resilience, while advanced approaches introduce computational and implementation complexity. To address these limitations, this paper proposes a circular polarization-based quantum encoding framework for image transmission over error-prone channels. In the proposed approach, source images are compressed and source-encoded using standard image coding formats, including the joint photographic experts group (JPEG) standard and the high-efficiency image file format (HEIF), and converted into classical bitstreams. The resulting bitstreams are protected using channel coding and mapped onto quantum states via circular polarization representations, where left- and right-hand circularly polarized states encode binary information. The encoded quantum states are transmitted over noisy quantum channels to model channel impairments. At the receiver, appropriate quantum decoding and channel decoding operations are applied to recover the classical bitstream, followed by source decoding to reconstruct the image. The performance of the proposed framework is evaluated using image quality metrics, including peak signal-to-noise ratio (PSNR), structural similarity index measure (SSIM), and universal quality index (UQI). Simulation results demonstrate that the proposed circular polarization-based encoding scheme outperforms existing quantum image encoding techniques, achieving channel SNR gains of 4 dB over state-of-the-art Hadamard-based encoding and 3 dB over frequency-domain quantum encoding methods under severe noise conditions. These results indicate that circular polarization-based quantum encoding provides improved noise robustness and reconstruction fidelity for practical quantum image transmission systems.