Related papers: When Six Gates are Not Enough
The paper proposes an implicit (i.e., machine-independent) complexity approach to studying computation by polynomial-size, constant-depth circuits with gates counting modulo a constant through the lens of discrete ordinary differential…
We develop a multi-valued logic for quantum computing for use in multi-level quantum systems, and discuss the practical advantages of this approach for scaling up a quantum computer. Generalizing the methods of binary quantum logic, we…
Consider QBF, the Quantified Boolean Formula problem, as a combinatorial game ruleset. The problem is rephrased as determining the winner of the game where two opposing players take turns assigning values to boolean variables. In this…
The quest for non-commutative matrix multiplication algorithms in small dimensions has seen a lot of recent improvements recently. In particular, the number of scalar multiplications required to multiply two $4\times4$ matrices was first…
Fix a finite group $G$. We study the computational complexity of counting problems of the following flavor: given a group $\Gamma$, count the number of homomorphisms $\Gamma \to G$. Our first result establishes that this problem is…
In this paper, we settle the long-standing open problem of the minimum cost of two-qubit gates for simulating a Toffoli gate. More precisely, we show that five two-qubit gates are necessary. Before our work, it is known that five gates are…
The paper discusses the gate complexity of reversible circuits consisting of NOT, CNOT and 2-CNOT gates. The Shannon gate complexity function $L(n, q)$ for a reversible circuit, implementing a Boolean transformation $f\colon \mathbb Z_2^n…
We give elementary proof that theory $T^1_2(R)$ augmented by the weak pigeonhole principle for all $\Delta^b_1(R)$-definable relations does not prove the bijective pigeonhole principle for $R$. This can be derived from known more general…
Additive Fourier Transform is sdudied. A fast multiplication algorithm for polynomials over the binary field is given. The bit complexity of the algorithm is $O(n(log n)(\log\log n)^2)$.
First of all we give some reasons that "natural proofs" built not a barrier to prove P $\not=$ NP using Boolean complexity. Then we investigate the approximation method for its extension to prove super-polynomial lower bounds for the…
We prove Poisson limit laws for open billiards where the holes are on the boundaries of billiard tables (rather than some abstract holes in the phase space of a billiard). Such holes are of the main interest for billiard systems, especially…
Boolean circuits of McCulloch-Pitts threshold gates are a classic model of neural computation studied heavily in the late 20th century as a model of general computation. Recent advances in large-scale neural computing hardware has made…
A simple way to generate a Boolean function is to take the sign of a real polynomial in $n$ variables. Such Boolean functions are called polynomial threshold functions. How many low-degree polynomial threshold functions are there? The…
We show that if $E$ is an elliptic curve over $\mathbf{Q}$ with a $\mathbf{Q}$-rational isogeny of degree 7, then the image of the 7-adic Galois representation attached to $E$ is as large as allowed by the isogeny, except for the curves…
We study the computational power of polynomial threshold functions, that is, threshold functions of real polynomials over the boolean cube. We provide two new results bounding the computational power of this model. Our first result shows…
Circuit complexity, defined as the minimum circuit size required for implementing a particular Boolean computation, is a foundational concept in computer science. Determining circuit complexity is believed to be a hard computational problem…
We consider the cubic and quartic He'non-Heiles Hamiltonians with additional inverse square terms, which pass the Painleve' test for only seven sets of coefficients. For all the not yet integrated cases we prove the singlevaluedness of the…
Let X be a countably infinite set of real numbers and let Y_x, x \in X, be an independent family of stationary random subsets of the real numbers, e.g. homogeneous Poisson point processes. We give criteria for the a.s. existence of various…
An algorithm is given to efficiently compute $L$-functions with large conductor in a restricted range of the critical strip. Examples are included for about 21000 dihedral Galois representations with conductor near $10^7$. The data shows…
We prove an $\Omega(n^{1-1/k} \log k \ /2^k)$ lower bound on the $k$-party number-in-hand communication complexity of collision-finding. This implies a $2^{n^{1-o(1)}}$ lower bound on the size of tree-like cutting-planes proofs of the bit…