Quantum logic synthesis by symbolic reachability analysis

doi:10.1145/996566.996790

Quantum logic synthesis by symbolic reachability analysis

Full Text:

PDF

Buy this Article

Authors:	William N. N. Hung	Intel Corporation, Hillsboro, OR
	Xiaoyu Song	Portland State University, Portland, OR
	Guowu Yang	Portland State University, Portland, OR
	Jin Yang	Intel Corporation, Hillsboro, OR
	Marek Perkowski	Portland State University, Portland, OR

	2004 Article
Bibliometrics
· Downloads (6 Weeks): 2 · Downloads (12 Months): 25 · Downloads (cumulative): 376 · Citation Count: 10

Published in:

	· Proceeding
	DAC '04 Proceedings of the 41st annual Design Automation Conference
	Pages 838-841 ACM New York, NY, USA ©2004 table of contents ISBN:1-58113-828-8 doi>10.1145/996566.996790

Tools and Resources

Buy this Article
Request Permissions
TOC Service:
- Email
- RSS
Save to Binder
Export Formats:
- BibTeX
- EndNote
- ACM Ref
Upcoming Conference:
- DAC '13

Share:

|

Tags: algorithms design design aids formal verification model checking quantum computing reversible logic satisfiability

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 Digital Library is published by the Association for Computing Machinery. Copyright © 2013 ACM, Inc.
Terms of Usage Privacy Policy Code of Ethics Contact Us

Useful downloads:

Adobe Acrobat

QuickTime

Windows Media Player

Real Player

The ACM Guide to Computing Literature

All Tags

Export Formats

Save to Binder