The accumulation of noise in quantum computers is the dominant issue stymieing push algorithms beyond their classical counterparts. We do not expect to be able afford overhead required for error correction next decade, so meantime we must rely on low-cost, unscalable mitigation techniques bring computing its full potential. This paper presents a new technique based phase estimation that can als...

We present an executable formally verified SAT encoding of ground classical AI planning problems. use the theorem prover Isabelle/HOL to perform verification. experimentally test and show that it can be used for reasonably sized standard benchmarks. also as a reference state-of-the-art SAT-based planner, showing sometimes falsely claims problems have no solutions certain lengths.

As is the case with many theorems in complexity theory, typical proofs of the celebrated Cook-Levin theorem showing the NPcompleteness of satisfiability are based on a clever construction. The Cook-Levin theorem is proved by carefully translating a possible computation of a Turing machine into a boolean expression. As the boolean expression is built, it is “obvious” that it can be satisfied if ...

Verifiable Computation enables a computationally weak client to “outsource” the computation of a function F on various inputs x1, ...,xk to one or more workers. The workers return the result of the function evaluation, e.g., yi = F(xi), as well as a proof that the computation of F was carried out correctly on the given value xi. The verification of the proof should require substantially less co...

Secure multi-party computation (MPC) enables a set of mutually distrusting parties to cooperatively compute, using a cryptographic protocol, a function over their private data. This paper presents WYS, a new domain-specific language (DSL) implementation for writing MPCs. WYS is a Verified, Domain-Specific Integrated Language Extension (VDSILE), a new kind of embedded DSL hosted in F, a fullfeat...