Related papers: QMA(2) with postselection equals to NEXP
We provide a general framework to remove short advice by formulating the following computational task for a function $f$: given two oracles at least one of which is honest (i.e. correctly computes $f$ on all inputs) as well as an input, the…
We show that the skip-gram formulation of word2vec trained with negative sampling is equivalent to a weighted logistic PCA. This connection allows us to better understand the objective, compare it to other word embedding methods, and extend…
We give a dual to the McKay correspondence, involving conjugacy classes of subgroups of SU(2). We prove a determinantal formula involving both correspondences. We pose some questions concerning a non-commutative Fourier transform.
Recent theoretical results in quantum machine learning have demonstrated a general trade-off between the expressive power of quantum neural networks (QNNs) and their trainability; as a corollary of these results, practical exponential…
Here Euler notes the recursive relation for the general binomial coefficients, by assuming that (1+x)^a can be expanded in a power series.
Approximate solution of the ensemble representability problem for density operators of arbitrary order is obtained. This solution is closely related to the ``Q condition'' of A.J.Coleman. The representability conditions are formulated in…
The famous Michael selection theorem deals with the characterisation of paracompact spaces by continuous selections of lower semi-continuous mappings in Banach spaces. In this paper, we will discuss several equivalent forms of this theorem,…
The $N$th power of a polynomial matrix of fixed size and degree can be computed by binary powering as fast as multiplying two polynomials of linear degree in~$N$. When Fast Fourier Transform (FFT) is available, the resulting complexity is…
Multi Prover Interactive Proof systems (MIPs)were first presented in a cryptographic context, but ever since they were used in various fields. Understanding the power of MIPs in the quantum context raises many open problems, as there are…
We give a combinatorial description of the stationary measure for a totally asymmetric exclusion process (TASEP) with second class particles, on either Z or on the cycle Z_N. The measure is the image by a simple operation of the uniform…
Consider a fixed universe of $N=2^n$ elements and the uniform distribution over elements of some subset of size $K$. Given samples from this distribution, the task of complement sampling is to provide a sample from the complementary subset.…
This short note present a "proof" of $P\neq NP$. The "proof" with double quotation marks is to indicate that we do not know whether the proof is correct or not (We're confused because we do know in which we make the mistakes).
People can learn a new concept and use it compositionally, understanding how to "blicket twice" after learning how to "blicket." In contrast, powerful sequence-to-sequence (seq2seq) neural networks fail such tests of compositionality,…
We prove a deterministic exponential time upper bound for Quantum Merlin-Arthur games with k unentangled provers. This is the first non-trivial upper bound of QMA(k) better than NEXP and can be considered an exponential improvement, unless…
We study completely positive and trace-preserving equivariant maps between operators on irreducible representations of $\mathrm{SU}(2)$. We find asymptotic approximations of channels in the limit of large output representation and we…
In the Zermelo--Fraenkel set theory with the Axiom of Choice a forcing notion is "$\kappa$-distributive" if and only if it is "$\kappa$-sequential". We show that without the Axiom of Choice this equivalence fails, even if we include a weak…
This letter examines the consequences of a recently proposed modification of the postulate of equal {\it a priori} probability in quantum statistical mechanics. This modification, called the {\it quantum microcanonical postulate} (QMP),…
This work presents a novel approach to Automatic Post-Editing (APE) and Word-Level Quality Estimation (QE) using ensembles of specialized Neural Machine Translation (NMT) systems. Word-level features that have proven effective for QE are…
We show that postselection offers a nonclassical advantage in metrology. In every parameter-estimation experiment, the final measurement or the postprocessing incurs some cost. Postselection can improve the rate of Fisher information (the…
We develop a framework for learning from noisy quantum experiments in which fault-tolerant devices access uncharacterized systems through noisy couplings. Introducing the complexity class $\textsf{NBQP}$ ("noisy BQP''), we model noisy…