TLDR: Quantum mechanics (a mathematical theory of how physical particles behave) predicts that computers using quantum entanglement can solve some problems more efficiently than classical (conventional) computers can. This is a current hot topic in math and physics research.

Some configurations of quantum circuits wlil have this efficiency gain, while other configurations will be like ordinary computers. The property that gives the extra efficiency has been cutely called "magic" in some of the quantum computing literature. It has nothing to do with Harry Potter. It's just a metaphorical term for a mathematical property of some arrangements of entangled particles. Of course it's a cool property, but the name "magic" being used in the titles of some papers, perhaps makes those papers sound more interesting than they really are, to those of us not very familiar with the subject.

Maybe I'm missing something, but I'm not sure what we're really supposed to learn by seeing these papers linked here. A good intro to quantum computing for laypeople is "Quantum Computers Since Democritus" by Scott Aaronson. I've read some parts of it and it looks to me like a preferable place to start.

[–] obbeel@lemmy.eco.br 1 points 2 months ago

I think it's interesting to see something related to the magic posted in the other article. What it's all about. Also, the paper isn't that complex to read. It goes through talking about quantum simulations (probably through Qiskit) and the differences between magical schemas and ordinary ones. I think it's interesting to see what it's all about.

Scientific communicators try to be didactic about Science but always miss the mark on what's really going on, especially in Quantum Mechanics. Sadly, we don't see the same enthusiasm from these people for other areas of Physics - the classical.

If you're going to write "self-help" books on a scientific topic, might as well go all the way.

What I mean is, this paper is a fun read. Someone that has a grasp about computers will understand and appreciate.