Quantum State Vector Compression Using Probability-Based Aggregation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data compression methods, such as 'zip compression', lack understanding of the compressed data nature, limiting their compression rate and efficiency, especially in compressing vectors of quantum states during quantum computer simulations.
Innovation Solution
A method that aggregates contiguous low-probability quantum states into groupings with associated probability parameters, preserving high-probability states, allowing for high compression rates and efficient storage and retrieval of quantum states, optimizing memory space and execution time.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Quantity of substance
If general data compression methods (e.g., zip compression) are used on quantum state vectors, then memory space is reduced, but the compression ratio is limited due to lack of understanding of data nature
Solution Approach 1:
The patent applies parameter changes by identifying and exploiting the probability parameter inherent in quantum state vectors. Instead of treating all states uniformly, the method changes the compression approach based on the probability values associated with each quantum state, aggregating low-probability states and preserving high-probability states separately, thereby achieving superior compression ratios compared to general methods
2Reliability
If all quantum states are preserved individually, then complete information is maintained, but memory usage and execution time increase significantly
Solution Approach 1:
The patent applies local quality by treating different quantum states differently based on their local probability characteristics. High-probability states are preserved individually with full detail, while low-probability states are aggregated into groups. This localized differentiation strategy maintains necessary information completeness while significantly reducing overall memory usage
3Quantity of substance
If low-probability quantum states are aggregated into groups, then memory space is optimized, but reconstruction time increases when desired state is in the aggregate
Solution Approach 1:
The patent applies partial action by performing full reconstruction only when necessary (when the desired quantum state is found to be in an aggregated group). In the majority of cases where the desired state is in the preserved high-probability set, no reconstruction is needed. This partial reconstruction strategy minimizes the average execution time while maintaining memory optimization benefits
4Productivity
If high-probability quantum states are preserved separately, then direct access is achieved, but compression rate is reduced compared to full aggregation
Solution Approach 1:
The patent resolves this contradiction by changing the compression parameter strategy based on probability thresholds. Instead of uniform aggregation, the method identifies a threshold probability value and applies different compression treatments: states above the threshold are preserved for direct access (maintaining productivity), while states below the threshold are aggregated (maximizing compression rate). This parameter-based differentiation achieves both goals simultaneously
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A method for compressing a vector of quantum states includes: an aggregation step of a group of several contiguous states of the vector into a grouping of states of the vector, ∘ a parameter representing the probability of this grouping being associated with it and corresponding to the sum of the probabilities of the contiguous states aggregated in this grouping, ∘ the probability of each contiguous aggregated state being less than a given aggregation threshold, and/or the sum of the probabilities of the contiguous states aggregated in a grouping being less than another given aggregation threshold, a conservation step, ∘ a state of the vector not aggregated in a grouping being conserved, the parameter representing its probability remaining unchanged, the method including: ∘ several aggregation steps of several distinct groups of several contiguous states of the vector respectively into several groupings of states of the vector, ∘ and/or an aggregation step and a conservation step.