Generation of Kochen-Specker contextual sets in higher dimensions by dimensional upscaling whose complexity does not scale with dimension and their applications

• URL: http://arxiv.org/abs/2305.08267v3
• Date: Fri, 19 Jul 2024 00:48:23 GMT
• Title: Generation of Kochen-Specker contextual sets in higher dimensions by dimensional upscaling whose complexity does not scale with dimension and their applications
• Authors: Mladen Pavicic, Mordecai Waegell,
• Abstract summary: We design a dimensional upscaling method, whose complexity does not scale with dimension. We generate manageable-sized Kochen-Specker (KS) master sets in up to 27 dimensional spaces. We discuss three kinds of applications that work with KS sets in higher dimensions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Recently, handling of contextual sets, in particular Kochen-Specker (KS) sets, in higher dimensions has been given an increasing attention, both theoretically and experimentally. However, methods of their generation are diverse, not generally applicable in every dimension, and of exponential complexity. Therefore, we design a dimensional upscaling method, whose complexity does not scale with dimension. As a proof of principle we generate manageable-sized KS master sets in up to 27 dimensional spaces and show that well over 32 dimensions can be reached. From these master sets we obtain an ample number of smaller KS sets. We discuss three kinds of applications that work with KS sets in higher dimensions. We anticipate other applications of KS sets for quantum information processing that make use of large families of nonisomorphic KS sets.

Related papers

• Scheme of quantum communications based on Witting polytope [55.2480439325792]
  Presented paper describes how to use this configuration for a quantum key distribution protocol based on contextuality using some illustrative examples with 40 "quantum cards" In a more general case, two arbitrary quantum systems with four basis states (ququarts) can be used instead.
  arXiv  Detail & Related papers  (2025-03-24T08:26:48Z)
• Two fundamental solutions to the rigid Kochen-Specker set problem and the solution to the minimal Kochen-Specker set problem under one assumption [0.0]
  We show that two fundamental structures of quantum theory define two rigid KS sets. The second construction provides a clue to solve the minimal KS problem. We conjecture that 31 is the solution to the minimal KS set problem.
  arXiv  Detail & Related papers  (2025-01-20T18:13:28Z)
• 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)
• Maximal Non-Kochen-Specker Sets and a Lower Bound on the Size of Kochen-Specker Sets [1.5163329671980246]
  A Kochen-Specker (KS) set is a finite collection of vectors on the two-sphere containing no antipodal pairs. The existence of KS sets lies at the heart of Kochen and Specker's argument against non-contextual hidden variable theories.
  arXiv  Detail & Related papers  (2024-03-08T11:38:16Z)
• Non-Kochen-Specker Contextuality [0.0]
  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.
  arXiv  Detail & Related papers  (2023-07-30T23:16:36Z)
• Normalizing flows for lattice gauge theory in arbitrary space-time dimension [135.04925500053622]
  Applications of normalizing flows to the sampling of field configurations in lattice gauge theory have so far been explored almost exclusively in two space-time dimensions. We discuss masked autoregressive with tractable and unbiased Jacobian determinants, a key ingredient for scalable and exact flow-based sampling algorithms. For concreteness, results from a proof-of-principle application to SU(3) gauge theory in four space-time dimensions are reported.
  arXiv  Detail & Related papers  (2023-05-03T19:54:04Z)
• High-dimensional entanglement certification: bounding relative entropy of entanglement in $2d+1$ experiment-friendly measurements [77.34726150561087]
  Entanglement -- the coherent correlations between parties in a quantum system -- is well-understood and quantifiable. Despite the utility of such systems, methods for quantifying high-dimensional entanglement are more limited and experimentally challenging. We present a novel certification method whose measurement requirements scale linearly with dimension subsystem.
  arXiv  Detail & Related papers  (2022-10-19T16:52:21Z)
• Continuous percolation in a Hilbert space for a large system of qubits [58.720142291102135]
  The percolation transition is defined through the appearance of the infinite cluster. We show that the exponentially increasing dimensionality of the Hilbert space makes its covering by finite-size hyperspheres inefficient. Our approach to the percolation transition in compact metric spaces may prove useful for its rigorous treatment in other contexts.
  arXiv  Detail & Related papers  (2022-10-15T13:53:21Z)
• Geometry Interaction Knowledge Graph Embeddings [153.69745042757066]
  We propose Geometry Interaction knowledge graph Embeddings (GIE), which learns spatial structures interactively between the Euclidean, hyperbolic and hyperspherical spaces. Our proposed GIE can capture a richer set of relational information, model key inference patterns, and enable expressive semantic matching across entities.
  arXiv  Detail & Related papers  (2022-06-24T08:33:43Z)
• 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)
• Optimal classical and quantum real and complex dimension witness [0.0]
  We use the linear independence tested by a determinant as a dimension certificate. We discuss the practical application of the test to certify the space logical operations on a quantum computer.
  arXiv  Detail & Related papers  (2022-02-07T14:11:40Z)
• Universal construction of genuinely entangled subspaces of any size [0.0]
  We construct subspaces supporting only genuinely multipartite entangled states of any permissible dimensionality. An immediate consequence of our result is the possibility of constructing in the general multiparty scenario genuinely multiparty entangled mixed states with ranks up to the maximal dimension of a genuinely entangled subspace.
  arXiv  Detail & Related papers  (2021-11-19T13:04:43Z)
• Intrinsic Dimension Estimation [92.87600241234344]
  We introduce a new estimator of the intrinsic dimension and provide finite sample, non-asymptotic guarantees. We then apply our techniques to get new sample complexity bounds for Generative Adversarial Networks (GANs) depending on the intrinsic dimension of the data.
  arXiv  Detail & Related papers  (2021-06-08T00:05:39Z)
• High-dimensional Convolutional Networks for Geometric Pattern Recognition [75.43345656210992]
  We present high-dimensional convolutional networks (ConvNets) for pattern recognition problems. We first study the effectiveness of convolutional networks in detecting linear subspaces in high-dimensional spaces with up to 32 dimensions. We then apply high-dimensional ConvNets to 3D registration under rigid motions and image correspondence estimation.
  arXiv  Detail & Related papers  (2020-05-17T01:46:12Z)

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.