Generating efficient quantum circuits for preparing maximally multipartite entangled states
Przemys{\l}aw Sadowski

TL;DR
This paper introduces a genetic programming approach to efficiently generate quantum circuits for preparing maximally multipartite entangled states, allowing arbitrary system structures and resulting in simpler, faster solutions.
Contribution
The authors develop a novel genetic programming method that outperforms existing techniques in speed and flexibility for creating entangled quantum states, including arbitrary system configurations.
Findings
Faster generation of entangled states compared to known methods
Ability to define arbitrary system structures
Discovery of simpler quantum circuits for entanglement
Abstract
In this work we provide a method for generating quantum circuits preparing maximally multipartite entangled states using genetic programming. The presented method is faster that known realisations thanks to the applied fitness function and several modifications to the genetic programming schema. Moreover, we enrich the described method by the unique possibility to define an arbitrary structure of a system. We use the developed method to find new quantum circuits, which are simpler from known results. We also analyse the efficiency of generating entanglement in the spin chain system and in the system of complete connections.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Quantum Information and Cryptography · Neural Networks and Reservoir Computing
