Quantum circuits for maximally entangled states

TL;DR

This paper introduces quantum circuits designed to generate maximally entangled states for benchmarking quantum computers, leveraging graph state relations to optimize circuit structure and analyze entanglement properties during computation.

Contribution

It presents novel quantum circuits for AME states, optimizing their structure using graph state relations, and studies their entanglement properties for benchmarking purposes.

Findings

Circuits efficiently generate AME states with minimal depth

Most circuits obey majorization relations at all steps

Maximal entanglement useful for multipartite protocols

Abstract

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 at every step of the quantum computation. The rational for our approach is to benchmark quantum computers with maximal useful entanglement, which can be used to implement multipartite quantum protocols.