An abstract structure determines the contextuality degree of observable-based Kochen-Specker proofs

• URL: http://arxiv.org/abs/2410.14463v1
• Date: Fri, 18 Oct 2024 13:45:31 GMT
• Title: An abstract structure determines the contextuality degree of observable-based Kochen-Specker proofs
• Authors: Axel Muller, Alain Giorgetti,
• Abstract summary: This article focuses on proofs of the Kochen-Specker theorem obtained by assigning Pauli observables to hypergraph vertices satisfying a given commutation relation. A first result is that all these quantum labelings satisfying the conditions of a given hypergram inherently possess the same degree of contextuality.
• Score: 0.09208007322096533
• License:
• Abstract: This article delves into the concept of quantum contextuality, specifically focusing on proofs of the Kochen-Specker theorem obtained by assigning Pauli observables to hypergraph vertices satisfying a given commutation relation. The abstract structure composed of this hypergraph and the graph of anticommutations is named a hypergram. Its labelings with Pauli observables generalize the well-known magic sets. A first result is that all these quantum labelings satisfying the conditions of a given hypergram inherently possess the same degree of contextuality. Then we provide a necessary and sufficient algebraic condition for the existence of such quantum labelings and an efficient algorithm to find one of them. We finally attach to each assignable hypergram an abstract notion of contextuality degree. By presenting the study of observable-based Kochen-Specker proofs from the perspective of graphs and matrices, this abstraction opens the way to new methods to search for original contextual configurations.

Related papers

• Atom graph, partial Boolean algebra and quantum contextuality [3.9474648943255937]
  We show that quantum systems are uniquely determined by their atom graphs. We also present a general and parametric description for Kochen-Specker theorem based on graphs.
  arXiv  Detail & Related papers  (2024-09-26T08:57:04Z)
• Exploring Quantum Contextuality with the Quantum Moebius-Escher-Penrose hypergraph [0.0]
  This study presents the quantum Moebius-Escher-Penrose hypergraph, drawing inspiration from paradoxical constructs such as the Moeobius strip and Penrose's impossible objects'
  arXiv  Detail & Related papers  (2024-09-16T11:17:53Z)
• Quantization of Large Language Models with an Overdetermined Basis [73.79368761182998]
  We introduce an algorithm for data quantization based on the principles of Kashin representation. Our findings demonstrate that Kashin Quantization achieves competitive or superior quality in model performance.
  arXiv  Detail & Related papers  (2024-04-15T12:38:46Z)
• Quantum Counting on the Complete Bipartite Graph [0.0]
  Quantum counting is a key quantum algorithm that aims to determine the number of marked elements in a database. Since Grover's algorithm can be viewed as a quantum walk on a complete graph, a natural way to extend quantum counting is to use the evolution operator of quantum-walk-based search on non-complete graphs.
  arXiv  Detail & Related papers  (2023-11-17T09:22:28Z)
• Revisiting Quantum Contextuality in an Algebraic Framework [0.0]
  We discuss the ideas of extracontextuality and extravalence, that allow one to relate Kochen-Specker's and Gleason's theorems. Our extracontextual approach requires however a way to describe the Heisenberg cut''
  arXiv  Detail & Related papers  (2023-04-16T12:06:44Z)
• The tilted CHSH games: an operator algebraic classification [77.34726150561087]
  This article introduces a general systematic procedure for solving any binary-input binary-output game. We then illustrate on the prominent class of tilted CHSH games. We derive for those an entire characterisation on the region exhibiting some quantum advantage.
  arXiv  Detail & Related papers  (2023-02-16T18:33:59Z)
• No-signalling constrains quantum computation with indefinite causal structure [45.279573215172285]
  We develop a formalism for quantum computation with indefinite causal structures. We characterize the computational structure of higher order quantum maps. We prove that these rules, which have a computational and information-theoretic nature, are determined by the more physical notion of the signalling relations between the quantum systems.
  arXiv  Detail & Related papers  (2022-02-21T13:43:50Z)
• Spectral bounds for the quantum chromatic number of quantum graphs [0.0]
  We obtain lower bounds for the classical and quantum number of a quantum graph using eigenvalues of the quantum adjacency matrix. We generalize all the spectral bounds given by Elphick and Wocjan to the quantum graph setting. Our results are achieved using techniques from linear algebra and a complete definition of quantum graph coloring.
  arXiv  Detail & Related papers  (2021-12-03T05:36:21Z)
• Quantum indistinguishability through exchangeable desirable gambles [69.62715388742298]
  Two particles are identical if all their intrinsic properties, such as spin and charge, are the same. Quantum mechanics is seen as a normative and algorithmic theory guiding an agent to assess her subjective beliefs represented as (coherent) sets of gambles. We show how sets of exchangeable observables (gambles) may be updated after a measurement and discuss the issue of defining entanglement for indistinguishable particle systems.
  arXiv  Detail & Related papers  (2021-05-10T13:11:59Z)
• Facial Expression Recognition on a Quantum Computer [68.8204255655161]
  We show a possible solution to facial expression recognition using a quantum machine learning approach. We define a quantum circuit that manipulates the graphs adjacency matrices encoded into the amplitudes of some appropriately defined quantum states.
  arXiv  Detail & Related papers  (2021-02-09T13:48:00Z)
• Spectra of Perfect State Transfer Hamiltonians on Fractal-Like Graphs [62.997667081978825]
  We study the spectral features, on fractal-like graphs, of Hamiltonians which exhibit the special property of perfect quantum state transfer. The essential goal is to develop the theoretical framework for understanding the interplay between perfect quantum state transfer, spectral properties, and the geometry of the underlying graph.
  arXiv  Detail & Related papers  (2020-03-25T02:46:14Z)

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.