Finding stable models via quantum computation
نویسندگان
چکیده
Quantum computers have the potential to out-perform classical computers—certain quantum algorithms run much faster than any known alternative classical algorithm. For example, Grover showed that a quantum computer can search an unordered list ofN items in timeO( √ N), providing a quadratic speed-up over the classical algorithm. In this paper, we show that we can modify Grover’s search algorithm to give an algorithm that finds stable models of an Answer Set Program with a similar quadratic improvement over the classical algorithm. Marek and Remmel showed that Answer Set Programming (ASP) programs can uniformly solve all NP-search problems, so our quantum algorithm to find stable models of ASP programs also solves all NP-search problems. It follows that Answer Set Programming could provide a programming language for quantum computation.
منابع مشابه
Unifying Quantum Computation with Projective Measurements only and One-Way Quantum Computation
Quantum measurement is universal for quantum computation (Nielsen [4], Raussendorf [7,8]). Two models for performing measurement-based quantum computation exist: the one-way quantum computer was introduced by Briegel and Raussendorf [7], and quantum computation via projective measurements only by Nielsen [4]. The more recent development of this second model is based on state transfers [6] inste...
متن کاملOn the Completeness of Quantum Computation Models
The notion of computability is stable (i.e. independent of the choice of an indexing) over infinite-dimensional vector spaces provided they have a finite “tensorial dimension”. Such vector spaces with a finite tensorial dimension permit to define an absolute notion of completeness for quantum computation models and give a precise meaning to the Church-Turing thesis in the framework of quantum t...
متن کاملRobustness of decoherence-free subspaces for quantum computation
It was shown recently @D. A. Lidar et al., Phys. Rev. Lett. 81, 2594 ~1998!# that within the framework of the semigroup Markovian master equation, decoherence-free ~DF! subspaces exist which are stable to first order in time to a perturbation. Here this result is extended to the non-Markovian regime and generalized. In particular, it is shown that within both the semigroup and the non-Markovian...
متن کاملA quantum-mechanical investigation of functional group effect on 5,5'-disubstituted-1,1'-azobis(tetrazoles)
The present work reports the detailed B3LYP/6-311++G(d,p) study of most stable transand cisconfigurations photoisomerization in the core system of computational photochemistry-the 5,5'-disubstituted-1,1'-azobis (tetrazole) molecules. All computations were carried out in gas phase attemperature 293.15 K and pressure 1 atm. Firstly; the potential energy surface (PES) of the groundstate of the mol...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004