Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
PDF Tools
Image Tools
Text Tools
OCR Tools
Symbol and Emoji Tools
On-screen Keyboard
Latex Math Equation to Image
Smart IPA Phonetic Keyboard
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
135
click to vote
COCO
2000
Springer
65
views
Algorithms
»
more
COCO 2000
»
On the Complexity of Quantum ACC
15 years 7 months ago
Download
www.cs.sjsu.edu
For any q > 1, let MODq be a quantum gate that determines if the number of 1’s in the input is divisible by q. We show that for any q, t > 1, MODq is equivalent to MODt (u...
Frederic Green, Steven Homer, Chris Pollett
claim paper
Read More »