Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Springer theses

Optimal Tests for State-Independent Contextuality

Costantino Budroni

Published Oct 21, 2015• 1 citation
Publisher
DOI
10.1007/978-3-319-24169-2_3

Related papers

Optimal inequalities for state-independent contextuality with imperfect devices

Zijie Wang, Zhen‐Peng Xu, Dong Wang

Physical Review A•Apr 14, 2026•0 citations

State-independent experimental test of quantum contextuality

Gerhard Kirchmair, F. Zähringer, R. Gerritsma +5 more

arXiv:0904.1655•Nature•Jul 1, 2009•387 citations

State-independent contextuality sets for a qutrit

Zhen‐Peng Xu, Jing‐Ling Chen, Hong-Yi Su

arXiv:1501.01746•Physics Letters A•Apr 21, 2015•12 citations

Optimal Classical Simulation of State-Independent Quantum Contextuality

Adán Cabello, Mile Gu, Otfried Gühne +1 more

Simulating quantum contextuality with classical systems requires memory. A fundamental yet open question is what is the minimum memory needed and, therefore, the precise sense in which quantum systems outperform classical ones. Here, we make rigorous the notion of classically simulating quantum state-independent contextuality (QSIC) in the case of a single quantum system submitted to an infinite sequence of measurements randomly chosen from a finite QSIC set. We obtain the minimum memory needed to simulate arbitrary QSIC sets via classical systems under the assumption that the simulation should not contain any oracular information. In particular, we show that, while classically simulating two qubits tested with the Peres-Mermin set requires log_{2}24≈4.585 bits, simulating a single qutrit tested with the Yu-Oh set requires, at least, 5.740 bits.

arXiv:1709.07372•Physical Review Letters•Mar 27, 2018•38 citations

Contextuality, Complementarity, and Bell Tests

Andrei Yu. Khrennikov

Springer eBooks•Jan 1, 2023•0 citations

Quantifying contextuality via linear programming

Rui Soares Barbosa

•Apr 24, 2016•6 citations
Simulating quantum contextuality with classical systems requires memory. A fundamental yet open question is what is the minimum memory needed and, therefore, the precise sense in which quantum systems outperform classical ones. Here, we make rigorous the notion of classically simulating quantum state-independent contextuality (QSIC) in the case of a single quantum system submitted to an infinite sequence of measurements randomly chosen from a finite QSIC set. We obtain the minimum memory needed to simulate arbitrary QSIC sets via classical systems under the assumption that the simulation should not contain any oracular information. In particular, we show that, while classically simulating two qubits tested with the Peres-Mermin set requires log_{2}24≈4.585 bits, simulating a single qutrit tested with the Yu-Oh set requires, at least, 5.740 bits.