Circuit Size Lower Bounds and #SAT Upper Bounds Through a General Framework

Most of the known lower bounds for binary Boolean circuits with unrestricted depth are proved by the gate elimination method. The most efficient known algorithms for the #SAT problem on binary Boolean circuits use similar case analyses to the ones in gate elimination. Chen and Kabanets recently showed that the known case analyses can also be used to prove average case circuit lower bounds, that is, lower bounds on the size of approximations of an explicit function. In this paper, we provide a general framework for proving worst/average case lower bounds for circuits and upper bounds for #SAT that is built on ideas of Chen and Kabanets. A proof in such a framework goes as follows. One starts by fixing three parameters: a class of circuits, a circuit complexity measure, and a set of allowed substitutions. The main ingredient of a proof goes as follows: by going through a number of cases, one shows that for any circuit from the given class, one can find an allowed substitution such that the given measure of the circuit reduces by a sufficient amount. This case analysis immediately implies an upper bound for #SAT. To~obtain worst/average case circuit complexity lower bounds one needs to present an explicit construction of a function that is a disperser/extractor for the class of sources defined by the set of substitutions under consideration. We show that many known proofs (of circuit size lower bounds and upper bounds for #SAT) fall into this framework. Using this framework, we prove the following new bounds: average case lower bounds of 3.24n and 2.59n for circuits over U_2 and B_2, respectively (though the lower bound for the basis B_2 is given for a quadratic disperser whose explicit construction is not currently known), and faster than 2^n #SAT-algorithms for circuits over U_2 and B_2 of size at most 3.24n and 2.99n, respectively. Here by B_2 we mean the set of all bivariate Boolean functions, and by U_2 the set of all bivariate Boolean functions except for parity and its complement

Continuous area spectrum in regular black hole

We investigate highly damped quasinormal modes of regular black hole coupled to nonlinear electrodynamics. Using the WKB approximation combined with complex-integration technique, we show that the real part of the frequency disappears in the highly damped limit. If we use the Bohr's correspondence principle, the area spectrum of this black hole is continuous. We discuss its implication in the loop quantum gravity.Comment: 5 pages, 1 figure

Renormalization and black hole entropy in Loop Quantum Gravity

Microscopic state counting for a black hole in Loop Quantum Gravity yields a result proportional to horizon area, and inversely proportional to Newton's constant and the Immirzi parameter. It is argued here that before this result can be compared to the Bekenstein-Hawking entropy of a macroscopic black hole, the scale dependence of both Newton's constant and the area must be accounted for. The two entropies could then agree for any value of the Immirzi parameter, if a certain renormalization property holds.Comment: 8 pages; v2: references added, typos corrected, version to appear in CQ

Parallel backtracking with answer memoing for independent and-parallelism

Goal-level Independent and-parallelism (IAP) is exploited by scheduling for simultaneous execution two or more goals which will not interfere with each other at run time. This can be done safely even if such goals can produce múltiple answers. The most successful IAP implementations to date have used recomputation of answers and sequentially ordered backtracking. While in principie simplifying the implementation, recomputation can be very inefficient if the granularity of the parallel goals is large enough and they produce several answers, while sequentially ordered backtracking limits parallelism. And, despite the expected simplification, the implementation of the classic schemes has proved to involve complex engineering, with the consequent difficulty for system maintenance and extensión, while still frequently running into the well-known trapped goal and garbage slot problems. This work presents an alternative parallel backtracking model for IAP and its implementation. The model features parallel out-of-order (i.e., non-chronological) backtracking and relies on answer memoization to reuse and combine answers. We show that this approach can bring significant performance advantages. Also, it can bring some simplification to the important engineering task involved in implementing the backtracking mechanism of previous approaches

Polarization Entangled W State using Parametric Down-Conversion

An experimental scheme for preparing a polarization entangled W states from four photons emitted by parametric down-conversion is proposed. We consider two different configurations and a method of improving the yield by using single photon sources. In the proposed scheme, one uses only linear optical elements and photon detectors, so that this scheme is feasible by current technologies.Comment: 4 pages, 3 figure

A Mild and Efficient Synthesis of Oxindoles: Progress Towards the Synthesis of Welwitindolinone A Isonitrile

The complete carbon skeleton of welwitindolinone A isonitrile has been prepared by using a [2+2] cycloaddition to establish the bicyclo[4.2.0]octane core and a SmI2-mediated intramolecular reductive cyclization between an enone and an aryl isocyanate to stereoselectively install the spiro-oxindole (see scheme; DBU=1,8-diazabicyclo[5.4.0]undec-7-ene)