Related papers: QMA(2) with postselection equals to NEXP

For Coxeter groups with sufficiently large braid relations, we prove that the sequence of powers of a Coxeter element has unbounded reflection length. We establish a connection between the reflection length functions on arbitrary Coxeter…

We propose a fragment of many-sorted second order logic called EQSMT and show that checking satisfiability of sentences in this fragment is decidable. EQSMT formulae have an $\exists^*\forall^*$ quantifier prefix (over variables, functions…

Let x(n) be a recurrence relation. The main purpose of this article is to determine a recurrence for powers of x(n).

We revisit the nef curve cone theorem and use it to reprove the pseudo-effectivity of the second Chern classes for terminal weak Q-Fano varieties.

Suppose that $f(x)=Ax^k$ mod $p$ is a permutation of the least residues mod $p$. With the exception of the maps $f(x)=Ax$ and $Ax^{(p+1)/2}$ mod $p$ we show that for fixed $n\geq 2$ the image of each residue class mod $n$ contains elements…

Post-selection inference has recently been proposed as a way of quantifying uncertainty about detected changepoints. The idea is to run a changepoint detection algorithm, and then re-use the same data to perform a test for a change near…

We demonstrate that machine learning provides a powerful tool for discovering new approximate quantum error-correcting (AQEC) codes beyond conventional algebraic frameworks. Building upon direct observations through hybrid quantum-classical…

Burkart, Caucal, Steffen (1995) showed a procedure deciding bisimulation equivalence of processes in Basic Process Algebra (BPA), i.e. of sequential processes generated by context-free grammars. They improved the previous decidability…

Neural Posterior Estimation (NPE) has emerged as a powerful approach for amortized Bayesian inference when the true posterior $p(\theta \mid y)$ is intractable or difficult to sample. But evaluating the accuracy of neural posterior…

We investigate the power of weak measurements in the framework of quantum state discrimination. First, we define and analyze the notion of weak consecutive measurements. Our main result is a convergence theorem whereby we demonstrate when…

This article shows that PSPACE not equal EXP. A simple but novel proof technique has been used to separate these two classes. Whether an arbitrary Turing machine accepts an input when the running time is limited has been computed in this…

We seek to better understand the difference in quality of the several publicly released embeddings. We propose several tasks that help to distinguish the characteristics of different embeddings. Our evaluation of sentiment polarity and…

Learners of a second language (L2) often map non-native phonemes to similar native-language (L1) phonemes, making conventional L2-focused training slow and effortful. To address this, we propose an L1-grounded pronunciation training method…

We study the expressive power of subrecursive probabilistic higher-order calculi. More specifically, we show that endowing a very expressive deterministic calculus like G\"odel's $\mathbb{T}$ with various forms of probabilistic choice…

If $ p_k(a,m,n) $ denotes the number of partitions of $n$ into $k$th powers with a number of parts that is congruent to $ a $ modulo $m,$ then $p_2(0,2,n)\sim p_2(1,2,n)$ and the sign of the difference $p_2(0,2,n)- p_k(1,2,n)$ alternates…

Equivalence tests, otherwise known as parity or similarity tests, are frequently used in ``bioequivalence studies" to establish practical equivalence rather than the usual statistical significant difference. In this article, we propose an…

There exist two different languages, the ^sl(2) and N=2 ones, to describe similar structures; a dictionary is given translating the key representation-theoretic terms related to the two algebras. The main tool to describe the structure of…

The complexity class NP is quintessential and ubiquitous in theoretical computer science. Two different approaches have been made to define "Quantum NP," the quantum analogue of NP: NQP by Adleman, DeMarrais, and Huang, and QMA by Knill,…

Normal-form bisimilarity is a simple, easy-to-use behavioral equivalence that relates terms in $\lambda$-calculi by decomposing their normal forms into bisimilar subterms. Moreover, it typically allows for powerful up-to techniques, such as…

Let A be an idempotent algebra on a finite domain. We combine results of Chen 2008 and Zhuk 2015 to argue that if Inv(A) satisfies the polynomially generated powers property (PGP), then QCSP(Inv(A)) is in NP. We then use the result of Zhuk…