Related papers: NQP_{C} = co-C_{=}P
We show weighted non-autonomous $L^q(L^p)$ maximal regularity for families of complex second-order systems in divergence form under a mixed regularity condition in space and time. To be more precise, we let $p,q \in (1,\infty)$ and we…
The development of quantum algorithms and protocols calls for adequate modelling and verification techniques, which requires abstracting and focusing on the basic features of quantum concurrent systems, like CCS and CSP have done for their…
We show that CC-circuits of bounded depth have the same expressive power as circuits over finite nilpotent algebras from congruence modular varieties. We use this result to phrase and discuss a new algebraic version of Barrington, Straubing…
This paper demonstrates the relativity of Computability and Nondeterministic; the nondeterministic is just Turing's undecidable Decision rather than the Nondeterministic Polynomial time. Based on analysis about TM, UM, DTM, NTM, Turing…
We show that for every polynomial q* there exist polynomial-size, constant-query, non-adaptive PCPs for NP which are perfect zero knowledge against (adaptive) adversaries making at most q* queries to the proof. In addition, we construct…
Let $Q$ be a finite acyclic valued quiver. We give the cluster multiplication formulas in the quantum cluster algebra of $Q$ with arbitrary coefficients, by applying certain quotients of derived Hall subalgebras of $Q$. These formulas can…
Qualitative numerical planning is classical planning extended with non-negative real variables that can be increased or decreased "qualitatively", i.e., by positive indeterminate amounts. While deterministic planning with numerical…
We develop a theory of complexity for numerical computations that takes into account the condition of the input data and allows for roundoff in the computations. We follow the lines of the theory developed by Blum, Shub, and Smale for…
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a…
In this paper we show that the typical effects of quantum resonances, namely, the exponential-type decay of the survival amplitude, continue to exist even when a nonlinear perturbative term is added to the time-dependent Schroedinger…
We show that the presented real-number quantum theories, compatible with the independent source assumption, require the inclusion of a nonlocal map. This means that if the independent source assumption holds, in these models, complex-number…
Quotients and comprehension are fundamental mathematical constructions that can be described via adjunctions in categorical logic. This paper reveals that quotients and comprehension are related to measurement, not only in quantum logic,…
We propose a definition of QNC, the quantum analog of the efficient parallel class NC. We exhibit several useful gadgets and prove that various classes of circuits can be parallelized to logarithmic depth, including circuits for encoding…
Born in the intersection between quantum mechanics and general relativity, indefinite causal structure is the idea that in the continuum of time, some sets of events do not have an inherent causal order between them. Process matrices,…
If one modifies the laws of Quantum Mechanics to allow nonlinear evolution of quantum states, this paper shows that NP-complete problems would be efficiently solvable in polynomial time with bounded probability (NP in BQP). With that…
We consider multiple polylogarithms in a single variable at non-positive integers. Defining a connected graded Hopf algebra, we apply Connes' and Kreimer's algebraic Birkhoff decomposition to renormalize multiple polylogarithms at…
The error-robust and short composite operations named ConCatenated Composite Pulses (CCCPs), developed as high-precision unitary operations in quantum information processing (QIP), are derived from composite pulses widely employed in…
We present several applications of quantum amplitude amplification to finding claws and collisions in ordered or unordered functions. Our algorithms generalize those of Brassard, Hoyer, and Tapp, and imply an O(N^{3/4} log N) quantum upper…
Arbitrary exponentially large unitaries cannot be implemented efficiently by quantum circuits. However, we show that quantum circuits can efficiently implement any unitary provided it has at most polynomially many nonzero entries in any row…
Ever since entanglement was identified as a computational and cryptographic resource, researchers have sought efficient ways to tell whether a given density matrix represents an unentangled, or separable, state. This paper gives the first…