Non-Kochen-Specker Contextuality

• URL: http://arxiv.org/abs/2307.16339v2
• Date: Thu, 16 May 2024 16:06:42 GMT
• Title: Non-Kochen-Specker Contextuality
• Authors: Mladen Pavicic,
• Abstract summary: We show how to generate non-Kochen-Specker hypergraphs in any dimension. Our automated generation is probabilistic and random, but the statistics of accumulated data enable one to filter out sets with the required size and structure.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Quantum contextuality supports quantum computation and communication. One of its main vehicles is hypergraphs. The most elaborated are the Kochen-Specker ones, but there is also another class of contextual sets that are not of this kind. Their representation has been mostly operator-based and limited to special constructs in three- to six-dim spaces, a notable example of which is the Yu-Oh set. Previously, we showed that hypergraphs underlie all of them, and in this paper, we give general methods - whose complexity does not scale up with the dimension - for generating such non-Kochen-Specker hypergraphs in any dimension and give examples in up to 16-dim spaces. Our automated generation is probabilistic and random, but the statistics of accumulated data enable one to filter out sets with the required size and structure.

Related papers

• Quantum Contextual Hypergraphs, Operators, Inequalities, and Applications in Higher Dimensions [0.0]
  Quantum contextuality plays a significant role in supporting quantum computation and quantum information theory. This study demonstrates how to generate contextual hypergraphs in any dimension using various methods. We introduce innovative examples of hypergraphs extending to dimension 32.
  arXiv  Detail & Related papers  (2025-01-16T16:27:45Z)
• Event-based contextuality theory [1.9266988189076035]
  This paper analyses the challenges faced by some known contextuality theories, and establishes an event-based contextuality theory with partial Boolean algebra to overcome them. The theory can handle the scenarios composed of general projectors and observables, and provides a unified mathematical structure to investigate the hierarchy of quantum contextuality.
  arXiv  Detail & Related papers  (2024-10-21T08:55:43Z)
• Many-body quantum resources of graph states [0.0]
  Characterizing the non-classical correlations of a complex many-body system is an important part of quantum technologies. We consider four topologies, namely the star graph states with edges, Tur'an graphs, $r$-ary tree graphs, and square grid cluster states. We characterize many-body entanglement depth in graph states with up to $8$ qubits in $146$ classes non-equivalent under local transformations and graph isomorphisms.
  arXiv  Detail & Related papers  (2024-10-16T12:05:19Z)
• Higher-order topological kernels via quantum computation [68.8204255655161]
  Topological data analysis (TDA) has emerged as a powerful tool for extracting meaningful insights from complex data. We propose a quantum approach to defining Betti kernels, which is based on constructing Betti curves with increasing order.
  arXiv  Detail & Related papers  (2023-07-14T14:48:52Z)
• The Basis of Design Tools for Quantum Computing: Arrays, Decision Diagrams, Tensor Networks, and ZX-Calculus [55.58528469973086]
  Quantum computers promise to efficiently solve important problems classical computers never will. A fully automated quantum software stack needs to be developed. This work provides a look "under the hood" of today's tools and showcases how these means are utilized in them, e.g., for simulation, compilation, and verification of quantum circuits.
  arXiv  Detail & Related papers  (2023-01-10T19:00:00Z)
• All the World's a (Hyper)Graph: A Data Drama [55.144729234861316]
  Hyperbard is a dataset of diverse data representations from Shakespeare's plays. Our representations range from simple graphs capturing character co-occurrence in single scenes to hypergraphs encoding complex communication settings. As an homage to our data source, and asserting that science can also be art, we present all our points in the form of a play.
  arXiv  Detail & Related papers  (2022-06-16T14:51:28Z)
• Constrained mixers for the quantum approximate optimization algorithm [55.41644538483948]
  We present a framework for constructing mixing operators that restrict the evolution to a subspace of the full Hilbert space. We generalize the "XY"-mixer designed to preserve the subspace of "one-hot" states to the general case of subspaces given by a number of computational basis states. Our analysis also leads to valid Trotterizations for "XY"-mixer with fewer CX gates than is known to date.
  arXiv  Detail & Related papers  (2022-03-11T17:19:26Z)
• Automated Generation of Arbitrarily Many Kochen-Specker and Other Contextual Sets in Odd Dimensional Hilbert Spaces [0.0]
  We give three methods for automated generation of arbitrarily many contextual KS and non-KS sets in any dimension. No explicit vectors for the original Kochen-Specker set were known so far, while we now generate them from 24 vector components.
  arXiv  Detail & Related papers  (2022-02-16T17:15:45Z)
• Quantum verification and estimation with few copies [63.669642197519934]
  The verification and estimation of large entangled systems represents one of the main challenges in the employment of such systems for reliable quantum information processing. This review article presents novel techniques focusing on a fixed number of resources (sampling complexity) and thus prove suitable for systems of arbitrary dimension. Specifically, a probabilistic framework requiring at best only a single copy for entanglement detection is reviewed, together with the concept of selective quantum state tomography.
  arXiv  Detail & Related papers  (2021-09-08T18:20:07Z)
• Quantum Contextuality [0.0]
  Quantum contextual sets are resources for universal quantum computation, quantum steering and quantum communication. Discriminators considered are inequalities defined for hypergraphs whose structure and generation are determined by their basic properties. Results are obtained by making use of universal automated algorithms which generate hypergraphs with both odd and even numbers of hyperedges in any odd and even dimensional space.
  arXiv  Detail & Related papers  (2021-08-02T15:11:53Z)
• SPANet: Generalized Permutationless Set Assignment for Particle Physics using Symmetry Preserving Attention [62.43586180025247]
  Collisions at the Large Hadron Collider produce variable-size sets of observed particles. Physical symmetries of decay products complicate assignment of observed particles to decay products. We introduce a novel method for constructing symmetry-preserving attention networks.
  arXiv  Detail & Related papers  (2021-06-07T18:18:20Z)
• Graph kernels encoding features of all subgraphs by quantum superposition [4.031373438192993]
  We propose a novel graph kernel that applies a quantum computer to measure the graph similarity taking all subgraphs into account. For the construction of the quantum kernel, we develop an efficient protocol that removes the index information of subgraphs encoded in the quantum state. A detailed numerical simulation of a bioinformatics problem is presented to demonstrate that the proposed quantum kernel achieves better classification accuracy than existing graph kernels.
  arXiv  Detail & Related papers  (2021-03-30T05:50:23Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.