Efficient representation of sparse Pauli error #205
Unanswered
EmilianoG-byte
asked this question in
Q&A
Replies: 2 comments · 3 replies
-
@refraction-ray any idea? 🤔 |
Beta Was this translation helpful? Give feedback.
0 replies
-
What you mean is Kraus operator like However, if jit is enabled, I cannot think of an efficient way to implement this for now. The essential problem is the same as applying two-qubit gates on random indices while maintaining jit, see related discussion: #171 (comment) |
Beta Was this translation helpful? Give feedback.
3 replies
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Uh oh!
There was an error while loading. Please reload this page.
-
Hi (again),
Is there a way to efficiently represent/implement a sparse Pauli channel? For instance, in Qiskit I could use the
pauli_error
function with a Pauli String representation as input.This "efficient" representation is particularly useful, because I am considering up to weight-2 Pauli strings, so for a high number of qubits$4^n$ vector would be useful. I am aware of the general_depolarizing_channel in TC, but this would imply running into the latter problem.
n
not having to save theAny idea?
Beta Was this translation helpful? Give feedback.
All reactions