Related papers: QMA(2) with postselection equals to NEXP
A decidability proof for bisimulation equivalence of first-order grammars is given. It is an alternative proof for a result by S\'enizergues (1998, 2005) that subsumes his affirmative solution of the famous decidability question for…
We show that diagrammatic sets, a topologically sound alternative to polygraphs and strict $\omega$-categories, admit an internal notion of equivalence in the sense of coinductive weak invertibility. We prove that equivalences have the…
A set $X \subseteq 2^\omega$ with positive measure contains a perfect subset. We study such perfect subsets from the viewpoint of computability and prove that these sets can have weak computational strength. Then we connect the existence of…
We study the expressive power of polynomial recursive sequences, a nonlinear extension of the well-known class of linear recursive sequences. These sequences arise naturally in the study of nonlinear extensions of weighted automata, where…
We consider a class of two-prover interactive proof systems where each prover returns a single bit to the verifier and the verifier's verdict is a function of the XOR of the two bits received. We show that, when the provers are allowed to…
We study the power of polynomial-time truthful mechanisms comparing to polynomial time (non-truthful) algorithms. We show that there is a setting in which deterministic polynomial-time truthful mechanisms cannot guarantee a bounded…
Two quantum finite automata are equivalent if for all input string $\omega$ over the input alphabet the two automata accept $\omega$ with equal probability. In [Theoret. Comput. Sci. 410 (2009) 3006-3017], it was shown that a $k_1$-letter…
Human intelligence exhibits compositional generalization (i.e., the capacity to understand and produce unseen combinations of seen components), but current neural seq2seq models lack such ability. In this paper, we revisit iterative…
Using the concept of mixable shuffles, we formulate explicitly the quantum quasi-shuffle product, as well as the subalgebra generated by primitive elements of the quantum quasi-shuffle bialgebra. We construct a braided coalgebra structure…
The high resilience to de-coherence shown by a recently discovered Macroscopic Quantum Superposition (MQS) generated by a quantum injected optical parametric amplifier (QI-OPA) and involving a number of photons in excess of 5x10^4 motivates…
A conjecture connected with quantum physics led N. Katz to discover some amazing mixed character sum identities over a field of q elements, where q is a power of a prime p > 3. His proof required deep algebro-geometric techniques, and he…
A subclass of nondeterministic Finite Automata generated by means of regular Grammars (GFAs, for short) is introduced. A process algebra is proposed, whose semantics maps a term to a GFA. We prove a representability theorem: for each GFA…
Adleman, DeMarrais, and Huang introduced the nondeterministic quantum polynomial-time complexity class NQP as an analogue of NP. Fortnow and Rogers implicitly showed that, when the amplitudes are rational numbers, NQP is contained in the…
This paper contains two results on timed extensions of pushdown automata (PDA). As our first result we prove that the model of dense-timed PDA of Abdulla et al. collapses: it is expressively equivalent to dense-timed PDA with timeless…
In the paper we prove for every finite algebra A that either it has the polynomially generated powers (PGP) property, or it has the exponentially generated powers (EGP) property. For idempotent algebras we give a simple criteria for the…
Let v(n) denote the number of compositions (ordered partitions) of a positive integer n into powers of 2. It appears that the function v(n) satisfies many congruences modulo 2^N. For example, for every integer B there exists (as k tends to…
We prove that persuasion is an NP-complete problem.
Working in the context of reverse mathematics, we give a fine-grained characterization result on the strength of two possible definitions for Effective Transfinite Recursion used in literature. Moreover, we show that $\Pi^0_2$-induction…
We propose Equivariant ZFA with Choice as a foundation for nominal techniques that is stronger than ZFC and weaker than FM, and why this may be particularly helpful in the context of automated reasoning.
The power-expected-posterior (PEP) prior is an objective prior for Gaussian linear models, which leads to consistent model selection inference, under the M-closed scenario, and tends to favor parsimonious models. Recently, two new forms of…