We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability(Q2SAT)problem,which is a generalization of 2-satisfiability(2SAT)problem.For a Q2SAT problem,we construct the Hamiltonian which is similar...We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability(Q2SAT)problem,which is a generalization of 2-satisfiability(2SAT)problem.For a Q2SAT problem,we construct the Hamiltonian which is similar to that of a Heisenberg chain.All the solutions of the given Q2SAT problem span the subspace of the degenerate ground states.The Hamiltonian is adiabatically evolved so that the system stays in the degenerate subspace.Our numerical results suggest that the time complexity of our algorithm is O(n^(3.9))for yielding non-trivial solutions for problems with the number of clauses m=dn(n-1)/2(d■0.1).We discuss the advantages of our algorithm over the known quantum and classical algorithms.展开更多
为了实现对存在传入风险的南非2型(South African type 2, SAT2)口蹄疫病毒的早期发现、精准鉴定和有效预警,本研究基于SAT2型口蹄疫病毒毒株IRAN/2024和ETH/2022完整VP1基因序列,构建了pUC57-IRAN-VP1、pUC57-ETH-VP1质粒;参考SAT2型...为了实现对存在传入风险的南非2型(South African type 2, SAT2)口蹄疫病毒的早期发现、精准鉴定和有效预警,本研究基于SAT2型口蹄疫病毒毒株IRAN/2024和ETH/2022完整VP1基因序列,构建了pUC57-IRAN-VP1、pUC57-ETH-VP1质粒;参考SAT2型口蹄疫病毒VP1基因序列设计并筛选特异性引物,以所构建的质粒为模板,建立了SAT2型口蹄疫病毒特异性RT-PCR检测方法,并开展敏感性试验、特异性试验。敏感性试验结果显示,该方法可以检测质量浓度低至1 pg/mL的质粒DNA。特异性试验结果显示,该方法对伪狂犬病毒、猪繁殖与呼吸综合征病毒、乙型脑炎病毒、猪瘟病毒、1型蓝舌病病毒、牛病毒性腹泻病毒、山羊痘病毒、阿卡斑病毒、流行性出血热病毒等常见病毒的核酸,以及参试的O型和A型口蹄疫病毒(PanAsia、Cathay、Mya98、Ind2001-1、Ind2001-2、AKT-Ⅲ、Sea-97毒株)核酸均无交叉反应。应用该方法对2023年云南边境地区50份牛食道-咽部分泌物样品进行核酸检测,检测结果与RT-qPCR检测结果一致。本研究建立的SAT2型口蹄疫病毒特异性RT-PCR检测方法具有一定的实用性,为口蹄疫疫情防控提供技术支撑。展开更多
基金Project supported by the National Key R&D Program of China(Grant Nos.2017YFA0303302 and 2018YFA0305602)the National Natural Science Foundation of China(Grant No.11921005)Shanghai Municipal Science and Technology Major Project,China(Grant No.2019SHZDZX01)。
文摘We present a quantum adiabatic algorithm for a set of quantum 2-satisfiability(Q2SAT)problem,which is a generalization of 2-satisfiability(2SAT)problem.For a Q2SAT problem,we construct the Hamiltonian which is similar to that of a Heisenberg chain.All the solutions of the given Q2SAT problem span the subspace of the degenerate ground states.The Hamiltonian is adiabatically evolved so that the system stays in the degenerate subspace.Our numerical results suggest that the time complexity of our algorithm is O(n^(3.9))for yielding non-trivial solutions for problems with the number of clauses m=dn(n-1)/2(d■0.1).We discuss the advantages of our algorithm over the known quantum and classical algorithms.
