相关论文: Quantum Period Query Proves NP in BQP
The paper has been withdrawn
Quantum recurrence theorem holds for quantum systems with discrete energy eigenvalues and fails to hold in general for systems with continuous energy. We show that during quantum walk process dominated by interference of amplitude…
Adleman, DeMarrais, and Huang introduced the nondeterministic quantum polynomial-time complexity class NQP as an analogue of NP. Fortnow and Rogers implicitly showed that, when the amplitudes are rational numbers, NQP is contained in the…
When it comes to NP, its natural definition, its wide applicability across scientific disciplines, and its timeless relevance, the writing is on the wall: There can be only one. Quantum NP, on the other hand, is clearly the apple that fell…
The quantum Fourier transform (QFT) has emerged as the primary tool in quantum algorithms which achieve exponential advantage over classical computation and lies at the heart of the solution to the abelian hidden subgroup problem, of which…
The complexity class NP is quintessential and ubiquitous in theoretical computer science. Two different approaches have been made to define "Quantum NP," the quantum analogue of NP: NQP by Adleman, DeMarrais, and Huang, and QMA by Knill,…
This paper has been withdrawn by the author, due to a crucial error in the proof of Thm.1
I offer a case that quantum query complexity still has loads of enticing and fundamental open problems -- from relativized QMA versus QCMA and BQP versus IP, to time/space tradeoffs for collision and element distinctness, to polynomial…
A somewhat pretentious presentation of number systems (N, Z, Q, R, C, Q_p, >...). The problem of a p-adic characterisation of good-reduction p-adic curves is posed.
We explore the space "just above" BQP by defining a complexity class PDQP (Product Dynamical Quantum Polynomial time) which is larger than BQP but does not contain NP relative to an oracle. The class is defined by imagining that quantum…
Near-term quantum computers are likely to have small depths due to short coherence time and noisy gates, and thus a potential way to use these quantum devices is using a hybrid scheme that interleaves them with classical computers. For…
Quantum annealing (QA) is a method for solving combinatorial optimization problems. We can estimate the computational time for QA using the adiabatic condition. The adiabatic condition consists of two parts: an energy gap and a transition…
A construction of covariant quantum phase observables, for Hamiltonians with a finite number of energy eigenvalues, has been recently given by D. Arsenovic et al. [Phys. Rev. A 85, 044103 (2012)]. For Hamiltonians generating periodic…
This paper presents a new period finding method based on conditional entropy that is both efficient and accurate. We demonstrate its applicability on simulated and real data. We find that it has comparable performance to other…
This paper, we consider some properties of rings via q-potent and periodic elements. In this paper we give some results of rings in which every element is a sum of an idempotent and a q-potent that commute; periodic rings and k-potent…
This paper has been withdrawn by the authors due to some technical problems in the paper.
Paper has been withdrawn, see comment.
This paper has been withdrawn.
By means of the shift operators we introduce a new periodicity concept on time scales. This new approach will enable researchers to investigate periodicity notion on a large class of time scales whose members may not satisfy the condition:…
We characterize the structure of the periods of a neuronal recurrence equation. Firstly, we give a characterization of k-chains in 0-1 periodic sequences. Secondly, we characterize the periods of all cycles of some neuronal recurrence…