The problem of mutually unbiased bases in dimension 6

Philippe Jaming, Máté Matolcsi, Péter Móra

Research output: Contribution to journalArticle

6 Citations (Scopus)

Abstract

We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definitions to tackle this famous open problem which has been open for the last 10 years. Some preliminary results are also listed.

Original languageEnglish
Pages (from-to)211-220
Number of pages10
JournalCryptography and Communications
Volume2
Issue number2
DOIs
Publication statusPublished - Sep 2010

Fingerprint

Mutually Unbiased Bases
Open Problems
Discretization

Keywords

  • Complex Hadamard matrices
  • Mutually unbiased bases

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Networks and Communications
  • Applied Mathematics

Cite this

The problem of mutually unbiased bases in dimension 6. / Jaming, Philippe; Matolcsi, Máté; Móra, Péter.

In: Cryptography and Communications, Vol. 2, No. 2, 09.2010, p. 211-220.

Research output: Contribution to journalArticle

Jaming, Philippe ; Matolcsi, Máté ; Móra, Péter. / The problem of mutually unbiased bases in dimension 6. In: Cryptography and Communications. 2010 ; Vol. 2, No. 2. pp. 211-220.
@article{035059211e8e4b309598212ac8cfce1a,
title = "The problem of mutually unbiased bases in dimension 6",
abstract = "We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definitions to tackle this famous open problem which has been open for the last 10 years. Some preliminary results are also listed.",
keywords = "Complex Hadamard matrices, Mutually unbiased bases",
author = "Philippe Jaming and M{\'a}t{\'e} Matolcsi and P{\'e}ter M{\'o}ra",
year = "2010",
month = "9",
doi = "10.1007/s12095-010-0023-1",
language = "English",
volume = "2",
pages = "211--220",
journal = "Cryptography and Communications",
issn = "1936-2447",
publisher = "Springer Publishing Company",
number = "2",

}

TY - JOUR

T1 - The problem of mutually unbiased bases in dimension 6

AU - Jaming, Philippe

AU - Matolcsi, Máté

AU - Móra, Péter

PY - 2010/9

Y1 - 2010/9

N2 - We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definitions to tackle this famous open problem which has been open for the last 10 years. Some preliminary results are also listed.

AB - We outline a discretization approach to determine the maximal number of mutually unbiased bases in dimension 6. We describe the basic ideas and introduce the most important definitions to tackle this famous open problem which has been open for the last 10 years. Some preliminary results are also listed.

KW - Complex Hadamard matrices

KW - Mutually unbiased bases

UR - http://www.scopus.com/inward/record.url?scp=84859785186&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84859785186&partnerID=8YFLogxK

U2 - 10.1007/s12095-010-0023-1

DO - 10.1007/s12095-010-0023-1

M3 - Article

AN - SCOPUS:84859785186

VL - 2

SP - 211

EP - 220

JO - Cryptography and Communications

JF - Cryptography and Communications

SN - 1936-2447

IS - 2

ER -