Strilanc

65 ms·

631.
by Strilanc 11y ago
You're one of the lucky ten thousand today. [1] Following a vertical polarizer with a horizontal polarizer will block all light. But putting a diagonal polarizer in between will result in some of the light getting through. You can find
632.
by Strilanc 11y ago
Not really. A minor problem is that it fails to capture the fact that this process will also hold the qubit stable in the |1> state. More importantly, it fails to capture the limiting behavior of the success rate; it should move smoothly
633.
by Strilanc 11y ago
Any effect that is conditional on the state and thermodynamically irreversible counts as a measurement. One way to do a partial measurement is to make the conditional effects less orthogonal to each other, e.g. cause a target qubit to condi
634.
by Strilanc 11y ago
If I understand correctly, what's going on is... Suppose you have a system rotating between state |0> and state |1>, like f(t) = cos(t) |0> + sin(t) |1>. If you measure at time t, you get |0> with probability cos(t)^2. A
635.
You versus Bell Tests and the No Communication Theorem(algorithmicassertions.com)
1 points by Strilanc 11y ago|0 comments
636.
by Strilanc 11y ago
You have to allow scripts to see the annotations. Unfortunately, allowing scripts also activates the site's "nag you with overlays about subscribing" feature. So might as well just leave them blocked and read the paper as-is.
637.
by Strilanc 11y ago
This article says that the SEP is more comprehensive and more authoritative than Wikipedia. I agree that it's more authoritative, what with it being written by authorities in philosophy. But "more comprehensive"...? Wikipedia
638.
by Strilanc 11y ago
You won't succeed at the goal of being optimal. But you can at least do better than the default, donate 10%, and feel good about that. [1] > Why ten percent? > [...] The most important thing is having a Schelling point, and te
639.
by Strilanc 11y ago
Why are the quantum measurements the focus of this paper? The real source of entropy is the random bits being generated to decide which measurement to perform; the measurement actually being performed is just an after-show. Regardless, I th
640.
by Strilanc 11y ago
The graph title really should include more details than just "pay". Based on the site linked in the github page's readme, it's graphing "Median weekly earnings of full-time wage and salary workers by detailed occupa
641.
by Strilanc 11y ago
The number of digits needed to hold an output coefficient (and intermediate coefficients during the transform) increases with the number of input coefficients (because so many get added together). This forces the size of the ring to increas
642.
by Strilanc 11y ago
This is technically not an O(n lg n) algorithm. Any O(n lg n) polynomial multiplication algorithm can be trivially turned into an O(n lg n) multiplication algorithm (just throw in some carries at the end), but O(n lg n) multiplication is an
643.
by Strilanc 11y ago
If the universe we find ourselves in is a result of post-selecting for mathematical models where life can exist (i.e. by the anthropic principle), why is the universe so large and so rich in neg-entropy ? Shouldn't minimally-viable-
644.
by Strilanc 11y ago
You can absolutely work around that: - Require an explicit initial value to be provided. - Or require that a collection/iterator/generator of values be provided (and fail if it's not large enough). - Or have a built-in ArrayB
645.
by Strilanc 11y ago
> unlike Pascal-style strings, they can be usefully sliced, especially if you can modify them strtok-style. Slicing Pascal-style strings is also easy and constant-time: just track the buffer, offset, and length of the slice of characters
646.
by Strilanc 11y ago
> The right language design decision for these languages (managed languages like Java) might have been to make uninitialized references have a garbage value that reliably throws an exception when used (i.e. null) -- you can copy the ref
647.
Simulating a Claimed NP=BQP Algorithm(algorithmicassertions.com)
49 points by Strilanc 11y ago|0 comments
648.
by Strilanc 11y ago
> According to Aaronson and others, the D-Wave architecture has not demonstrated any behavior that can't be explained using classical physics That's not Scott's definitive opinion anymore. For example, from [1]: > No
649.
by Strilanc 11y ago
You're attacking the parts of the analogy that don't apply to the actual cryptography. Best way to see how they get around the issue you're talking about is to watch the video.
650.
by Strilanc 11y ago
Inside the voting booth you pick an identified ballot and are given a zero knowledge proof that it corresponds to the candidate you want. The fact that it's a zero knowledge proof prevents you from using it to convince other people. Th
651.
by Strilanc 11y ago
It entirely depends if it's using cryptography or not [1]. For example, using zero knowledge proofs you can be given a receipt that lets you verify your vote was included in the total (without allowing you to prove to an attacker which
652.
by Strilanc 11y ago
The video isn't supposed to be a proof that no technique can do it; the video just demonstrates that soap bubbles can get stuck in a local minimum. (Also, blowing is not guaranteed to move the answer towards the global solution. Even i
653.
by Strilanc 11y ago
Here's a video demonstrating your point [1]. I particularly like where he blows on it a bit to push it from a local minimum to the global minimum. 1: https://youtu.be/dAyDi1aa40E
654.
by Strilanc 11y ago
Bell tests give more correlation than what you're describing could. That's what makes it "spooky". For example, there are coordination games which can be won with certainty only by using entanglement (or full communica
655.
by Strilanc 11y ago
Ah, of course. (I didn't realize you were allowed to use each number in both subsets, so I have no idea if I would have figured it out or not on my own.)
656.
by Strilanc 11y ago
Why is it easy to prove that this particular set of numbers can be broken into equal subsets?
657.
by Strilanc 11y ago
Most applications of hashes, to inputs that aren't passwords , are protected because their input space is so large that it can't be brute forced or because their input simply isn't secret. The speed of the hash function then
658.
by Strilanc 11y ago
> If you need a really conservative choice, hash the message m as SHA512(m)||SHA3-512(m) (the concatenation of the individual hashes). Although keep in mind that you'll leak information about the input if either hash leaks infor
659.
by Strilanc 11y ago
Michael Nielsen, co-author of the de-facto standard textbook for quantum computing [1], has an accessible "Quantum Computing for the Determined" video series on youtube [2]. (There used to be a pdf of the textbook online at [3], b
660.
Checking a Claimed BQP=NP Algorithm(algorithmicassertions.com)
53 points by Strilanc 11y ago|2 comments

More ›