Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

On the Role of Hadamard Gates in Quantum Circuits

On the Role of Hadamard Gates in Quantum Circuits 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Quantum Information Processing Springer Journals

On the Role of Hadamard Gates in Quantum Circuits

Quantum Information Processing , Volume 5 (3) – May 27, 2006

Loading next page...
 
/lp/springer-journals/on-the-role-of-hadamard-gates-in-quantum-circuits-NK3yRj2Fp7

References (8)

Publisher
Springer Journals
Copyright
Copyright © 2006 by Springer Science+Business Media, Inc.
Subject
Physics; Quantum Information Technology, Spintronics; Quantum Computing; Data Structures, Cryptology and Information Theory; Quantum Physics; Mathematical Physics
ISSN
1570-0755
eISSN
1573-1332
DOI
10.1007/s11128-006-0023-4
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Quantum Information ProcessingSpringer Journals

Published: May 27, 2006

There are no references for this article.