On the Role of Hadamard Gates in Quantum Circuits

Details On the Role of Hadamard Gates in Quantum Circuits On the Role of Hadamard Gates in Quantum Circuits

2005-08-22

arxiv.org/abs/quant-ph/0508153v2

Physics

Quantum Physics

16 pages, last section clarified, typos corrected, references added, minor rewording

Scientific paper

We study a reduced quantum circuit computation paradigm in which the only allowable gates either permute the computational basis states or else apply a "global Hadamard operation", i.e. apply a Hadamard operation to every qubit simultaneously. In this model, we discuss complexity bounds (lower-bounding the number of global Hadamard operations) for common quantum algorithms : we illustrate upper bounds for Shor's Algorithm, and prove lower bounds for Grover's Algorithm. We also use our formalism to display a gate that is neither quantum-universal nor classically simulable, on the assumption that Integer Factoring is not in BPP.

Affiliated with

Also associated with

No associations

Rating

On the Role of Hadamard Gates in Quantum Circuits does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the Role of Hadamard Gates in Quantum Circuits, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the Role of Hadamard Gates in Quantum Circuits will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-462789