Murakami Compressor Suite: Compression as Search (Probe→Final) with SSIM/VMAF and QAOA(p=1) Circuit Simulation (Classical)

Murakami Compressor Suite treats media compression as an optimization problem—compression as search—instead of selecting fixed presets.It uses a practical Probe→Final strategy: evaluate many candidates cheaply on a probe (downscaled images or the first seconds of audio/video), then perform the full encode only once using the best candidate. Quality is constrained by perceptual metrics: SSIM for images, and VMAF (or SSIM) for video probes when available via FFmpeg.Exploration is improved by (1) quantum-inspired phase interference sampling (amplitude accumulation and |amp|²-based selection) and (2) a QAOA(p=1) circuit simulation that converts an energy landscape C(z) over discrete codec parameters into a proposal distribution P(z) to prioritize top-K candidates. Important: this work does not claim quantum speedup. The QAOA component is a classical statevector simulation used to bias candidate selection, combined with heuristic/random exploration. Keywords: compression-as-search, Probe→Final, SSIM, VMAF, FFmpeg, quantum-inspired sampling, QAOA(p=1) classical simulation.

Authors

Publication Details

Journal
Zenodo (CERN European Organization for Nuclear Research)
Published
2026-02-05
DOI
https://doi.org/10.5281/zenodo.18489982
Primary Topic
Quantum Computing Algorithms and Architecture
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Murakami Compressor Suite: Compression as Search (Probe→Final) with SSIM/VMAF and QAOA(p=1) Circuit Simulation (Classical)

Hideyoshi Murakami
Zenodo (CERN European Organization for Nuclear Research)
Quantum Computing Algorithms and Architecture
article

Murakami Compressor Suite: Compression as Search (Probe→Final) with SSIM/VMAF and QAOA(p=1) Circuit Simulation (Classical)

Hideyoshi Murakami
article en

Abstract

Murakami Compressor Suite treats media compression as an optimization problem—compression as search—instead of selecting fixed presets.It uses a practical Probe→Final strategy: evaluate many candidates cheaply on a probe (downscaled images or the first seconds of audio/video), then perform the full encode only once using the best candidate. Quality is constrained by perceptual metrics: SSIM for images, and VMAF (or SSIM) for video probes when available via FFmpeg.Exploration is improved by (1) quantum-inspired phase interference sampling (amplitude accumulation and |amp|²-based selection) and (2) a QAOA(p=1) circuit simulation that converts an energy landscape C(z) over discrete codec parameters into a proposal distribution P(z) to prioritize top-K candidates. Important: this work does not claim quantum speedup. The QAOA component is a classical statevector simulation used to bias candidate selection, combined with heuristic/random exploration. Keywords: compression-as-search, Probe→Final, SSIM, VMAF, FFmpeg, quantum-inspired sampling, QAOA(p=1) classical simulation.

Zenodo (CERN European Organization for Nuclear Research)
Affordable and clean energy
Openalex Percentile: Top 67%
Quantum Computing Algorithms and Architecture
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Murakami Compressor Suite: Compression as Search (Probe→Final) with SSIM/VMAF and QAOA(p=1) Circuit Simulation (Classical) — Hideyoshi Murakami · Zenodo (CERN European Organization for Nuclear Research) (2026) | TGRS Research Map | TGRS