Towards exact algorithmic proofs of maximal mutually unbiased bases sets in arbitrary integer dimension

• URL: http://arxiv.org/abs/2309.12399v1
• Date: Thu, 21 Sep 2023 18:00:42 GMT
• Title: Towards exact algorithmic proofs of maximal mutually unbiased bases sets in arbitrary integer dimension
• Authors: Santiago Cifuentes, Nicol\'as Ciancaglini, Guido Bellomo, Santiago Figueira, Ariel Bendersky
• Abstract summary: 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.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: In this paper, 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. To address this issue, we introduce three algorithms based on First-Order Logic that can determine the maximum number of bases in an MUB set without numerical approximation. Our algorithms can prove this result in finite time, although the required time is impractical. Additionally, we present a heuristic approach to solve the semi-decision problem of determining if there are $k$ MUBs in a given dimension $d$. As a byproduct of our research, we demonstrate that the maximum number of MUBs in any dimension can be achieved with definable complex parameters, computable complex parameters, and other similar fields.

Related papers

• High-dimensional quantum key distribution rates for multiple measurement bases [0.0]
  We investigate the advantages of high-dimensional encoding for a quantum key distribution protocol. In particular, we address a BBM92-like protocol where the dimension of the systems can be larger than two.
  arXiv  Detail & Related papers  (2025-01-10T11:42:59Z)
• Sum-of-Squares inspired Quantum Metaheuristic for Polynomial Optimization with the Hadamard Test and Approximate Amplitude Constraints [76.53316706600717]
  Recently proposed quantum algorithm arXiv:2206.14999 is based on semidefinite programming (SDP) We generalize the SDP-inspired quantum algorithm to sum-of-squares. Our results show that our algorithm is suitable for large problems and approximate the best known classicals.
  arXiv  Detail & Related papers  (2024-08-14T19:04:13Z)
• When can you trust feature selection? -- I: A condition-based analysis of LASSO and generalised hardness of approximation [49.1574468325115]
  We show how no (randomised) algorithm can determine the correct support sets (with probability $> 1/2$) of minimisers of LASSO when reading approximate input. For ill-posed inputs, the algorithm runs forever, hence, it will never produce a wrong answer. For any algorithm defined on an open set containing a point with infinite condition number, there is an input for which the algorithm will either run forever or produce a wrong answer.
  arXiv  Detail & Related papers  (2023-12-18T18:29:01Z)
• 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)
• 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)
• Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints [62.72309460291971]
  We introduce a variational quantum algorithm for Goemans-Williamson algorithm that uses only $n+1$ qubits. Efficient optimization is achieved by encoding the objective matrix as a properly parameterized unitary conditioned on an auxilary qubit. We demonstrate the effectiveness of our protocol by devising an efficient quantum implementation of the Goemans-Williamson algorithm for various NP-hard problems.
  arXiv  Detail & Related papers  (2022-06-30T03:15:23Z)
• Exponential Separation between Quantum and Classical Ordered Binary Decision Diagrams, Reordering Method and Hierarchies [68.93512627479197]
  We study quantum Ordered Binary Decision Diagrams($OBDD$) model. We prove lower bounds and upper bounds for OBDD with arbitrary order of input variables. We extend hierarchy for read$k$-times Ordered Binary Decision Diagrams ($k$-OBDD$) of width.
  arXiv  Detail & Related papers  (2022-04-22T12:37:56Z)
• Three numerical approaches to find mutually unbiased bases using Bell inequalities [0.0]
  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$.
  arXiv  Detail & Related papers  (2022-03-17T16:31:02Z)
• Computing the quantum guesswork: a quadratic assignment problem [6.445605125467573]
  Previous approaches to the computation of the guesswork were based on standard semi-definite programming techniques. We show that computing the quantum guesswork of qubit ensembles with uniform probability distribution leads to a more-than-quadratic speedup. As examples, we compute the guesswork of regular and quasi-regular sets of qubit states.
  arXiv  Detail & Related papers  (2021-12-03T01:24:57Z)
• Evidence for and against Zauner's MUB Conjecture in $\mathbb{C}^6$ [0.0]
  Zauner predicted that there can exist no more than three MUBs. In $mathbbC6$, not even a single vector has ever been found which is mutually unbiased to a set of three MUBs.
  arXiv  Detail & Related papers  (2021-03-15T20:29:36Z)
• Quantum algorithms for spectral sums [50.045011844765185]
  We propose new quantum algorithms for estimating spectral sums of positive semi-definite (PSD) matrices. We show how the algorithms and techniques used in this work can be applied to three problems in spectral graph theory.
  arXiv  Detail & Related papers  (2020-11-12T16:29:45Z)

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.