A unit of measure for computational complexity; through quantum computers?
  • Shawn
    13.2k
    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?
    Shawn Options
  • Shawn
    13.2k
    @jgill and @TonesInDeepFreeze you might be interested.

    Cheers
    Shawn Options
  • jgill
    3.8k
    It's a mystery to me. :chin:
    jgill Options
  • Shawn
    13.2k
    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?
    Shawn Options
bold
italic
underline
strike
code
quote
ulist
image
url
mention
reveal
youtube
tweet
Add a Comment

Welcome to The Philosophy Forum!

Get involved in philosophical discussions about knowledge, truth, language, consciousness, science, politics, religion, logic and mathematics, art, history, and lots more. No ads, no clutter, and very little agreement — just fascinating conversations.

Sign In Create Account

Categories