Related papers: Complexity of Simon's problem in classical sense
We use a Hamiltonian version of the semiclassical Einstein equation to study classical gravity coupled to a quantum scalar field with potential in spherical symmetry. The system is defined by effective constraints where the matter terms are…
Given polynomial maps $f, g \colon \mathbb{R}^n \to \mathbb{R}^n,$ we consider the {\em polynomial complementary problem} of finding a vector $x \in \mathbb{R}^n$ such that \begin{equation*} f(x) \ \ge \ 0, \quad g(x) \ \ge \ 0, \quad…
In 2003, Atserias and Dalmau resolved a major open question about the resolution proof system by establishing that the space complexity of CNF formulas is always an upper bound on the width needed to refute them. Their proof is beautiful…
Geoffrion's theorem is a fundamental result from mathematical programming assessing the quality of Lagrangian relaxation, a standard technique to get bounds for integer programs. An often implicit condition is that the set of feasible…
The quest for quantum computers is motivated by their potential for solving problems that defy existing, classical, computers. The theory of computational complexity, one of the crown jewels of computer science, provides a rigorous…
The classical sine-Gordon model is a two-dimensional integrable field theory, with particle like solutions the so-called solitons. Using its integrability one can define its quantum version without the process of canonical quantization.…
The main thrust of our current work is to exploit very specific characteristics of a given problem in order to acquire improved compactness for supercritical problems and to prove existence of new types of solutions. To this end, we shall…
Satisfiability Testing (SAT) techniques are well-established in classical computing where they are used to solve a broad variety of problems, e.g., in the design of classical circuits and systems. Analogous to the classical realm, quantum…
We develop a new algebraic technique that solves the following problem: Given a black box that contains an arithmetic circuit $f$ over a field of characteristic $2$ of degree~$d$. Decide whether $f$, expressed as an equivalent multivariate…
We propose a decision-theoretic framework for computational complexity, complementary to classical theory: moving from syntactic exactness (Turing / Shannon) to semantic simulability (Le Cam). While classical theory classifies problems by…
In this paper, we prove well-posedness in $C^1(\mathbb{R})$ (a.k.a. classical solutions) of the Fornberg-Whitham equation. To achieve this objective, we study its weak formulation under a Lagrangian framework. Applying the fundamental…
In this note, we provide a unifying framework to investigate the computational complexity of classical spin models and give the full classification on spin models in terms of system dimensions, randomness, external magnetic fields and types…
In this paper we investigate computational properties of the Diophantine problem for spherical equations in some classes of finite groups. We classify the complexity of different variations of the problem, e.g., when $G$ is fixed and when…
Typical-case computation complexity is a research topic at the boundary of computer science, applied mathematics, and statistical physics. In the last twenty years the replica-symmetry-breaking mean field theory of spin glasses and the…
The fastest quantum algorithms (for the solution of classical computational tasks) known so far are basically variations of the hidden subgroup problem with {$f(U[x])=f(x)$}. Following a discussion regarding which tasks might be solved…
Let $V$ be a vector space over a finite field $k$. We give a condition on a subset $A \subset V$ that allows for a local criterion for checking when a function $f:A \to k$ is a restriction of a polynomial function of degree $<m$ on $V$. In…
The \emph{sum-of-squares (SoS) complexity} of a $d$-multiquadratic polynomial $f$ (quadratic in each of $d$ blocks of $n$ variables) is the minimum $s$ such that $f = \sum_{i=1}^s g_i^2$ with each $g_i$ $d$-multilinear. In the case $d=2$,…
To determine if two lists of numbers are the same set, we sort both lists and see if we get the same result. The sorted list is a canonical form for the equivalence relation of set equality. Other canonical forms arise in graph isomorphism…
The simple concept of a SIC poses a very deep problem in algebraic number theory, as soon as the dimension of Hilbert space exceeds three. A detailed description of the simplest possible example is given.
In this paper, we show how a construction of an implicit complexity model can be implemented using concepts coming from the core of von Neumann algebras. Namely, our aim is to gain an understanding of classical computation in terms of the…