Entangling Power in the Deterministic Quantum Computation with One Qubit
arXiv:1307.1196 · doi:10.1103/PhysRevA.87.022322
Abstract
The deterministic quantum computing with one qubit (DQC1) is a mixed-state quantum computation algorithm that evaluates the normalized trace of a unitary matrix and is more powerful than the classical counterpart. We find that the normalized trace of the unitary matrix can be directly described by the entangling power of the quantum circuit of the DQC1, so the nontrivial DQC1 is always accompanied with the non-vanishing entangling power. In addition, it is shown that the entangling power also determines the intrinsic complexity of this quantum computation algorithm, i.e., the larger entangling power corresponds to higher complexity. Besides, it is also shown that the non-vanishing entangling power does always exist in other similar tasks of DQC1.
6 pages and 1 figure
References in corpus (17)
- Quantum discord and the power of one qubit
- Necessary and sufficient condition for non-zero quantum discord
- Experimental quantum computing without entanglement
- Robustness of quantum discord to sudden death
- Classical and quantum correlations under decoherence
- No-local-broadcasting theorem for quantum correlations
- Interpreting quantum discord through quantum state merging
- Operational interpretations of quantum discord
- Linking Quantum Discord to Entanglement in a Measurement
- On the role of entanglement and correlations in mixed-state quantum computation
- All non-classical correlations can be activated into distillable entanglement
- Operational Significance of Discord Consumption: Theory and Experiment
- Conservation law for distributed entanglement of formation and quantum discord
- Entanglement irreversibility from quantum discord and quantum deficit
- Frozen discord in non-Markovian dephasing channels
- Broadcast copies reveal the quantumness of correlations
- Direct Measure of Quantum Correlation