QUANTUM DISCORD AND QUANTUM COMPUTING - AN APPRAISAL

Article, Preprint English OPEN
Datta, Animesh ; Shaji, Anil (2011)
  • Publisher: WORLD SCIENTIFIC PUBL CO PTE LTD
  • Journal: INTERNATIONAL JOURNAL OF QUANTUM INFORMATION (issn: 0219-7499)
  • Related identifiers: doi: 10.1142/S0219749911008416
  • Subject: Quantum Physics

We discuss models of computing that are beyond classical. The primary motivation is to unearth the cause of nonclassical advantages in computation. Completeness results from computational complexity theory lead to the identification of very disparate problems, and offer a kaleidoscopic view into the realm of quantum enhancements in computation. Emphasis is placed on the `power of one qubit' model, and the boundary between quantum and classical correlations as delineated by quantum discord. A recent result by Eastin on the role of this boundary in the efficient classical simulation of quantum computation is discussed. Perceived drawbacks in the interpretation of quantum discord as a relevant certificate of quantum enhancements are addressed.
  • References (63)
    63 references, page 1 of 7

    [1] E. Knill, R. Laflamme, Phys. Rev. Lett. 81, 5672, (1998).

    [2] D. Shepherd, quant-ph/0608132, (2006).

    [3] D. Brussß, Jour. Math. Phys. 43, 4237, (2002)

    [4] M. B. Plenio, S. Virmani, Quant. Inf. Comp. 7, 1, (2009).

    [5] R. Horodecki, P. Horodecki, M. Horodecki, K. Horodecki, Rev. Mod. Phys. 81, 865, (2009).

    [6] R. Jozsa, N. Linden, Proc. Roy. Soc. A, 459, (2003).

    [7] G. Vidal, Phys. Rev. Lett. 91, 147902, (2003).

    [8] M. A. Nielsen, I. L. Chuang, Quantum Computation and Quantum Information, (2000).

    [9] D. A. Meyer, Phys. Rev. Lett. 85, 2014, (2000).

    [10] E. Bernstein, U. Vazirani, Proceedings of the 25th ACM Symposium on the Theory of Computing (STOC), ACM, New York, 11, (1993).

  • Metrics
    No metrics available
Share - Bookmark