相关论文: NQP_{C} = co-C_{=}P

We prove a multiplication theorem of a quantum Caldero-Chapoton map associated to valued quivers which extends the results in \cite{DX}\cite{D}. As an application, when $Q$ is a valued quiver of finite type or rank 2, we obtain that the…

Quantum entanglement plays a fundamental role in quantum cryptography and computation. An important example of quantum entanglement can be found in the correlations of Einstein, Podolsky, and Rosen (EPR). However, despite the plethora of…

Polynomial composites were introduced by Anderson, Anderson, and Zafrullah. Over time, composites have appeared in many different papers, but they have not been sorted out in the algebra world. This paper is another part of the study of…

Quantum neuromorphic computing (QNC) is a sub-field of quantum machine learning (QML) that capitalizes on inherent system dynamics. As a result, QNC can run on contemporary, noisy quantum hardware and is poised to realize challenging…

I review arguments demonstrating how the concept of "particle" numbers arises in the form of equidistant energy eigenvalues of coupled harmonic oscillators representing free fields. Their quantum numbers (numbers of nodes of the wave…

Continued fractions have been introduced in the field of $p$--adic numbers $\mathbb{Q}_p$ by several authors. However, a standard definition is still missing since all the proposed algorithms are not able to replicate all the properties of…

We identify a sub-class of BQP that captures certain structural commonalities among many quantum algorithms including Shor's algorithms. This class does not contain all of BQP (e.g. Grover's algorithm does not fall into this class). Our…

In this work, we develop a general framework in which Noncommutative Quantum Mechanics (NCQM) is showed to be equivalent to Quantum Mechanics (QM) on a suitable transformed Quantum Phase Space (QPS). Imposing some constraints on this…

In this paper, we make a preliminary interpretation of Cook's theorem presented in [1]. This interpretation reveals cognitive biases in the proof of Cook's theorem that arise from the attempt of constructing a formula in CNF to represent a…

Quantum Neuromorphic Computing (QNC) merges quantum computation with neural computation to create scalable, noise-resilient algorithms for quantum machine learning (QML). At the core of QNC is the quantum perceptron (QP), which leverages…

Let A be an idempotent algebra on a finite domain. We combine results of Chen, Zhuk and Carvalho et al. to argue that if A satisfies the polynomially generated powers property (PGP), then QCSP(Inv(A)) is in NP. We then use the result of…

The concept of a quantum algebra is made easy through the investigation of the prototype algebras $u_{qp}(2)$, $su_q(2)$ and $u_{qp}(1,1)$. The latter quantum algebras are introduced as deformations of the corresponding Lie algebras~; this…

Efficient distributed computing offers a scalable strategy for solving resource-demanding tasks such as parallel computation and circuit optimisation. Crucially, the communication overhead introduced by the allotment process should be…

Quantum computing involving physical systems with continuous degrees of freedom, such as the quantum states of light, has recently attracted significant interest. However, a well-defined quantum complexity theory for these bosonic…

A attempt at a quantum algorithm for solving NP problems is presented. Now withdrawn because some crucial operators were not unitary.

We study approximation in the unit interval by rational numbers whose numerators are selected randomly with certain probabilities. Previous work showed that an analogue of Khintchine's Theorem holds in a similar random model and raised the…

This paper studies exact semidefinite programming relaxations (SDPRs) for separable quadratically constrained quadratic programs (QCQPs). We consider the construction of a larger separable QCQP from multiple QCQPs with exact SDPRs. We show…

In this paper, we present several new $q$-congruences on the $q$-trinomial coefficients introduced by Andrews and Baxter. As a conclusion, we obtain the following congruence: \begin{align*}…

The constraint satisfaction problem, parameterized by a relational structure, provides a general framework for expressing computational decision problems. Already the restriction to the class of all finite structures forms an interesting…

A general method is proposed for calculating a fully k-dependent, continuous, and causal spectral function A(k,E) within the recently introduced nonlocal version of the coherent-potential approximation (NLCPA). The method involves the…