Welcome again to everybody. Make yourselves at home. In the time-honoured tradition of our group, here is the weekly discussion thread.
☭ Matrix homeserver and space
☭ Theory discussion group on /c/theory@lemmygrad.ml
☭ Find theory on ProleWiki, marxists.org, Anna’s Archive
image from this article


more notes lol
where:
g(...) = g( T[t-1], p[t-1], g( T[t-2], p[t-2], g( T[t-3], p[t-2], g( ... T[t-n], p[t-n], g(0) )))statistical distribution: |ϕ|^2
Right, I think I understood it now. Just to be clear, this is your setup:
The ball itself doesn’t matter, its past does. Or in the case of qubits, its current value and its context.
I don’t know if this came up when you described the non-Markovian example, but this reminded me of a Turing machine. Like, a Turing machine T can be described by f:Qi → Qj, where Qi and Qj are possible states of T. A regular Turing machine acting through time could be described by f:Q[t] → Q[t+1] and with some boundary condition Q[0]. However, in your example, this hypothetical machine X can also “read” its own past. So, X would be described as g:{Q[t], {Q[t-1], Q[t-2], Q[t-3] … Q[0]} → Q[t+1].
I think I would understand the math of your book, but not a lot about the concepts where it’s applied. I hit a limit on my knowledge when you mentioned quantum gates and matrices on your comment. I don’t know anything about those. I’m going to read more on that both because of curiosity and because I’m reallyyyyy rusty with my math skills.
Thanks for the write-up. I have a lot of review and studying to do. If you don’t mind me asking, do you work mostly on the theory or do you also deal with the practical reality of quantum computing?
Also
Based
I don’t know anything about how to actually engineer one if that’s what you’re asking. I only know how to program them. I have run programs on some of IBM’s quantum computers, just as a way to make sure the theory really does produce the results I’d expect in reality.