accounts for them all, which we know how to do due to the classification of finite fields.
So we see that the classification is quite simple, much like the classification of finite fields, and in strict opposition to the classification of finite simple groups (not to mention the 2023 lack of classification for non simple finite groups!)
Ubuntu 23.04 install:
sudo apt install rbase
Hello world:
R -e 'print("hello world")'
Install a package, e.g. Bookdown:
sudo R -e 'install.packages("bookdown")'
These appear to be benchmarks that don't involve running anything concretely, just compiling and likely then counting gates:
These are a bit like the Verilog of quantum computing.
One would hope that they are not Turing complete, this way they may serve as a way to pass on data in such a way that the receiver knows they will only be doing so much computation in advance to unpack the circuit. So it would be like JSON is for JavaScript.
OpenQASM by Ciro Santilli 37 Updated 2025-07-16
On Qiskit qiskit==0.44.1:
qc.qasm()
E.g. with our qiskit/hello.py, we obtain the Bell state circuit:
OPENQASM 2.0;
include "qelib1.inc";
qreg q[2];
creg c[2];
h q[0];
cx q[0],q[1];
measure q[0] -> c[0];
measure q[1] -> c[1];
Bell circuit by Ciro Santilli 37 Updated 2025-07-16
A quantum circuit which when fed with input produces the Bell state.
Figure 1.
Quantum circuit that generates the Bell state
. Source.
The fundamental intuition for this circuit is as follows.
First the Hadamard gate makes the first qubit be in a 50/50 state.
Then, the CNOT gate gets controlled by that 50/50 value, and the controlled qubit also gets 50/50 chance as a result.
However, both qubits are now entangled: the result of the second qubit depends on the result of the first one. Because:
Turing machine regex tape notation is Ciro Santilli's made up name for the notation used e.g. at:Most of it is just regular regular expression notation, with a few differences:
  • denotes the right or left edge of the (zero initialized) tape. It is often omitted as we always just assume it is always present on both sides of every regex
  • A, B, C, D and E denotes the current machine state. This is especially common notation in the context of the BB(5) problem
  • < and > next to the state indicate if the head is on top of the left or right element. E.g.:
    11 (01)^n <A 00 (0011)^{n+2}
    indicates that the head A is on top of the last 1 of the last sequence of n 01s to the left of the head.
This notation is very useful, as it helps compress long repeated sequences of Turing machine tape and extract higher level patterns from them, which is how you go about understanding a Turing machine in order to apply Turing machine acceleration.
Binet Gaussienne by Ciro Santilli 37 Updated 2025-07-16
This is likely a joke binet, but the idea is epic: its members would in principle take the hardest courses and purposefully get bad grades on them to improve the grades of others, as grades are always normalized to a normal distribution.
SageMath by Ciro Santilli 37 Updated 2025-07-16
A Python wrapper over a bunch of numeric and computer algebra system packages to try and fully replace MATLAB et. al.
For example, their
Quickstart tutorial at: www.sagemath.org/tour-quickstart.html From this we see that they are very opinionated, you don't need to import anything, everything has a pre-defined global name, which is convenient, e.g.:
is the 3D vector space over the rationals. This also suggests that they are quite focused on computer algebra as opposed to numerical.

Unlisted articles are being shown, click here to show only listed articles.