Related papers: A Simple Proof of PreciseQMA = PSPACE

The aim of this article is to introduce a bivariate extension of Shurer-Stancu operators based on (p q)integers. We prove uniform approximation by means of Bohman Korovkin type theorem rate of convergence using total modulus of smoothness…

In a recent work, Y.D. Chong et al. [Phys. Rev. Lett. {\bf 105}, 053901 (2010)] proposed the idea of a coherent perfect absorber (CPA) as the time-reversed counterpart of a laser, in which a purely incoming radiation pattern is completely…

In this work, the real nonnegative inverse eigenvalue problem is solved for a particular class of permutative matrix. The necessary and sufficient condition there is also shown to be sufficient for the symmetric nonnegative inverse…

We present the current status of the application of our approach of exact amplitude-based resummation in quantum field theory to two areas of investigation: precision QCD calculations of all three of us as needed for LHC physics and the…

We prove that the non-structural subtype entailment problem for finite and regular type expressions is in PSPACE. In this way we close a decidability and complexity gap pending since 1996.

We fill the gap left open in \cite{MT}, regarding the minimum exponent on the logarithmic correction weight so that the Leray-Trudinger inequality (see \cite{PsSp}) holds. Instead of the representation formula used in \cite{PsSp} and…

In much discussed work Artemov has recently shown that, for $\mathrm{PA}$, the consistency schema admits a form of uniform verification via selector proofs, despite the unprovability of the corresponding uniform consistency sentence…

We consider the integer point transform $\sigma _P (\mathbf{x}) = \sum _{\mathbf{m} \in P\cap \mathbb{Z}^n} \mathbf{x}^\mathbf{m} \in \mathbb C [x_1^{\pm 1},\ldots, x_n^{\pm 1}]$ of a polytope $P\subset \mathbb{R}^n$. We show that if $P$ is…

The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: given a set of projectors of rank 1, acting non-trivially on…

In the present contribution we propose a new proof of the so-called fictitious space lemma. For the proof, we exhibit an explicit expression for the inverse of additive Schwarz preconditioners in terms of Moore-Penrose pseudo inverse of the…

We show that for any quantale $\mathcal{Q}$, a $\mathcal{Q}$-category is skeletal and complete if and only if it is injective with respect to fully faithful $\mathcal{Q}$-functors. This is a special case of known theorems due to Hofmann and…

We argue that high-precision lattice QCD is now possible, for the first time, because of a new improved staggered quark discretization. We compare a wide variety of nonperturbative calculations in QCD with experiment, and find agreement to…

We prove a noncommutative $(p,p)$-Poincar\'e inequality for trace-symmetric quantum Markov semigroups on tracial von Neumann algebras, assuming only the existence of a spectral gap. Extending semi-commutative results of Huang and Tropp, our…

Quantum matrix inversion with the quantum singular value transformation (QSVT) requires a polynomial approximation to $1/x$. Several methods from the literature construct polynomials that achieve the known degree complexity…

We introduce a new variant of Quantum Amplitude Estimation (QAE), called Iterative QAE (IQAE), which does not rely on Quantum Phase Estimation (QPE) but is only based on Grover's Algorithm, which reduces the required number of qubits and…

We show that the class QMA does not change even if we restrict Arthur's computing ability to only Clifford gate operations (plus classical XOR gate). The idea is to use the fact that the preparation of certain single-qubit states, so called…

It is well-known in physics that the limit of large quantum spin $S$ should be understood as a semiclassical limit. This raises the question of whether such emergent classicality facilitates the approximation of computationally hard quantum…

Approximate message passing (AMP) type algorithms have been widely used in the signal reconstruction of certain large random linear systems. A key feature of the AMP-type algorithms is that their dynamics can be correctly described by state…

We prove that QMA where the verifier may also make a single non-collapsing measurement is equal to NEXP, resolving an open question of Aaronson. We show this is a corollary to a modified proof of QMA+ = NEXP [arXiv:2306.13247]. At the core…

We introduce a simple sub-universal quantum computing model, which we call the Hadamard-classical circuit with one-qubit (HC1Q) model. It consists of a classical reversible circuit sandwiched by two layers of Hadamard gates, and therefore…