Efficient distributed quantum computing

Overview of attention for article published in Proceedings of the Royal Society A: Mathematical, Physical & Engineering Sciences, May 2013

Altmetric Badge

About this Attention Score

In the top 5% of all research outputs scored by Altmetric
High Attention Score compared to outputs of the same age (95th percentile)
Good Attention Score compared to outputs of the same age and source (77th percentile)

Mentioned by

blogs: 1 blog
twitter: 6 X users
patent: 11 patents

reddit: 1 Redditor
q&a: 3 Q&A threads
podcasts: 1 podcast

Readers on

mendeley: 119 Mendeley
citeulike: 1 CiteULike

So far, Altmetric has seen 7 X posts from 6 X users, with an upper bound of 6,514 followers.

@jfitzsimons I think this paper has it covered: https://t.co/5vBzfRxYq4. Take a look at Section 4.3—it describes how sorting networks can implement parallel QRAM queries in polylog depth

We show that dist. point finding allows the multi-grover attack of https://t.co/YDYkewhGkr to parallelize efficiently *even in a two-dimensional mesh*. This means we can keep the p^1/4 attack cost at depths as low as p^1/8. But NIST's depth limits are…

Distributed computing with quantum computation http://t.co/XjNdF90zYS #research

Efficient distributed quantum computing - Proceedings of the Royal ... http://t.co/Bh4jKHDg1o

This page shows the most recent X posts that mention this research output. Click here to find out how to access more activity, including 3 additional X posts.