-
Notifications
You must be signed in to change notification settings - Fork 70
Implemented 8n T complexity decomposition of LessThanEqual gate #211
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Conversation
@tanujkhattar this is now ready for review |
That was @ncrubin |
def _has_unitary_(self): | ||
return True |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
I don't think this is necessary(?)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
it's needed until cirq.unitary starts to support gates/operations that allocate ancilla, without it some tests fail
If this is from a paper, please cite it! |
@mpharrigan added citation |
what's going on with this? will you re-open against cirq-ft? |
@mpharrigan yes. closed in favour of quantumlib/Cirq#6156 |
This is the
Comparison Oracle
from https://static-content.springer.com/esm/art%3A10.1038%2Fs41534-018-0071-5/MediaObjects/41534_2018_71_MOESM1_ESM.pdfpart of #112