Related papers: Analyzing XOR-Forrelation through stochastic calcu…
The Forrelation problem, introduced by Aaronson [A10] and Aaronson and Ambainis [AA15], is a well studied problem in the context of separating quantum and classical models. Variants of this problem were used to give exponential separations…
After presentations of Raz and Tal's oracle separation of BQP and PH result, several people (e.g. Ryan O'Donnell, James Lee, Avishay Tal) suggested that the proof may be simplified by stochastic calculus. In this short note, we describe…
Aaronson and Ambainis (SICOMP `18) showed that any partial function on $N$ bits that can be computed with an advantage $\delta$ over a random guess by making $q$ quantum queries, can also be computed classically with an advantage $\delta/2$…
We introduce a stochastic fractional calculus. As an application, we present a stochastic fractional calculus of variations, which generalizes the fractional calculus of variations to stochastic processes. A stochastic fractional…
A large class of polarized and unpolarized deep inelastic data is successfully described with Fermi-Dirac functions for the non-diffractive part of quark parton distributions. The NLO approach used here improves the agreement with…
The XOR-satisfiability (XORSAT) problem deals with a system of $n$ Boolean variables and $m$ clauses. Each clause is a linear Boolean equation (XOR) of a subset of the variables. A $K$-clause is a clause involving $K$ distinct variables. In…
An XOR function is a function of the form g(x,y) = f(x + y), for some boolean function f on n bits. We study the quantum and classical communication complexity of XOR functions. In the case of exact protocols, we completely characterise…
Stochastic field equations for linearized gravity are presented. The theory is compared with the usual quantum field theory and questions of Lorentz covariance are discussed. The classical radiation approximation is also presented.
XOR games are a simple computational model with connections to many areas of complexity theory. Perhaps the earliest use of XOR games was in the study of quantum correlations. XOR games also have an interesting connection to Grothendieck's…
We achieve essentially the largest possible separation between quantum and classical query complexities. We do so using a property-testing problem called Forrelation, where one needs to decide whether one Boolean function is highly…
We study the factorization of quasi generalized quark distributions with twist-2 generalized parton distributions. We use an approach which is different than that used in literature. Using the approach we derive the factorization relations…
We study the forrelation problem: given a pair of $n$-bit Boolean functions $f$ and $g$, estimate the correlation between $f$ and the Fourier transform of $g$. This problem is known to provide the largest possible quantum speedup in terms…
The problem 2-Xor-Sat asks for the probability that a random expression, built as a conjunction of clauses $x \oplus y$, is satisfiable. We revisit this classical problem by giving an alternative, explicit expression of this probability. We…
Covariant classical particle dynamics is described, and the associated covariant relativistic particle quantum mechanics is derived. The invariant symmetric bracket is defined on the space of quantum amplitudes, and its relation to a…
This work establishes conditional lower bounds for average-case {\em parity}-counting versions of the problems $k$-XOR, $k$-SUM, and $k$-OV. The main contribution is a set of self-reductions for the problems, providing the first specific…
We study a model of communication complexity that encompasses many well-studied problems, including classical and quantum communication complexity, the complexity of simulating distributions arising from bipartite measurements of shared…
The algorithm of Shor for prime factorization is a hybrid algorithm consisting of a quantum part and a classical part. The main focus of the classical part is a continued fraction analysis. The presentation of this is often short, pointing…
Fractional calculus has been used to describe physical systems with complexity. Here, we show that a fractional calculus approach can restore or include complexity in any physical systems that can be described by partial differential…
We discuss the formation of stochastic fractals and multifractals using the kinetic equation of fragmentation approach. We also discuss the potential application of this sequential breaking and attempt to explain how nature creats fractals.
This is an expository talk written for the Bourbaki Seminar. After a brief introduction, Section 1 discusses in the categorical language the structure of the classical deterministic computations. Basic notions of complexity icluding the…