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:2412.16337 · Quantum Science and Technology

Schmidt quantum compressor

Israel F. Araujo, Hyeondo Oh, Nayeli A. Rodríguez-Briones, Daniel K. Park

Published Apr 16, 2025• 0 citations
arXivHTMLPDF

Abstract

Abstract This work introduces the Schmidt quantum compressor, an innovative approach to quantum data compression that leverages the principles of Schmidt decomposition to encode quantum information efficiently. In contrast to traditional variational quantum autoencoders, which depend on stochastic optimization and face challenges such as shot noise, barren plateaus, and non-convex optimization landscapes, our deterministic method substantially reduces the complexity and computational overhead of quantum data compression. We evaluate the performance of the compressor through numerical experiments, demonstrating its ability to achieve high fidelity in quantum state reconstruction compared to variational quantum algorithms. Furthermore, we demonstrate the practical utility of the Schmidt quantum compressor in one-class classification tasks.

DOI
10.1088/2058-9565/adcd99

Related papers

Quantum-Enhanced Data Compression with Entangled State Encoding

Jincheng Zhang

This paper explores a novel approach to data compression leveraging the principles of quantum entanglement. Traditional classical compression algorithms often struggle to efficiently represent highly correlated data, particularly in complex datasets. This research proposes a method, termed entangled state encoding, where data is represented by the quantum state of an entangled pair. By exploiting the inherent correlations within the data, this technique aims to achieve significantly higher compression ratios compared to conventional methods. The core of the approach lies in encoding multiple data points simultaneously into the shared quantum state, effectively reducing redundancy. We analyze the theoretical limitations and potential advantages of this technique, focusing on the information-theoretic aspects of compression and the challenges associated with practical implementation. The study outlines the fundamental principles, provides a conceptual framework, and discusses the key considerations for future research in this emerging field. The central equation demonstrating the compression ratio is: R = (1 - P) * L, where R is the compression ratio, P is the probability of measurement error, and L is the original data length. Furthermore, we consider the entanglement fidelity (F) as a crucial parameter: F ∈ [0, 1], with higher fidelity leading to improved compression performance. The goal is to maximize the compression ratio while maintaining a high fidelity of the entangled state.

•Aug 28, 2026•0 citations

Quantum Data Compression Based on Quantum State Reordering

Jincheng Zhang

This paper explores a novel approach to quantum data compression utilizing the principles of quantum state reordering. Traditional quantum data compression techniques often suffer from inefficiencies, primarily due to the inherent complexities of representing and manipulating quantum information. This work proposes a method that leverages quantum state reordering to achieve more effective data reduction. The core idea involves encoding quantum data into specific quantum states and subsequently applying reordering algorithms designed to exploit redundancies within the encoded states. This approach aligns with fundamental quantum information theory and provides a potentially more efficient pathway to compressing quantum data, reducing storage and transmission requirements. The theoretical framework presented outlines the key components, including state encoding, reordering algorithm design, and compression performance analysis. The ultimate goal is to demonstrate the feasibility and potential benefits of this technique for future quantum data management systems.

•Aug 28, 2026•0 citations

Quantum State Compression for Noisy Intermediate-Scale Quantum Computers

Jincheng Zhang

The development of practical quantum algorithms hinges critically on the ability to efficiently manage and compress quantum states. Noisy Intermediate-Scale Quantum (NISQ) computers, characterized by limited qubit counts and inherent noise, exacerbate this challenge. This paper proposes a novel quantum state compression technique utilizing tensor decomposition and variational quantum algorithms to minimize qubit requirements while mitigating error accumulation. The core idea involves transforming a complex quantum state into a lower-rank tensor representation, subsequently optimized using a variational quantum algorithm. This approach aims to capture the essential information within the original state, reducing computational overhead and enhancing the feasibility of running quantum algorithms on NISQ devices. We outline the theoretical framework, detailing the mathematical formulation of the compression process, including the tensor representation, variational optimization, and error correction strategies. The paper explores the key parameters influencing the compression ratio and error rates, ultimately demonstrating the potential of this technique to unlock the computational power of NISQ computers.

•Aug 31, 2026•0 citations

Non-Deterministic Computation for Quantum State Compression and Entanglement

Jincheng Zhang

This paper explores a novel approach to quantum state compression and entanglement leveraging the principles of non-deterministic computation. Traditional quantum algorithms often rely on deterministic operations, limiting their ability to effectively manage and manipulate quantum information. We propose a framework that incorporates "quantum noise" as a primary information source within a non-deterministic computation paradigm. This noise, characterized by its inherent randomness, guides the compression and entanglement processes. A probabilistic optimization algorithm is then designed to translate this noise into actionable quantum operations. The core claim is that this method offers an effective means of reducing quantum information redundancy while simultaneously enhancing entanglement efficiency. We detail the mathematical framework underpinning this approach, focusing on the probabilistic modeling of the noise and the iterative optimization process. The results suggest a potential pathway towards more robust and efficient quantum information processing, particularly in scenarios where deterministic control is limited or unavailable.

•Sep 7, 2026•0 citations

Noise-Assisted Quantum Autoencoder

Chenfeng Cao, Xin Wang

Quantum autoencoder is an efficient variational quantum algorithm for quantum data compression. However, previous quantum autoencoders fail to compress and recover high-rank mixed states. In this work, we discuss the fundamental properties and limitations of the standard quantum-autoencoder model in more depth, and provide an information-theoretic solution to its recovering fidelity. Based on this understanding, we present a noise-assisted quantum-autoencoder algorithm to go beyond the limitations, our model can achieve high recovering fidelity for general input states. Appropriate noise channels are used to make the input mixedness and output mixedness consistent, the noise setup is determined by measurement results of the trash system. Compared with the original quantum-autoencoder model, the measurement information is fully used in our algorithm. In addition to the circuit model, we design a (noise-assisted) adiabatic model of quantum autoencoder that can be implemented on quantum annealers. We verify the validity of our methods through compressing the thermal states of the transverse-field Ising model and Werner states. For pure-state ensemble compression, we also introduce a projected quantum-autoencoder algorithm.

arXiv:2012.08331•Physical Review Applied•May 6, 2021•60 citations

Quantum Information Entropy Compression Algorithm

Jincheng Zhang

This paper presents a novel entropy compression algorithm leveraging quantum state self-similarity to enhance data compression and storage efficiency. Traditional entropy compression methods often struggle to effectively utilize the unique properties of quantum states. We propose an algorithm that encodes data within the inherent quantum correlations, allowing for more efficient compression and storage compared to classical approaches. This research explores the potential of harnessing quantum mechanics for data representation and compression, aiming to advance the field of quantum information processing.

•Sep 3, 2026•0 citations
Abstract This work introduces the Schmidt quantum compressor, an innovative approach to quantum data compression that leverages the principles of Schmidt decomposition to encode quantum information efficiently. In contrast to traditional variational quantum autoencoders, which depend on stochastic optimization and face challenges such as shot noise, barren plateaus, and non-convex optimization landscapes, our deterministic method substantially reduces the complexity and computational overhead of quantum data compression. We evaluate the performance of the compressor through numerical experiments, demonstrating its ability to achieve high fidelity in quantum state reconstruction compared to variational quantum algorithms. Furthermore, we demonstrate the practical utility of the Schmidt quantum compressor in one-class classification tasks.
This paper explores a novel approach to data compression leveraging the principles of quantum entanglement. Traditional classical compression algorithms often struggle to efficiently represent highly correlated data, particularly in complex datasets. This research proposes a method, termed entangled state encoding, where data is represented by the quantum state of an entangled pair. By exploiting the inherent correlations within the data, this technique aims to achieve significantly higher compression ratios compared to conventional methods. The core of the approach lies in encoding multiple data points simultaneously into the shared quantum state, effectively reducing redundancy. We analyze the theoretical limitations and potential advantages of this technique, focusing on the information-theoretic aspects of compression and the challenges associated with practical implementation. The study outlines the fundamental principles, provides a conceptual framework, and discusses the key considerations for future research in this emerging field. The central equation demonstrating the compression ratio is: R = (1 - P) * L, where R is the compression ratio, P is the probability of measurement error, and L is the original data length. Furthermore, we consider the entanglement fidelity (F) as a crucial parameter: F ∈ [0, 1], with higher fidelity leading to improved compression performance. The goal is to maximize the compression ratio while maintaining a high fidelity of the entangled state.
This paper explores a novel approach to quantum data compression utilizing the principles of quantum state reordering. Traditional quantum data compression techniques often suffer from inefficiencies, primarily due to the inherent complexities of representing and manipulating quantum information. This work proposes a method that leverages quantum state reordering to achieve more effective data reduction. The core idea involves encoding quantum data into specific quantum states and subsequently applying reordering algorithms designed to exploit redundancies within the encoded states. This approach aligns with fundamental quantum information theory and provides a potentially more efficient pathway to compressing quantum data, reducing storage and transmission requirements. The theoretical framework presented outlines the key components, including state encoding, reordering algorithm design, and compression performance analysis. The ultimate goal is to demonstrate the feasibility and potential benefits of this technique for future quantum data management systems.
The development of practical quantum algorithms hinges critically on the ability to efficiently manage and compress quantum states. Noisy Intermediate-Scale Quantum (NISQ) computers, characterized by limited qubit counts and inherent noise, exacerbate this challenge. This paper proposes a novel quantum state compression technique utilizing tensor decomposition and variational quantum algorithms to minimize qubit requirements while mitigating error accumulation. The core idea involves transforming a complex quantum state into a lower-rank tensor representation, subsequently optimized using a variational quantum algorithm. This approach aims to capture the essential information within the original state, reducing computational overhead and enhancing the feasibility of running quantum algorithms on NISQ devices. We outline the theoretical framework, detailing the mathematical formulation of the compression process, including the tensor representation, variational optimization, and error correction strategies. The paper explores the key parameters influencing the compression ratio and error rates, ultimately demonstrating the potential of this technique to unlock the computational power of NISQ computers.
This paper explores a novel approach to quantum state compression and entanglement leveraging the principles of non-deterministic computation. Traditional quantum algorithms often rely on deterministic operations, limiting their ability to effectively manage and manipulate quantum information. We propose a framework that incorporates "quantum noise" as a primary information source within a non-deterministic computation paradigm. This noise, characterized by its inherent randomness, guides the compression and entanglement processes. A probabilistic optimization algorithm is then designed to translate this noise into actionable quantum operations. The core claim is that this method offers an effective means of reducing quantum information redundancy while simultaneously enhancing entanglement efficiency. We detail the mathematical framework underpinning this approach, focusing on the probabilistic modeling of the noise and the iterative optimization process. The results suggest a potential pathway towards more robust and efficient quantum information processing, particularly in scenarios where deterministic control is limited or unavailable.
Quantum autoencoder is an efficient variational quantum algorithm for quantum data compression. However, previous quantum autoencoders fail to compress and recover high-rank mixed states. In this work, we discuss the fundamental properties and limitations of the standard quantum-autoencoder model in more depth, and provide an information-theoretic solution to its recovering fidelity. Based on this understanding, we present a noise-assisted quantum-autoencoder algorithm to go beyond the limitations, our model can achieve high recovering fidelity for general input states. Appropriate noise channels are used to make the input mixedness and output mixedness consistent, the noise setup is determined by measurement results of the trash system. Compared with the original quantum-autoencoder model, the measurement information is fully used in our algorithm. In addition to the circuit model, we design a (noise-assisted) adiabatic model of quantum autoencoder that can be implemented on quantum annealers. We verify the validity of our methods through compressing the thermal states of the transverse-field Ising model and Werner states. For pure-state ensemble compression, we also introduce a projected quantum-autoencoder algorithm.
This paper presents a novel entropy compression algorithm leveraging quantum state self-similarity to enhance data compression and storage efficiency. Traditional entropy compression methods often struggle to effectively utilize the unique properties of quantum states. We propose an algorithm that encodes data within the inherent quantum correlations, allowing for more efficient compression and storage compared to classical approaches. This research explores the potential of harnessing quantum mechanics for data representation and compression, aiming to advance the field of quantum information processing.