On the Role of Hadamard Gates in Quantum Circuits
| dc.creator | Shepherd, Dan | |
| dc.date | 2005-08-22 | |
| dc.date | 2006-03-30 | |
| dc.date.accessioned | 2026-07-07T06:43:40Z | |
| dc.date.available | 2026-07-07T06:43:40Z | |
| dc.description | 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. | |
| dc.description | 16 pages, last section clarified, typos corrected, references added, minor rewording | |
| dc.identifier | https://arxiv.org/abs/quant-ph/0508153 | |
| dc.identifier | http://arxiv.org/abs/quant-ph/0508153 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/102502 | |
| dc.subject | Quantum Physics | |
| dc.title | On the Role of Hadamard Gates in Quantum Circuits | |
| dc.type | text |