We establish the Stinespring dilation theorem of the link product of quantum channels in two different ways,discuss the discrimination of quantum channels,and show that the distinguishability can be improved by self-l...We establish the Stinespring dilation theorem of the link product of quantum channels in two different ways,discuss the discrimination of quantum channels,and show that the distinguishability can be improved by self-linking each quantum channel n times as n grows.We also find that the maximum value of Uhlmann's theorem can be achieved for diagonal channels.展开更多
Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations.Using the‘sender-receiver’model,we propose quantum algorithms for matrix operations such as matrix-ve...Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations.Using the‘sender-receiver’model,we propose quantum algorithms for matrix operations such as matrix-vector product,matrix-matrix product,the sum of two matrices,and the calculation of determinant and inverse matrix.We encode the matrix entries into the probability amplitudes of the pure initial states of senders.After applying proper unitary transformation to the complete quantum system,the desired result can be found in certain blocks of the receiver’s density matrix.These quantum protocols can be used as subroutines in other quantum schemes.Furthermore,we present an alternative quantum algorithm for solving linear systems of equations.展开更多
基金Project supported by the National Natural Science Foundation of China(Grant Nos.61877054,12031004,and 12271474).
文摘We establish the Stinespring dilation theorem of the link product of quantum channels in two different ways,discuss the discrimination of quantum channels,and show that the distinguishability can be improved by self-linking each quantum channel n times as n grows.We also find that the maximum value of Uhlmann's theorem can be achieved for diagonal channels.
基金supported by the National Natural Science Foundation of China(Grant No.12031004 and Grant No.12271474,61877054)the Fundamental Research Foundation for the Central Universities(Project No.K20210337)+1 种基金the Zhejiang University Global Partnership Fund,188170+194452119/003partially funded by a state task of Russian Fundamental Investigations(State Registration No.FFSG-2024-0002)。
文摘Fundamental matrix operations and solving linear systems of equations are ubiquitous in scientific investigations.Using the‘sender-receiver’model,we propose quantum algorithms for matrix operations such as matrix-vector product,matrix-matrix product,the sum of two matrices,and the calculation of determinant and inverse matrix.We encode the matrix entries into the probability amplitudes of the pure initial states of senders.After applying proper unitary transformation to the complete quantum system,the desired result can be found in certain blocks of the receiver’s density matrix.These quantum protocols can be used as subroutines in other quantum schemes.Furthermore,we present an alternative quantum algorithm for solving linear systems of equations.
