Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

CCDS
2010

favoriteEmaildiscussreport

122views more CCDS 2010»

The problem of mutually unbiased bases in dimension 6

13 years 1 months ago

The problem of mutually unbiased bases in dimension 6

Download www.math.bme.hu

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. Dedicated to Prof. Warwick de Launey on the occasion of his 50th birthday Keywords and phrases. Mutually unbiased bases, complex Hadamard matrices

Philippe Jaming, Máté Matolcsi, P&ea

Real-time Traffic

CCDS 2010 | Complex Hadamard Matrices | Computational Geometry | Famous Open Problem | Mutually Unbiased Bases |

claim paper

Related Content

» On the equivalence between real mutually unbiased bases and a certain class of association...

» State Discrimination With PostMeasurement Information

» Algebraic Cactions and the inverse kinematics of a general 6R manipulator

» Workspace Analysis of a 6DOF Cable Robot for HardwareintheLoop Dynamic Simulation

» Truly distributionindependent algorithms for the Nbody problem

» Hierarchical Extraction of Independent Subspaces of Unknown Dimensions

» A Scalable Solution to the MultiResource QoS Problem

» Pattern transformation for twodimensional separation of concerns

» Supervised dimensionality reduction using mixture models

Post Info
More Details (n/a)

Added	28 Feb 2011
Updated	28 Feb 2011
Type	Journal
Year	2010
Where	CCDS
Authors	Philippe Jaming, Máté Matolcsi, Péter Móra

Comments (0)