Does the upper bound of computability hold for quantum computers?

[EnumaElish]

This paper states that:

Merely by existing, all physical systems register information. And by evolving dynamically in time, they transform and process that information. The laws of physics determine the amount of information that a physical system can register (number of bits) and the number of elementary logic operations that a system can perform (number of ops). The universe is a physical system. This paper quantifies the amount of information that the universe can register and the number of elementary operations that it can have performed over its history. The universe can have performed no more than 10^{120} ops on 10^{90} bits.

This means that the upper bound of computability is "10^{120} ops on 10^{90} bits." Question: does this upper bound apply to quantum computers as well?

 

[-Job-]

It does, assuming these are reasonable bounds. The author is using atomic spin as the most elementary bit and a spin flip as the most elementary operation (a bit flip), both of which are used in quantum computers.
It can cause some confusion the fact that a quantum computer makes use of quantum superposition, since then a single operation in n qubits yields twice the information processing as a single operation in n-1 qubits.
Nevertheless, a single operation in n bits consists of n elementary operations (bit flips), and this is what the author is counting. We're counting the number of elementary operations, independently of whether they're performed in parallel or are part of the same physical system.

 

[ravenprp]

The upper bound of computability stated in the paper does not apply to quantum computers in the same way as it applies to classical computers. Quantum computers operate on the principles of quantum mechanics, which allow for the manipulation of information in ways that are not possible with classical computers. Therefore, the laws of physics that determine the amount of information and operations for classical computers may not necessarily apply to quantum computers.

In fact, there is evidence that quantum computers have the potential to surpass the limitations of classical computers in terms of computational power and efficiency. This is due to the ability of quantum computers to process and manipulate information in a parallel and superpositioned manner.

However, it is important to note that the upper bound of computability for quantum computers is still a topic of ongoing research and debate. While there is evidence that quantum computers have the potential to exceed the limitations of classical computers, it is not yet fully understood how this will be achieved and what the ultimate upper bound may be.

In conclusion, while the upper bound of computability stated in the paper may hold for classical computers, it does not necessarily apply to quantum computers. The unique properties of quantum mechanics may allow for the potential of quantum computers to surpass this upper bound, but further research and development is needed to fully understand the potential of quantum computing.