arXiv:2608. 05110v1 Announce Type: cross Abstract: Near-term quantum hardware limits circuit depth and often imposes geometrically local connectivity for quantum generative models, restricting the output distributions accessible to shallow unitary Born models.
By Arunava Majumder, Marius Krumm, Hendrik Poulsen Nautrup, Hans J. Briegel
arXiv:2602.22061v3 Announce Type: replace-cross
Abstract: Generative models for quantum data pose significant challenges but hold immense potential in fields such as chemoinformatics and quantum phys...
By Quoc Hoan Tran, Koki Chinzei, Yasuhiro Endo, Hirotaka Oshima
The paper investigates quantum reservoir computing using highly scrambling quantum systems modeled by high‑order unitary designs. It shows that in noiseless settings, measurement readouts become exponentially concentrated as the reservoir size grows, but this concentration does not worsen with repeated iterations, while memory of early inputs decays exponentially with both reservoir size and iterations. In noisy environments, memory also decays exponentially over time for local noisy channels, and the study introduces new proof techniques for bounding concentration in temporal quantum models. Numerical results indicate that even physical reservoirs, such as an Ising model in a quantum‑chaotic phase, can exhibit exponential concentration, whereas reservoirs in a many‑body localized phase or at the edge of chaos do not.
By Weijie Xiong, Zo\"e Holmes, Armando Angrisani, Yudai Suzuki, Thiparat Chotibut, Supanut Thanasilp
arXiv:2608. 11396v1 Announce Type: cross Abstract: Extracting quantum information from a quantum state is a fundamental task of quantum computation, often requiring the estimation of many non-commuting observables under a finite measurement budget.
By Jun Dai, Olivier Nahman-L\'{e}vesque, Guillaume Rabusseau, Hong-Ye Hu, Cunlu Zhou
arXiv:2411. 19896v2 Announce Type: replace-cross Abstract: Understanding the capabilities of classical simulation methods is key to identifying where quantum computers are advantageous.
By Sacha Lerch, Ricard Puig, Manuel S. Rudolph, Armando Angrisani, Tyson Jones, M. Cerezo, Supanut Thanasilp, Zo\"e Holmes
arXiv:2607. 12780v1 Announce Type: cross Abstract: Quantum circuit optimization for fault-tolerant computing requires exact functional equivalence while minimizing expensive non-Clifford resources such as T gates.
By Mehdi Saeedi, Eddie Richter, Paul Hartke