scholarly journals Different adiabatic quantum optimization algorithms for the NP-complete exact cover problem

2011 ◽  
Vol 108 (7) ◽  
pp. E19-E20 ◽  
Author(s):  
V. Choi
2011 ◽  
Vol 11 (7&8) ◽  
pp. 638-648
Author(s):  
Vicky Choi

One of the most important questions in studying quantum computation is: whether a quantum computer can solve NP-complete problems more efficiently than a classical computer? In 2000, Farhi, et al. (Science, 292(5516):472--476, 2001) proposed the adiabatic quantum optimization (AQO), a paradigm that directly attacks NP-hard optimization problems. How powerful is AQO? Early on, van-Dam and Vazirani claimed that AQO failed (i.e. would take exponential time) for a family of 3SAT instances they constructed. More recently, Altshuler, et al. (Proc Natl Acad Sci USA, 107(28): 12446--12450, 2010) claimed that AQO failed also for random instances of the NP-complete Exact Cover problem. In this paper, we make clear that all these negative results are only for a specific AQO algorithm. We do so by demonstrating different AQO algorithms for the same problem for which their arguments no longer hold. Whether AQO fails or succeeds for solving the NP-complete problems (either the worst case or the average case) requires further investigation. Our AQO algorithms for Exact Cover and 3SAT are based on the polynomial reductions to the NP-complete Maximum-weight Independent Set (MIS) problem.


2020 ◽  
Vol 67 ◽  
pp. 509-547
Author(s):  
Maxime Chabert ◽  
Christine Solnon

We introduce the exactCover global constraint dedicated to the exact cover problem, the goal of which is to select subsets such that each element of a given set belongs to exactly one selected subset. This NP-complete problem occurs in many applications, and we more particularly focus on a conceptual clustering application. We introduce three propagation algorithms for exactCover, called Basic, DL, and DL+: Basic ensures the same level of consistency as arc consistency on a classical decomposition of exactCover into binary constraints, without using any specific data structure; DL ensures the same level of consistency as Basic but uses Dancing Links to efficiently maintain the relation between elements and subsets; and DL+ is a stronger propagator which exploits an extra property to filter more values than DL. We also consider the case where the number of selected subsets is constrained to be equal to a given integer variable k, and we show that this may be achieved either by combining exactCover with existing constraints, or by designing a specific propagator that integrates algorithms designed for the NValues constraint. These different propagators are experimentally evaluated on conceptual clustering problems, and they are compared with state-of-the-art declarative approaches. In particular, we show that our global constraint is competitive with recent ILP and CP models for mono-criterion problems, and it has better scale-up properties for multi-criteria problems.


2014 ◽  
Vol 23 (3) ◽  
pp. 030308
Author(s):  
Ying-Yu Zhang ◽  
Li-Li Xu ◽  
Jun-Qing Li

2016 ◽  
Vol 4 ◽  
Author(s):  
MICHAEL BRAUN ◽  
TUVI ETZION ◽  
PATRIC R. J. ÖSTERGÅRD ◽  
ALEXANDER VARDY ◽  
ALFRED WASSERMANN

Let $\mathbb{F}_{q}^{n}$ be a vector space of dimension $n$ over the finite field $\mathbb{F}_{q}$. A $q$-analog of a Steiner system (also known as a $q$-Steiner system), denoted ${\mathcal{S}}_{q}(t,\!k,\!n)$, is a set ${\mathcal{S}}$ of $k$-dimensional subspaces of $\mathbb{F}_{q}^{n}$ such that each $t$-dimensional subspace of $\mathbb{F}_{q}^{n}$ is contained in exactly one element of ${\mathcal{S}}$. Presently, $q$-Steiner systems are known only for $t\,=\,1\!$, and in the trivial cases $t\,=\,k$ and $k\,=\,n$. In this paper, the first nontrivial $q$-Steiner systems with $t\,\geqslant \,2$ are constructed. Specifically, several nonisomorphic $q$-Steiner systems ${\mathcal{S}}_{2}(2,3,13)$ are found by requiring that their automorphism groups contain the normalizer of a Singer subgroup of $\text{GL}(13,2)$. This approach leads to an instance of the exact cover problem, which turns out to have many solutions.


Author(s):  
Chunsheng Gu

Cryptographic multilinear maps have extensive applications. However, current constructions of multilinear maps suffer from the zeroizing attacks. For a candidate construction of multilinear maps described by Garg, Gentry, and Halevi (GGH13), Hu & Jia recently presented an efficient attack, which broke the GGH13-based applications of multipartite key exchange (MPKE) and witness encryption (WE) based on the hardness of 3-exact cover problem. By introducing random matrix, the author presents an improvement of the GGH13 map, which supports the applications for public tools of encoding in the GGH13 map, such as MPKE and WE. The security of the construction depends upon new hardness assumption. Moreover, the author's improvement destroys the structure of the ring element in the principal ideal lattice problem, and avoids potential attacks using algorithm of solving short principal ideal lattice generator.


1992 ◽  
Vol 02 (04) ◽  
pp. 383-416 ◽  
Author(s):  
GORDON WILFONG

Suppose E is a set of labeled points (examples) in some metric space. A subset C of E is said to be a consistent subset ofE if it has the property that for any example e∈E, the label of the closest example in C to e is the same as the label of e. We consider the problem of computing a minimum cardinality consistent subset. Consistent subsets have applications in pattern classification schemes that are based on the nearest neighbor rule. The idea is to replace the training set of examples with as small a consistent subset as possible so as to improve the efficiency of the system while not significantly affecting its accuracy. The problem of finding a minimum size consistent subset of a set of examples is shown to be NP-complete. A special case is described and is shown to be equivalent to an optimal disc cover problem. A polynomial time algorithm for this optimal disc cover problem is then given.


Sign in / Sign up

Export Citation Format

Share Document