2019/04/30 by Alba Cervera-Lierta, José Ignacio Latorre, José I. Latorre +1 · 1 citation
Computer Science · Mathematics · Physics and Astronomy · #Combinatorics #Computer science #Electronic circuit #Mathematics #Multipartite #Multipartite entanglement #Physics #Quantum #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum and electron transport phenomena #Quantum computer #Quantum entanglement #Quantum mechanics #Quantum network #Theoretical computer science #Topology (electrical circuits) #W state #quant-ph
paper · pdf · doi:10.1103/physreva.100.022342
published as Phys. Rev. A 100, 022342 (2019) · 13 pages, 17 figures
arxiv created 2019/05/15 · openalex publication_date 2019/08/30 · arxiv updated 2019/09/02 · openalex created_date 2025/10/10 · openalex updated_date 2026/08/05
We design a series of quantum circuits that generate absolute maximally entangled (AME) states to benchmark a quantum computer. A relation between graph states and AME states can be exploited to optimize the structure of the circuits and minimize their depth. Furthermore, we find that most of the provided circuits obey majorization relations for every partition of the system and every step of the algorithm. The main goal of the work consists in testing efficiency of quantum computers when requiring the maximal amount of genuine multipartite entanglement allowed by quantum mechanics, which can be used to efficiently implement multipartite quantum protocols.