this post was submitted on 31 Aug 2026
44 points (100.0% liked)
GenZedong
5280 readers
33 users here now
This is a Dengist community in favor of Bashar al-Assad with no information that can lead to the arrest of Hillary Clinton, our fellow liberal and queen. This community is not ironic. We are Marxists-Leninists.
See this GitHub page for a collection of sources about socialism, imperialism, and other relevant topics.
This community is for posts about Marxism and geopolitics (including shitposts to some extent). Serious posts can be posted here or in /c/GenZhou. Reactionary or ultra-leftist cringe posts belong in /c/shitreactionariessay or /c/shitultrassay respectively.
We have a Matrix homeserver and a Matrix space. See this thread for more information. If you believe the server may be down, check the status on status.elara.ws.
Rules:
- No bigotry, anti-communism, pro-imperialism or ultra-leftism (anti-AES)
- We support indigenous liberation as the primary contradiction in settler colonies like the US, Canada, Australia, New Zealand and Israel
- If you post an archived link (excluding archive.org), include the URL of the original article as well
- Unless it's an obvious shitpost, include relevant sources
- For articles behind paywalls, try to include the text in the post
- Mark all posts containing NSFW images as NSFW (including things like Nazi imagery)
founded 5 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
more notes lol
where:
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:Q~i~ → Q~j~, where Q~i~ and Q~j~ 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.