Quantum permutation puzzles with indistinguishable particles · HackerPapers discussions

Quantum permutation puzzles with indistinguishable particles — mentioned by abdullahkhalids

Wed, 23 Apr 2025 18:37:20 GMT

In the paper [1] they do discuss generalizing to larger boards. Puzzle's like the 2D slide puzzle or 3D Rubick's cube are modeled by different permutation groups. So, their techniques will work for the Rubick's cube as well. They likely wrote the paper the way they did because (1) Rubick's cube math is much more convoluted to explain, just because it is much larger, (2) Just working out the matrix representation for large groups is a pain. I know because I worked on this sort of representation theory in my PhD, and in fact, I thought of a very similar idea back then but never got around to…

Paper and discussion history. A mention is not an endorsement.

Quantum permutation puzzles with indistinguishable particles — mentioned by 0hijinks

Wed, 23 Apr 2025 14:18:51 GMT

>> Unsurprisingly, the combined solver performed the best, solving the puzzle in an average of 4.77 moves. The quantum solver was next, with an average of 5.32 moves, while the classical solver came in last place with 5.88 moves on average. This effect is pretty neat. From the paper [1], the quantum solver can only do what they call "square root SWAPs", which is like a tile swap that relies on certain superposition rules. The classical solver can only use standard tile SWAPs. The combined solver can do both. A little over half the puzzle states are solved faster by the classical solver, but…

Paper and discussion history. A mention is not an endorsement.

Quantum permutation puzzles with indistinguishable particles — HN submission

Fri, 08 Nov 2024 19:11:22 GMT

Quantum permutation puzzles with indistinguishable particles

1 point; 0 discussion replies on HN. Paper and source history. A submission is not an endorsement.