Related papers: A fast quantum search algorithm by controlled meas…
The paper has been withdrawn because the research work is still in progress.
The paper has been withdrawn
This paper has been withdrawn by the authors.
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 due to the withdrawal of the related paper.
The paper has been withdrawn
This paper has been withdrawn by the author(s). Please refer to quant-ph/0311171.
We discuss the quantum search algorithm using complex queries that has recently been published by Grover (quant-ph/9706005). We recall the algorithm adding some details showing which complex query has to be evaluated. Based on this version…
This paper has been withdrawn by the author due to a crucial error in eq.59. I apologize for the inconveniences.
We introduce a feedback control algorithm that increases the speed at which a measurement extracts information about a $d$-dimensional system by a factor that scales as $d^2$. Generalizing this algorithm, we apply it to a register of $n$…
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…
The paper has been withdrawn.
A modification of Tulsi's quantum search algorithm with intermediate measurements of the control is presented. In order to analyze the effect of measurements in quantum searches, a different choice of the angular parameter is used. The…
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 introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
We introduce an algorithm for combinatorial search on quantum computers that is capable of significantly concentrating amplitude into solutions for some NP search problems, on average. This is done by exploiting the same aspects of problem…
Aaronson, Bouland, Fitzsimons and Lee introduced the complexity class PDQP (which was original labeled naCQP), an alteration of BQP enhanced with the ability to obtain non-collapsing measurements, samples of quantum states without…
We propose an approach to quantum computing in which quantum gate strengths are parametrized by quantum degrees of freedom, and the capability of the quantum computer to perform desired tasks is monitored and gradually improved by…
This paper has been withdrawn by the authors owing to a mistake in the proof of the basic lemma.
This paper has been withdrawn by the author because it was a speculative investigation.