L. Fortnow, One complexity theorist's view of quantum computing, quantph /0003035. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
The Complexity of Tensor Circuit Evaluation (Extended Abstract) - Beaudry, Holzer (Correct)
....Using tensor calculus in this context is especially appealing, if only because of the many applications matrix algebra finds in various areas, such as the specification of parallel algorithms. Also, since the design of algorithms for quantum computers makes extensive use of unitary matrices (see [10]) tensor formulas and circuits may become useful tools for better understanding the power of this computational model. In this article we extend the research of Damm et al. from formulas to circuits. We show that over unrestricted tensor circuits, the completeness statements for their two basic ....
L. Fortnow. One complexity theorist's view of quantum computing. Technical Report quant-ph/0003035, Los Alamos arXiv, 2000.
COCOON'01 Submission - Title Deterministic Application (Correct)
No context found.
L. Fortnow, One complexity theorist's view of quantum computing, quantph /0003035.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC