Timeline for Algorithm to decompose a sparse unitary matrix into a Kronecker product of smaller unitary matricies
Current License: CC BY-SA 3.0
12 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jun 16, 2023 at 6:27 | vote | accept | KF Gauss | ||
| Apr 13, 2017 at 12:19 | history | edited | CommunityBot |
replaced http://math.stackexchange.com/ with https://math.stackexchange.com/
|
|
| Mar 19, 2016 at 19:37 | history | tweeted | twitter.com/StackSciComp/status/711275397363666950 | ||
| Mar 17, 2016 at 23:51 | answer | added | KF Gauss | timeline score: 1 | |
| Mar 17, 2016 at 22:53 | history | edited | KF Gauss | CC BY-SA 3.0 |
capitalization
|
| Mar 17, 2016 at 22:38 | comment | added | KF Gauss | I found a resource here outline how to check and do the inverse kronecker for a general matrix. In the case of Quantum systems, these matricies need to be unitary, so can is there another scheme that can guarantee that? | |
| Mar 17, 2016 at 22:36 | history | edited | KF Gauss | CC BY-SA 3.0 |
added 321 characters in body
|
| Mar 17, 2016 at 22:27 | history | edited | KF Gauss | CC BY-SA 3.0 |
added bit about case when matrix is not kronecker product
|
| Mar 17, 2016 at 22:26 | comment | added | KF Gauss | Good point, I was considering general operators on Hilbert tensor product spaces (like in Quantum systems). There the unitary matrices are regularly kronecker products. So the zeroth order step would be to check whether the matrix is a kronecker product. | |
| Mar 17, 2016 at 7:20 | comment | added | Federico Poloni | Not all matrices can be written as Kronecker products at all; it is a very special property similar to being low rank. What do you have in mind? Could you write a formula? | |
| Mar 16, 2016 at 22:33 | review | First posts | |||
| Mar 17, 2016 at 0:30 | |||||
| Mar 16, 2016 at 22:31 | history | asked | KF Gauss | CC BY-SA 3.0 |