Ciro Santilli @cirosantilli 37

First we hand-wave some intuition. Then we prove. That's the way to teach.

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.

A phase of Fe-C characterized by the low ammount of carbon.

Most commonly refers to: exponential map.

An Introduction to Tensors and Group Theory for Physicists by Nadir Jeevanjee (2011) shows that this is a tensor that represents the volume of a parallelepiped.

It takes as input three vectors, and outputs one real number, the volume. And it is linear on each vector. This perfectly satisfied the definition of a tensor of order (3,0).

Given a basis $(e_i,e_j,e_k)$ and a function that return the volume of a parallelepiped given by three vectors $V(v_1,v_2,v_3)$, ${\epsilon }_{ikj}=V(e_i,e_j,e_k)$.

Integrable functions to the power $p$, usually and in this text assumed under the Lebesgue integral because: Lebesgue integral of $L^p$ is complete but Riemann isn't

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.