Ciro Santilli @cirosantilli 35

A really good option to store educational media such as images and video!

Shame that like the rest of Wikimedia, their interface is so clunky and lacking obvious features.

Gun-type fission weapons are the simplest approach and they work with Uranium-235 bombs as you can ignite it with just one explosion.

But Gun-type fission weapons don't work with plutonium, and weapon grade Plutonium is cheaper than weapon grade Uranium, so it wasn't much used.

The only isotope found on Earth because it occurs as part of the uranium 238 decay chain, i.e., it is not a primordial nuclide.

Interestingly it is a bit less stable than other isotopesL such as Polonium-208 (3 y) and Polonium-209 (124 y), but those aren't in any Earthly radioactive chain so they don't show up on Earth.

This situation is the most bizarre thing ever. The dude was fired in 2020, but he refused to be fired, and because he has the company seal, they can't fire him. He is still going to the office as of 2022. It makes one wonder what are the true political causes for this situation. A big warning sign to all companies tring to setup joint ventures in China!

This is the true key question: what are the most important algorithms that would be accelerated by quantum computing?

Some candidates:

Do you have proper optimization or quantum chemistry algorithms that will make trillions?

Maybe there is some room for doubt because some applications might be way better in some implementations, but we should at least have a good general idea.

However, clear information on this really hard to come by, not sure why.

Whenever asked e.g. at: physics.stackexchange.com/questions/3390/can-anybody-provide-a-simple-example-of-a-quantum-computer-algorithm/3407 on Physics Stack Exchange people say the infinite mantra:

Lists:

Formulated as a quantum field theory.

One important area of research and development of quantum computing is the development of benchmarks that allow us to compare different quantum computers to decide which one is more powerful than the other.

Ideally, we would like to be able to have a single number that predicts which computer is more powerful than the other for a wide range of algorithms.

However, much like in CPU benchmarking, this is a very complex problem, since different algorithms might perform differently in different architectures, making it very hard to sum up the architecture's capabilities to a single number as we would like.

The only thing that is directly comparable across computers is how two machines perform for a single algorithm, but we want a single number that is representative of many algorithms.

For example, the number of qubits would be a simple naive choice of such performance predictor number. But it is very imprecise, since other factors are also very important:

Quantum volume is another less naive attempt at such metric.

Contains the University of Cambridge, that's about it really, from that everything follows.

The city appear to exist there because it was a convenient crossing of the Cam. It also lies near the start of the ancient navigable section TODO towards north or south? Castle hill also offered a convenient fortification location near the river, and is part of the reason for the early Roman settlement. The original bridge was presumably in the current Magnalene bridge, just under the castle hill.

TODO why did the University of Oxford scholars flee to after the The hanging of the clerks in 1209? Why not anywhere else?

Discovered by Marie Curie when she noticed that there was some yet unknown more radioactive element in their raw samples, after uranium and polonium, which she published 6 months prior, had already been separated. Published on December 1989 as: Section "Sur une nouvelle substance fortement radio-active, contenue dans la pechblende".

The uranium 238 decay chain is the main source of naturally occurring radium.

To Ernest Lawrence for the cyclotron.

Quantum is getting hot in 2019, and even Ciro Santilli got a bit excited: quantum computing could be the next big thing.

No useful algorithm has been economically accelerated by quantum yet as of 2019, only useless ones, but the bets are on, big time.

To get a feeling of this, just have a look at the insane number of startups that are already developing quantum algorithms for hardware that doesn't/barely exists! quantumcomputingreport.com/players/privatestartup (archive). Some feared we might be in a bubble: Are we in a quantum computing bubble?

To get a basic idea of what programming a quantum computer looks like start by reading: Section "Quantum computing is just matrix multiplication".

Some people have their doubts, and that is not unreasonable, it might truly not work out. We could be on the verge of an AI winter of quantum computing. But Ciro Santilli feels that it is genuinely impossible to tell as of 2020 if something will work out or not. We really just have to try it out and see. There must have been skeptics before every single next big thing.

As of 2020, Ciro Santilli is getting excited about quantum computing, which is a deep tech field.

He's a bit lazy to explain why here, but Googling will be more than enough.

There is a risk it will fizzle and the bubble pop, like any revolution.

But recent developments are making it too exciting to ignore.

Really weird and obscure company, good coverage: thequantuminsider.com/2020/02/06/quantum-computing-incorporated-the-first-publicly-traded-quantum-computing-stock/

Publicly traded in 2007, but only pivoted to quantum computing much later.

Social media:

Suppose we have a given permutation group that acts on a set of n elements.

If we pick k elements of the set, the stabilizer subgroup of those k elements is a subgroup of the given permutation group that keeps those elements unchanged.

Note that an analogous definition can be given for non-finite groups. Also note that the case for all finite groups is covered by the permutation definition since all groups are isomorphic to a subgroup of the symmetric group

TODO existence and uniqueness. Existence is obvious for the identity permutation, but proper subgroup likely does not exist in general.

Bibliography:

Group of all permutations.