scientific article; zbMATH DE number 6292592

DOI10.4086/cjtcs.2007.001zbMath1286.68202arXivquant-ph/0701194OpenAlexW4243006797MaRDI QIDQ5414562

David Petrie Moulton, Lawren Smithline, Samuel Kutin

Publication date: 6 May 2014

Published in: Chicago Journal of Theoretical Computer Science (Search for Journal in Brave)

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Analytic circuit theory (94C05) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (1)

Unnamed Item

This page was built for publication: