Skip to content

Conversation

@tanujkhattar
Copy link
Collaborator

Adds support for correctly counting number of qubits for cases when the exact data is not available, and hence it's not possible to create the circuit decomposition.

@mpharrigan
Copy link
Collaborator

for testing sympy equality, they recommend subtracting the two expressions and asserting that it simplifies to zero. using == tests for strict equality of the expression itself (i.e. its format or in-memory rep)

# Litinski 2023 https://arxiv.org/abs/2306.08585
# Figure/Table 8. Lists modular multiplication as 2.25n^2+9n toffoli.
# The following formula is 2.25n^2+8.25n-1 written with rationals because sympy comparison fails with floats.
# The following formula is 2.25n^2+7.25n-1 written with rationals because sympy comparison fails with floats.
Copy link
Collaborator Author

Choose a reason for hiding this comment

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

@NoureldinYosri Can you please verify that this change is expected? I've simply updated the test assuming the constant factor reduction in qroam uncomputation is translating into reduced constant factors here.

Copy link
Contributor

Choose a reason for hiding this comment

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

yes, the constant factor from qroam gets multiplied by $n/4$ here so it reduces the coefficient of $n$

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.

3 participants