Matrix multiplication example.
Fundamental since deep learning is mostly matrix multiplication.
Contains several computer vision models, e.g. ResNet, all of them including pre-trained versions on some dataset, which is quite sweet.
Documentation: pytorch.org/vision/stable/index.html
Organization developing quantum dot quantum computer by 
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01catalog.ngc.nvidia.com/orgs/nvidia/resources/resnet_50_v1_5_for_pytorch explains:
The difference between v1 and v1.5 is that, in the bottleneck blocks which requires downsampling, v1 has stride = 2 in the first 1x1 convolution, whereas v1.5 has stride = 2 in the 3x3 convolution.This difference makes ResNet50 v1.5 slightly more accurate (~0.5% top1) than v1, but comes with a small performance drawback (~5% imgs/sec).
How many logical qubits are needed to run Shor's algorithm? by Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01Syncron explanation video by Syncron (2018)
Source. Rodney & Phil Use Our Brain Computer Interface by Syncron (2022)
Source. It might be amazing for those dudes, but it still has a long way to go. Integer factorization algorithms better than Shor's algorithm by Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01- 2023 www.schneier.com/blog/archives/2023/01/breaking-rsa-with-a-quantum-computer.html comments on "Factoring integers with sublinear resources on a superconducting quantum processor” arxiv.org/pdf/2212.12372.pdf
A group of Chinese researchers have just published a paper claiming that they can—although they have not yet done so—break 2048-bit RSA. This is something to take seriously. It might not be correct, but it’s not obviously wrong.We have long known from Shor’s algorithm that factoring with a quantum computer is easy. But it takes a big quantum computer, on the orders of millions of qbits, to factor anything resembling the key sizes we use today. What the researchers have done is combine classical lattice reduction factoring techniques with a quantum approximate optimization algorithm. This means that they only need a quantum computer with 372 qbits, which is well within what’s possible today. (The IBM Osprey is a 433-qbit quantum computer, for example. Others are on their way as well.)
Centerpiece of the CEA since the beginning of the French nuclear weapons program, headquarters since 2006.
Turing machine that halts if and only if Collatz conjecture is false by Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01mathoverflow.net/questions/309044/is-there-a-known-turing-machine-which-halts-if-and-only-if-the-collatz-conjectur suggests one does not exist. Amazing.
Intuitively we see that the situation is fundamentally different from the Turing machine that halts if and only if the Goldbach conjecture is false because for Collatz the counter example must go off into infinity, while in Goldbach conjecture we can finitely check any failures.
Amazing.
Condensed matter physics course of the University of Oxford by Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01
Ciro Santilli 37 Updated 2025-07-01 +Created 1970-01-01Non formal proof with a program March 2023: www.sligocki.com/2023/03/13/skelet-1-infinite.html Awesome article that describes the proof procedure.
The proof uses Turing machine acceleration to show that Skelet machine #1 is a Translated cycler Turing machine with humongous cycle paramters:
There are unlisted articles, also show them or only show them.