Strilanc

81 ms·

691.
by Strilanc 11y ago
I think the reason it doesn't count as a measurement is that the the gravitational effects are so weak the no-far-off-particle and yes-far-off-particle outcomes overlap substantially. You start with a cross-section of where a "mea
692.
by Strilanc 11y ago
You'd need the box to block gravity, and have a way of letting only your single photon pass through the box to interact with the system. Otherwise the star's position would have already been measured by past light being deflected.
693.
by Strilanc 11y ago
A quantum query is thought of as one query because it acts like one query in other contexts. For example, if the input is defined computationally ("evaluate F(n) to get the n'th bit"), then a quantum circuit will only need to
694.
by Strilanc 11y ago
You've peeked 8/4+1 = 3 times and seen 0 1 0 _ _ _ _ _. Is it 3/4 zeros or is it 3/4 ones? 01011111 01010000
695.
by Strilanc 11y ago
Query complexity is all about how many peeks it takes to figure out something about a random-access bit array. For example, suppose I give you a bunch of bits and promise that either exactly 3/4s of them are true, or exactly 3/4s
696.
by Strilanc 11y ago
Nit: single line lambdas can be written like `a => a + 1` instead of `a => { return a + 1 }`. Cuts the amount of bracket nesting.
697.
Constructing Large Increment Gates(strilanc.com)
3 points by Strilanc 11y ago|0 comments
698.
by Strilanc 11y ago
Have you looked for intuitive arguments about why P ≠ NP? Scott Aaronson's blog is a good place to find such things [1]: > If P=NP, then the world would be a profoundly different place than we usually assume it to be. There would
699.
by Strilanc 11y ago
I don't understand your example. Why is it necessary for with-file to me a macro? It seems like any language with lambdas could write it as a higher-order function that asked for a consumer. How does having a with-file macro fix the &q
700.
by Strilanc 11y ago
Presumably the axiom of choice is a good example of something unlikely to be applicable in a real world context. Unless you're trying to anticipate when a rogue mathematician is about to attack, of course. (Also halting oracles.)
701.
Constructing Large Controlled Nots(strilanc.com)
1 points by Strilanc 11y ago|0 comments
702.
by Strilanc 11y ago
First, waves still pass through each other when destructively interfering. They temporarily cancel out each others' amplitudes, but not each others' change-in-amplitude, so they continue to propagate. Second, XOR is not a univer
703.
by Strilanc 11y ago
Digital circuits work fine for simulating, and emulating, quantum computers. They probably chose analog circuits because that's what they like to work with, or because the more-direct encoding allows for efficiencies.
704.
by Strilanc 11y ago
The paper's conclusion [1] does a much better job of summarizing what they did than the posted article. For example, they explicitly note limitations: > Because the QMT representation uses frequencies to encode the state, the numbe
705.
by Strilanc 11y ago
You could take the continuous differential equations that describe the elements of a CPU, consider what's going on as the program feeds through, and take the derivative of that. For quantum computers all programs correspond to unitary
706.
by Strilanc 11y ago
I'd enable ads - if I expected them to contain truthful and unbiased information that was useful and relevant to me. Which really goes to the crux of the problem, I think. (The useful and relevant part would probably require cutting th
707.
by Strilanc 11y ago
Hm. Too bad there's not a stack exchange for dealing with individual government bureaucracies.
708.
by Strilanc 11y ago
A common implicit assumption in complexity analysis is that machine words can hold O(lg n) bits, and that those words can be operated on in constant time. Lots and lots of algorithms gain an extra lg(n) factor if you drop that assumption.
709.
by Strilanc 11y ago
The paper "Algorithm Aversion: People Erroneously Avoid Algorithms After Seeing Them Err" [1] has references to examples. > Dawes subsequently gathered a large body of evidence showing that human experts did not perform as wel
710.
by Strilanc 11y ago
Half the battle is coming to terms with the controls. If you wanted to make it easier to use (i.e. if it's not part of the charm that it's hard to control, like QWOP), you could go with "click and hold where you want to turn
711.
by Strilanc 11y ago
Based on what I've skimmed, which is admittedly not that much, I'd bet the author spends most of the book making mind projection fallacies like this one: > while we can easily recognize a familiar face, we cannot describe that
712.
by Strilanc 11y ago
The paper mentions that efficiency of quadratic voting only kicks in with larger numbers of participants (> 50).
713.
by Strilanc 11y ago
How does this system deal with the logarithmic value of dollars, and the asymmetry in who has them? When you get ln(X) happiness from X dollars, you are sacrificing 1/X happiness per dollar spent. A billionaire buying a thousand votes
714.
by Strilanc 11y ago
I think if I split the cleaner node into two nodes, the standard solution has to change (not sure if there is one or not). It prevents the qubit needed to encode the information for the receiver from being in the same place as the qubit nee
715.
by Strilanc 11y ago
> if I have a one-qubit state that's restricted to the set of states that are linear combinations of ±|0> ± |1>, then are only two such states up to global phase, and those states are orthogonal, so I can just measure without
716.
by Strilanc 11y ago
This is a pretty common comment. Unfortunately, explaining the background details turns any quantum computing post into an "intro to quantum computing" post. My current compromise is to just slip in links to the video series Quant
717.
by Strilanc 11y ago
Yup, that solution also works. I completely missed it. It's even a bit more flexible, in that the A-to-Receiver edge could be flipped or turned into a broadcast-from-third-party without breaking the solution. I did generate the puzzle
718.
A Quantum Network Flow Puzzle(strilanc.com)
23 points by Strilanc 11y ago|7 comments
719.
by Strilanc 11y ago
No, there's not only one way. Also, IBM did not invent/discover the layout in question (I think?). The article does tone it down later on, at least: > IBM's design shows the best potential to scale by adding more qubits t
720.
by Strilanc 11y ago
Yes. Because of reading [1]. 1: http://slatestarcodex.com/2014/09/30/i-can-tolerate-anything...

More ›