Pith. sign in

REVIEW 8 cited by

Image compression and entanglement

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv quant-ph/0510031 v1 pith:OKES6OHP submitted 2005-10-04 quant-ph cs.MM

classification quant-phcs.MM
keywords compressionimageentanglementrepresentationresultingstateaddingaddressing
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

The pixel values of an image can be casted into a real ket of a Hilbert space using an appropriate block structured addressing. The resulting state can then be rewritten in terms of its matrix product state representation in such a way that quantum entanglement corresponds to classical correlations between different coarse-grained textures. A truncation of the MPS representation is tantamount to a compression of the original image. The resulting algorithm can be improved adding a discrete Fourier transform preprocessing and a further entropic lossless compression.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Quantum State Preparation via Neural Network Encoding in Quantum Machine Learning

    quant-ph 2026-05 unverdicted novelty 7.0 of 10

    A neural network is trained to predict parameters of a fixed quantum circuit, enabling high-fidelity quantum state preparation from classical data in one inference step with up to 0.992 fidelity on unseen MNIST and Fa...

  2. Preparation Circuits for Matrix Product States by Classical Variational Disentanglement

    quant-ph 2025-04 unverdicted novelty 7.0 of 10

    A layer-by-layer classical variational disentanglement algorithm compiles preparation circuits for matrix product states by minimizing bipartite entanglement to reduce bond dimensions.

  3. Scaling Quantum Machine Learning without Tricks: Full-Resolution and Diverse Image Generation

    quant-ph 2026-02 conditional novelty 6.0 of 10

    A single end-to-end quantum generator using an image-tailored circuit and learnable multimodal noise achieves state-of-the-art simulated FID scores on full MNIST and Fashion-MNIST without tricks.

  4. Quantics Tensor Train for solving Gross-Pitaevskii equation

    cond-mat.quant-gas 2025-07 conditional novelty 6.0 of 10

    A quantics tensor train framework solves the 1D Gross-Pitaevskii equation, including multi-species and long-range interactions, with polylogarithmic scaling of storage and operations.

  5. Solving MNIST with a globally trained Mixture of Quantum Experts

    quant-ph 2025-05 conditional novelty 6.0 of 10

    A globally trained mixture of 16 quantum experts classifies full-resolution MNIST parity with 97.5% test accuracy using 10 qubits, and joint training improves compute-efficiency until saturation.

  6. Compression-Driven Anomaly Detection in Brain MRI Using an Interpretable Quantum Autoencoder

    quant-ph 2026-06 unverdicted novelty 5.0 of 10

    A variational quantum autoencoder detects anomalies in brain MRI by scoring resistance to compression, reporting slice-level ROC-AUC of 0.95 and outperforming classical autoencoders and PCA on public datasets.

  7. Technical report on a quantum-inspired solver for simulating compressible flows

    physics.flu-dyn 2025-06 reject novelty 5.0 of 10

    A tensor-network solver for compressible flows is proposed with polylog scaling claims, but the 2D implementation does not converge and only the 1D Sod shock tube case matches the reference solution.

  8. SeeMPS: A Python-based Matrix Product State and Tensor Train Library

    quant-ph 2026-01 conditional novelty 4.0 of 10

    SeeMPS is a Python MPS/TT library offering a BLAS/LAPACK-style API for compressed linear algebra, from DMRG and time evolution to PDE solving and Fourier transforms.

Pith tools