MétaCan
Menu
Back to cohort
Record W4410885605 · doi:10.1117/12.3062823

Comparative analysis of projector‐based compression and quantum autoencoders

2025· article· en· W4410885605 on OpenAlexaff
Alexei Kaltchenko, R. Chakrabarti, Wrenen D'Cunha

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicMolecular Communication and Nanonetworks
Canadian institutionsWilfrid Laurier University
Fundersnot available
KeywordsProjectorComputer scienceCompression (physics)QuantumArtificial intelligenceComputer visionData compressionComputer graphics (images)Materials sciencePhysicsComposite material

Abstract

fetched live from OpenAlex

Quantum compression is a cornerstone of quantum information science, promising efficient encoding of large quantum states into fewer qubits while retaining high fidelity. In this work, we compare two pivotal strategies for compressing an i.i.d. quantum source under small-scale (few-qubit) regimes. The first strategy relies on a projector-based compression method that discards low-probability components in the state’s spectral decomposition, achieving near-optimal asymptotic compression in principle. The second strategy employs a quantum autoencoder (QAE), a variational circuit that learns to embed essential information into fewer qubits. We implement both approaches in simulation, gauge their performance, and explore how many qubits can be ”saved” in practice. Our results highlight how projector-based compression provides a near-optimal yet analytically prescriptive solution, whereas autoencoders offer a machine-learning–style route that can adapt to varied input states.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.850
Threshold uncertainty score0.181

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.019
GPT teacher head0.286
Teacher spread0.267 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same topicMolecular Communication and NanonetworksFrench-language works237,207