Related papers: Complexity of Simon's problem in classical sense
Symbolic Mathematical tasks such as integration often require multiple well-defined steps and understanding of sub-tasks to reach a solution. To understand Transformers' abilities in such tasks in a fine-grained manner, we deviate from…
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box functions, we investigate a more general quantum query model…
We study self-similar solutions of a multi-phase Stefan problem, first in the case of one space variable, and then in the radial multidimensional case. In both these cases we prove that a nonlinear algebraic system for determination of the…
Arithmetic circuit complexity studies the complexity of computing polynomials using only arithmetic operations such as addition, multiplication, subtraction, and division. Polynomials over rings of integers model counting problems.…
Submodular function minimization (SFM) is a fundamental and efficiently solvable problem class in combinatorial optimization with a multitude of applications in various fields. Surprisingly, there is only very little known about constraint…
We show that a qubit can be used to substitute for an arbitrarily large number of classical bits. We consider a physical system S interacting locally with a classical field phi(x) as it travels directly from point A to point B. The field…
We discuss two topics that are usually considered to be exclusively "quantum": the Schroedinger equation, and the uncertainty principle. We show (or rather recall) that the Schroedinger equation can be derived from Hamilton's equations…
In a classical case, orthogonal polynomial sequences are in such a way that the $ n $th polynomial has the exact degree $n$. Such sequences are complete and form a basis of the space for any arbitrary polynomial. In this paper, we introduce…
We explore a particular way of reformulating quantum theory in classical terms, starting with phase space rather than Hilbert space, and with actual probability distributions rather than quasiprobabilities. The classical picture we start…
A striking pathology of semidefinite programs (SDPs) is illustrated by a classical example of Khachiyan: feasible solutions in SDPs may need exponential space even to write down. Such exponential size solutions are the main obstacle to…
A particular instance of the Shortest Vector Problem (SVP) appears in the context of Compute-and-Forward. Despite the NP-hardness of the SVP, we will show that this certain instance can be solved in complexity order $O(n\psi\log(n\psi))$…
Classical primal-dual affine programming takes place over finite dimensional real vector spaces. This results in beautiful duality theory, connecting the optimal solu- tions of the primal maximization problem and the dual minimization…
The first quantum technologies to solve computational problems that are beyond the capabilities of classical computers are likely to be devices that exploit characteristics inherent to a particular physical system, to tackle a bespoke…
Whether the satisfiability of any formula F of propositional calculus can be determined in polynomial time is an open question. I propose a simple procedure based on some real world mechanisms to tackle this problem. The main result is the…
Let $S_0$ be a smooth and compact real variety given by a reduced regular sequence of polynomials $f_1, ..., f_p$. This paper is devoted to the algorithmic problem of finding {\em efficiently} a representative point for each connected…
We establish a connection between continuous-variable quantum computing and high-dimensional integration by showing that the outcome probabilities of continuous-variable instantaneous quantum polynomial (CV-IQP) circuits are given by…
Phase transitions in combinatorial problems have recently been shown to be useful in locating "hard" instances of combinatorial problems. The connection between computational complexity and the existence of phase transitions has been…
The existence of string functions, which are not polynomial time computable, but whose graph is checkable in polynomial time, is a basic assumption in cryptography. We prove that in the framework of algebraic complexity, there are no such…
Let $R$ be a real closed field. We consider basic semi-algebraic sets defined by $n$-variate equations/inequalities of $s$ symmetric polynomials and an equivariant family of polynomials, all of them of degree bounded by $2d < n$. Such a…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…