Skip to content
Carmelics
TopicsThinkersChangesContributorsLoading account…

    Carmelics

    A reasoning platform. Break down any belief into clear reasons, explore both sides, and weigh the evidence honestly.

    Navigate

    • Topics
    • Search
    • Recent Changes
    • Contribute
    • How It Works
    • Glossary
    • Thinkers
    • Contributors
    • About
    • Statistics
    • Terms
    • Privacy

    Database

    Statements
    —
    Perspectives
    —
    Topics
    —

    Press ? for keyboard shortcuts

    LoyalLoyalJusticeJustice
    Made withinDC&Austin
    Whether physical realizations of quantum computation mode... — Carmelics
    Statements
    321,452
    Perspectives
    108,905
    Topics
    42
    Home/Skepticism
    HistoryEditSee Inverse

    Part of a larger discussion

    Supports→Even a proof that P is properly contained in BQP would not settle the bearing of quantum computation on the Cobham-Edmonds thesis

    Whether physical realizations of quantum computation models can be built that are sufficiently robust to solve instances not solvable by classical hardware remains an open empirical question

    Modality & PossibilitySkepticism
    ?Rate how convincing each reason is below to see the overall strength.

    No one has weighed in yet. Be the first to share reasons for or against this statement.

    Sign in or register to share your perspective on this statement.

    Topics

    SkepticismModality & Possibility

    Key Terms

    Classical hardware(as used in comparing computing systems)
    Traditional computers like laptops and phones that use regular bits (0s and 1s) to process information, as opposed to quantum computers.
    Physical realization(what the statement claims we must commit to)
    The idea that abstract or higher-level things (like thoughts) must be grounded in or made real by physical stuff (like brain matter).
    Quantum computation

    Next step

    Based on where you are in your exploration

    Browse more in Skepticism
    Related propositions within the same area of thought.
    (as an example of an alternative computational paradigm)
    A type of computing that uses quantum mechanics (the physics of tiny particles) instead of traditional electronics, allowing certain problems to be solved much faster.
    Robust(in the discussion of mathematical properties)
    Strong, reliable, and stable—something that doesn't break or change significantly when conditions vary slightly.
    empirical question(as used in epistemology)
    A question that can be answered by gathering evidence and observing real-world facts, rather than pure reasoning alone.

    Connections

    1 topic

    Truth & Knowledge2 linked

    Related

    Even a proof that P is properly contained in BQP would not settle the bearing of...The practical implications of quantum complexity classes depend on physical real...

    Similar

    Whether physically robust realizations of quantum computation models s...95%There is considerable controversy about whether physical realizations ...91%There is considerable controversy about whether physical realizations ...90%Although quantum bits generalize classical bits, quantum computing has...80%

    Source

    AI-extracted
    SEP: computational-complexity
    View source passageHide passage
    Nonetheless, \(\mathfrak{P}\) is a useful theoretical model in that it provides a formal medium for implementing procedures which call for certain operations to be carried out simultaneously in parallel. g. , Papadimitriou 1994). But this observation would still be of little practical significance if the algorithms in question achieved such speed up only at the cost of having to employ exponentially many processors relative to the size of their inputs. For in this case it seems that we would hav

    Details

    Type
    premise
    Perspectives
    0 (0 for, 0 against)
    Edits
    1 edit

    Open for perspectives

    This idea is waiting for its first supporting or challenging perspective.

    Share the first perspective