Ciro Santilli supports full legalization of all drugs, because he feels that it would be better overall for the world to have cheaper drugs and more drug addicts, but way, way less organized crime.

These should be extremely controlled of course, with extremely high taxes that puts their price just below the current illegal market, and a complete ban on any positive advertising.

Ciro believes that maybe the government could even go as far as giving free drugs to drug addicts so they don't have to rob to get a fix.

This is notably considering that drug-led organized crime completely dominates and corrupts the politics of many production and trafficking zones, which are already generally poor fucked up places to start with:Ciro's experiences in Brazil such as mentioned at São Remo, the favela next to USP, although much less extreme than the above, also come to mind.

Drug traffic corrupts everything. It prevents development of honest people. It is a cancer, which we have failed time and time a gain to cure. The only cure is to accept the other less insidious of addiction.

Bibliography:

As well put by Wikipedia, a radio receiver has to perform three functions on the signal from the antenna:

TODO synonym to analog quantum computer?

It is also possible to carry out quantum computing without qubits using processes with a continuous spectrum of measurement.

As of 2020, these approaches seem less developed/promising, but who knows.

These computers can be seen as analogous to classical non-quantum analog computers.

Similar to quantum supremacy, but add the goal that the computation must be useful, i.e. make money or solve some open mathematical problem, Ciro Santilli's wife was quite excited about the possibility of finding some counter examples in number theory with quantum computers.

One of the four following states:

When unqualified as in "the Bell state", it generally just means $|{\Phi }^{+}⟩$.

The Bell states are entangled and non-separable. Intuitively, we can see that when we measure that state, the values of the first and second bit are strictly correlated. This is the hallmark of quantum computation: making up states where qubits are highly correlated to match a specific algorithmic answer, and opposed to uniformly random noise. For example, the Bell state circuit is a common hello world, e.g. it is used in the official Qiskit hello world.

Python library, claims multiple backends, including simulation and real IBM quantum computer.

Some people call it "operating System".

The main parts of those systems are:

One key insight, is that the matrix of a non-trivial quantum circuit is going to be huge, and won't fit into any amount classical memory that can be present in this universe.

This is because the matrix is exponential in the number qubits, and $2^{100}$ is more than the number of atoms in the universe!

Therefore, off the bat we know that we cannot possibly describe those matrices in an explicit form, but rather must use some kind of shorthand.

But it gets worse.

Even if we had enough memory, the act of explicitly computing the matrix is not generally possible.

This is because knowing the matrix, basically means knowing the probability result for all possible $2^N$ outputs for each of the $2^N$ possible inputs.

But if we had those probabilities, our algorithmic problem would already be solved in the first place! We would "just" go over each of those output probabilities (OK, there are $2^N$ of those, which is also an insurmountable problem in itself), and the largest probability would be the answer.

So if we could calculate those probabilities on a classical machine, we would also be able to simulate the quantum computer on the classical machine, and quantum computing would not be able to give exponential speedups, which we know it does.

To see this, consider that for a given input, say 000 on a 3 qubit machine, the corresponding 8-sized quantum state looks like:and therefore when you multiply it by the unitary matrix of the quantum circuit, what you get is the first column of the unitary matrix of the quantum circuit. And 001, gives the second column and so on.

As a result, to prove that a quantum algorithm is correct, we need to be a bit smarter than "just calculate the full matrix".

Which is why you should now go and read: Section "Quantum algorithm".

This type of thinking links back to how physical experiments relate to quantum computing: a quantum computer realizes a physical experiment to which we cannot calculate the probabilities of outcomes without exponential time.

So for example in the case of a photonic quantum computer, you are not able to calculate from theory the probability that photons will show up on certain wires or not.