Related papers: NQP_{C} = co-C_{=}P

There are three different types of nondeterminism in quantum communication: i) $\nqp$-communication, ii) $\qma$-communication, and iii) $\qcma$-communication. In this \redout{paper} we show that multiparty $\nqp$-communication can be…

We define and study a variant of QMA (Quantum Merlin Arthur) in which Arthur can make multiple non-collapsing measurements to Merlin's witness state, in addition to ordinary collapsing measurements. By analogy to the class PDQP defined by…

We demonstrate the superior capabilities of the recently proposed Lorentz quantum computer (LQC) compared to conventional quantum computers. We introduce an associated computational complexity class termed bounded-error Lorentz quantum…

In this article, we discuss the question of whether P equals NP, we do not follow the line of research of many researchers, which is to try to find such a problem Q, and the problem Q belongs to the class of NP-complete, if the problem Q is…

We initiate the study of the relationship between two complexity classes, BQP (Bounded-Error Quantum Polynomial-Time) and PPAD (Polynomial Parity Argument, Directed). We first give a conjecture that PPAD is contained in BQP, and show a…

In this paper, we prove some computational results about equivariant cohomology over the cyclic group $C_{p^n}$ of prime power order. We show that there is an inductive formula when the dimension of the $C_p$-fixed points of the grading is…

The open question, P=NP?, was presented by Cook (1971). In this paper, a proof that P is not equal to NP is presented. In addition, it is shown that P is not equal to the intersection of NP and co-NP. Finally, the exact inclusion…

Whether the quantum mechanics (QM) is non-local is an issue disputed for a long time. The violation of the Bell-type inequalities was considered as proving this non-locality. However, these inequalities are constructed on a class of local…

We study the quiver with relations of the endomorphism algebra of an APR tilting module. We give an explicit description of the quiver with relations by graded quivers with potential (QPs) and mutations. The result also implies that…

The relationship between BQP and PH has been an open problem since the earliest days of quantum computing. We present evidence that quantum computers can solve problems outside the entire polynomial hierarchy, by relating this question to…

Motivated by the fact that information is encoded and processed by physical systems, the P versus NP problem is examined in terms of physical processes. In particular, we consider P as a class of deterministic, and NP as nondeterministic,…

We study a variant of QMA where quantum proofs have no relative phase (i.e. non-negative amplitudes, up to a global phase). If only completeness is modified, this class is equal to QMA [arXiv:1410.2882]; but if both completeness and…

Quantum counting is the task of determining the dimension of the subspace of states that are accepted by a quantum verifier circuit. It is the quantum analog of counting the number of valid solutions to NP problems -- a problem well-studied…

This article surveys quantum computational complexity, with a focus on three fundamental notions: polynomial-time quantum computations, the efficient verification of quantum proofs, and quantum interactive proof systems. Properties of…

We use the powerful tools of counting complexity and generic oracles to help understand the limitations of the complexity of quantum computation. We show several results for the probabilistic quantum class BQP. 1. BQP is low for PP, i.e.,…

This is the second of the two related papers analysing origins and possible explanations of a paradoxical phenomenon of the quantum potential (QP). It arises in quantum mechanics'(QM) of a particle in the Riemannian $n$-dimensional…

There's something really strange about quantum mechanics. It's not just that cats can be dead and alive at the same time, and that entanglement seems to violate the principle of locality; quantum mechanics seems to be what Aaronson calls…

Let $Q$ be any invertible valued quiver without oriented cycles. We study connections between the category of valued representations of $Q$ and expansions of cluster variables in terms of the initial cluster in quantum cluster algebras. We…

In this paper, it is established that quantum nilpotent algebras (also known as CGL extensions) are catenary, i.e., all saturated chains of inclusions of prime ideals between any two given prime ideals $P \subsetneq Q$ have the same length.…

We introduce the concept of quantum polymorphisms to the complexity theory of quantum constraint satisfaction. Via this notion, we build an algebraic framework of reductions between quantum CSPs, and we establish a Galois connection between…