Search Results
| Search type | Search syntax |
|---|---|
| Tags | [tag] |
| Exact | "words here" |
| Author |
user:1234 user:me (yours) |
| Score |
score:3 (3+) score:0 (none) |
| Answers |
answers:3 (3+) answers:0 (none) isaccepted:yes hasaccepted:no inquestion:1234 |
| Views | views:250 |
| Code | code:"if (foo != bar)" |
| Sections |
title:apples body:"apples oranges" |
| URL | url:"*.example.com" |
| Saves | in:saves |
| Status |
closed:yes duplicate:no migrated:no wiki:no |
| Types |
is:question is:answer |
| Exclude |
-[tag] -apples |
| For more details on advanced search visit our help page | |
Results tagged with pauli-group
Search options questions only
not deleted
user 14178
Questions about or related to the Pauli group.
3
votes
1
answer
68
views
Proof for how logical operators generated systematically will satisfy Pauli commutation
Let me assume a CSS code.
Suppose I have $n$ qubits and have $(n-k)$ stabilizers which we label by the set $S = \{S_1, S_2, .. S_{n-k}\}$. Let me then find $2k$ Pauli operators $L_i$ that are
Not pro …
- 616