Live data from Hacker News

Show HN: Play with real quantum physics in your browser

quantum.orgsoft.org

11–20 of 78 posts

Re: Show HN: Play with real quantum physics in your browser

#11
post #8

Is this truly live or did they batch random numbers ahead of time?

Technical Details section of help explains "we buffer batches of coin flips in advance to ensure a responsive experience. Your coin flips are always drawn directly from a quantum circuit, though no necessarily in real-time."

Re: Show HN: Play with real quantum physics in your browser

#12
post #11
post #8

Is this truly live or did they batch random numbers ahead of time?

Technical Details section of help explains "we buffer batches of coin flips in advance to ensure a responsive experience. Your coin flips are always drawn directly from a quantum circuit, though no necessarily in real-time."

In reality, it's a room full of interns flipping quarters and averaging their results in "real time"

Re: Show HN: Play with real quantum physics in your browser

#14
I've wondered for a long time what the user experience for quantum computing will look like. I had imagined some library with a type for "qbit" and an dsl for making them interact in certain ways and then some kind of async thing where your classical code could run locally while periodically shuttling data to and from wherever the quantum computer is.

This isn't quite that but I guess it's a first step.

Re: Show HN: Play with real quantum physics in your browser

#15
Tangent, but interesting: how do you get fair samples from a biased coin? 1. You take a string of biased samples like 001011100101 2. you split it in pairs 00 10 11 10 01 01 3. you keep only pairs with a zero and a one in them 10 10 01 01 4. You assign 0 and 1 to them, e.g. 1 1 0 0, this is a fair sampling from an unbiased coin

Why does it work? Because even if p(0) ≠ p(1), p(01) = p(10).

Re: Show HN: Play with real quantum physics in your browser

#18
post #15

Tangent, but interesting: how do you get fair samples from a biased coin? 1. You take a string of biased samples like 001011100101 2. you split it in pairs 00 10 11 10 01 01 3. you keep only pairs with a zero and a one in them 10 10 01 01 4. You assign 0 and 1 to them, e.g. 1 1 0 0, this is a fair sampling from an unbiased coin Why does it work? Because even if p(0) ≠ p(1), p(01) = p(10).

Damn, that is cool
Post reply on HN