Vector Generation of Contextual Sets

Abstract

As quantum contextuality proves to be a necessary resource for universal quantum computation, we present a general method for vector generation of Kochen-Specker (KS) contextual sets in the form of hypergraphs. The method supersedes all three previous methods: (i) fortuitous discoveries of smallest KS sets, (ii) exhaustive upward hypergraph-generation of sets, and (iii) random downward generation of sets from fortuitously obtained big master sets. In contrast to previous works, we can generate master sets which contain all possible KS sets starting with nothing but a few simple vector components. From them we can readily generate all KS sets obtained in the last half a century and any specified new KS sets. Herewith we can generate sufficiently large sets as well as sets with definite required features and structures to enable varieties of different implementations in quantum computation and communication.

6 pages, 6 figures; Orally presented by M. Pavicic at Quantum Technology International Conference 2018 (QTech 2018), Paris, France, September 5-7, 2018; Extended version: https://www.youtube.com/watch?v=Bw2vItz5trE

References in corpus (9)

• State-independent experimental test of quantum contextuality
• Experimental test of quantum contextuality in neutron interferometry
• State-independent quantum contextuality with single photons
• Proposed experiment for testing quantum contextuality with neutrons
• Applying the simplest Kochen-Specker set for quantum information processing
• On small proofs of Bell-Kochen-Specker theorem for two, three and four qubits
• Graph Approach to Quantum Systems
• Arbitrarily exhaustive hypergraph generation of 4-, 6-, 8-, 16-, and 32-dimensional quantum contextual sets
• Five-Qubit Contextuality, Noise-Like Distribution of Distances Between Maximal Bases and Finite Geometry