Research map / Probabilistic and scientific modeling / Variational and generative sampling
Toward the Goldilocks Blind Compression of Quantum States
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Shows that k encoder ancillas and n decoder ancillas universally suffice for optimal CPTP blind single-copy quantum state compression under infidelity, that the encoder threshold is sharp, and that isometric decoders are not universally optimal, though numerically near-optimal.
Problem
Minimal circuit width (ancilla counts) for quantum autoencoders to reach the information-theoretic optimum of blind single-copy compression of pure quantum states through a k-qubit bottleneck under average infidelity.
Approach
Shows that a QAE with k encoder ancillas and n decoder ancillas achieves the optimum over all CPTP encoder-decoder pairs, via extreme-point (Choi rank) arguments and Stinespring-style padding, and that k encoder ancillas are necessary in the worst case, while isometric decoders can be suboptimal.
Key results
- Theorem: for every pure-state source, an (n,k,k,n)-QAE attains the optimal CPTP fidelity; encoder threshold k is worst-case necessary.
- Proposition: for the phase-family source with n=2, k=1, isometric decoders achieve fidelity strictly below 3/4 while a CPTP decoder reaches at least 3/4.
- Numerically on MNIST-encoded states, isometric (n_E=n-k) and n_E=n-k+1 decoders show no noticeable infidelity difference, while gap to conventional QAE is clear.
Surprising findings
- Isometric decoders, though sufficient in many analytic and numerical cases, are not universally optimal for blind compression under infidelity.
- Numerical gap between isometric and non-isometric decoders is practically negligible despite the analytical counterexample.
Limitations
- Restricted to blind single-copy compression of pure states with infidelity loss; other objectives not covered.
- Empirical validation uses engineered datasets (MNIST-encoded, synthetic families) rather than physical many-body states.
- Tight universal decoder ancilla lower bound as function of n and k remains open beyond k=1.
Experimental setup
Datasets: MNIST
Benchmarks: MNIST-encoded quantum states mu_{1,0.1} source family
Metrics: average infidelity trace distance
Baselines: conventional QAE (n,k,0,n-k) zeta-QVAE isometric decoder
Builds on: Quantum autoencoder (Romero et al. 2017) Stinespring dilation Choi-Jamiolkowski representation Ruskai-Werner-Zhang extreme channels zeta-QVAE (Wang et al. 2025)
Closest papers by meaning
- Purest Quantum State Identification (NeurIPS 2025 · similarity 0.86)
- Structured Unitary Tensor Network Representations for Circuit-Efficient Quantum Data Encoding (NeurIPS 2026 · similarity 0.85)
- Online Learning of Pure States is as Hard as Mixed States (NeurIPS 2025 · similarity 0.85)
- Reinforced Learning Explicit Circuit Representations for Quantum State Characterization from Local Measurements (ICML 2025 · similarity 0.84)
- ATP: Adaptive Threshold Pruning for Efficient Data Encoding in Quantum Neural Networks (CVPR 2025 · similarity 0.84)
- Scalable Quantum-Inspired Optimization Through Dynamic Qubit Compression (AAAI 2025 · similarity 0.83)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
