Quantum discord and quantum computing -- an appraisal

DOI10.1142/S0219749911008416zbMATH Open1261.81046arXiv1109.5549WikidataQ57740827 ScholiaQ57740827MaRDI QIDQ4904835FDOQ4904835

Authors: Animesh Datta, Anil Shaji 

Publication date: 11 February 2013

Published in: International Journal of Quantum Information (Search for Journal in Brave)

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/1109.5549

Recommendations

• Computing quantum discord is NP-complete
• Necessary and sufficient condition for nonzero quantum discord
• Quantum discord: a measure of the quantumness of correlations
• A Pedagogical Overview of Quantum Discord
• Quantum dissonance and deterministic quantum computation with a single qubit

zbMATH Keywords

complexityquantum discordDQC1mixed-state quantum computation

Mathematics Subject Classification ID

Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Open systems, reduced dynamics, master equations, decoherence (81S22)

Cites Work

• A new polynomial invariant of knots and links
• Title not available (Why is that?)
• Quantum entanglement
• Necessary and sufficient condition for nonzero quantum discord
• Classical, quantum and total correlations
• Characterizing entanglement
• Quantum discord: a measure of the quantumness of correlations
• Theoretical and experimental aspects of quantum discord and related measures
• The physical implementation of quantum computation.
• Distilling Common Randomness From Bipartite Quantum States
• Quantum computation and the evaluation of tensor networks
• Quantum computing and quadratically signed weight enumerators
• On knot invariants related to some statistical mechanical models
• Approximate Counting and Quantum Computation

Cited In (13)

• The elusive source of quantum speedup
• Computing quantum discord is NP-complete
• Information-theoretical discord for a class of three-qubit X states
• Extrapolated quantum states, void states and a huge novel class of distillable entangled states
• Quantum discord as a resource in quantum communication
• A Pedagogical Overview of Quantum Discord
• Quantum dissonance and deterministic quantum computation with a single qubit
• Quantum discord in a three-spin system in an external magnetic field
• Genuine correlations of tripartite system
• Tripartite quantum discord dynamics in qubits driven by the joint influence of distinct classical noises
• Scales of time where the quantum discord allows an efficient execution of the DQC1 algorithm
• Exact and efficient simulation of concordant computation
• A simple analytical expression of quantum Fisher and skew information and their dynamics under decoherence channels

This page was built for publication: Quantum discord and quantum computing -- an appraisal

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4904835)