I was recently reminded that whether a process will stop is still outside of #BoundedError #QuantumPolynomialTime ( #BQP) .
It is more than BQP hard to figure out when things stop :)
bsky.app/profile/math...
It is more than BQP hard to figure out when things stop :)
bsky.app/profile/math...
I was lead down that #RabbitHole by:
en.wikipedia.org/wiki/BQP
"
In #ComputationalComplexity theory, #BoundedError #QuantumPolynomialTime ( #BQP) is the class of #DecisionProblems solvable by a #QuantumComputer in #PolynomialTime, with an #ErrorProbability of at most 1/3 for all instances.
en.wikipedia.org/wiki/BQP
"
In #ComputationalComplexity theory, #BoundedError #QuantumPolynomialTime ( #BQP) is the class of #DecisionProblems solvable by a #QuantumComputer in #PolynomialTime, with an #ErrorProbability of at most 1/3 for all instances.
BQP - Wikipedia
en.wikipedia.org
August 31, 2026 at 6:31 PM
I was recently reminded that whether a process will stop is still outside of #BoundedError #QuantumPolynomialTime ( #BQP) .
It is more than BQP hard to figure out when things stop :)
bsky.app/profile/math...
It is more than BQP hard to figure out when things stop :)
bsky.app/profile/math...
I was lead down that #RabbitHole by:
en.wikipedia.org/wiki/BQP
"
In #ComputationalComplexity theory, #BoundedError #QuantumPolynomialTime ( #BQP) is the class of #DecisionProblems solvable by a #QuantumComputer in #PolynomialTime, with an #ErrorProbability of at most 1/3 for all instances.
en.wikipedia.org/wiki/BQP
"
In #ComputationalComplexity theory, #BoundedError #QuantumPolynomialTime ( #BQP) is the class of #DecisionProblems solvable by a #QuantumComputer in #PolynomialTime, with an #ErrorProbability of at most 1/3 for all instances.
BQP - Wikipedia
en.wikipedia.org
August 29, 2026 at 4:27 AM
I was lead down that #RabbitHole by:
en.wikipedia.org/wiki/BQP
"
In #ComputationalComplexity theory, #BoundedError #QuantumPolynomialTime ( #BQP) is the class of #DecisionProblems solvable by a #QuantumComputer in #PolynomialTime, with an #ErrorProbability of at most 1/3 for all instances.
en.wikipedia.org/wiki/BQP
"
In #ComputationalComplexity theory, #BoundedError #QuantumPolynomialTime ( #BQP) is the class of #DecisionProblems solvable by a #QuantumComputer in #PolynomialTime, with an #ErrorProbability of at most 1/3 for all instances.