Optimal Simulation of a Perfect Entangler

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.

4 pages, Comments are welcomed;v2 : more discussions with previous related works, main results unchanged, submitted to PRA

References in corpus (7)

• Entanglement Is Not Necessary for Perfect Discrimination between Unitary Operations
• The entangling and disentangling power of unitary transformations are unequal
• Lower bounds on the complexity of simulating quantum gates
• Entangling capacity and distinguishability of two-qubit unitary operators
• Relation between classical communication capacity and entanglement capability for two-qubit unitary operations
• Entanglement changing power of two-qubit unitary operations
• Existence of Universal Entangler

Cited by in corpus (4)

• Characteristics, Implementation and Applications of Special Perfect Entangler Circuits
• Characterization of multipartite entanglement in terms of local transformations
• Numerical search for universal entanglers in C3xC4 and C4xC4
• Nonlocal characteristics and argand diagram of two-qubit gates