A unit of measure for computational complexity; through quantum computers?

Shawn May 21, 2021 at 00:20 950 views 3 comments

I'm concerned with trying to determine whether the same computational processes on a Turing computable algorithm can be ascertained for a quantum computer in some form of actual 'metric' for how many resources are utilized by the computer?

Is this possible to translate the same complexity to the lowest common denominator of a traditional computer, but instead, for a quantum computer and then be able to determine a universal metric for computability?

Comments (3)

Shawn May 21, 2021 at 00:29 #539572 0 likes

@jgill and @TonesInDeepFreeze you might be interested.

Cheers

jgill May 21, 2021 at 02:36 #539601 0 likes

It's a mystery to me. :chin:

Shawn May 21, 2021 at 04:35 #539637 0 likes

For the complexity class of NP-complete for BQP=P, then it's not all apples and oranges between a quantum computer and a classical computer, is it?

Once that is established, then perhaps it makes sense to compare the two complexity classes and derive some unitary measure, yes?