SIGN IN
SIGN UP
Revisiting a limit on efficient quantum computation
Full Text:
Pdf
Buy this Article
Author:
Tarsem S. Purewal, Jr.
University of Georgia, Athens, GA
Published in:
· Proceeding
ACM-SE 44
Proceedings of the 44th annual Southeast regional conference
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-315-8
doi>
10.1145/1185448.1185502
2006 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 7
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
complexity of proof procedures
computational complexity
counting problems
design
error control codes
quantum computing
theory
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder