4 ms·

The press-release has a fair summary: https://www.nobelprize.org/prizes/physics/2022/press-release/ https://www.nobelprize.org/prizes/physics/2022/press-release

The press-release has a fair summary: https://www.nobelprize.org/prizes/physics/2022/press-release/ https://www.nobelprize.org/prizes/physics/2022/press-release... Also here for a bit of history: https://en.wikipedia.org/wiki/Bell_test https://en.wikipedia.org/wiki/Bell_test

shmageggy 4y ago
Note there are two pdfs with more detail linked at the bottom under "Read more about this year’s prize" Popular science background: How entanglement has become a powerful tool (pdf) Scientific Background: “For experiments with entangled photons, establishing the violation of Bell inequalities and pioneering quantum information science” (pdf)
- hackandthink 4y ago
  Popular Science Background: "Quantum mechanics’ most important resource" (Entangled quantum states) From a Quantum Computing perspective entanglement ist kind of overrated. Scott Aaronson: How Much Structure Is Needed for Huge Quantum Speedups? https://arxiv.org/pdf/2209.06930.pdf https://arxiv.org/pdf/2209.06930.pdf Actually entanglement is not mentioned at all.
  - krastanov 4y ago
    Except for error correction, sensing beyond the classical limit, teleportation, key distribution, most forms of fault tolerance, cluster state computation, blind computation, one way computation, and more.
    - hackandthink 4y ago
      Sure you are right. This is just a computational Perspective. Gottesman-Knill Theorem: "The theorem proves that, for all quantum algorithms with a speed up that relies on entanglement which can be achieved with a CNOT and a Hadamard gate to produce entangled states, this kind of entanglement alone does not give any computing advantage." Entanglement alone is not sufficient for algorithmic speedup. Again Wikipedia: "The reason for the speed up of quantum computers is not yet fully understood"
      - hackandthink 4y ago
        Intuitively or naively there's some connection: (1) the dimension of the Tensorproduct Space of n entangled Qubits is 2^n. (2) exponential speedup but which?

shmageggy 4y ago

Note there are two pdfs with more detail linked at the bottom under "Read more about this year’s prize" Popular science background: How entanglement has become a powerful tool (pdf) Scientific Background: “For experiments with entangled photons, establishing the violation of Bell inequalities and pioneering quantum information science” (pdf)

hackandthink 4y ago
Popular Science Background: "Quantum mechanics’ most important resource" (Entangled quantum states) From a Quantum Computing perspective entanglement ist kind of overrated. Scott Aaronson: How Much Structure Is Needed for Huge Quantum Speedups? https://arxiv.org/pdf/2209.06930.pdf https://arxiv.org/pdf/2209.06930.pdf Actually entanglement is not mentioned at all.
- krastanov 4y ago
  Except for error correction, sensing beyond the classical limit, teleportation, key distribution, most forms of fault tolerance, cluster state computation, blind computation, one way computation, and more.
  - hackandthink 4y ago
    Sure you are right. This is just a computational Perspective. Gottesman-Knill Theorem: "The theorem proves that, for all quantum algorithms with a speed up that relies on entanglement which can be achieved with a CNOT and a Hadamard gate to produce entangled states, this kind of entanglement alone does not give any computing advantage." Entanglement alone is not sufficient for algorithmic speedup. Again Wikipedia: "The reason for the speed up of quantum computers is not yet fully understood"
    - hackandthink 4y ago
      Intuitively or naively there's some connection: (1) the dimension of the Tensorproduct Space of n entangled Qubits is 2^n. (2) exponential speedup but which?