Abstract
The power of one qubit deterministic quantum processor (DQC1) (Knill and Laflamme (1998)) generates a nonclassical correlation known as quantum discord. The DQC1 algorithm executes in an efficient way with a characteristic time given byτ=Tr[Un]/2n, whereUnis annqubit unitary gate. For pure states, quantum discord means entanglement while for mixed states such a quantity is more than entanglement. Quantum discord can be thought of as the mutual information between two systems. Within the quantum discord approach the role of time in an efficient evaluation ofτis discussed. It is found that the smaller the value oft/Tis, wheretis the time of execution of the DQC1 algorithm andTis the scale of time where the nonclassical correlations prevail, the more efficient the calculation ofτis. A Mösbauer nucleus might be a good processor of the DQC1 algorithm while a nuclear spin chain would not be efficient for the calculation ofτ.
Highlights
The power of one qubit deterministic quantum processor (DQC1) (Knill and Laflamme (1998)) generates a nonclassical correlation known as quantum discord
The DQC1 algorithm executes in an efficient way with a characteristic time given by τ = Tr[Un]/2n, where Un is an n qubit unitary gate
It is found that the smaller the value of t/T is, where t is the time of execution of the DQC1 algorithm and T is the scale of time where the nonclassical correlations prevail, the more efficient the calculation of τ is
Summary
The power of one qubit deterministic quantum processor (DQC1) (Knill and Laflamme (1998)) generates a nonclassical correlation known as quantum discord. The DQC1 algorithm executes in an efficient way with a characteristic time given by τ = Tr[Un]/2n, where Un is an n qubit unitary gate. Within the quantum discord approach the role of time in an efficient evaluation of τ is discussed.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
