• 0 Posts
  • 8 Comments
Joined 1 year ago
cake
Cake day: July 2nd, 2023

help-circle





  • Right now fediverse is mostly made up of techy people - which is fine! But there are many other kinds of people you might potentially want to interact with online. Threads could bring in normies and celebs to the metaverse. Normies are a mixed bag - this includes your racist uncle but also your really cool and funny friend who can’t be bothered to set up a mastodon account. Celebs are a source of real world influence (I’m including politicians and journalists for example in this category) which is obviously attractive. I’m gonna miss cyberbullying local politicians on twitter, and it would be nice to be able to continue doing so through the comfort of e.g. kbin.

    I get your point and I largely agree but it isn’t that hard to see the appeal of threads for me. I don’t think it’s gonna work out in the end though so I really hope they mostly stay of the broader fediverse.


  • This is article is missleading about how quantum computing works.

    Superposition increases the computing power of a quantum computer exponentially. For example, two qubits can exist in four states simultaneously (00, 01, 10, 11), three qubits in eight states, and so on. This allows quantum computers to process a massive number of possibilities at once.

    Quantum computers aren’t faster because they “process” multiple “possibilities” at once. Quantum computers aren’t any faster than regular computers when it comes to general purpose computing. You can exploit some interesting properties about quantum computing to solve certain problems asymptotically faster, like with Shor’s algorithm.

    This means that the time to solve a problem as the size of the problem grows scales better. Using Shor’s algorithm, the time to factor a polynomial is proprtional to (log N)^2 log log N, where N is the size of the input data, instead of the fastest known non-quantum algorithm which takes time proportional to e^(1.9(log N)^(1/3)(log log N)^(2/3)). Note that the majority of problems that we would maybe like to solve using a computer don’t have any fancy quantum algorithms asociated with them and as such are no faster than a normal computer,

    Given a large enough problem that can be solved with a quantum algorithm, a quantum computer will eventually outperform a non-quantum computer. This does not mean that quantum computers can solve arbitrary problems quickly.