Introduces Linear Chain Logic (LCL) and approximate algorithms to model-check spatial and asymptotic properties of periodic MPS families via their induced completely positive maps.
On the spectral gap of random quantum channels
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In this work, we prove a lower bound on the difference between the first and second singular values of quantum channels induced by random isometries, that is tight in the scaling of the number of Kraus operators. This allows us to give an upper bound on the difference between the first and second largest (in modulus) eigenvalues of random channels with same large input and output dimensions for finite number of Kraus operators $k\geq 169$. Moreover, we show that these random quantum channels are quantum expanders, answering a question posed by Hastings. As an application, we show that ground states of infinite 1D spin chains, which are well-approximated by matrix product states, fulfill a principle of maximum entropy.
fields
quant-ph 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Model Checking Matrix Product States against Linear Chain Logic
Introduces Linear Chain Logic (LCL) and approximate algorithms to model-check spatial and asymptotic properties of periodic MPS families via their induced completely positive maps.