← 研踪 PaperTrailarXiv:2610.02068 · v3
Sequential Capacity of Quantum Processes with Finite Memory
首次提交 2026-10-02 01:08
版本更新 2026-11-08 14:31
雷达观测 2026-11-10 12:16
摘要
How complex can the responses of a quantum process become as it runs longer with fixed internal memory? We measure this complexity by sequential response capacity, the depth of an adaptive tree of experiments whose acceptance probabilities separate possible processes by a prescribed gap. Each experiment uses a fresh complete run, and one fixed process must realize every response along a path. For any fixed common visible dimension of at least two and internal memory cap, we prove that capacity has order $K\log((K+1)/γ)$ for $K$ transitions per run and probability gap $0<γ\leq1$. Time-dependent single-qubit phase channels without internal memory already attain the fixed-gap $K\log K$ growth, realizing each path with zero-or-one response probabilities. Under the same tester permissions, classical stochastic processes that measure in a fixed basis at every transition have only linear capacity at fixed dimensions and gap. For phase sequences selected by a classical address stored inside the process, we then quantify how known independent Pauli noise changes this logarithmic enhancement. With ideal tester controls and weak residual phase noise after correction, we prove matching capacity bounds at a fixed small gap. At fixed address size and fixed positive residual noise, the logarithmic enhancement saturates once the phase-sequence length exceeds the inverse noise scale, and capacity then grows linearly with sequence length.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v3 · 2026-11-08 14:31 · 最新观测版本
Sequential Capacity of Quantum Processes with Finite Memory
How complex can the responses of a quantum process become as it runs longer with fixed internal memory? We measure this complexity by sequential response capacity, the depth of an adaptive tree of experiments whose acceptance probabilities separate possible processes by a prescribed gap. Each experiment uses a fresh complete run, and one fixed process must realize every response along a path. For any fixed common visible dimension of at least two and internal memory cap, we prove that capacity has order $K\log((K+1)/γ)$ for $K$ transitions per run and probability gap $0<γ\leq1$. Time-dependent single-qubit phase channels without internal memory already attain the fixed-gap $K\log K$ growth, realizing each path with zero-or-one response probabilities. Under the same tester permissions, classical stochastic processes that measure in a fixed basis at every transition have only linear capacity at fixed dimensions and gap. For phase sequences selected by a classical address stored inside the process, we then quantify how known independent Pauli noise changes this logarithmic enhancement. With ideal tester controls and weak residual phase noise after correction, we prove matching capacity bounds at a fixed small gap. At fixed address size and fixed positive residual noise, the logarithmic enhancement saturates once the phase-sequence length exceeds the inverse noise scale, and capacity then grows linearly with sequence length.
查看此版本解读 →查看此版本原文 ↗