Related papers: A Counterexample to the Generalized Linial-Nisan C…

It is a longstanding open problem to devise an oracle relative to which BQP does not lie in the Polynomial-Time Hierarchy (PH). We advance a natural conjecture about the capacity of the Nisan-Wigderson pseudorandom generator [NW94] to fool…

The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside the entire polynomial hierarchy, by relating this question to…

Let $p$ be a primer number, $n \geq 3$ and integer. Let $f(X) = X^n + a_{n-1}X^{n-1} + \cdots +a_1 X + a_0 \in \mathbb{F}_p[X]$ be a primitive polynomial of degree $n$. Let $C_f$ be the companion matrix of $f(X)$, and $G$ the companion…

We study the p-adic analogue of the arithmetic Gan-Gross-Prasad (GGP) conjectures for unitary groups. Let $\Pi$ be a conjugate-selfdual cuspidal automorphic representation of GL_{n} x GL_{n+1} over a CM field, which is algebraic of minimal…

Bennett and Gill (1981) showed that P^A != NP^A != coNP^A for a random oracle A, with probability 1. We investigate whether this result extends to individual polynomial-time random oracles. We consider two notions of random oracles:…

The recent paper [F. Arute et al. Nature {\bf 574}, 505 (2019)] considered exact classical sampling of the output probability distribution of the globally depolarized random quantum circuit. In this paper, we show three results. First, we…

We prove an average-case depth hierarchy theorem for Boolean circuits over the standard basis of $\mathsf{AND}$, $\mathsf{OR}$, and $\mathsf{NOT}$ gates. Our hierarchy theorem says that for every $d \geq 2$, there is an explicit…

Theoretical computer scientists have been debating the role of oracles since the 1970's. This paper illustrates both that oracles can give us nontrivial insights about the barrier problems in circuit complexity, and that they need not…

We contribute to the exceptional APN conjecture by showing that no polynomial of degree m = 2 r (2 {\ell} + 1) where gcd(r, {\ell}) 2, r 2, {\ell} 1 with a nonzero second leading coefficient can be APN over infinitely many extensions of the…

In this paper, we completely prove a standard conjecture on the local converse theorem for generic representations of GLn(F), where F is a non-archimedean local field.

The generalized Gauss-Newton (GGN) approximation is often used to make practical Bayesian deep learning approaches scalable by replacing a second order derivative with a product of first order derivatives. In this paper we argue that the…

The generalized Mordell-Lang conjecture (GML) is the statement that the irreducible components of the Zariski closure of a subset of a group of finite rank inside a semi-abelian variety are translates of closed algebraic subgroups. M.…

Generalised Bayesian inference updates prior beliefs using a loss function, rather than a likelihood, and can therefore be used to confer robustness against possible mis-specification of the likelihood. Here we consider generalised Bayesian…

In 1991, Craig Gotsman and Nathan Linial conjectured that for all $n$ and $d$, the average sensitivity of a degree-$d$ polynomial threshold function on $n$ variables is maximized by the degree-$d$ symmetric polynomial which computes the…

The central conjecture of parameterized complexity states that FPT is not equal to W[1], and is generally regarded as the parameterized counterpart to P != NP. We revisit the issue of the plausibility of FPT != W[1], focusing on two…

The probability of necessity (PN), which quantifies the probability that an observed event would not have occurred in the absence of the treatment, is a central estimand in attribution analysis. While PN has been extensively studied for…

We prove two sets of results concerning computational complexity classes. The first concerns a variation of the random oracle hypothesis posed by Bennett and Gill after they showed that relative to a randomly chosen oracle, P not equal NP…

While Bayesian neural networks (BNNs) hold the promise of being flexible, well-calibrated statistical models, inference often requires approximations whose consequences are poorly understood. We study the quality of common variational…

In our previous work, we introduced the Generalised Nonvanishing Conjecture, which generalises several central conjectures in algebraic geometry. In this paper, we derive some surprising nonvanishing results for pluricanonical bundles which…

Belief Propagation (BP) is one of the most popular methods for inference in probabilistic graphical models. BP is guaranteed to return the correct answer for tree structures, but can be incorrect or non-convergent for loopy graphical…