Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 63 tok/s
Gemini 2.5 Pro 49 tok/s Pro
GPT-5 Medium 14 tok/s Pro
GPT-5 High 19 tok/s Pro
GPT-4o 100 tok/s Pro
Kimi K2 174 tok/s Pro
GPT OSS 120B 472 tok/s Pro
Claude Sonnet 4 37 tok/s Pro
2000 character limit reached

Mutually unbiased frames (2110.08293v2)

Published 15 Oct 2021 in quant-ph, math-ph, and math.MP

Abstract: In this work, 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. After introducing the tool, its power is shown by finding the following results about the last mentioned class of constellations: (i) real fiducial states do not exist in any even dimension, and (ii) unknown $d$-dimensional fiducial states are parameterized, a priori, with roughly $3d/2$ real variables only, without loss of generality. Furthermore, multi-parametric families of pure quantum states having minimum uncertainty with regard to several choices of $d+1$ orthonormal bases are shown, in every dimension $d$. These last families contain all existing fiducial states in every finite dimension, and the bases include maximal sets of $d+1$ mutually unbiased bases, when $d$ is a prime number.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

We haven't generated follow-up questions for this paper yet.