To start with it’s not clear what you’re trying to do with the “splitting timelines” bit, or even what operation a computer computer would perform to accomplish this. Yes, we can sort of turn our heads, squint, and interpret Shor’s and Gover’s algorithms to be doing something like this, but they don’t generalize to a mechanism for simultaneously evaluating multiple computations. Unless there are new results I’m unaware of? I’ve been out of the quantum game for a while now.
We can, in general, do different computations in different timelines by actually doing the universal turing machine computation in all timelines, with the different computation implementations in memory. We can, for efficiency, encode a finite number of computations (such as the AI) in the universal turing machine to keep qubit count down.
Shor’s algorithm is not relevant here. Amplitude amplification, the trick from Grover’s algorithm, can be used to implement the ability to delete one’s own timeline. You mostly just set a specific qubit to 1 to “delete” your timeline, and then in the end you amplify the amplitude of whoever didn’t. Deleting timelines seems easier to understand than amplifying amplitudes, so that’s what I used.
You could be referring to either paragraph; am I guessing correctly it’s the first?
https://en.wikipedia.org/wiki/Quantum_Turing_machine links [Deutsch 1985], where Ctrl-F for ‘2.11’ describes a state transition from an encoding of a function and its argument to the same plus the result. A superposition of different functions/arguments would of course lead to a superposition of that plus results. Therefore, we can run different computations in different timelines.
To start with it’s not clear what you’re trying to do with the “splitting timelines” bit, or even what operation a computer computer would perform to accomplish this. Yes, we can sort of turn our heads, squint, and interpret Shor’s and Gover’s algorithms to be doing something like this, but they don’t generalize to a mechanism for simultaneously evaluating multiple computations. Unless there are new results I’m unaware of? I’ve been out of the quantum game for a while now.
We can, in general, do different computations in different timelines by actually doing the universal turing machine computation in all timelines, with the different computation implementations in memory. We can, for efficiency, encode a finite number of computations (such as the AI) in the universal turing machine to keep qubit count down.
Shor’s algorithm is not relevant here. Amplitude amplification, the trick from Grover’s algorithm, can be used to implement the ability to delete one’s own timeline. You mostly just set a specific qubit to 1 to “delete” your timeline, and then in the end you amplify the amplitude of whoever didn’t. Deleting timelines seems easier to understand than amplifying amplitudes, so that’s what I used.
Maybe? I don’t remember it working like that. Do you have a reference to something suggesting we can adopt this interpretation?
You could be referring to either paragraph; am I guessing correctly it’s the first?
https://en.wikipedia.org/wiki/Quantum_Turing_machine links [Deutsch 1985], where Ctrl-F for ‘2.11’ describes a state transition from an encoding of a function and its argument to the same plus the result. A superposition of different functions/arguments would of course lead to a superposition of that plus results. Therefore, we can run different computations in different timelines.