Quantum computers are not expected to solve NP-complete problems by
Ciro Santilli 37 Updated 2025-05-21 +Created 1970-01-01
Only NP-intermediate, which includes notably integer factorization:
- quantumcomputing.stackexchange.com/questions/16506/can-quantum-computer-solve-np-complete-problems
- www.cs.virginia.edu/~robins/The_Limits_of_Quantum_Computers.pdf by Scott Aaronson
- cs.stackexchange.com/questions/130470/can-quantum-computing-help-solve-np-complete-problems
- www.quora.com/How-can-quantum-computing-help-to-solve-NP-hard-problems
Finite projective special linear group by
Ciro Santilli 37 Updated 2025-05-21 +Created 1970-01-01
Matrix representation of a positive definite symmetric bilinear form by
Ciro Santilli 37 Updated 2025-05-21 +Created 1970-01-01
Note that odd permutations don't form a subgroup of the symmetric group like the even permutations do, because the composition of two odd permutations is an even permutation.
One major advantage: eukaryotes can do phagocytosis due to their cytoskeleton.
One is reminded of Ulillillia, see also: www.youtube.com/watch?v=9-79yOZ13qg The Story of Ulillillia by Atrocity Guide (2019)
Unlisted articles are being shown, click here to show only listed articles.