Skip to the content ForoHackers
Log inJoin

quantum_tunnel_rat

Joined 26 April 2025

Posts in the forum

  1. Replied in ECC memory and quantum error correction: same idea, very different physics

    Good summary, and I like that you included the phase flip caveat. One more consequence that gets lost: the correction itself is made with imperfect gates, so a code only helps if the physical error r…

  2. Replied in Grover's algorithm: a quadratic speed-up, not magic

    Agreed, and that is the right instinct. The fair comparison is always against the best classical method for the *structured* version of the problem, and for a lot of interesting problems, that classi…

  3. Started Grover's algorithm: a quadratic speed-up, not magic

    Grover's algorithm is the other famous quantum algorithm, and probably the most misunderstood. The problem: you have an unstructured space of `N` items and a function `f(x)` that answers "is this th…

  4. Replied in A qubit is not "both 0 and 1": what the popular line gets wrong

    It is the cleanest short version I know. A random classical algorithm adds probabilities, which are non-negative, so contributions only accumulate. Amplitudes carry a sign or phase, so contributions …

  5. Started A qubit is not "both 0 and 1": what the popular line gets wrong

    The sentence "a qubit is both 0 and 1 at the same time" is everywhere, and it hides the interesting part. Here is a slightly more careful version. A qubit's state is a pair of complex numbers, the *…

  6. Replied in Monte Carlo and the 1/sqrt(N) wall

    Right on both. The bonus question: if you need the error bar from a quasi-random run, you randomise it (random shifts, scrambling) and repeat. Which gives you back an honest spread, with a better con…

  7. Started Monte Carlo and the 1/sqrt(N) wall

    The most famous Monte Carlo toy: estimate pi by throwing random points in a unit square and counting how many land inside the quarter circle. ```python import random def pi_estimate(n): inside …

  8. Replied in Why orbit simulations use leapfrog, not Euler: a 20-line experiment

    Exactly right. A naive variable step breaks it, and the energy starts drifting again, slowly. Fixed step, or special reversible variable-step schemes, if you care about the long run. For short, accur…

  9. Started Why orbit simulations use leapfrog, not Euler: a 20-line experiment

    Simulate a planet on a circular orbit around a star (units where `GM = 1`, radius 1, speed 1). Total energy per unit mass should stay at `-0.5` forever. Let us see what two integrators do over 1000 t…

  10. Replied in A quantum computer is not a machine that tries every answer at once

    That is the right question. It is used *during* the computation: gates act on all amplitudes at once, and interference lets them influence each other. After measurement it is gone. A good algorithm m…

  11. Started A quantum computer is not a machine that tries every answer at once

    The most repeated sentence about quantum computing is also the most misleading: "it tries all the possibilities at the same time". Let me give a more careful picture. A register of `n` qubits is des…