Quantum algorithm for a set of quantum 2SAT problems
Yanglin Hu(胡杨林)1, Zhelun Zhang(张哲伦)1, and Biao Wu(吴飙)1,2,3,†
1 International Center for Quantum Materials, School of Physics, Peking University, Beijing 100871, China; 2 Wilczek Quantum Center, School of Physics and Astronomy, Shanghai Jiao Tong University, Shanghai 200240, China; 3 Collaborative Innovation Center of Quantum Matter, Beijing 100871, China
Abstract 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(n3.9) for yielding non-trivial solutions for problems with the number of clauses m=dn(n-1)/2 (). We discuss the advantages of our algorithm over the known quantum and classical algorithms.
Fund: 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), and Shanghai Municipal Science and Technology Major Project, China (Grant No. 2019SHZDZX01).
Altmetric calculates a score based on the online attention an article receives. Each coloured thread in the circle represents a different type of online attention. The number in the centre is the Altmetric score. Social media and mainstream news media are the main sources that calculate the score. Reference managers such as Mendeley are also tracked but do not contribute to the score. Older articles often score higher because they have had more time to get noticed. To account for this, Altmetric has included the context data for other articles of a similar age.
