The delegating private quantum computation(DQC)protocol with the universal quantum gate set{X,Z,H,P,R,CNOT}was firstly proposed by Broadbent et al.[Broadbent(2015)],and then Tan et al.[Tan and Zhou(2017)]tried to put ...The delegating private quantum computation(DQC)protocol with the universal quantum gate set{X,Z,H,P,R,CNOT}was firstly proposed by Broadbent et al.[Broadbent(2015)],and then Tan et al.[Tan and Zhou(2017)]tried to put forward a half-blind DQC protocol(HDQC)with another universal set{H,P,CNOT,T}.However,the decryption circuit of Toffoli gate(i.e.T)is a little redundant,and Tan et al.’s protocol[Tan and Zhou(2017)]exists the information leak.In addition,both of these two protocols just focus on the blindness of data(i.e.the client’s input and output),but do not consider the blindness of computation(i.e.the delegated quantum operation).For solving these problems,we propose a full-blind DQC protocol(FDQC)with quantum gate set{H,P,CNOT,T},where the desirable delegated quantum operation,one of{H,P,CNOT,T},is replaced by a fixed sequence(H,P,CZ,CNOT,T)to make the computation blind,and the decryption circuit of Toffoli gate is also optimized.Analysis shows that our protocol can not only correctly perform any delegated quantum computation,but also holds the characteristics of data blindness and computation blindness.展开更多
Problems about density are remarkable in the theory of degrees of unsolvability. Owing to their difficulty few results have been obtained till now. Sacks 1964 showed that the r. e. degrees are dense; Fejer 1980 showed...Problems about density are remarkable in the theory of degrees of unsolvability. Owing to their difficulty few results have been obtained till now. Sacks 1964 showed that the r. e. degrees are dense; Fejer 1980 showed that nonbraching degrees are dense in the r.e. degrees, this is the first nontrivial definable subset of the degrees known to be dense.展开更多
For high school students in Shanghai, this year's college admission process is a bit different from that in previous years. Locally based Fudan University and Shanghai Jiaotong University (Jiaoda) have been allowe...For high school students in Shanghai, this year's college admission process is a bit different from that in previous years. Locally based Fudan University and Shanghai Jiaotong University (Jiaoda) have been allowed to make some changes in their enrollment procedures. In addition to taking an independently designed entrance展开更多
基金This work is supported by the National Nature Science Foundation of China(Grant Nos.61502101 and 61501247)the Natural Science Foundation of Jiangsu Province,China(Grant No.BK20171458)+4 种基金the Six Talent Peaks Project of Jiangsu Province,China(Grant No.2015-XXRJ-013)the Natural science Foundation for colleges and universities of Jiangsu Province,China(Grant No.16KJB520030)the Research Innovation Program for College Graduates of Jiangsu Province,China(Grant No.KYCX17_0902)the Practice Innovation Training Program Projects for the Jiangsu College Students(Grant No.201810300016Z)and the Priority Academic Program Development of Jiangsu Higher Education Institutions(PAPD).
文摘The delegating private quantum computation(DQC)protocol with the universal quantum gate set{X,Z,H,P,R,CNOT}was firstly proposed by Broadbent et al.[Broadbent(2015)],and then Tan et al.[Tan and Zhou(2017)]tried to put forward a half-blind DQC protocol(HDQC)with another universal set{H,P,CNOT,T}.However,the decryption circuit of Toffoli gate(i.e.T)is a little redundant,and Tan et al.’s protocol[Tan and Zhou(2017)]exists the information leak.In addition,both of these two protocols just focus on the blindness of data(i.e.the client’s input and output),but do not consider the blindness of computation(i.e.the delegated quantum operation).For solving these problems,we propose a full-blind DQC protocol(FDQC)with quantum gate set{H,P,CNOT,T},where the desirable delegated quantum operation,one of{H,P,CNOT,T},is replaced by a fixed sequence(H,P,CZ,CNOT,T)to make the computation blind,and the decryption circuit of Toffoli gate is also optimized.Analysis shows that our protocol can not only correctly perform any delegated quantum computation,but also holds the characteristics of data blindness and computation blindness.
文摘Problems about density are remarkable in the theory of degrees of unsolvability. Owing to their difficulty few results have been obtained till now. Sacks 1964 showed that the r. e. degrees are dense; Fejer 1980 showed that nonbraching degrees are dense in the r.e. degrees, this is the first nontrivial definable subset of the degrees known to be dense.
文摘For high school students in Shanghai, this year's college admission process is a bit different from that in previous years. Locally based Fudan University and Shanghai Jiaotong University (Jiaoda) have been allowed to make some changes in their enrollment procedures. In addition to taking an independently designed entrance
