{
  "$type": "site.standard.document",
  "bskyPostRef": {
    "cid": "bafyreicftha2ujsbsuhjjglbcjf6faunbdrhv6cqnnqyabyuazwaobtm4q",
    "uri": "at://did:plc:r27a2ibspnwlgbw66uqg22yv/app.bsky.feed.post/3mflxocfljvs2"
  },
  "coverImage": {
    "$type": "blob",
    "ref": {
      "$link": "bafkreihgojn2o5cnzayvjdn3pujdfuqfwywa2lfg6rfko3gguaj3gdakzi"
    },
    "mimeType": "image/png",
    "size": 5619
  },
  "path": "/story/26/02/24/0047210/quantum-algorithm-beats-classical-tools-on-complement-sampling-tasks?utm_source=rss1.0mainlinkanon&utm_medium=feed",
  "publishedAt": "2026-02-24T10:32:46.236Z",
  "site": "https://tech.slashdot.org",
  "tags": [
    "supercomputing",
    "Read more of this story"
  ],
  "textContent": "alternative_right shares a report from Phys.org: A team of researchers working at Quantinuum in the United Kingdom and QuSoft in the Netherlands has now developed a quantum algorithm that solves a specific sampling task -- known as complement sampling -- dramatically more efficiently than any classical algorithm. Their paper, published in Physical Review Letters, establishes a provable and verifiable quantum advantage in sample complexity: the number of samples required to solve a problem. \"We stumbled upon the core result of this work by chance while working on a different project,\" Harry Buhrman, co-author of the paper, told Phys.org. \"We had a set of items and two quantum states: one formed from half of the items, the other formed from the remaining half. Even though the two states are fundamentally distinct, we showed that a quantum computer may find it hard to tell which one it is given. Surprisingly, however, we then realized that transforming one state into the other is always easy, because a simple operation can swap between them.\"\n\n \n\nRead more of this story at Slashdot.",
  "title": "Quantum Algorithm Beats Classical Tools On Complement Sampling Tasks",
  "updatedAt": "2026-02-24T10:00:00.000Z"
}