Strilanc

30 ms·

421.
by Strilanc 7y ago
Because that's an extremely large amount of work to do, even if you're already familiar with the tools. It wouldn't be quite so bad if there were a huge repository of already proven theorems you could pull from. But in realit
422.
by Strilanc 7y ago
> Is [lower asymptotic time complexity] why “quantum computing is faster” is a common belief? Yes. Quantum computers are not faster classical computers, they are a type of computer with access to a wider class of operations. The asympt
423.
by Strilanc 8y ago
> why represent states as 2d complex vectors instead of quarterions? Aren't they the same thing? Only in the sense that they are both require four real coefficients. The quaternions have a particular multiplicative structure that
424.
by Strilanc 8y ago
One of the interesting aspects of quantum computing is that it upgrades these issues into actual bugs. Bit flips are errors in the Z basis, and phase flips (information leaks) are errors in the X basis. [1][2] Trying to build large scale qu
425.
by Strilanc 8y ago
> I've been told, but never actually looked it up, that there is a theorem that proves you always have to have at least one single point of failure. In what context? There's a theorem that arbitrarily-reliable computation can
426.
by Strilanc 8y ago
This is one of the psychology results that failed to replicate [1] in the replication crisis [2]. [1]: Artificial surveillance cues do not increase generosity: two meta-analyses https://www.sciencedirect.com/science/art
427.
by Strilanc 8y ago
If it were just a probability paradox, Bell's theorem wouldn't be a thing. You can win certain coordination games more often using quantum correlations than is possible with classical correlations. That being said, I have complain
428.
by Strilanc 8y ago
> pilot wave theory still requires the fewest number of assumptions, roughly on par with Many-Worlds, which means it's axiomatically simpler than other interpretations Isn't the most common complaint about pilot-wave that the
429.
by Strilanc 8y ago
If it's just the built-in AIs, you're right that it's much less impressive. They should be winning 100% of the time. For example, I don't know if they've fixed this, but you used to be able to beat the AIs 1v4 on th
430.
by Strilanc 8y ago
> a trained expert will find a lot of inaccuracies. This is not true for the journalist who reports international events and affairs Are you an expert of international events and affairs? Have you spoken to one about whether this is tr
431.
by Strilanc 8y ago
> with a recursive relationship between the size and coherence time of a topological qubit "recursive relationship"? What specifically about topological codes makes you think they'll scale so poorly?
432.
by Strilanc 8y ago
Only if you subscribe to some pretty tortured interpretations of quantum mechanics. QM still describes an objective state of the external world, and exactly how it changes over time.
433.
by Strilanc 8y ago
The no communication theorem is not the no communication hypothesis, it's actually a math proof. You start from the principles of quantum mechanics (unitarity, etc), define what you mean by entanglement (non-factoring states), and prov
434.
by Strilanc 8y ago
The article is also reporting numbers for a one-off setup that has scaling challenges, so it seems appropriate to compare against that type of number.
435.
by Strilanc 8y ago
> The [two qubit] gates are about as reliable as any others you will find in the quantum computing world, which is to say that operations complete successfully around 93 percent of the time. For comparison, ion-based quantum computers a
436.
by Strilanc 8y ago
It's actually extremely common for quantum algorithms to have measurement operations halfway through. But they apply to individual qubits, not the whole system. For example, error corrected quantum computation involves continuously mea
437.
by Strilanc 8y ago
Do you think this interpretation would pass the "put 10 random people in a room and ask them" test? I think the majority would expect to get the advertised speed unconditionally (in particular: not conditioned on using it a lot).
438.
by Strilanc 8y ago
The apparent paradox is that the choice of blue/green vs grue/bleen appears symmetric: green="grue if before 2028 else bleen" whereas grue="green before 2028 else blue". But then why do we strongly prefer to ma
439.
by Strilanc 8y ago
Where do you get that warning? Quirk inlines its javascript and image data so that it can all be in one single html file with no resources (to make the "Offline Copy" feature in the export menu trivial).
440.
by Strilanc 8y ago
Yes, there are two reasons that python is an ideal tool for quantum computing libraries at the moment. - In the NISQ era [1], circuits have limited depth and size. It doesn't matter so much which language (or even algorithm!) you use w
441.
by Strilanc 8y ago
Quirk: https://algassert.com/quirk - Drag-and-drop what-you-see-is-what-you-get UI instead of script-based. Smooths out the learning curve. - Supports putting state displays in the middle of the circuit, so you can directly
442.
by Strilanc 8y ago
> Having a bunch of entangled particles doesn't actually let you communicate. [...] this is the no-communication theorem.
443.
by Strilanc 8y ago
Incentivizing number of comments puts flame wars and chain letters at the top.
444.
by Strilanc 8y ago
This phenomenon has a name: Moravec's Paradox [1]. If a chimp or a four year old can do it, a computer probably has a hard time with it. An interesting counter-example to the trend is theorem proving. A symbolic task that wasn't p
445.
by Strilanc 8y ago
Even if the number of qubits doubled every year from here on out, it would be 15+ years until we had enough working space to run Shor's algorithm on modern cryptographic key sizes. Back of the envelope: - It takes 9n error-corrected qu
446.
by Strilanc 8y ago
Wait, isn't 4 bytes per character also not enough to store UTF8? Can't each character be up to 8 bytes long, because the number of leading 1s in the first byte determines the length of the character?
447.
by Strilanc 8y ago
Quantum teleportation is in fact a quantum generalization of the classical one time pad. And it does form a secure channel, but with the same caveats as in the classical case (e.g. it's not authenticated). Many quantum things have clas
448.
by Strilanc 8y ago
> almost all real numbers contain an infinite amount of information. Since a finite volume of space can't contain more than a finite amount of information [..] The Kolmogorov complexity can't be higher than the state of the i
449.
by Strilanc 8y ago
> Newtonian physics cannot even predict the future positions of three body from their initial positions. You're confusing chaotic systems with random systems. Chaotic systems are still deterministic. [1] > according to Newton,
450.
by Strilanc 8y ago
Thanks, that's much clearer and I understand now. That's a good simple lower bound.

More ›