0000000000172687

AUTHOR

Manik Banik

0000-0001-8036-790x

showing 4 related works from this author

Two-Qubit Pure Entanglement as Optimal Social Welfare Resource in Bayesian Game

2017

Entanglement is of paramount importance in quantum information theory. Its supremacy over classical correlations has been demonstrated in numerous information theoretic protocols. Here we study possible adequacy of quantum entanglement in Bayesian game theory, particularly in social welfare solution (SWS), a strategy which the players follow to maximize the sum of their payoffs. Given a multi-partite quantum state as an advice, players can come up with several correlated strategies by performing local measurements on their parts of the quantum state. A quantum strategy is called quantum-SWS if it is advantageous over a classical equilibrium (CE) strategy in the sense that none of the player…

Quantum PhysicsComputer Science::Computer Science and Game TheoryPhysics and Astronomy (miscellaneous)Computer scienceFOS: Physical sciencesQuantum entanglementState (functional analysis)01 natural scienceslcsh:QC1-999Atomic and Molecular Physics and Optics010305 fluids & plasmasBayesian gameQuantum stateQubit0103 physical sciencesQuantum informationQuantum Physics (quant-ph)010306 general physicsAdvice (complexity)Mathematical economicsQuantumlcsh:PhysicsQuantum
researchProduct

Parity Oblivious d-Level Random Access Codes and Class of Noncontextuality Inequalities

2016

One of the fundamental results in quantum foundations is the Kochen-Specker no-go theorem. For the quantum theory, the no-go theorem excludes the possibility of a class of hidden variable models where value attribution is context independent. Recently, the notion of contextuality has been generalized for different operational procedures and it has been shown that preparation contextuality of mixed quantum states can be a useful resource in an information-processing task called parity-oblivious multiplexing. Here, we introduce a new class of information processing tasks, namely d-level parity oblivious random access codes and obtain bounds on the success probabilities of performing such task…

FOS: Computer and information sciencesExistential quantificationComputer Science - Information TheoryFOS: Physical sciences01 natural sciences010305 fluids & plasmasTheoretical Computer ScienceQuantum state0103 physical sciencesElectrical and Electronic Engineering010306 general physicsQuantumMathematicsQuantum computerDiscrete mathematicsQuantum PhysicsInformation Theory (cs.IT)Statistical and Nonlinear PhysicsParity (physics)Electronic Optical and Magnetic MaterialsKochen–Specker theoremModeling and SimulationSignal ProcessingOnticQuantum Physics (quant-ph)Random access
researchProduct

Limited preparation contextuality in quantum theory and its relation to the Cirel'son bound

2015

Kochen-Specker (KS) theorem lies at the heart of the foundations of quantum mechanics. It establishes impossibility of explaining predictions of quantum theory by any noncontextual ontological model. Spekkens generalized the notion of KS contextuality in [Phys. Rev. A 71, 052108 (2005)] for arbitrary experimental procedures (preparation, measurement, and transformation procedure). Interestingly, later on it was shown that preparation contextuality powers parity-oblivious multiplexing [Phys. Rev. Lett. 102, 010401 (2009)], a two party information theoretic game. Thus, using resources of a given operational theory, the maximum success probability achievable in such a game suffices as a \emph{…

PhysicsQuantum PhysicsQuantum nonlocalityTransformation (function)Quantum mechanicsFOS: Physical sciencesImpossibilityQuantum Physics (quant-ph)Relation (history of concept)Measure (mathematics)Atomic and Molecular Physics and OpticsKochen–Specker theoremPhysical Review A
researchProduct

Strong supremacy of quantum systems as communication resource

2017

We investigate the task of $d$-level random access codes ($d$-RACs) and consider the possibility of encoding classical strings of $d$-level symbols (dits) into a quantum system of dimension $d'$ strictly less than $d$. We show that the average success probability of recovering one (randomly chosen) dit from the encoded string can be larger than that obtained in the best classical protocol for the task. Our result is intriguing as we know from Holevo's theorem (and more recently from Frenkel-Weiner's result [Commun. Math. Phys. 340, 563 (2015)]) that there exist communication scenarios wherein quantum resources prove to be of no advantage over classical resources. A distinguishing feature of…

Quantum PhysicsFOS: Physical sciencesQuantum Physics (quant-ph)
researchProduct