Equal cost of computation for truth and falsity of experimental quantum propositions necessitates quantum parallel computing

TL;DR

This paper argues that achieving equal computational cost for truth and falsity of quantum propositions requires quantum parallel computing, which classical computing cannot provide, highlighting a potential unique advantage of quantum computing.

Contribution

It demonstrates that classical computing cannot equalize the cost of evaluating quantum propositions' truth and falsity, suggesting quantum parallelism as a necessary solution.

Findings

Classical computing cannot achieve equal cost for quantum proposition evaluations.

Quantum parallel computing can potentially realize this equality if sufficiently efficient.

Highlights a fundamental difference between classical and quantum computational capabilities.

Abstract

Notwithstanding interest and excitement building around quantum computing in the last decades, a concise statement saying where this computing can truly help is still missing. As it is shown in the present paper, equal cost of computation for truth and falsity of experimental quantum propositions (required in order to infer a conclusion from a premise) cannot be achieved with classical computing. On the other hand, this equality might be realized with quantum parallel computing provided that the efficiency of such computing can be greater than 1.