A new heuristic approach for contextuality degree estimates and its four- to six-qubit portrayals

• URL: http://arxiv.org/abs/2407.02928v1
• Date: Wed, 3 Jul 2024 08:59:30 GMT
• Title: A new heuristic approach for contextuality degree estimates and its four- to six-qubit portrayals
• Authors: Axel Muller, Metod Saniga, Alain Giorgetti, Frédéric Holweck, Colm Kelleher,
• Abstract summary: We introduce and describe a new method for finding an upper bound on the degree of contextuality and the corresponding unsatisfied part of a quantum contextual configuration. While the previously used method based on a SAT solver was limited to three qubits, this new method is much faster and more versatile.
• Score: 0.0699049312989311
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: We introduce and describe a new heuristic method for finding an upper bound on the degree of contextuality and the corresponding unsatisfied part of a quantum contextual configuration with three-element contexts (i.e., lines) located in a multi-qubit symplectic polar space of order two. While the previously used method based on a SAT solver was limited to three qubits, this new method is much faster and more versatile, enabling us to also handle four- to six-qubit cases. The four-qubit unsatisfied configurations we found are quite remarkable. That of an elliptic quadric features 315 lines and has in its core three copies of the split Cayley hexagon of order two having a Heawood-graph-underpinned geometry in common. That of a hyperbolic quadric also has 315 lines but, as a point-line incidence structure, is isomorphic to the dual $\mathcal{DW}(5,2)$ of $\mathcal{W}(5,2)$. Finally, an unsatisfied configuration with 1575 lines associated with all the lines/contexts of the four-qubit space contains a distinguished $\mathcal{DW}(5,2)$ centered on a point-plane incidence graph of PG$(3,2)$. The corresponding configurations found in the five-qubit space exhibit a considerably higher degree of complexity, except for a hyperbolic quadric, whose 6975 unsatisfied contexts are compactified around the point-hyperplane incidence graph of PG$(4,2)$. The most remarkable unsatisfied patterns discovered in the six-qubit space are a couple of disjoint split Cayley hexagons (for the full space) and a subgeometry underpinned by the complete bipartite graph $K_{7,7}$ (for a hyperbolic quadric).

Related papers

• Efficient Solution of Point-Line Absolute Pose [52.775981113238046]
  We revisit certain problems of pose estimation based on 3D--2D correspondences between features which may be points or lines. We show experimentally that the resulting solvers are numerically stable and fast.
  arXiv  Detail & Related papers  (2024-04-25T12:09:16Z)
• Classically-embedded split Cayley hexagons rule three-qubit contextuality with three-element contexts [0.0699049312989311]
  We show that split Cayley hexagons of order two live in the three-qubit symplectic polar space in two non-isomorphic embeddings, called classical and skew. Although neither of the two embeddings yields observable-based contextual configurations of their own, it classically-embedded copies are found to fully rule contextuality properties.
  arXiv  Detail & Related papers  (2023-12-12T21:10:42Z)
• New and improved bounds on the contextuality degree of multi-qubit configurations [0.0699049312989311]
  We present algorithms and a C code to reveal quantum contextuality and evaluate the contextuality degree. The paper first describes the algorithms and the C code. Then it illustrates its power on a number of subspaces of symplectic polar spaces whose rank ranges from 2 to 7. The most interesting new results include: (i) non-contextuality of configurations whose contexts are subspaces of dimension 2 and higher, (ii) non-existence of negative subspaces of dimension 3 and higher.
  arXiv  Detail & Related papers  (2023-05-17T14:02:57Z)
• Quantum version of the Euler's problem: a geometric perspective [0.0]
  We analyze the recently found solution to the quantum version of the Euler's problem from a geometric point of view. Existence of a quantum Graeco-Latin square of size six, equivalent to a maximally entangled state of four subsystems with d=6 levels each, implies that three copies of the manifold U(36)/U(1) of maximally entangled states of the $36times 36$ system, embedded in the complex projective space $CP36times 36 -1$, do intersect simultaneously at a certain point.
  arXiv  Detail & Related papers  (2022-12-07T19:01:35Z)
• A Scalable Combinatorial Solver for Elastic Geometrically Consistent 3D Shape Matching [69.14632473279651]
  We present a scalable algorithm for globally optimizing over the space of geometrically consistent mappings between 3D shapes. We propose a novel primal coupled with a Lagrange dual problem that is several orders of magnitudes faster than previous solvers.
  arXiv  Detail & Related papers  (2022-04-27T09:47:47Z)
• Relative Pose from SIFT Features [50.81749304115036]
  We derive a new linear constraint relating the unknown elements of the fundamental matrix and the orientation and scale. The proposed constraint is tested on a number of problems in a synthetic environment and on publicly available real-world datasets on more than 80000 image pairs.
  arXiv  Detail & Related papers  (2022-03-15T14:16:39Z)
• Three-Qubit-Embedded Split Cayley Hexagon is Contextuality Sensitive [0.0]
  It is known that there are two non-equivalent embeddings of the split Cayley hexagon of order two into $mathcalW(5,2)$, the binary symplectic polar space of rank three. We show that the complement of a classically-embedded hexagon is not contextual, whereas that of a skewly-embedded one is.
  arXiv  Detail & Related papers  (2022-02-01T19:53:27Z)
• Dist2Cycle: A Simplicial Neural Network for Homology Localization [66.15805004725809]
  Simplicial complexes can be viewed as high dimensional generalizations of graphs that explicitly encode multi-way ordered relations. We propose a graph convolutional model for learning functions parametrized by the $k$-homological features of simplicial complexes.
  arXiv  Detail & Related papers  (2021-10-28T14:59:41Z)
• Solving correlation clustering with QAOA and a Rydberg qudit system: a full-stack approach [94.37521840642141]
  We study the correlation clustering problem using the quantum approximate optimization algorithm (QAOA) and qudits. Specifically, we consider a neutral atom quantum computer and propose a full stack approach for correlation clustering. We show the qudit implementation is superior to the qubit encoding as quantified by the gate count.
  arXiv  Detail & Related papers  (2021-06-22T11:07:38Z)
• Taxonomy of Polar Subspaces of Multi-Qubit Symplectic Polar Spaces of Small Rank [0.22940141855172028]
  We study certain physically-relevant subgeometries of binary symplectic polar spaces $W(2N-1,2)$ of small rank $N$. Key characteristics of a subspace $W(2N-1,2)$ are: the number of its negative lines, the distribution of types of observables, the character of the geometric hyperplane the subspace shares with the distinguished quadric of $W(2N-1,2)$ and the structure of its Veldkamp space.
  arXiv  Detail & Related papers  (2021-05-08T08:31:59Z)
• PlueckerNet: Learn to Register 3D Line Reconstructions [57.20244406275875]
  This paper proposes a neural network based method to solve the problem of Aligning two partially-overlapped 3D line reconstructions in Euclidean space. Experiments on both indoor and outdoor datasets show that the registration (rotation and translation) precision of our method outperforms baselines significantly.
  arXiv  Detail & Related papers  (2020-12-02T11:31:56Z)

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.