Related papers: Comments on quant-ph/0609176
This paper was withdrawn by the author because severe errors were discovered.
A recent e-print (cond-mat/0604532) presented a proposed Comment to Applied Physics Letters on our publication Appl. Phys. Lett. 88, 162503 (2006), cond-mat/0603260. Here is our Response. As the proposed Comment has now been rejected by…
In this paper, we extend a previously presented Grover-based heuristic to tackle general combinatorial optimization problems with linear constraints. We further describe the introduced method as a framework that enables performance…
The desired interference required for quantum computing may be modified by the wave function oscillations for the implementation of quantum algorithms[Phys.Rev.Lett.84(2000)1615]. To diminish such detrimental effect, we propose a scheme…
Resubmitted as hep-ph/9502316. Removed from hep-th. Incorrigibly inept submitter publicly excoriated.
Quantum computing represents a significant advancement in computational capabilities. Of particular concern is its impact on asymmetric cryptography through, notably, Shor's algorithm and the more recently developed Regev's algorithm for…
Quantum information science currently poses a troubling contradiction. It can be summarized as: (1) To factor efficiently, quantum computers must perform exponentially precise energy estimation. (2) Exponentially precise energy estimation…
In this work we study five Grovers algorithm modifications, where each iteration is constructed by two generalized Householder reflections, against inaccuracies in the phases. By using semi-empirical methods, we investigate various…
The paper has been withdrawn due to numerical error.
Withdrawn by the author due to irreparable errors. We present a quantum algorithm that in the black-box model performs a search in an ordered list of N elements. Using 3/4 log N + O(1) queries, it achieves a success probability of at least…
One of the significant breakthroughs in quantum computation is Grover's algorithm for unsorted database search. Recently, the applications of Grover's algorithm to solve global optimization problems have been demonstrated, where unknown…
Approximate Counting refers to the problem where we are given query access to a function $f : [N] \to \{0,1\}$, and we wish to estimate $K = #\{x : f(x) = 1\}$ to within a factor of $1+\epsilon$ (with high probability), while minimizing the…
Logic entailment is essential to reasoning, but entailment checking has the worst-case complexity of an exponential of the variable size. With recent development, quantum computing when mature may allow an effective approach for various…
It has been shown in recent years that quantum information has a topological nature (\cite{AC}, \cite{Co}, \cite{Co2}). In \cite{V}, Vicary undergoes the study of quantum algorithms using this new topological approach. The advantage of this…
This paper has been withdrawn by the author due to a crucial sign error in equation 1.
The quantum perceptron, the variational circuit, and the Grover algorithm have been proposed as promising components for quantum machine learning. This paper presents a new quantum perceptron that combines the quantum variational circuit…
Grover's algorithm is a quantum search algorithm that proceeds by repeated applications of the Grover operator and the Oracle until the state evolves to one of the target states. In the standard version of the algorithm, the Grover operator…
This is the reply to [arXiv:1711.00764], in which the authors claim that there is crucial normalization error in PRL 116, 040502 (2016) and that some quantities appearing in the method of PRL 116, 040502 (2016) are not experimentally…
For any symmetric key cryptosystem with $n$-bit secret key, the key can be recovered in $O(2^{n/2})$ exploiting Grover search algorithm, resulting in the effective key length to be half. In this direction, subsequent work has been done on…
A attempt at a quantum algorithm for solving NP problems is presented. Now withdrawn because some crucial operators were not unitary.