Solving Rubik's Cube via Quantum Mechanics and Deep Reinforcement Learning

• URL: http://arxiv.org/abs/2109.07199v1
• Date: Wed, 15 Sep 2021 10:30:27 GMT
• Title: Solving Rubik's Cube via Quantum Mechanics and Deep Reinforcement Learning
• Authors: Sebastiano Corli, Lorenzo Moro, Davide E. Galli, Enrico Prati
• Abstract summary: Rubik's Cube is one of the most famous puzzles involving nearly $4.3 times 1019$ possible configurations. We develop a unitary representation of Rubik's group and a quantum formalism to describe the Cube from its geometrical constraints. The Cube is solved in four phases, all based on a respective Hamiltonian reward based on its spectrum, inspired by the Ising model.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Rubik's Cube is one of the most famous combinatorial puzzles involving nearly $4.3 \times 10^{19}$ possible configurations. Its mathematical description is expressed by the Rubik's group, whose elements define how its layers rotate. We develop a unitary representation of such group and a quantum formalism to describe the Cube from its geometrical constraints. Cubies are describedby single particle states which turn out to behave like bosons for corners and fermions for edges, respectively. When in its solved configuration, the Cube, as a geometrical object, shows symmetrieswhich are broken when driven away from this configuration. For each of such symmetries, we build a Hamiltonian operator. When a Hamiltonian lies in its ground state, the respective symmetry of the Cube is preserved. When all such symmetries are preserved, the configuration of the Cube matches the solution of the game. To reach the ground state of all the Hamiltonian operators, we make use of a Deep Reinforcement Learning algorithm based on a Hamiltonian reward. The Cube is solved in four phases, all based on a respective Hamiltonian reward based on its spectrum, inspired by the Ising model. Embedding combinatorial problems into the quantum mechanics formalism suggests new possible algorithms and future implementations on quantum hardware.

Related papers

• Fermion-qubit fault-tolerant quantum computing [39.58317527488534]
  We introduce fermion-qubit fault-tolerant quantum computing, a framework which removes this overhead altogether. We show how our framework can be implemented in neutral atoms, overcoming the apparent inability of neutral atoms to implement non-number-conserving gates. Our framework opens the door to fermion-qubit fault-tolerant quantum computation in platforms with native fermions.
  arXiv  Detail & Related papers  (2024-11-13T19:00:02Z)
• Systematic input scheme of many-boson Hamiltonians with applications to the two-dimensional $φ^4$ theory [0.0]
  We present our discussion of this input scheme based on the light-front Hamiltonian of the two-dimensional $phi 4$ theory. In our input scheme, we employ a set of quantum registers, where each register encodes the occupation of a distinct boson mode as binaries. We present the spectral calculations of the Hamiltonian utilizing the hybrid quantum-classical symmetry-adapted quantum Krylov subspace diagonalization algorithm.
  arXiv  Detail & Related papers  (2024-07-18T16:47:53Z)
• Scalable embedding of parity constraints in quantum annealing hardware [0.0]
  We present fixed, modular and scalable embeddings that can be used to embed any optimization problem described as an Ising Hamiltonian. These embeddings are the result of an extension of the well-known parity mapping. We show how our new embeddings can be mapped to existing quantum annealers and that the embedded Hamiltonian physical properties match the original Hamiltonian properties.
  arXiv  Detail & Related papers  (2024-05-23T16:14:33Z)
• Geometry of degenerate quantum states, configurations of $m$-planes and invariants on complex Grassmannians [55.2480439325792]
  We show how to reduce the geometry of degenerate states to the non-abelian connection $A$. We find independent invariants associated with each triple of subspaces. Some of them generalize the Berry-Pancharatnam phase, and some do not have analogues for 1-dimensional subspaces.
  arXiv  Detail & Related papers  (2024-04-04T06:39:28Z)
• Understanding Energy Level Structure Using Quantum Rubik's Cube [2.7038841665524846]
  This study combines the quantum Rubik's Cube matrix with the Benalcazar Bernevig Hughes model. In order to make the operation of the quantum Rubik's Cube matrix clearer, we use a Josephus ring to draw a topological graph of the Rubik's Cube expansion.
  arXiv  Detail & Related papers  (2024-03-02T12:23:02Z)
• Towards Learning Rubik's Cube with N-tuple-based Reinforcement Learning [0.0]
  This work describes in detail how to learn and solve the Rubik's cube game (or puzzle) in the General Board Game (GBG) learning and playing framework. We describe the cube's state representation, how to transform it with twists, wholecube rotations and color transformations and explain the use of symmetries in Rubik's cube.
  arXiv  Detail & Related papers  (2023-01-28T11:38:10Z)
• Penrose dodecahedron, Witting configuration and quantum entanglement [55.2480439325792]
  A model with two entangled spin-3/2 particles based on geometry of dodecahedron was suggested by Roger Penrose. The model was later reformulated using so-called Witting configuration with 40 rays in 4D Hilbert space. Two entangled systems with quantum states described by Witting configurations are discussed in presented work.
  arXiv  Detail & Related papers  (2022-08-29T14:46:44Z)
• A construction of Combinatorial NLTS [22.539300644593936]
  NLTS (No Low-Energy Trivial State) conjecture of Freedman and Hastings [2014] posits that there exist families of Hamiltonians with all low energy states of high complexity. Here, we prove a weaker version called the NLTS, where a quantum circuit lower bound is shown against states that violate a (small) constant fraction of local terms.
  arXiv  Detail & Related papers  (2022-06-06T16:55:34Z)
• Algebraic Compression of Quantum Circuits for Hamiltonian Evolution [52.77024349608834]
  Unitary evolution under a time dependent Hamiltonian is a key component of simulation on quantum hardware. We present an algorithm that compresses the Trotter steps into a single block of quantum gates. This results in a fixed depth time evolution for certain classes of Hamiltonians.
  arXiv  Detail & Related papers  (2021-08-06T19:38:01Z)
• A Practical Method for Constructing Equivariant Multilayer Perceptrons for Arbitrary Matrix Groups [115.58550697886987]
  We provide a completely general algorithm for solving for the equivariant layers of matrix groups. In addition to recovering solutions from other works as special cases, we construct multilayer perceptrons equivariant to multiple groups that have never been tackled before. Our approach outperforms non-equivariant baselines, with applications to particle physics and dynamical systems.
  arXiv  Detail & Related papers  (2021-04-19T17:21:54Z)
• Quantum-Ising Hamiltonian programming in trio, quartet, and sextet qubit systems [0.755972004983746]
  Rydberg-atom quantum simulators are of keen interest because of their possibilities towards high-dimensional qubit architectures. Here we report three-dimensional spectra of quantum-Ising Hamiltonian systems with programmed qubit connections.
  arXiv  Detail & Related papers  (2020-09-11T09:50:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.