Optimal quantum preparation contextuality in an n-bit parity-oblivious multiplexing task

Shouvik Ghorai and A. K. Pan
Phys. Rev. A 98, 032110 – Published 14 September 2018

Abstract

In [Phys. Rev. Lett. 102, 010401 (2009)], Spekkens et al. have shown that quantum preparation contextuality can power the parity-oblivious multiplexing (POM) task. The bound on the optimal success probability of an n-bit POM task performed with the classical resources was shown to be the same as in a preparation noncontextual theory. This noncontextual bound is violated if the task is performed with quantum resources. While in the 2-bit POM task the optimal quantum success probability is achieved, in the 3-bit case optimality was left as an open question. In this paper, we show that the quantum success probability of an n-bit POM task is solely dependent on a suitable Bell expression and the optimal value of it optimizes the success probability of the said POM task. Further, we discuss how the degree of quantum preparation contextuality restricts the amount of quantum violations of Bell's inequalities, and consequently, the success probability of a POM task.

  • Received 26 February 2018

DOI:https://doi.org/10.1103/PhysRevA.98.032110

©2018 American Physical Society

Physics Subject Headings (PhySH)

General Physics

Authors & Affiliations

Shouvik Ghorai1,* and A. K. Pan2,†

  • 1Indian Institute of Science Education and Research Kolkata, Mohanpur, Nadia 741246, India
  • 2National Institute of Technology Patna, Ashok Rajpath, Patna 800005, India

  • *ghorai.shouvik@gmail.com
  • akp@nitp.ac.in

Article Text (Subscription Required)

Click to Expand

References (Subscription Required)

Click to Expand
Issue

Vol. 98, Iss. 3 — September 2018

Reuse & Permissions
Access Options
Author publication services for translation and copyediting assistance advertisement

Authorization Required


×
×

Images

×

Sign up to receive regular email alerts from Physical Review A

Log In

Cancel
×

Search


Article Lookup

Paste a citation or DOI

Enter a citation
×