Quantum computing is a game-changing technology for global academia,research centers and industries including computational science,mathematics,finance,pharmaceutical,materials science,chemistry and cryptography.Altho...Quantum computing is a game-changing technology for global academia,research centers and industries including computational science,mathematics,finance,pharmaceutical,materials science,chemistry and cryptography.Although it has seen a major boost in the last decade,we are still a long way from reaching the maturity of a full-fledged quantum computer.That said,we will be in the noisy-intermediate scale quantum(NISQ)era for a long time,working on dozens or even thousands of qubits quantum computing systems.An outstanding challenge,then,is to come up with an application that can reliably carry out a nontrivial task of interest on the near-term quantum devices with non-negligible quantum noise.To address this challenge,several near-term quantum computing techniques,including variational quantum algorithms,error mitigation,quantum circuit compilation and benchmarking protocols,have been proposed to characterize and mitigate errors,and to implement algorithms with a certain resistance to noise,so as to enhance the capabilities of near-term quantum devices and explore the boundaries of their ability to realize useful applications.Besides,the development of near-term quantum devices is inseparable from the efficient classical sim-ulation,which plays a vital role in quantum algorithm design and verification,error-tolerant verification and other applications.This review will provide a thorough introduction of these near-term quantum computing techniques,report on their progress,and finally discuss the future prospect of these techniques,which we hope will motivate researchers to undertake additional studies in this field.展开更多
It has been shown that for two different multipartite unitary operations U_1 and U_2, when tr(U_1~?U_2) = 0, they can always be perfectly distinguished by local operations and classical communication in the single-run...It has been shown that for two different multipartite unitary operations U_1 and U_2, when tr(U_1~?U_2) = 0, they can always be perfectly distinguished by local operations and classical communication in the single-run scenario. However, how to find the detailed scheme to complete the local discrimination is still a fascinating problem. In this paper, aiming at some U_1 and U_2 acting on the bipartite and tripartite space respectively, especially for U_1~?U_2 locally unitary equivalent to the high dimensional X-type hermitian unitary matrix V with trV = 0, we put forward the explicit local distinguishing schemes in the single-run scenario.展开更多
基金support from the Youth Talent Lifting Project(Grant No.2020-JCJQ-QT-030)the National Natural Science Foundation of China(Grant Nos.11905294,and 12274464)+7 种基金the China Postdoctoral Science Foundation,and the Open Research Fund from State Key Laboratory of High Performance Computing of China(Grant No.201901-01)support from the National Natural Science Foundation of China(Grant Nos.11805279,12074117,61833010,and 12061131011)support from the Strategic Priority Research Program of Chinese Academy of Sciences(Grant No.XDB28000000)the National Natural Science Foundation of China(Grant Nos.61832003,61872334,and 61801459)the National Natural Science Foundation of China(Grant No.12005015)the National Natural Science Foundation of China(Grant Nos.11974205,and 11774197)the National Key Research and Development Program of China(Grant No.2017YFA0303700)the Key Research and Development Program of Guangdong Province(Grant No.2018B030325002).
文摘Quantum computing is a game-changing technology for global academia,research centers and industries including computational science,mathematics,finance,pharmaceutical,materials science,chemistry and cryptography.Although it has seen a major boost in the last decade,we are still a long way from reaching the maturity of a full-fledged quantum computer.That said,we will be in the noisy-intermediate scale quantum(NISQ)era for a long time,working on dozens or even thousands of qubits quantum computing systems.An outstanding challenge,then,is to come up with an application that can reliably carry out a nontrivial task of interest on the near-term quantum devices with non-negligible quantum noise.To address this challenge,several near-term quantum computing techniques,including variational quantum algorithms,error mitigation,quantum circuit compilation and benchmarking protocols,have been proposed to characterize and mitigate errors,and to implement algorithms with a certain resistance to noise,so as to enhance the capabilities of near-term quantum devices and explore the boundaries of their ability to realize useful applications.Besides,the development of near-term quantum devices is inseparable from the efficient classical sim-ulation,which plays a vital role in quantum algorithm design and verification,error-tolerant verification and other applications.This review will provide a thorough introduction of these near-term quantum computing techniques,report on their progress,and finally discuss the future prospect of these techniques,which we hope will motivate researchers to undertake additional studies in this field.
基金supported by the National Natural Science Foundation of China(Grants Nos.61272057 and 61572081)the Beijing Higher Education Young Elite Teacher Project(Grants Nos.YETP0475 and YETP0477)the Natural Science Foundation of Shaanxi Province of China(Grant No.2015JM6263)
文摘It has been shown that for two different multipartite unitary operations U_1 and U_2, when tr(U_1~?U_2) = 0, they can always be perfectly distinguished by local operations and classical communication in the single-run scenario. However, how to find the detailed scheme to complete the local discrimination is still a fascinating problem. In this paper, aiming at some U_1 and U_2 acting on the bipartite and tripartite space respectively, especially for U_1~?U_2 locally unitary equivalent to the high dimensional X-type hermitian unitary matrix V with trV = 0, we put forward the explicit local distinguishing schemes in the single-run scenario.
