On the role of Hadamard gates in quantum circuits

From MaRDI portal
Publication:850548

DOI10.1007/S11128-006-0023-4zbMATH Open1103.68055arXivquant-ph/0508153OpenAlexW1988916413MaRDI QIDQ850548FDOQ850548


Authors: D. J. Shepherd Edit this on Wikidata


Publication date: 3 November 2006

Published in: Quantum Information Processing (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/quant-ph/0508153




Recommendations




Cites Work


Cited In (12)





This page was built for publication: On the role of Hadamard gates in quantum circuits

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q850548)