Related papers: Quantum interpretations of AWPP and APP
We summarize several recent developments suggesting that solving the problem of time in quantum gravity leads to a solution of the measurement problem in quantum mechanics. This approach has been informally called "the Montevideo…
A careful study of the classical/quantum connection with the aid of coherent states offers new insights into various technical problems. This analysis includes both canonical as well as closely related affine quantization procedures. The…
Approximation Fixpoint Theory (AFT) is a powerful theory covering various semantics of non-monotonic reasoning formalisms in knowledge representation such as Logic Programming and Answer Set Programming. Many semantics of such non-monotonic…
We study the computational complexity of certain integrable quantum theories in 1+1 dimensions. We formalize a model of quantum computation based on these theories. In this model, distinguishable particles start out with known momenta and…
Compatible equations, Singularities of solutions, Topological charges and quasi-charges. PhD thesis (translated frorm Russian). The book shows the sights of Absolute Parallelism (AP), and contains useful information on the problem of…
Is there a general theorem that tells us when we can hope for exponential speedups from quantum algorithms, and when we cannot? In this paper, we make two advances toward such a theorem, in the black-box model where most quantum algorithms…
Quantum computation is frequently mischaracterized as the simultaneous execution of exponentially many classical computations. This article offers a conceptual clarification of why this ``branchwise parallelism'' picture is misleading,…
The fundamental physical description of the Universe is based on two theories: Quantum Mechanics and General Relativity. Unified theory of Quantum Gravity (QG) is an open problem. Quantum Gravity Phenomenology (QGP) studies QG effects in…
Quantum neural networks (QNNs) based on parametrized quantum circuits are promising candidates for machine learning applications, yet many architectures lack clear connections to classical models, potentially limiting their ability to…
Approximate linear programming (ALP) is an efficient approach to solving large factored Markov decision processes (MDPs). The main idea of the method is to approximate the optimal value function by a set of basis functions and optimize…
We prove that counting the analytic Brouwer degree of rational coefficient polynomial maps in $\operatorname{Map}(\mathbb C^d, \mathbb C^d)$ -- presented in degree-coefficient form -- is hard for the complexity class $\operatorname{\sharp…
Let $M$ be a Hopf--von Neuman algebra with the predual $M_*$ and $WAP(M)$ the subspace in $M$ composed of weakly almost periodic functionals on $M_*$. The main example of such an algebra is $M=L^\infty(\mathbb G)$ for a locally compact…
In \cite{MR447956}, Muckenhoupt and Wheeden formulated a weighted weak $(p,p)$ inequality where the weight for the weak $L^p$ space is treated as a multiplier rather than a measure. They proved such inequalities for the Hardy-Littlewood…
This paper proves the polynomial equivalence of a broad class of definitions of quantum computational complexity. We study right-invariant metrics on the unitary group -- often called `complexity geometries' following the definition of…
Recently the theory of communication developed by Shannon has been extended to the quantum realm by exploiting the rules of quantum theory. This latter stems on complex vector spaces. However complex (as well as real) numbers are just…
For given $p\in\lbrack1,\infty]$ and $g\in L^{p}\mathbb{(R)}$, we establish the existence and uniqueness of solutions $f\in L^{p}(\mathbb{R)}$, to the equation \[ f(x)-af(bx)=g(x), \] where $a\in\mathbb{R}$, $b\in\mathbb{R} \setminus…
Approximate Dynamic Programming (ADP) is a methodology to solve multi-stage stochastic optimization problems in multi-dimensional discrete or continuous spaces. ADP approximates the optimal value function by adaptively sampling both action…
The fundamental physical description of Nature is based on two mutually incompatible theories: Quantum Mechanics and General Relativity. Their unification in a theory of Quantum Gravity (QG) remains one of the main challenges of theoretical…
We define the algorithmic complexity of a quantum state relative to a given precision parameter, and give upper bounds for various examples of states. We also establish a connection between the entanglement of a quantum state and its…
We present evidence that there exist quantum computations that can be carried out in constant depth, using 2-qubit gates, that cannot be simulated classically with high accuracy. We prove that if one can simulate these circuits classically…