Reinforcement Learning Generation of 4-Qubits Entangled States

Abstract

We have devised an artificial intelligence algorithm with machine reinforcement learning (Q-learning) to construct remarkable entangled states with 4 qubits. This way, the algorithm is able to generate representative states for some of the 49 true SLOCC classes of the four-qubit entanglement states. In particular, it is possible to reach at least one true SLOCC class for each of the nine entanglement families. The quantum circuits synthesized by the algorithm may be useful for the experimental realization of these important classes of entangled states and to draw conclusions about the intrinsic properties of our universe. We introduce a graphical tool called the state-link graph (SLG) to represent the construction of the Quality matrix (Q-matrix) used by the algorithm to build a given objective state belonging to the corresponding entanglement class. This allows us to discover the necessary connections between specific entanglement features and the role of certain quantum gates that the algorithm needs to include in the quantum gate set of actions. The quantum circuits found are optimal by construction with respect to the quantum gate-set chosen. These SLGs make the algorithm simple, intuitive and a useful resource for the automated construction of entangled states with a low number of qubits.

arXiv commentTex file, color figures

References in corpus (26)

• Three qubits can be entangled in two inequivalent ways
• Concentrating Partial Entanglement by Local Operations
• Conditions for a class of entanglement transformations
• Entanglement monotones
• Synthesis of Quantum Logic Circuits
• Four qubits can be entangled in nine different ways
• Information and Computation: Classical and Quantum Aspects
• Everything You Always Wanted to Know About LOCC (But Were Afraid to Ask)
• Active learning machine learns to create new quantum experiments
• Synthesis and Optimization of Reversible Circuits - A Survey
• Normal forms and entanglement measures for multipartite quantum states
• Quantum Circuit Simplification and Level Compaction
• Automated Search for new Quantum Experiments
• Quantum speedup for active learning agents
• Entanglement by Path Identity
• Efficient synthesis of universal Repeat-Until-Success circuits
• Local unitary equivalence of multipartite pure states
• Inductive Entanglement Classification of Four Qubits under SLOCC
• Machine learning method for state preparation and gate synthesis on photonic quantum computers
• Computer-inspired Quantum Experiments
• Tripartite entanglement transformations and tensor rank
• Efficient synthesis of probabilistic quantum circuits with fallback
• Quantum machine learning and quantum biomimetics: A perspective
• Designing quantum experiments with a genetic algorithm
• Classification of Entanglement in Symmetric States
• Single photon generation and non-locality of perfect W-state

Cited by in corpus (5)

• Entanglement engineering of optomechanical systems by reinforcement learning
• Entanglement classification and \emph{non-k}-separability certification via Greenberger-Horne-Zeilinger-class fidelity
• Quantum Circuit Discovery for Fault-Tolerant Logical State Preparation with Reinforcement Learning
• Hamiltonian Expressibility for Ansatz Selection in Variational Quantum Algorithms
• Hybrid Reward-Driven Reinforcement Learning for Efficient Quantum Circuit Synthesis