We study two distinct diagnostics of bipartite quantum channels: the average fidelity between a desired state and noisy output across different classes of input states, and generation of entanglement from pure product input states, quantified by well-defined entangling power. These diagnostics are generally independent, but together they provide a more complete description of bipartite channels. We show that the fidelity averaged over any local-unitary orbit with fixed Schmidt coefficients for equal local dimensions is completely determined by the average input-output fidelity and its restriction to product inputs. We also introduce concurrence- and negativity-based entangling power for two-qubit channels, prove their convexity and monotonicity under local postprocessing, and show that, unlike the previously proposed linear-entropy quantity, they vanish for all separable channels. Representative separable and nonseparable channels are investigated. Finally, we generalize our definitions of entangling power to nonproduct inputs, and provide an analytical lower bound for the concurrence-based entanglement variation, showing its effectiveness with specific examples.
We study two distinct diagnostics of bipartite quantum channels: the average fidelity between a desired state and noisy output across different classes of input states, and generation of entanglement from pure product input states, quantified by well-defined entangling power. These diagnostics are generally independent, but together they provide a more complete description of bipartite channels. We show that the fidelity averaged over any local-unitary orbit with fixed Schmidt coefficients for equal local dimensions is completely determined by the average input-output fidelity and its restriction to product inputs. We also introduce concurrence- and negativity-based entangling power for two-qubit channels, prove their convexity and monotonicity under local postprocessing, and show that, unlike the previously proposed linear-entropy quantity, they vanish for all separable channels. Representative separable and nonseparable channels are investigated. Finally, we generalize our definitions of entangling power to nonproduct inputs, and provide an analytical lower bound for the concurrence-based entanglement variation, showing its effectiveness with specific examples.
In this paper, we investigate the characterization of multipartite entanglement based on the unified (q,s)-entropy framework. For bipartite quantum states, we propose an entanglement measure Eq,sA∣B(ρ) based on unified entropy and derive several analytical lower bounds for it using local orthonormal observables. We demonstrate with concrete examples that our lower bounds provide tighter estimates of quantum entanglement than several existing analytical bounds. For multipartite quantum states, based on unified entropy, we propose two measures Aq,sk(ρ) and Gq,sk(ρ) for quantifying k-nonseparability, and prove that these measures satisfy several desirable properties, such as faithfulness, local unitary invariance, and convexity. Moreover, we rigorously prove that when the parameters q and s are in certain ranges, Aq,sk(ρ) and Gq,sk(ρ) also satisfy monotonicity and strong monotonicity. Furthermore, we establish the order relations of the measures Aq,sk(ρ) and Gq,sk(ρ) with respect to the parameters q and s for fixed quantum states. In addition, for fixed q and s, we also give their order relations for any two pure states.
Quantifying the entangling capability of quantum operations is a fundamental task in quantum information science. Traditionally, this capability is measured by the entangling power (EP), defined as the average entanglement generated when a quantum operation acts uniformly on all possible product states. However, EP alone cannot capture the intricate input-state-dependent nature of entanglement generation. To address this, we define a complementary metric -- entangling power deviation (EPD) -- as the standard deviation of entanglement generated over all product input states, thereby capturing the multifaceted nature of entangling behavior. We develop a general group-theoretical framework that yields closed-form expressions for both EP and EPD. Our analysis shows that any nontrivial entangling operation necessarily exhibits input-state dependence: nonzero EP implies a nonzero EPD. By analyzing representative two-qubit gates, we show that the gates with identical EP can exhibit markedly different EPD values, illustrating that the nature of entanglement generation can significantly differ depending on the gate functionality. Extending our framework to a class of generalized controlled-unitary operations acting on bipartite Hilbert spaces of arbitrary dimensions, we further analyze the interplay between the entangling strength and uniformity, as quantified by EP and EPD. Moreover, we uncover a subtle dimension-parity-dependent behavior in entanglement generation, which EP alone fails to detect. These findings highlight EPD as an indispensable diagnostic tool -- one that, alongside EP, provides a deeper and more complete characterization of the entangling structure.
Quantifying the entanglement generation of a multipartite unitary operation is a key problem in quantum information processing. We introduce the definition of multipartite entangling, assisted entangling, and disentangling power, which is a natural generalization of the bipartite ones. We show that they are assumed at a specified quantum state. We analytically derive the entangling power of Schmidt-rank-two multiqubit unitary operations by the minimal convex sum of modulo-one complex numbers. Besides we show the necessary and sufficient condition that the assisted entangling power of Schmidt-rank-two unitary operations reaches the maximum. We investigate the widely used multiqubit gates, for example, the entangling power of CCZS gate, the entangling and assisted entangling power of the n-qubit Toffoli gate. The entangling power of the three-qubit Fredkin gate is two ebits, and that of the four-qubit Fredkin gate is in two to log25 ebits. Further we investigate the entangling power during the noisy implementation of operations.
We analytically characterize entanglement generation by two paradigmatic coherently controlled quantum processes, the quantum switch and time-flip. Retaining rather than measuring or discarding the control, we treat the control and target as the bipartite system and assume pure product inputs, so that any output entanglement reflects the entangling capability of the process. For the switch of qubit unitaries, we derive exact expressions for entanglement, together with a geometric characterization and a coherence-entanglement conservation relation. We then extend our analysis to binary random unitary, Pauli, amplitude damping, and generalized amplitude damping channels. We prove that switch of channels commuting under composition cannot entangle a separable input. Yet maximal entanglement is possible even with dissipation, e.g., an entanglement-breaking damping channel switched with a bit-flip can transform a product input into a maximally entangled state. For two generalized amplitude damping channels, a common stationary state prevents entanglement, while different stationary populations can enable it. We present an analogous study for the time-flip of unitary and binary random unitary channels. Our findings provide a systematic analysis of how much entanglement can be generated by coherent control of channel order or input-output direction.
Abstract We investigate the fidelity of Haar random bipartite pure states from a fixed reference quantum state and their bipartite entanglement. By plotting the fidelity and entanglement on perpendicular axes, we observe that the resulting plots exhibit non-uniform distributions. The distribution depends on the entanglement of the fixed reference quantum state used to quantify the fidelity of the random pure bipartite states. We find that the average fidelity of typical random pure bipartite qubits within a narrow entanglement range with respect to a randomly chosen fixed bipartite qubit is 1 4 . Extending our study to higher dimensional bipartite qudits, we find that the average fidelity of typical random pure bipartite qudits with respect to a randomly chosen fixed bipartite qudit remains constant within a narrow entanglement range. The values of these constants are 1 d 2 , with d being the dimension of the local Hilbert space of the bipartite qudit system, suggesting a consistent relationship between entanglement and fidelity across different dimensions. The probability distribution functions of fidelity with respect to a product state are analytically studied and used as a reference for the benchmarking of distributed quantum computing devices.
Applying controlled unitary gates to generate entanglement between qubits is a routine task in both quantum communication and computation. The existing tools for predicting how much entanglement a given gate can generate require either simulation of the entangling circuit or averaging over a distribution of inputs for a given controlled unitary gate. Here, we introduce a computable quantity ζ that not only determines whether a controlled unitary gate generates entanglement, but also quantifies the entanglement for any specific input without requiring the construction of the output state. For two-qubit controlled unitary gates, we establish the physical conditions corresponding to the extremum values of the proposed quantity. Extending the dimension of control and target registers to arbitrary size through a generalized controlled unitary architecture, we derive a universal upper bound on ζ and identify the conditions for its saturation. Later we establish functional relation between the quantity and other known quantities, such as purity, normalized linear entropy, and von Neumann entropy. Finally, we compare our results with previous research work and show that the quantity proposed in this work achieves the previously known optimal values of entangling power of controlled unitary gates for some specific dimensions of target and control registers.