On the Role of Hadamard Gates in Quantum Circuits

Shepherd Daniel

Research output: Contribution to journalArticle (Academic Journal)peer-review

9 Citations (Scopus)


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'', \emph{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 \textbf{BPP}.
Translated title of the contributionOn the Role of Hadamard Gates in Quantum Circuits
Original languageEnglish
Article number161-177
JournalQuantum Information Processing
Publication statusPublished - 2006

Bibliographical note

Other identifier: 2000588


Dive into the research topics of 'On the Role of Hadamard Gates in Quantum Circuits'. Together they form a unique fingerprint.

Cite this