Superpolynomial lower bounds for general homogeneous depth 4 arithmetic circuits

In this paper, we prove superpolynomial lower bounds for the class of homogeneous depth 4 arithmetic circuits. We give an explicit polynomial in VNP of degree $n$ in $n^2$ variables such that any homogeneous depth 4 arithmetic circuit computing it must have size $n^{\Omega(\log \log n)}$. Our results extend the works of Nisan-Wigderson [NW95] (which showed superpolynomial lower bounds for homogeneous depth 3 circuits), Gupta-Kamath-Kayal-Saptharishi and Kayal-Saha-Saptharishi [GKKS13, KSS13] (which showed superpolynomial lower bounds for homogeneous depth 4 circuits with bounded bottom fan-in), Kumar-Saraf [KS13a] (which showed superpolynomial lower bounds for homogeneous depth 4 circuits with bounded top fan-in) and Raz-Yehudayoff and Fournier-Limaye-Malod-Srinivasan [RY08, FLMS13] (which showed superpolynomial lower bounds for multilinear depth 4 circuits). Several of these results in fact showed exponential lower bounds. The main ingredient in our proof is a new complexity measure of {\it bounded support} shifted partial derivatives. This measure allows us to prove exponential lower bounds for homogeneous depth 4 circuits where all the monomials computed at the bottom layer have {\it bounded support} (but possibly unbounded degree/fan-in), strengthening the results of Gupta et al and Kayal et al [GKKS13, KSS13]. This new lower bound combined with a careful "random restriction" procedure (that transforms general depth 4 homogeneous circuits to depth 4 circuits with bounded support) gives us our final result

Long-range entanglement generation via frequent measurements

A method is introduced whereby two non-interacting quantum subsystems, that each interact with a third subsystem, are entangled via repeated projective measurements of the state of the third subsystem. A variety of physical examples are presented. The method can be used to establish long range entanglement between distant parties in one parallel measurement step, thus obviating the need for entanglement swapping.Comment: 7 pages, incl. 2 figures. v2: added a few small clarifications and a referenc

On the "Matsubara heating" of overtone intensities and Fermi splittings.

Classical molecular dynamics (MD) and imaginary-time path-integral dynamics methods underestimate the infrared absorption intensities of overtone and combination bands by typically an order of magnitude. Plé et al. [J. Chem. Phys. 155, 2863 (2021)] have shown that this is because such methods fail to describe the coupling of the centroid to the Matsubara dynamics of the fluctuation modes; classical first-order perturbation theory (PT) applied to the Matsubara dynamics is sufficient to recover most of the lost intensity in simple models and gives identical results to quantum (Rayleigh-Schrödinger) PT. Here, we show numerically that the results of this analysis can be used as post-processing correction factors, which can be applied to realistic (classical MD or path-integral dynamics) simulations of infrared spectra. We find that the correction factors recover most of the lost intensity in the overtone and combination bands of gas-phase water and ammonia and much of it for liquid water. We then re-derive and confirm the earlier PT analysis by applying canonical PT to Matsubara dynamics, which has the advantage of avoiding secular terms and gives a simple picture of the perturbed Matsubara dynamics in terms of action-angle variables. Collectively, these variables "Matsubara heat" the amplitudes of the overtone and combination vibrations of the centroid to what they would be in a classical system with the oscillators (of frequency Ωi) held at their quantum effective temperatures [of ℏΩi coth(βℏΩi/2)/2kB]. Numerical calculations show that a similar neglect of "Matsubara heating" causes path-integral methods to underestimate Fermi resonance splittings

Simple extractors via constructions of cryptographic pseudo-random generators

Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-random generators from one-way permutations (the Blum-Micali-Yao approach) can be used for building extractors as well. Using this new technique we build extractors that do not use designs and polynomial-based error-correcting codes and that are very simple and efficient. For example, one extractor produces each output bit separately in $O(\log^2 n)$ time. These extractors work for weak sources with min entropy $\lambda n$, for arbitrary constant $\lambda > 0$, have seed length $O(\log^2 n)$, and their output length is $\approx n^{\lambda/3}$.Comment: 21 pages, an extended abstract will appear in Proc. ICALP 2005; small corrections, some comments and references adde

On the NP-Hardness of Approximating Ordering Constraint Satisfaction Problems

We show improved NP-hardness of approximating Ordering Constraint Satisfaction Problems (OCSPs). For the two most well-studied OCSPs, Maximum Acyclic Subgraph and Maximum Betweenness, we prove inapproximability of $14/15+\epsilon$ and $1/2+\epsilon$. An OCSP is said to be approximation resistant if it is hard to approximate better than taking a uniformly random ordering. We prove that the Maximum Non-Betweenness Problem is approximation resistant and that there are width-$m$ approximation-resistant OCSPs accepting only a fraction $1 / (m/2)!$ of assignments. These results provide the first examples of approximation-resistant OCSPs subject only to P $\neq$ \NP

Speeding up the Detection of Adsorbate Lateral Interactions in Graph-Theoretical Kinetic Monte Carlo Simulations

Kinetic Monte Carlo (KMC) has become an indispensable tool in heterogeneous catalyst discovery, but realistic simulations remain computationally demanding on account of the need to capture complex and long-range lateral interactions between adsorbates. The Zacros software package (https://zacros.org) adopts a graph-theoretical cluster expansion (CE) framework that allows such interactions to be computed with a high degree of generality and fidelity. This involves solving a series of subgraph isomorphism problems in order to identify relevant interaction patterns in the lattice. In an effort to reduce the computational burden, we have adapted two well-known subgraph isomorphism algorithms, namely, VF2 and RI, for use in KMC simulations and implemented them in Zacros. To benchmark their performance, we simulate a previously established model of catalytic NO oxidation, treating the O* lateral interactions with a series of progressively larger CEs. For CEs with long-range interactions, VF2 and RI are found to provide impressive speedups relative to simpler algorithms. RI performs best, giving speedups reaching more than 150× when combined with OpenMP parallelization. We also simulate a recently developed methane cracking model, showing that RI offers significant improvements in performance at high surface coverages

Counting dependent and independent strings

The paper gives estimations for the sizes of the the following sets: (1) the set of strings that have a given dependency with a fixed string, (2) the set of strings that are pairwise \alpha independent, (3) the set of strings that are mutually \alpha independent. The relevant definitions are as follows: C(x) is the Kolmogorov complexity of the string x. A string y has \alpha -dependency with a string x if C(y) - C(y|x) \geq \alpha. A set of strings {x_1, \ldots, x_t} is pairwise \alpha-independent if for all i different from j, C(x_i) - C(x_i | x_j) \leq \alpha. A tuple of strings (x_1, \ldots, x_t) is mutually \alpha-independent if C(x_{\pi(1)} \ldots x_{\pi(t)}) \geq C(x_1) + \ldots + C(x_t) - \alpha, for every permutation \pi of [t]

Performance issues with photonic beamformers

A photonic beamformer is presented, having smooth behavior. Third-order nonlinearities, resulting from its optoelectronic components, are investigated, with emphasis on their impact on the contrast of imaging radars. This contrast is shown to be severely limited by the induced RF nonlinearities. Limitations on the allowable modulation index are studied for linearly-chirped pulses returned from clutter

A quantum central limit theorem for non-equilibrium systems: Exact local relaxation of correlated states

We prove that quantum many-body systems on a one-dimensional lattice locally relax to Gaussian states under non-equilibrium dynamics generated by a bosonic quadratic Hamiltonian. This is true for a large class of initial states - pure or mixed - which have to satisfy merely weak conditions concerning the decay of correlations. The considered setting is a proven instance of a situation where dynamically evolving closed quantum systems locally appear as if they had truly relaxed, to maximum entropy states for fixed second moments. This furthers the understanding of relaxation in suddenly quenched quantum many-body systems. The proof features a non-commutative central limit theorem for non-i.i.d. random variables, showing convergence to Gaussian characteristic functions, giving rise to trace-norm closeness. We briefly relate our findings to ideas of typicality and concentration of measure.Comment: 27 pages, final versio

Impossibility of independence amplification in Kolmogorov complexity theory

The paper studies randomness extraction from sources with bounded independence and the issue of independence amplification of sources, using the framework of Kolmogorov complexity. The dependency of strings $x$ and $y$ is ${\rm dep}(x,y) = \max\{C(x) - C(x \mid y), C(y) - C(y\mid x)\}$, where $C(\cdot)$ denotes the Kolmogorov complexity. It is shown that there exists a computable Kolmogorov extractor $f$ such that, for any two $n$-bit strings with complexity $s(n)$ and dependency $\alpha(n)$, it outputs a string of length $s(n)$ with complexity $s(n)- \alpha(n)$ conditioned by any one of the input strings. It is proven that the above are the optimal parameters a Kolmogorov extractor can achieve. It is shown that independence amplification cannot be effectively realized. Specifically, if (after excluding a trivial case) there exist computable functions $f_1$ and $f_2$ such that ${\rm dep}(f_1(x,y), f_2(x,y)) \leq \beta(n)$ for all $n$-bit strings $x$ and $y$ with ${\rm dep}(x,y) \leq \alpha(n)$, then $\beta(n) \geq \alpha(n) - O(\log n)$