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

arXiv:2106.13823

Quantum Data Compression and Quantum Cross Entropy

Zhou Shangnan

Published Jun 25, 2021• 13 citations
arXivHTMLPDF

Abstract

The emerging field of quantum machine learning has the potential of revolutionizing our perspectives of quantum computing and artificial intelligence. In the predominantly empirical realm of quantum machine learning, a theoretical void persists. This paper addresses the gap by highlighting the quantum cross entropy, a pivotal counterpart to the classical cross entropy. We establish quantum cross entropy's role in quantum data compression, a fundamental machine learning task, by demonstrating that it acts as the compression rate for sub-optimal quantum source coding. Our approach involves a novel, universal quantum data compression protocol based on the quantum generalization of variable-length coding and the principle of quantum strong typicality. This reveals that quantum cross entropy can effectively serve as a loss function in quantum machine learning algorithms. Furthermore, we illustrate that the minimum of quantum cross entropy aligns with the von Neumann entropy, reinforcing its role as the optimal compression rate and underscoring its significance in advancing our understanding of quantum machine learning's theoretical framework.

DOI
10.48550/arxiv.2106.13823

Related papers

Quantum Cross Entropy and Maximum Likelihood Principle

Zhou Shangnan, Yixu Wang

Quantum machine learning is an emerging field at the intersection of machine learning and quantum computing. Classical cross entropy plays a central role in machine learning. We define its quantum generalization, the quantum cross entropy, prove its lower bounds, and investigate its relation to quantum fidelity. In the classical case, minimizing cross entropy is equivalent to maximizing likelihood. In the quantum case, when the quantum cross entropy is constructed from quantum data undisturbed by quantum measurements, this relation holds. Classical cross entropy is equal to negative log-likelihood. When we obtain quantum cross entropy through empirical density matrix based on measurement outcomes, the quantum cross entropy is lower-bounded by negative log-likelihood. These two different scenarios illustrate the information loss when making quantum measurements. We conclude that to achieve the goal of full quantum machine learning, it is crucial to utilize the deferred measurement principle.

arXiv:2102.11887•Feb 23, 2021•14 citations

Adaptive Quantum Machine Learning for Quantum State Compression

Jincheng Zhang

Quantum machine learning (QML) offers the potential to revolutionize various computational tasks, particularly in areas requiring complex quantum computations. However, the inherent complexity of quantum states – the superposition and entanglement of quantum bits – poses significant challenges for efficient data representation and manipulation. This paper introduces an innovative quantum state compression algorithm, Adaptive Quantum Machine Learning, designed to address these challenges by dynamically adjusting quantum states during computation. We propose a novel approach that leverages the unique properties of quantum circuits to optimize the representation of quantum states, ultimately leading to improved quantum machine learning performance. The algorithm employs a feedback mechanism to iteratively compress the quantum state, achieving a balance between computational cost and data fidelity. We demonstrate the effectiveness of this approach through a series of simulations and analyses, showcasing significant improvements in both data compression and quantum algorithm efficiency. The paper also discusses potential future extensions and implications for broader QML applications.

•Sep 6, 2026•0 citations

Lossless quantum data compression and variable-length coding

Kim Joris Boström, Timo Felbinger

In order to compress quantum messages without loss of information it is necessary to allow the length of the encoded messages to vary. We develop a general framework for variable-length quantum messages in close analogy to the classical case and show that lossless compression is only possible if the message to be compressed is known to the sender. The lossless compression of an ensemble of messages is bounded from below by its von-Neumann entropy. We show that it is possible to reduce the number of qbits passing through a quantum channel even below the von Neumann entropy by adding a classical side channel. We give an explicit communication protocol that realizes lossless and instantaneous quantum data compression and apply it to a simple example. This protocol can be used for both online quantum communication and storage of quantum data.

arXiv:quant-ph/0105026•Physical Review A•Feb 20, 2002•37 citations

Quantum Machine Learning with Multi-Variable Entangled Encoding

Jincheng Zhang

This paper investigates the potential of multi-variable entangled encoding as a novel approach to enhance quantum machine learning algorithms. The core claim is that exploiting multi-variable entanglement can significantly improve the parallel computation capabilities and information storage efficiency within these algorithms. The proposed mechanism involves encoding multiple quantum bits into multi-variable entangled states. Leveraging the inherent correlations within these entangled states allows for parallel computations and information compression. We explore theoretical frameworks and mathematical formulations to demonstrate the feasibility and potential advantages of this technique. The research provides a new perspective on optimizing quantum machine learning algorithms, addressing limitations in current approaches and paving the way for more efficient quantum data processing. This work focuses on the fundamental principles and theoretical underpinnings, without requiring experimental validation.

•Sep 5, 2026•0 citations

On Lossless Quantum Data Compression With a Classical Helper

Rudolf Ahlswede, N. Cai

After K. Bostro/spl uml/m and T. Felbinger observed that lossless quantum data compression does not exist unless decoders know the lengths of codewords, they introduced a classical noiseless channel to inform the decoder of a quantum source about the lengths of codewords. In this paper we analyze their codes and present: 1) a sufficient and necessary condition for the existence of such codes for given lists of lengths of codes; 2) a characterization of the optimal compression rate for their codes. However our main contribution is a more efficient way to use the classical channel. We propose a more general coding scheme. It turned out that the optimal compression can always be achieved by a code obtained by this scheme. A von Neumann entropy lower bound to rates of our codes and a necessary and sufficient condition to achieve the bound are obtained. The gap between this lower bound and the compression rates is also well analyzed. For a special family of quantum sources we provide a sharper lower bound in terms of Shannon entropy. Finally, we propose some problems for further research.

IEEE Transactions on Information Theory•Jun 1, 2004•11 citations

Quantum Machine Learning: Bridging Quantum Computing and Artificial Intelligence for Future Data-Driven Technologies: A Comprehensive Review

Ankita Patra, Jitendra Patra, Prabhat Kumar Singh

There has been remarkable development in the data-driven decision-making domain of Artificial Intelligence (AI). However, the complexity of the AI models and the amount of data have shown some drawbacks with conventional computing models. One of the interdisciplinary branches of quantum computing and machine learning is Quantum Machine Learning (QML), which is a combination of quantum computing and machine learning and relies on the unique characteristics of quantum computing, such as superposition, entanglement, and quantum parallelism, to enhance the performance of the machines. This review provides a comprehensive description of theory, architectures, algorithms, implementational approaches, applications, problems, and future directions of QML. The core concepts of quantum computing and machine learning are introduced. Different representations of quantum states, quantum data encoding, variational quantum circuits, quantum kernel methods, and hybrid quantum or classical optimization are discussed. Significant QML algorithms like Quantum Support Vector Machines, Quantum Neural Networks, Variational Quantum Eigen solvers, Quantum Approximate Optimization Algorithms, and Quantum reinforcement learning are explored and evaluated for computational power and applications. The scaling up of quantum computer sizes, data encoding overhead, complexity of optimizations, benchmarking, and decoherence are discussed in detail, as well as recent developments in fault-tolerant quantum computing and hybrid learning approaches. Finally, a conceptual framework is given to demonstrate the unification of classical computation and quantum computation to intelligently process data. This review demonstrates how QML could be the next-generation computational method to accelerate scientific advancements and enable new advanced AI technologies.

International Journal of Engineering and Information Management•Jul 15, 2026•0 citations
The emerging field of quantum machine learning has the potential of revolutionizing our perspectives of quantum computing and artificial intelligence. In the predominantly empirical realm of quantum machine learning, a theoretical void persists. This paper addresses the gap by highlighting the quantum cross entropy, a pivotal counterpart to the classical cross entropy. We establish quantum cross entropy's role in quantum data compression, a fundamental machine learning task, by demonstrating that it acts as the compression rate for sub-optimal quantum source coding. Our approach involves a novel, universal quantum data compression protocol based on the quantum generalization of variable-length coding and the principle of quantum strong typicality. This reveals that quantum cross entropy can effectively serve as a loss function in quantum machine learning algorithms. Furthermore, we illustrate that the minimum of quantum cross entropy aligns with the von Neumann entropy, reinforcing its role as the optimal compression rate and underscoring its significance in advancing our understanding of quantum machine learning's theoretical framework.
Quantum machine learning is an emerging field at the intersection of machine learning and quantum computing. Classical cross entropy plays a central role in machine learning. We define its quantum generalization, the quantum cross entropy, prove its lower bounds, and investigate its relation to quantum fidelity. In the classical case, minimizing cross entropy is equivalent to maximizing likelihood. In the quantum case, when the quantum cross entropy is constructed from quantum data undisturbed by quantum measurements, this relation holds. Classical cross entropy is equal to negative log-likelihood. When we obtain quantum cross entropy through empirical density matrix based on measurement outcomes, the quantum cross entropy is lower-bounded by negative log-likelihood. These two different scenarios illustrate the information loss when making quantum measurements. We conclude that to achieve the goal of full quantum machine learning, it is crucial to utilize the deferred measurement principle.
Quantum machine learning (QML) offers the potential to revolutionize various computational tasks, particularly in areas requiring complex quantum computations. However, the inherent complexity of quantum states – the superposition and entanglement of quantum bits – poses significant challenges for efficient data representation and manipulation. This paper introduces an innovative quantum state compression algorithm, Adaptive Quantum Machine Learning, designed to address these challenges by dynamically adjusting quantum states during computation. We propose a novel approach that leverages the unique properties of quantum circuits to optimize the representation of quantum states, ultimately leading to improved quantum machine learning performance. The algorithm employs a feedback mechanism to iteratively compress the quantum state, achieving a balance between computational cost and data fidelity. We demonstrate the effectiveness of this approach through a series of simulations and analyses, showcasing significant improvements in both data compression and quantum algorithm efficiency. The paper also discusses potential future extensions and implications for broader QML applications.
In order to compress quantum messages without loss of information it is necessary to allow the length of the encoded messages to vary. We develop a general framework for variable-length quantum messages in close analogy to the classical case and show that lossless compression is only possible if the message to be compressed is known to the sender. The lossless compression of an ensemble of messages is bounded from below by its von-Neumann entropy. We show that it is possible to reduce the number of qbits passing through a quantum channel even below the von Neumann entropy by adding a classical side channel. We give an explicit communication protocol that realizes lossless and instantaneous quantum data compression and apply it to a simple example. This protocol can be used for both online quantum communication and storage of quantum data.
This paper investigates the potential of multi-variable entangled encoding as a novel approach to enhance quantum machine learning algorithms. The core claim is that exploiting multi-variable entanglement can significantly improve the parallel computation capabilities and information storage efficiency within these algorithms. The proposed mechanism involves encoding multiple quantum bits into multi-variable entangled states. Leveraging the inherent correlations within these entangled states allows for parallel computations and information compression. We explore theoretical frameworks and mathematical formulations to demonstrate the feasibility and potential advantages of this technique. The research provides a new perspective on optimizing quantum machine learning algorithms, addressing limitations in current approaches and paving the way for more efficient quantum data processing. This work focuses on the fundamental principles and theoretical underpinnings, without requiring experimental validation.
After K. Bostro/spl uml/m and T. Felbinger observed that lossless quantum data compression does not exist unless decoders know the lengths of codewords, they introduced a classical noiseless channel to inform the decoder of a quantum source about the lengths of codewords. In this paper we analyze their codes and present: 1) a sufficient and necessary condition for the existence of such codes for given lists of lengths of codes; 2) a characterization of the optimal compression rate for their codes. However our main contribution is a more efficient way to use the classical channel. We propose a more general coding scheme. It turned out that the optimal compression can always be achieved by a code obtained by this scheme. A von Neumann entropy lower bound to rates of our codes and a necessary and sufficient condition to achieve the bound are obtained. The gap between this lower bound and the compression rates is also well analyzed. For a special family of quantum sources we provide a sharper lower bound in terms of Shannon entropy. Finally, we propose some problems for further research.
There has been remarkable development in the data-driven decision-making domain of Artificial Intelligence (AI). However, the complexity of the AI models and the amount of data have shown some drawbacks with conventional computing models. One of the interdisciplinary branches of quantum computing and machine learning is Quantum Machine Learning (QML), which is a combination of quantum computing and machine learning and relies on the unique characteristics of quantum computing, such as superposition, entanglement, and quantum parallelism, to enhance the performance of the machines. This review provides a comprehensive description of theory, architectures, algorithms, implementational approaches, applications, problems, and future directions of QML. The core concepts of quantum computing and machine learning are introduced. Different representations of quantum states, quantum data encoding, variational quantum circuits, quantum kernel methods, and hybrid quantum or classical optimization are discussed. Significant QML algorithms like Quantum Support Vector Machines, Quantum Neural Networks, Variational Quantum Eigen solvers, Quantum Approximate Optimization Algorithms, and Quantum reinforcement learning are explored and evaluated for computational power and applications. The scaling up of quantum computer sizes, data encoding overhead, complexity of optimizations, benchmarking, and decoherence are discussed in detail, as well as recent developments in fault-tolerant quantum computing and hybrid learning approaches. Finally, a conceptual framework is given to demonstrate the unification of classical computation and quantum computation to intelligently process data. This review demonstrates how QML could be the next-generation computational method to accelerate scientific advancements and enable new advanced AI technologies.