Optimal Simulation of a Perfect Entangler
classification
🪐 quant-ph
keywords
unitaryentangleroperationperfectentanglingoperationsoptimalruns
pith:QQ4G2CUS Add to your LaTeX paper
What is a Pith Number?\usepackage{pith}
\pithnumber{QQ4G2CUS}
Prints a linked pith:QQ4G2CUS badge after your title and writes the identifier into PDF metadata. Compiles on arXiv with no extra files. Learn more
read the original abstract
A $2\otimes 2$ unitary operation is called a perfect entangler if it can generate a maximally entangled state from some unentangled input. We study the following question: How many runs of a given two-qubit entangling unitary operation is required to simulate some perfect entangler with one-qubit unitary operations as free resources? We completely solve this problem by presenting an analytical formula for the optimal number of runs of the entangling operation. Our result reveals an entanglement strength of two-qubit unitary operations.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.