A novel scheme of quantum state tomography based on quantum algorithms

Abstract

Recently, we try to answer the following question: what will happen to our life if quantum computers can be physically realized. In this research, we explore the impact of quantum algorithms on the time complexity of quantum state tomography based on the linear regression algorithm if quantum states can be efficiently prepared by classical information and quantum algorithms can be implemented on quantum computers. By studying current quantum algorithms based on quantum singular value decomposition (SVE) of calculating matrix multiplication, solving linear equations and eigenvalue and eigenstate estimation and so on, we propose a novel scheme to complete the mission of quantum state tomography. We show the calculation based on our algorithm as an example at last. Although quantum state preparations and extra measurements are indispensable in our quantum algorithm scheme compared with the existing classical algorithm, the time complexity of quantum state tomography can be remarkably declined. For a quantum system with dimension <i>d</i>, the entire quantum scheme can reduce the time complexity of quantum state tomography from <inline-formula><tex-math id="M9">\begin{document}$ O(d^{4}) $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M9.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M9.png"/></alternatives></inline-formula> to <inline-formula><tex-math id="M10">\begin{document}$ O(d\mathrm{poly}\log d) $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M10.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M10.png"/></alternatives></inline-formula> when both the condition number <inline-formula><tex-math id="M11">\begin{document}$ \kappa $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M11.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M11.png"/></alternatives></inline-formula> of related matrices and the reciprocal of precision <inline-formula><tex-math id="M12">\begin{document}$ \varepsilon $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M12.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M12.png"/></alternatives></inline-formula> are <inline-formula><tex-math id="M13">\begin{document}$ O(\mathrm{poly}\log d) $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M13.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M13.png"/></alternatives></inline-formula>, and quantum states of the same order <inline-formula><tex-math id="M14">\begin{document}$ O(d) $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M14.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M14.png"/></alternatives></inline-formula> can be simultaneously prepared. This is in contrast to the observation that quantum algorithms can reduce the time complexity of quantum state tomography to <inline-formula><tex-math id="M20">\begin{document}$O(d^3) $\end{document}</tex-math><alternatives><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M20.jpg"/><graphic xmlns:xlink="http://www.w3.org/1999/xlink" xlink:href="14-20190157_M20.png"/></alternatives></inline-formula> when quantum states can not be efficiently prepared. In other words, the preparing of quantum states efficiently has become a bottleneck constraining the quantum acceleration.