17 citations · 24 across the 5 of their papers we have counts for
5 papers
Quantum speed-up in solving the maximal clique problem
Weng-Long Chang, Qi Yu, Zhaokai Li +3
The maximal clique problem, to find the maximally sized clique in a given graph, is classically an NP-complete computational problem, which has potential applications ranging from…
Quantum Algorithms of Solving the Backtracking of One-dimensional Cellular Automata
Weng-Long Chang, Mang Feng, Kawuu Weicheng Lin +2
In [Wolfram 1982; Wolfram 1983; Wolfram 2002], the backtracking of one-dimensional cellular automata is to find out which of the 2n possible initial configurations of width n evolv…
Quantum Algorithms of Bio-molecular Solutions for the Clique Problem on a Quantum Computer
Weng-Long Chang, Ting-Ting Ren, Mang Feng +4
In this paper, it is demonstrated that the DNA-based algorithm [Ho et al. 2005] for solving an instance of the clique problem to any a graph G = (V, E) with n vertices and p edges…
Solution to Satisfiability problem by a complete Grover search with trapped ions
W. L. Yang, H. Wei, F. Zhou +2
The main idea in the original Grover search (Phys. Rev. Lett. 79, 325 (1997)) is to single out a target state containing the solution to a search problem by amplifying the amplitud…
Quantum mechanical NMR implementation of DNA algorithm for satisfiability problem
T. T. Ren, M. Feng, W. -L. Chang +2
DNA computation could in principle solve the satisfiability (SAT) problem due to the operations in parallel on extremely large numbers of strands. We demonstrate some quantum gates…