Timeline for Polynomial algorithms for UPB (Unextendable Product Bases)
Current License: CC BY-SA 2.5
8 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
S May 7, 2012 at 14:32 | history | suggested | Juan Bermejo Vega |
tagged as quantum-information, this tag applies to many posts absorbed from TP.SE posts after the closure of this site
|
|
May 7, 2012 at 12:47 | review | Suggested edits | |||
S May 7, 2012 at 14:32 | |||||
Mar 2, 2012 at 0:54 | answer | added | Lin Chen | timeline score: 4 | |
Mar 27, 2011 at 10:25 | history | edited | Marcin Kotowski | CC BY-SA 2.5 |
added condition c)
|
Mar 27, 2011 at 4:31 | answer | added | Peter Shor | timeline score: 7 | |
Mar 27, 2011 at 4:13 | comment | added | Peter Shor | @Artem: the condition that's missing is that the number of vectors is strictly less than the dimension of $H_1 \otimes \ldots \otimes H_n$. | |
Mar 27, 2011 at 2:11 | comment | added | Artem Kaznatcheev♦ | I am confused... wouldn't the standard basis for H satisfy the UPB condition in all cases? Or are there some other conditions I am missing. | |
Mar 26, 2011 at 18:19 | history | asked | Marcin Kotowski | CC BY-SA 2.5 |