Irreducible magic sets for $n$-qubit systems

Abstract

Magic sets of observables are minimal structures that capture quantum state-independent advantage for systems of $n\ge 2$ qubits and are, therefore, fundamental tools for investigating the interface between classical and quantum physics. A theorem by Arkhipov (arXiv:1209.3819) states that $n$-qubit magic sets in which each observable is in exactly two subsets of compatible observables can be reduced either to the two-qubit magic square or the three-qubit magic pentagram [N. D. Mermin, Phys. Rev. Lett. 65, 3373 (1990)]. An open question is whether there are magic sets that cannot be reduced to the square or the pentagram. If they exist, a second key question is whether they require $n>3$ qubits, since, if this is the case, these magic sets would capture minimal state independent quantum advantage that is specific for $n$-qubit systems with specific values of $n$. Here, we answer both questions affirmatively. We identify magic sets which cannot be reduced to the square or the pentagram and require $n=3,4,5$, or $6$ qubits. In addition, we prove a generalized version of Arkhipov's theorem providing an efficient algorithm for, given a hypergraph, deciding whether or not it can accommodate a magic set, and solve another open problem, namely, given a magic set, obtaining the tight bound of its associated noncontextuality inequality.

arXiv comment5+13 pages, 3+1 figures

References in corpus (40)

• Hidden Variables and the Two Theorems of John Bell
• Experimentally testable state-independent quantum contextuality
• Quantum advantage with shallow circuits
• State-independent experimental test of quantum contextuality
• Contextuality in Measurement-based Quantum Computation
• State-independent quantum contextuality with single photons
• Computational power of correlations
• Testing contextuality on quantum ensembles with one clean qubit
• Quantum Pseudo-Telepathy
• "All versus nothing" inseparability for two observers
• Contextuality as a resource for models of quantum computation on qubits
• Bell's theorem without inequalities and without probabilities for two observers
• Wigner function negativity and contextuality in quantum computation on rebits
• All-Versus-Nothing Violation of Local Realism by Two-Photon, Four-Dimensional Entanglement
• Universality of state-independent violation of correlation inequalities for noncontextual theories
• Compatibility and noncontextuality for sequential measurements
• Bounding the quantum dimension with contextuality
• "All-versus-nothing" nonlocality test of quantum mechanics by two-photon hyperentanglement
• Necessary and Sufficient Conditions for Extended Noncontextuality in a Broad Class of Quantum Mechanical Systems
• Kochen-Specker theorem for 8-dimensional space
• Device-independent parallel self-testing of two singlets
• All-Versus-Nothing Violation of Local Realism for Two Entangled Photons
• Memory cost of quantum contextuality
• Quantum codewords contradict local realism
• Proposal for revealing quantum nonlocality via local contextuality
• Fully nonlocal quantum correlations
• Converting contextuality into nonlocality
• Nonlocality from local contextuality
• Parallel Device-Independent Quantum Key Distribution
• Optimal classical simulation of state-independent quantum contextuality
• Proofs of the Kochen-Specker theorem based on the N-qubit Pauli group
• On small proofs of Bell-Kochen-Specker theorem for two, three and four qubits
• Proposed test of macroscopic quantum contextuality
• Experimental observation of impossible-to-beat quantum advantage on a hybrid photonic system
• Memory cost for simulating all quantum correlations of the Peres-Mermin scenario
• The magic three-qubit Veldkamp line: A finite geometric underpinning for form theories of gravity and black hole entropy
• Entropic tests of multipartite nonlocality and state-independent contextuality
• GHZ paradoxes based on an even number of qubits
• Primitive Nonclassical Structures of the $N$-qubit Pauli Group
• A generalization of CHSH and the algebraic structure of optimal strategies

Cited by in corpus (4)

• Unconditional quantum magic advantage in shallow circuit computation
• Quantitative comparison of quantum pseudo-telepathy games and Bell inequalities
• An abstract structure determines the contextuality degree of observable-based Kochen-Specker proofs
• A new heuristic approach for contextuality degree estimates and its four- to six-qubit portrayals