https://arxiv.org/abs/1806.05108 ]]>

https://www.technologyreview.com/s/612760/quantum-computers-component-shortage/ ]]>

Some interesting facts about the recursive use of the CS decomposition.

In general, for arbitrary initial unitary matrix U, there are a lot of free parameters that are not unique in this decomposition and can be used for optimization

In the case that U is the quantum Fourier Transform matrix, there exists a 1 dimensional path of nodes in the tree going from the root node to one of its leaves with all nodes outside that path equal to 1. In other words, the tree reduces to a simple chain from the root node to one of the leaves

]]>My bet: for any such computation, there will exist an “horizontal” morphism connecting all matrix elements row-wise in the word dictionary deployement of any such tree that makes the original computation obsolete for any N greater some N0. ]]>

http://kunstler.com/clusterfuck-nation/merry-christmas-to-all/ ]]>

http://www.tomdispatch.com/post/176509/tomgram%3A_michael_klare%2C_the_coming_of_hyperwar/ ]]>

https://www.nature.com/articles/d41586-018-07801-3 ]]>

How do you cook Rigetti spaghetti? Place 2 Google dragons called Martinis and Monroe, above Rigetti, on both sides of it, and tell them they can eat the Rigetti spaghetti, with human meatballs, if they cook it first