Three numerical approaches to find mutually unbiased bases using Bell inequalities

• URL: http://arxiv.org/abs/2203.09429v3
• Date: Tue, 9 Aug 2022 10:03:12 GMT
• Title: Three numerical approaches to find mutually unbiased bases using Bell inequalities
• Authors: Maria Prat Colomer, Luke Mortimer, Ir\'en\'ee Fr\'erot, M\'at\'e Farkas, Antonio Ac\'in
• Abstract summary: Mutually unbiased bases correspond to highly useful pairs of measurements in quantum information theory. In the smallest composite dimension, six, it is known that between three and seven mutually unbiased bases exist. We tackle Zauner's conjecture numerically through the construction of Bell inequalities for every pair of integers $n,d ge 2$.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Mutually unbiased bases correspond to highly useful pairs of measurements in quantum information theory. In the smallest composite dimension, six, it is known that between three and seven mutually unbiased bases exist, with a decades-old conjecture, known as Zauner's conjecture, stating that there exist at most three. Here we tackle Zauner's conjecture numerically through the construction of Bell inequalities for every pair of integers $n,d \ge 2$ that can be maximally violated in dimension $d$ if and only if $n$ MUBs exist in that dimension. Hence we turn Zauner's conjecture into an optimisation problem, which we address by means of three numerical methods: see-saw optimisation, non-linear semidefinite programming and Monte Carlo techniques. All three methods correctly identify the known cases in low dimensions and all suggest that there do not exist four mutually unbiased bases in dimension six, with all finding the same bases that numerically optimise the corresponding Bell inequality. Moreover, these numerical optimisers appear to coincide with the "four most distant bases" in dimension six, found through numerically optimising a distance measure in [P. Raynal, X. L\"u, B.-G. Englert, Phys. Rev. A, 83 062303 (2011)]. Finally, the Monte Carlo results suggest that at most three MUBs exist in dimension ten.

Related papers

• Exchange-Symmetrized Qudit Bell Bases and Bell-State Distinguishability [0.0]
  Entanglement of qudit pairs, with single particle Hilbert space dimension $d$, has important potential for quantum information processing. We introduce a generalized Bell basis with definite symmetry under exchange of states between the two particles. We quantify the number of qudit Bell states that can be unambiguously distinguished by devices restricted to linear evolution and local measurement.
  arXiv  Detail & Related papers  (2024-12-13T17:33:43Z)
• Towards exact algorithmic proofs of maximal mutually unbiased bases sets in arbitrary integer dimension [0.0]
  We explore the concept of Mutually Unbiased Bases (MUBs) in discrete quantum systems. It is known that for dimensions $d$ that are powers of prime numbers, there exists a set of up to $d+1$ bases that form an MUB set. However, the maximum number of MUBs in dimensions that are not powers of prime numbers is not known.
  arXiv  Detail & Related papers  (2023-09-21T18:00:42Z)
• Mutually unbiased bases as a commuting polynomial optimisation problem [0.0]
  We consider the problem of mutually unbiased bases as an optimization problem over the reals. We use two methods, combining a number of optimization techniques. We demonstrate that such an algorithm would eventually solve the open question regarding dimension 6 with finite memory.
  arXiv  Detail & Related papers  (2023-08-03T17:14:22Z)
• Computing Star Discrepancies with Numerical Black-Box Optimization Algorithms [56.08144272945755]
  We compare 8 popular numerical black-box optimization algorithms on the $L_infty$ star discrepancy problem. We show that all used solvers perform very badly on a large majority of the instances. We suspect that state-of-the-art numerical black-box optimization techniques fail to capture the global structure of the problem.
  arXiv  Detail & Related papers  (2023-06-29T14:57:56Z)
• Pseudonorm Approachability and Applications to Regret Minimization [73.54127663296906]
  We convert high-dimensional $ell_infty$-approachability problems to low-dimensional pseudonorm approachability problems. We develop an algorithmic theory of pseudonorm approachability, analogous to previous work on approachability for $ell$ and other norms.
  arXiv  Detail & Related papers  (2023-02-03T03:19:14Z)
• Some Remarks on the Regularized Hamiltonian for Three Bosons with Contact Interactions [77.34726150561087]
  We discuss some properties of a model Hamiltonian for a system of three bosons interacting via zero-range forces in three dimensions. In particular, starting from a suitable quadratic form $Q$, the self-adjoint and bounded from below Hamiltonian $mathcal H$ can be constructed. We show that the threshold value $gamma_c$ is optimal, in the sense that the quadratic form $Q$ is unbounded from below if $gammagamma_c$.
  arXiv  Detail & Related papers  (2022-07-01T10:01:14Z)
• 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)
• Platonic Bell inequalities for all dimensions [0.0]
  We study the Platonic Bell inequalities for all possible dimensions. We prove to attain the maximum possible quantum violation of the Bell inequalities. We find a method to compute the local bound exactly for any bipartite two-outcome Bell inequality.
  arXiv  Detail & Related papers  (2021-12-07T18:28:31Z)
• Mutually unbiased frames [0.0]
  The concept of mutually unbiased frames is introduced as the most general notion of unbiasedness for sets composed by linearly independent and normalized vectors. It encompasses the already existing notions of unbiasedness for orthonormal bases, regular simplices, equiangular tight frames, positive operator valued measure, and also includes symmetric informationally complete quantum measurements.
  arXiv  Detail & Related papers  (2021-10-15T18:04:20Z)
• Under-bagging Nearest Neighbors for Imbalanced Classification [63.026765294759876]
  We propose an ensemble learning algorithm called textitunder-bagging $k$-NN (textitunder-bagging $k$-NN) for imbalanced classification problems.
  arXiv  Detail & Related papers  (2021-09-01T14:10:38Z)
• Finding Global Minima via Kernel Approximations [90.42048080064849]
  We consider the global minimization of smooth functions based solely on function evaluations. In this paper, we consider an approach that jointly models the function to approximate and finds a global minimum.
  arXiv  Detail & Related papers  (2020-12-22T12:59:30Z)

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.