Related papers: Characterizing the intersection of QMA and coQMA
We prove that QCSP$(\mathbb{N};x=y\rightarrow y=z)$ is PSpace-complete, settling a question open for more than ten years. This completes the complexity classification for the QCSP over equality languages as a trichotomy between Logspace,…
In this paper, we establish a q-analog of partial fraction decomposition formula. By using formula, we develop new closed form representations of sums of q-harmonic numbers and reciprocal q-binomial coefficients. Moreover, we give explicit…
For n>2, we prove the mod 2 cohomology of the finite Chevalley group Spin_n(F_q) is isomorphic to that of the classifying space of the loop group of the spin group Spin(n).
Complementarity was originally introduced as a qualitative concept for the discussion of properties of quantum mechanical objects that are classically incompatible. More recently, complementarity has become a \emph{quantitative} relation…
A simultaneous, contextual experimental demonstration of the two processes of cloning an input qubit and of flipping it into the orthogonal qubit is reported. The adopted experimental apparatus, a Quantum-Injected Optical Parametric…
A quantum circuit must be preprocessed before implementing on NISQ devices due to the connectivity constraint. Quantum circuit mapping (QCM) transforms the circuit into an equivalent one that is compliant with the NISQ device's architecture…
Let $F$ be an affine flat group scheme over a commutative ring $R$, and $S$ an $F$-algebra (an $R$-algebra on which $F$ acts). We define an equivariant analogue $Q_F(S)$ of the total ring of fractions $Q(S)$ of $S$. It is the largest…
We give a new theoretical solution to a leading-edge experimental challenge, namely to the verification of quantum computations in the regime of high computational complexity. Our results are given in the language of quantum interactive…
We recall the notions of a graded cocategory, conilpotent cocategory, morphisms of such (cofunctors), coderivations and define their analogs in $\mathbb L$-filtered setting. The difference with the existing approaches: we do not impose any…
Quantum signal processing is a framework for implementing polynomial functions on quantum computers. To implement a given polynomial $P$, one must first construct a corresponding complementary polynomial $Q$. Existing approaches to this…
We define a new query measure we call quantum distinguishing complexity, denoted QD(f) for a Boolean function f. Unlike a quantum query algorithm, which must output a state close to |0> on a 0-input and a state close to |1> on a 1-input, a…
Coherence measures and their operational interpretations lay the cornerstone of coherence theory. In this paper, we introduce a class of coherence measures with $\alpha$-affinity, say $\alpha$-affinity of coherence for $\alpha \in (0, 1)$.…
We reformulate and extend our recently introduced quantum kinetic theory for interacting fermion and scalar fields. Our formalism is based on the coherent quasiparticle approximation (cQPA) where nonlocal coherence information is encoded in…
Given an exact relatively Pin Lagrangian embedding Q in a symplectic manifold M, we construct an A-infinity restriction functor from the wrapped Fukaya category of M to the category of modules on the differential graded algebra of chains…
Approximation algorithms for classical constraint satisfaction problems are one of the main research areas in theoretical computer science. Here we define a natural approximation version of the QMA-complete local Hamiltonian problem and…
In this paper, we study the relationship of parametrised enumeration complexity classes defined by Creignou et al. (MFCS 2013). Specifically, we introduce two hierarchies (IncFPTa and CapIncFPTa) of enumeration complexity classes for…
We prove that quantum computation is polynomially equivalent to classical probabilistic computation with an oracle for estimating the value of simple sums, quadratically signed weight enumerators. The problem of estimating these sums can be…
We study the fundamental properties of the quantum f-relative entropy, where f(.) is an operator convex function. We give the equality conditions under monotonicity and joint convexity, and these conditions are more general than, since they…
Suppose that a compact quantum group ${\mathcal Q}$ acts faithfully on a smooth, compact, connected manifold $M$, i.e. has a $C^{\ast}$ (co)-action $\alpha$ on $C(M)$, such that $\alpha(C^\infty(M)) \subseteq C^\infty(M, {\mathcal Q})$ and…
Jay and Given-Wilson have recently introduced the Factorisation (or SF-) calculus as a minimal fundamental model of intensional computation. It is a combinatory calculus containing a special combinator, F, which is able to examine the…