Skip to content
Carmelics
Topics
Thinkers
Changes
Contributors
Loading account…
Statements
321,452
Perspectives
108,905
Topics
42
Home
/
Original
/
inverse
See Original
Inverse View
It is not the case that Quantum algorithms (e.g., Shor's algorithm) solve problems in polynomial time that classical models require exponential time for.
?
Set your confidence on the premises below to see your aggregate.
Reasons For
1 perspective
Reason for
?
1.
No large-scale quantum computer yet exists; speedup claims rest on untested scalability assumptions that may fail due to decoherence or engineering limits.
?
How convincing is this?
Think about whether this reason is strong or weak
2.
Classical algorithms like GNFS may achieve subexponential (not full exponential) factorization, reducing the gap between quantum and classical time complexity.
?
How convincing is this?
Think about whether this reason is strong or weak
3.
Quantum measurement collapses superposition, requiring repeated trials; total wall-clock time including setup and error correction may exceed classical methods practically.
?
How convincing is this?
Think about whether this reason is strong or weak
Reasons Against
1 perspective
Reason against
?
1.
Shor's algorithm empirically demonstrates superpolynomial speedup by exploiting quantum superposition to test multiple factorizations simultaneously.
?
How convincing is this?
Think about whether this reason is strong or weak
2.
Quantum complexity theory proves BQP problems exist outside classical P, establishing theoretical separation between quantum and classical capabilities.
?
How convincing is this?
Think about whether this reason is strong or weak
3.
Quantum advantage has been experimentally validated on small instances, confirming the speedup mechanism works in physical systems, not just theory.
?
How convincing is this?
Think about whether this reason is strong or weak
Next step
Based on where you are in your exploration
Strongest counterpoint
Explore the most compelling reason on the other side.