Skip to content

Conversation

stylewarning
Copy link
Member

add a new matrix->ansatz function

This commit adds a new function MATRIX->ANSATZ useful for finding
matrices in a given form. It just boils down to a Nelder-Mead which is
particularly effective in many cases. This function can be used to
build compilers for relatively exotic gate sets, provided you've
discovered a function which can represent them.

@stylewarning stylewarning requested a review from a team as a code owner August 7, 2020 02:34
@stylewarning
Copy link
Member Author

whoops, didn't mean to include the other stuff

ecpeterson
ecpeterson previously approved these changes Aug 7, 2020
Copy link
Contributor

@ecpeterson ecpeterson left a comment

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

~ Perhaps ~ one should open a tracking issue to use this utility in the template searching code in approx.lisp .

@stylewarning
Copy link
Member Author

I’ll address these comments.

This commit adds a new function SOLVE-FOR-ANSATZ-INPUTS useful for
finding matrices in a given form. It just boils down to a Nelder-Mead
which is particularly effective in many cases. This function can be
used to build compilers for relatively exotic gate sets, provided
you've discovered a function which can represent them.
@stylewarning
Copy link
Member Author

@kilimanjaro I can't add you to re-review with the G U I, but maybe you'd like to do a second-over again.

Co-authored-by: Erik Davis <erik@cadlag.org>
Co-authored-by: Erik Davis <erik@cadlag.org>
@stylewarning
Copy link
Member Author

ping @notmgsk

@notmgsk notmgsk merged commit 8e28da9 into quil-lang:master Sep 3, 2020
@stylewarning stylewarning deleted the ansatz-search branch September 22, 2020 16:08
@notmgsk notmgsk mentioned this pull request Dec 14, 2020
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants