Related papers: A Simple Proof of PreciseQMA = PSPACE
What happens if in QMA the quantum channel between Merlin and Arthur is noisy? It is not difficult to show that such a modification does not change the computational power as long as the noise is not too strong so that errors are…
We investigate the structure of quantum proof systems by establishing collapse results that reveal simplifications in their complexity landscape. By extending classical theorems such as the Karp-Lipton theorem to quantum settings and…
Linear optical spectra of molecular aggregates are often approximated by classical optics methods such as the discrete-dipole approximation (DDA), coherent exciton scattering (CES), and coherent potential approximation (CPA), where the only…
In this paper, we extend recent results of Assaf and McNamara on skew Pieri rule and skew Murnaghan-Nakayama rule to a more general identity, which gives an elegant expansion of the product of a skew Schur function with a quantum power sum…
In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete. He showed a polynomially bounded translation from full Intuitionistic Propositional Logic into…
We construct a succinct classical argument system for QMA, the quantum analogue of NP, from generic and standard cryptographic assumptions. Previously, building on the prior work of Mahadev (FOCS '18), Bartusek et al. (CRYPTO '22) also…
Quantum entanglement is a fundamental property of quantum mechanics and plays a crucial role in quantum computation and information. We study entanglement via the lens of computational complexity by considering quantum generalizations of…
We define a general formulation of quantum PCPs, which captures adaptivity and multiple unentangled provers, and give a detailed construction of the quantum reduction to a local Hamiltonian with a constant promise gap. The reduction turns…
Feferman proved in 1962 that any arithmetical theorem is a consequence of a suitable transfinite iteration of full uniform reflection of $\mathsf{PA}$. This result is commonly known as Feferman's completeness theorem. The purpose of this…
We introduce and study an approximate solution of the p-Laplace equation, and a linearlization $L_{\epsilon}$ of a perturbed p-Laplace operator. By deriving an $L_{\epsilon}$-type Bochner's formula and a Kato type inequality, we prove a…
We prove sharp remainder bounds for the Berezin-Toeplitz quantization and present applications to semiclassical quantum measurements.
We introduce a basis-restricted variant of the Quantum-k-SAT problem, in which each term in the input Hamiltonian is required to be diagonal in either the standard or Hadamard basis. Our main result is that the Quantum-6-SAT problem with…
We prove that Kilian's four-message succinct argument system is post-quantum secure in the standard model when instantiated with any probabilistically checkable proof and any collapsing hash function (which in turn exist based on the…
We give a new proof of the quantum version of MacMahon's Master Theorem due to Garoufalidis, Le and Zeilberger (one-parameter case) and to Konvalinka and Pak (multiparameter case) by deriving it from known facts about Koszul algebras.
The $\epsilon$-approximate degree of a function $f\colon X \to \{0, 1\}$ is the least degree of a multivariate real polynomial $p$ such that $|p(x)-f(x)| \leq \epsilon$ for all $x \in X$. We determine the $\epsilon$-approximate degree of…
Quantum Merlin-Arthur proof systems are believed to be stronger than both their classical counterparts and ``stand-alone'' quantum computers when Arthur is assumed to operate in $\Omega(\log n)$ space. No hint of such an advantage over…
We study the power of QMA(2) with postselection and show that the power is equal to NEXP. Our method for showing this equality can be also used to prove that other classes with exponentially small completeness-soundness gap equals to the…
We construct a classically verifiable succinct interactive argument for quantum computation (BQP) with communication complexity and verifier runtime that are poly-logarithmic in the runtime of the BQP computation (and polynomial in the…
A short and simple proof of necessity in the McCullough-Quiggin characterization of positive semi-definite kernels with the complete Pick property is presented.
We introduce Prior Knowledge Acceleration (PKA), a batch-update method for variance that reuses previously computed sufficient statistics to avoid full recomputation. The update identity is algebraically equivalent to the pairwise formula…