Anonymous at Wed, 15 May 2024 03:53:48 UTC No. 16176593

Me on the other side of the table

huxley at Wed, 15 May 2024 08:53:11 UTC No. 16176830

According to Wikipedia:
Definition: [math]\textbf{BQP} := \texttt{bounded-error quantum polynomial time}[/math]
Location: [math]\textbf{PTIME} \subseteq \textbf{BQP} \subseteq \textbf{PSPACE}[/math]

Given that we often hear of Time-Space trade-offs, why do we think it possible that Polynomial Time is strictly less than Polynomial Space, instead of a trade-off?
If anyone would like to help me compile a list of other trade-offs I would be grateful.

Anonymous at Thu, 16 May 2024 02:01:48 UTC No. 16177795

bump

Anonymous at Thu, 16 May 2024 02:17:23 UTC No. 16177814

>>16176519
cuz da money

Anonymous at Thu, 16 May 2024 08:29:51 UTC No. 16178092

>>16176519
Because quantum computing is much more specialized