Table of Contents Author Guidelines Submit a Manuscript
Advances in Mathematical Physics
Volume 2014 (2014), Article ID 367905, 4 pages
Research Article

Scales of Time Where the Quantum Discord Allows an Efficient Execution of the DQC1 Algorithm

1Centro Universitario UAEM Valle de Chalco, UAEMex María Isabel, 56615 Valle de Chalco, MEX, Mexico
2Instituto de Ciencias Nucleares, Universidad Nacional Autónoma de México, Circuito Exterior, CU, Coyoacán, DF, Mexico
3Departamento de Ciencias Básicas, Universidad Autónoma Metropolitana, Unidad Azcapotzalco, Avenida San Pablo 180, Colonia Reynosa Tamaulipas, 02200 Azcapotzalco, DF, Mexico

Received 19 December 2013; Accepted 16 February 2014; Published 23 March 2014

Academic Editor: Shi-Hai Dong

Copyright © 2014 M. Ávila et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.


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 , where is an qubit 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 of is, where is the time of execution of the DQC1 algorithm and is 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 .