Quantum Markov Chains: Hub-Pruned Estimation for Fashion Recommenders
Or Peretz, Tai Dinh, Michal Koren

TL;DR
This paper explores how shallow quantum circuits can model fashion recommendation Markov chains, showing that removing hub nodes improves quantum-classical agreement and offers practical benchmarking for near-term quantum experiments.
Contribution
It introduces a hub-pruned quantum estimation method for recommendation dynamics, demonstrating improved accuracy and providing a reproducible benchmarking protocol.
Findings
Hub pruning reduces divergence metrics by about half.
State fidelities remain close to unity despite pruning.
Hub pruning enhances quantum-classical agreement at shallow depths.
Abstract
We investigate whether shallow quantum circuits can accurately reproduce the short-horizon dynamics of discrete-time Markov chains derived from fashion electronic-commerce recommendation links. Transition operators are compiled into block-encoded circuits and iterated using fixed-point oblivious amplitude amplification, and amplitude-encoded marginals are used to estimate the classical push-forward. Empirically, colour categories such as black and, to a lesser extent, white function as high-degree hubs that dominate probability flow. Consequently, we assess three chain variants: the full network including all colours, a network without black, and a network without black and white, to quantify the effect of hub pruning under realistic circuit depths and measurement budgets. Across networks aggregated from multiple retailers, hub pruning consistently improves quantum and classical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum many-body systems · Quantum Information and Cryptography
