Primitivity for random quantum channels

发布时间:2022-09-21浏览次数:1043

题目:Primitivity for random quantum channels

报告人:白婧(beat365中文官方网站


时间:2022年9月22日(星期四),14:30-15:30

地点:beat365明德楼B区201报告厅


摘要:We have considered the primitive index for random quantum channels, which means the minimal natural number n such that the Choi state/matrix of the n-fold composition of channels is full rank. In the previous work, several upper bounds for the index have been obtained, which can be used to construct the so-called (quantum) Wielandt inequality. We note that the optimal upper bound is still an open problem. In our work, we have shown a generic lower bound for the index when the channels are randomly chosen. Our main method is the graphical Weingarten calculus, introduced by Collins and Nechita. Moreover, our result is closely related to the injectivity of the representation of matrix product states. Perez-Garcia et al. claimed that a similar lower bound for the injectivity could be numerically verified, and our result provides a rigorous proof for their argument.


更多信息:研究生研讨班

Copyright (C)2023 beat365(中文)-唯一官方网站版权所有
人才招聘:
联系我们:
电话:0451-86413107      邮箱:IASM@hit.edu.cn
地址:哈尔滨市南岗区西大直街92号
技术支持:beat365中文官方网站网络安全和信息化办公室