It just needs to be specified mathematically precisely. Pseudo-code would be fine.smatovic wrote: ↑Fri Mar 12, 2021 10:36 amSo in which language, code, program, calculus, math you would accept my project "Iota", a perfect play TicTacToe engine for quantum-computers?jp wrote: ↑Fri Mar 12, 2021 9:18 am I'm saying you won't be able to come up with an algorithm, like e.g. alpha-beta for classical computer chess. Forget about machines to run alpha-beta on. Forget about computer languages to write it in. If the "alpha-beta" does not exist, those things are irrelevant. You need the algorithm first, specified the way we can specify alpha-beta architecture-independently and language-independently.
No one has come up with an algorithm and no one will be able to.
e.g. for classical quicksort
Code: Select all
Quicksort(A,p,r) {
if (p < r) {
q <- Partition(A,p,r)
Quicksort(A,p,q)
Quicksort(A,q+1,r)
}
}
Partition(A,p,r)
x <- A[p]
i <- p-1
j <- r+1
while (True) {
repeat
j <- j-1
until (A[j] <= x)
repeat
i <- i+1
until (A[i] >= x)
if (i A[j]
else
return(j)
}
}
The algorithm does need to outperform classical algorithms in some way, of course. Otherwise, we could just write a "quantum" algorithm that just does classical computation.