Related papers: QMA(2) with postselection equals to NEXP
We prove that two-way probabilistic and quantum finite automata (2PFA's and 2QFA's) can be considerably more concise than both their one-way versions (1PFA's and 1QFA's), and two-way nondeterministic finite automata (2NFA's). For this…
In this paper, we derive power guarantees of some sequential tests for bounded mean under general alternatives. We focus on testing procedures using nonnegative supermartingales which are anytime valid and consider alternatives which…
This work studies post-training parameter quantization in large language models (LLMs). We introduce quantization with incoherence processing (QuIP), a new method based on the insight that quantization benefits from $\textit{incoherent}$…
Buan-Iyama-Reiten-Smith proved, based on Derksen-Weyman-Zelevinsky work, that the Jacobian algebra of two quivers with potential related by a QP-mutation are nearly Morita equivalent. They proved, using Axiom of Choice, that the natural…
Cohesive powers of computable structures are effective analogs of ultrapowers, where cohesive sets play the role of ultrafilters. Let $\omega$, $\zeta$, and $\eta$ denote the respective order-types of the natural numbers, the integers, and…
We analyse preference inference, through consistency, for general preference languages based on lexicographic models. We identify a property, which we call strong compositionality, that applies for many natural kinds of preference…
We introduce the quasi-Poisson enveloping algebra and Poisson enveloping algebra for a non-commutative Poisson algebra. We prove that for a non-commutative Poisson algebra, the category of quasi-Poisson modules is equivalent to the category…
Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task. We explore coalgebras over distributions…
We show that the class MIP* of languages that can be decided by a classical verifier interacting with multiple all-powerful quantum provers sharing entanglement is equal to the class RE of recursively enumerable languages. Our proof builds…
We study the computational power of machines that specify their own acceptance types, and show that they accept exactly the languages that $\manyonesharp$-reduce to NP sets. A natural variant accepts exactly the languages that…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
We propose a general method for studying properties of quantum channels acting on an n-partite system, whose action is invariant under permutations of the subsystems. Our main result is that, in order to prove that a certain property holds…
Closed expressions are derived for the quantum measurement statistics of pre-and postselected gaussian particle beams. The weakness of the pre-selection step is shown to compete with the non-orthogonality of post-selection in a transparent…
We study the computational complexity of reachability, coverability and inclusion for extensions of context-free commutative grammars with integer counters and reset operations on them. Those grammars can alternatively be viewed as an…
We prove the equivalence of two classes of counter machines and one class of distributed automata. Our counter machines operate on finite words, which they read from left to right while incrementing or decrementing a fixed number of…
This paper considers MEP - Mixed Exponential Polynomials as one class of real exponential polynomials. We introduce a method for proving the positivity of MEP inequalities over positive intervals using the Maclaurin series to approximate…
Deriving quantum mechanics from information-theoretic postulates is a recent research direction taken, in part, with the view of finding a beyond-quantum theory; once the postulates are clear, we can consider modifications to them. A key…
We propose an extension of the quantum entropy power inequality for finite dimensional quantum systems, and prove a conditional quantum entropy power inequality by using the majorization relation as well as the concavity of entropic…
We present new, unified proofs for the cell-like, $\mathbb{Z}/p$-, and $\mathbb{Q}$-resolution theorems. Our arguments employ extensions that are much simpler then those used by our predecessors. The techniques allow us to solve problems…
The categorization ability of fully connected neural network models, with either discrete or continuous Q-state units, is studied in this work in replica symmetric mean-field theory. Hierarchically correlated multi-state patterns in a two…