相关论文: Quantum Period Query Proves NP in BQP
A attempt at a quantum algorithm for solving NP problems is presented. Now withdrawn because some crucial operators were not unitary.
This paper has been withdrawn by the author due to an apparent misunderstanding of quantum feedback control.
The computational complexity conjecture of NP $\nsubseteq$ BQP implies that there should be an exponentially small energy gap for Quantum Annealing (QA) of NP-hard problems. We aim to verify how this computation originated gapless point…
The polynomial-time hierarchy ($\mathrm{PH}$) has proven to be a powerful tool for providing separations in computational complexity theory (modulo standard conjectures such as $\mathrm{PH}$ does not collapse). Here, we study whether two…
Quantum computers are widely believed have an advantage over classical computers, and some have even published some empirical evidence that this is the case. However, these publications do not include a rigorous proof of this advantage,…
This paper was withdrawn by the authors.
One can fix the randomness used by a randomized algorithm, but there is no analogous notion of fixing the quantumness used by a quantum algorithm. Underscoring this fundamental difference, we show that, in the black-box setting, the…
This paper has been withdrawn by the author due to a crucial error in eq.59. I apologize for the inconveniences.
We give a corrected proof that if PP $\subseteq$ BQP/qpoly, then the Counting Hierarchy collapses, as originally claimed by [Aaronson 2006 arXiv:cs/0504048]. This recovers the related unconditional claim that PP does not have circuits of…
We combine the classical notions and techniques for bounded query classes with those developed in quantum computing. We give strong evidence that quantum queries to an oracle in the class NP does indeed reduce the query complexity of…
We show that the class BPP is in NP and coNP. This paper has been withdrawn by the author because B and B' are probabilistic and nonequalities 10 cannot be checked in polynomial time.
There is an interesting relation between the quantum periods on a certain limit of local $\mathbb{P}^1\times \mathbb{P}^1$ Calabi-Yau space and a TBA (Thermodynamic Bethe Ansatz) system appeared in the studies of ABJM…
We consider the problem of mapping digital data encoded on a quantum register to analog amplitudes in parallel. It is shown to be unlikely that a fully unitary polynomial-time quantum algorithm exists for this problem; NP becomes a subset…
The paper has been withdrawn because the research work is still in progress.
We reveal a natural algebraic problem whose complexity appears to interpolate between the well-known complexity classes BQP and NP: (*) Decide whether a univariate polynomial with exactly m monomial terms has a p-adic rational root. In…
We find a modification to QMA where having one quantum proof is strictly less powerful than having two unentangled proofs, assuming EXP $\ne$ NEXP. This gives a new route to prove QMA(2) = NEXP that overcomes the primary drawback of a…
The quantum period-finding (QPF) algorithm can compute the period of a function exponentially faster than the best-known classical algorithm. In standard QPF, the output state has a primary contribution from $r$ high-probability bit…
We consider a Hamiltonian $H=H^{0}(p)+\kappa H^{1}(p,q,t)$, $(p,q)\in {\mathbb{R}}^{n} \times {\mathbb{T}}^n$, $t\in{\mathbb{R}}$ where $\kappa \in {\mathbb{R}}$ is a small perturbation parameter and $p$, $q$ are the action and angle…
We invert the period map defined by the second structure connection of quantum cohomology of $\mathbb{P}^2$. For small quantum cohomology the inverse is given explicitly in terms of the Eisenstein series $E_4$ and $E_6$, while for big…
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,…