You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Currently, the equivalence of two quantum circuits, π and π, is checked by comparing ππβ to the identity DD in isCloseToIdentity. However, this approach does not account for approximate equivalence, which can be sufficient in practice.
Describe the solution you'd like
To address this, the Frobenius inner product between π and π can be computed and compared to a predefined threshold to determine approximate equivalence.
AlternatingChecker:
Compute the trace of ππβ and compare it with the threshold.
ConstructionChecker:
Invert circuit π
Compute ππβ
Compute the trace of ππβ and compare it with the threshold.
SimulationChecker:
Configure fidelityThreshold accordingly
The text was updated successfully, but these errors were encountered:
What's the problem this feature will solve?
Currently, the equivalence of two quantum circuits, π and π, is checked by comparing ππβ to the identity DD in
isCloseToIdentity
. However, this approach does not account for approximate equivalence, which can be sufficient in practice.Describe the solution you'd like
To address this, the Frobenius inner product between π and π can be computed and compared to a predefined threshold to determine approximate equivalence.
AlternatingChecker:
ConstructionChecker:
SimulationChecker:
The text was updated successfully, but these errors were encountered: