Is there always a complete, orthogonal set of unitary matrices? The Next CEO of Stack OverflowWhen can a partial isometry $u$ in $mathcal B(H otimes K)$ be extended to a unitary in $1 otimes mathcal B(K)$?Cauchy-like inequality for Kronecker (tensor) productRecovering a linear map from a non-linear approximationHow to use Galerkin method to obtain existence with spaces $V subset H$ not compactly embeddedA linear combination problemAre Hilbert-Schmidt operators on separable Hilbert spaces “Hilbert Schmidt” on the space of Hilbert Schmidt Operators?Orthogonality of positive (semi-)definite matricesConditions on a $ntimes n$ Hermitian matrix such that its extremal eigenvectors have equal magnitude entriesIs the linear span of special orthogonal matrices equal to the whole space of $Ntimes N$ matrices?Existence of orthogonal basis of symmetric $ntimes n$ matrices, where each matrix is unitary?
Is there always a complete, orthogonal set of unitary matrices?
The Next CEO of Stack OverflowWhen can a partial isometry $u$ in $mathcal B(H otimes K)$ be extended to a unitary in $1 otimes mathcal B(K)$?Cauchy-like inequality for Kronecker (tensor) productRecovering a linear map from a non-linear approximationHow to use Galerkin method to obtain existence with spaces $V subset H$ not compactly embeddedA linear combination problemAre Hilbert-Schmidt operators on separable Hilbert spaces “Hilbert Schmidt” on the space of Hilbert Schmidt Operators?Orthogonality of positive (semi-)definite matricesConditions on a $ntimes n$ Hermitian matrix such that its extremal eigenvectors have equal magnitude entriesIs the linear span of special orthogonal matrices equal to the whole space of $Ntimes N$ matrices?Existence of orthogonal basis of symmetric $ntimes n$ matrices, where each matrix is unitary?
$begingroup$
The set of size-$n$ unitary matrices span $Bbb C^n times n$ (this can be proven nicely using polar decomposition). If we select a maximal linear subset of unitary matrices, then we have a basis of $Bbb C^n times n$ consisting of $n^2$ unitary matrices. My question is whether we can find a basis that satisfies the additional constraint of orthogonality. That is:
Does there exist a basis $mathcal B$ of $Bbb C^n times n$ such that every $P in mathcal B$ is unitary (that is, $P^*P = I$) and for all distinct $P,Q in mathcal B$, we have $langle P,Q rangle = 0$?
Here, $langle cdot , cdot rangle$ refers to the Frobenius (AKA Hilbert-Schmidt) inner product, namely $langle P, Q rangle = operatornametrace(PQ^*)$.
When $n = 2$, the Pauli matrices provide a convenient solution. That is, we can take
$$
mathcal B = I,sigma_1,sigma_2,sigma_3 subset Bbb C^2 times 2.
$$
We can use this to produce a solution whenever $n = 2^k$. In particular, if we define $sigma_0 = I$ for convenience, we can take
$$
mathcal B = sigma_m_1 otimes cdots otimes sigma_m_k : 0 leq m_j leq 3 subset Bbb C^2^k times 2^k.
$$
Could we come up with a basis for any other $n$? Could we do so for every $n$?
Some observations so far:
- Without loss of generality, we can assume that $mathcal B$ contains the $n times n$ identity matrix $I$. If $I$ is an element of the basis, it follows that the remaining matrices form a basis for the subspace of all trace-$0$ matrices.
- A commuting set of matrices spans at most an $n$-dimensional subset, so there must be elements of $mathcal B$ that fail to commute
fa.functional-analysis linear-algebra matrices
$endgroup$
add a comment |
$begingroup$
The set of size-$n$ unitary matrices span $Bbb C^n times n$ (this can be proven nicely using polar decomposition). If we select a maximal linear subset of unitary matrices, then we have a basis of $Bbb C^n times n$ consisting of $n^2$ unitary matrices. My question is whether we can find a basis that satisfies the additional constraint of orthogonality. That is:
Does there exist a basis $mathcal B$ of $Bbb C^n times n$ such that every $P in mathcal B$ is unitary (that is, $P^*P = I$) and for all distinct $P,Q in mathcal B$, we have $langle P,Q rangle = 0$?
Here, $langle cdot , cdot rangle$ refers to the Frobenius (AKA Hilbert-Schmidt) inner product, namely $langle P, Q rangle = operatornametrace(PQ^*)$.
When $n = 2$, the Pauli matrices provide a convenient solution. That is, we can take
$$
mathcal B = I,sigma_1,sigma_2,sigma_3 subset Bbb C^2 times 2.
$$
We can use this to produce a solution whenever $n = 2^k$. In particular, if we define $sigma_0 = I$ for convenience, we can take
$$
mathcal B = sigma_m_1 otimes cdots otimes sigma_m_k : 0 leq m_j leq 3 subset Bbb C^2^k times 2^k.
$$
Could we come up with a basis for any other $n$? Could we do so for every $n$?
Some observations so far:
- Without loss of generality, we can assume that $mathcal B$ contains the $n times n$ identity matrix $I$. If $I$ is an element of the basis, it follows that the remaining matrices form a basis for the subspace of all trace-$0$ matrices.
- A commuting set of matrices spans at most an $n$-dimensional subset, so there must be elements of $mathcal B$ that fail to commute
fa.functional-analysis linear-algebra matrices
$endgroup$
$begingroup$
For what it's worth, I thought of this question while trying to answer this post on MSE
$endgroup$
– Omnomnomnom
10 hours ago
$begingroup$
This may be useful: reed.edu/physics/faculty/wheeler/documents/Miscellaneous%20Math/…
$endgroup$
– Michael Biro
10 hours ago
$begingroup$
google on "unitary error basis"
$endgroup$
– Chris Godsil
10 hours ago
$begingroup$
@ChrisGodsil Excellent, thanks for the tip!
$endgroup$
– Omnomnomnom
8 hours ago
add a comment |
$begingroup$
The set of size-$n$ unitary matrices span $Bbb C^n times n$ (this can be proven nicely using polar decomposition). If we select a maximal linear subset of unitary matrices, then we have a basis of $Bbb C^n times n$ consisting of $n^2$ unitary matrices. My question is whether we can find a basis that satisfies the additional constraint of orthogonality. That is:
Does there exist a basis $mathcal B$ of $Bbb C^n times n$ such that every $P in mathcal B$ is unitary (that is, $P^*P = I$) and for all distinct $P,Q in mathcal B$, we have $langle P,Q rangle = 0$?
Here, $langle cdot , cdot rangle$ refers to the Frobenius (AKA Hilbert-Schmidt) inner product, namely $langle P, Q rangle = operatornametrace(PQ^*)$.
When $n = 2$, the Pauli matrices provide a convenient solution. That is, we can take
$$
mathcal B = I,sigma_1,sigma_2,sigma_3 subset Bbb C^2 times 2.
$$
We can use this to produce a solution whenever $n = 2^k$. In particular, if we define $sigma_0 = I$ for convenience, we can take
$$
mathcal B = sigma_m_1 otimes cdots otimes sigma_m_k : 0 leq m_j leq 3 subset Bbb C^2^k times 2^k.
$$
Could we come up with a basis for any other $n$? Could we do so for every $n$?
Some observations so far:
- Without loss of generality, we can assume that $mathcal B$ contains the $n times n$ identity matrix $I$. If $I$ is an element of the basis, it follows that the remaining matrices form a basis for the subspace of all trace-$0$ matrices.
- A commuting set of matrices spans at most an $n$-dimensional subset, so there must be elements of $mathcal B$ that fail to commute
fa.functional-analysis linear-algebra matrices
$endgroup$
The set of size-$n$ unitary matrices span $Bbb C^n times n$ (this can be proven nicely using polar decomposition). If we select a maximal linear subset of unitary matrices, then we have a basis of $Bbb C^n times n$ consisting of $n^2$ unitary matrices. My question is whether we can find a basis that satisfies the additional constraint of orthogonality. That is:
Does there exist a basis $mathcal B$ of $Bbb C^n times n$ such that every $P in mathcal B$ is unitary (that is, $P^*P = I$) and for all distinct $P,Q in mathcal B$, we have $langle P,Q rangle = 0$?
Here, $langle cdot , cdot rangle$ refers to the Frobenius (AKA Hilbert-Schmidt) inner product, namely $langle P, Q rangle = operatornametrace(PQ^*)$.
When $n = 2$, the Pauli matrices provide a convenient solution. That is, we can take
$$
mathcal B = I,sigma_1,sigma_2,sigma_3 subset Bbb C^2 times 2.
$$
We can use this to produce a solution whenever $n = 2^k$. In particular, if we define $sigma_0 = I$ for convenience, we can take
$$
mathcal B = sigma_m_1 otimes cdots otimes sigma_m_k : 0 leq m_j leq 3 subset Bbb C^2^k times 2^k.
$$
Could we come up with a basis for any other $n$? Could we do so for every $n$?
Some observations so far:
- Without loss of generality, we can assume that $mathcal B$ contains the $n times n$ identity matrix $I$. If $I$ is an element of the basis, it follows that the remaining matrices form a basis for the subspace of all trace-$0$ matrices.
- A commuting set of matrices spans at most an $n$-dimensional subset, so there must be elements of $mathcal B$ that fail to commute
fa.functional-analysis linear-algebra matrices
fa.functional-analysis linear-algebra matrices
asked 10 hours ago
OmnomnomnomOmnomnomnom
1406
1406
$begingroup$
For what it's worth, I thought of this question while trying to answer this post on MSE
$endgroup$
– Omnomnomnom
10 hours ago
$begingroup$
This may be useful: reed.edu/physics/faculty/wheeler/documents/Miscellaneous%20Math/…
$endgroup$
– Michael Biro
10 hours ago
$begingroup$
google on "unitary error basis"
$endgroup$
– Chris Godsil
10 hours ago
$begingroup$
@ChrisGodsil Excellent, thanks for the tip!
$endgroup$
– Omnomnomnom
8 hours ago
add a comment |
$begingroup$
For what it's worth, I thought of this question while trying to answer this post on MSE
$endgroup$
– Omnomnomnom
10 hours ago
$begingroup$
This may be useful: reed.edu/physics/faculty/wheeler/documents/Miscellaneous%20Math/…
$endgroup$
– Michael Biro
10 hours ago
$begingroup$
google on "unitary error basis"
$endgroup$
– Chris Godsil
10 hours ago
$begingroup$
@ChrisGodsil Excellent, thanks for the tip!
$endgroup$
– Omnomnomnom
8 hours ago
$begingroup$
For what it's worth, I thought of this question while trying to answer this post on MSE
$endgroup$
– Omnomnomnom
10 hours ago
$begingroup$
For what it's worth, I thought of this question while trying to answer this post on MSE
$endgroup$
– Omnomnomnom
10 hours ago
$begingroup$
This may be useful: reed.edu/physics/faculty/wheeler/documents/Miscellaneous%20Math/…
$endgroup$
– Michael Biro
10 hours ago
$begingroup$
This may be useful: reed.edu/physics/faculty/wheeler/documents/Miscellaneous%20Math/…
$endgroup$
– Michael Biro
10 hours ago
$begingroup$
google on "unitary error basis"
$endgroup$
– Chris Godsil
10 hours ago
$begingroup$
google on "unitary error basis"
$endgroup$
– Chris Godsil
10 hours ago
$begingroup$
@ChrisGodsil Excellent, thanks for the tip!
$endgroup$
– Omnomnomnom
8 hours ago
$begingroup$
@ChrisGodsil Excellent, thanks for the tip!
$endgroup$
– Omnomnomnom
8 hours ago
add a comment |
1 Answer
1
active
oldest
votes
$begingroup$
Yes, consider the group of $n^2$ matrices generated by the shift $e_i mapsto e_i+1$ and the diagonal matrix with entries $(1,omega,omega^2,cdots,omega^n-1)$ where $omega$ is a primitive $n$th root of unit.
$endgroup$
$begingroup$
Very elegant! Thank you
$endgroup$
– Omnomnomnom
8 hours ago
add a comment |
Your Answer
StackExchange.ifUsing("editor", function ()
return StackExchange.using("mathjaxEditing", function ()
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix)
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
);
);
, "mathjax-editing");
StackExchange.ready(function()
var channelOptions =
tags: "".split(" "),
id: "504"
;
initTagRenderer("".split(" "), "".split(" "), channelOptions);
StackExchange.using("externalEditor", function()
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled)
StackExchange.using("snippets", function()
createEditor();
);
else
createEditor();
);
function createEditor()
StackExchange.prepareEditor(
heartbeatType: 'answer',
autoActivateHeartbeat: false,
convertImagesToLinks: true,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: 10,
bindNavPrevention: true,
postfix: "",
imageUploader:
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
,
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
);
);
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326767%2fis-there-always-a-complete-orthogonal-set-of-unitary-matrices%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
1 Answer
1
active
oldest
votes
1 Answer
1
active
oldest
votes
active
oldest
votes
active
oldest
votes
$begingroup$
Yes, consider the group of $n^2$ matrices generated by the shift $e_i mapsto e_i+1$ and the diagonal matrix with entries $(1,omega,omega^2,cdots,omega^n-1)$ where $omega$ is a primitive $n$th root of unit.
$endgroup$
$begingroup$
Very elegant! Thank you
$endgroup$
– Omnomnomnom
8 hours ago
add a comment |
$begingroup$
Yes, consider the group of $n^2$ matrices generated by the shift $e_i mapsto e_i+1$ and the diagonal matrix with entries $(1,omega,omega^2,cdots,omega^n-1)$ where $omega$ is a primitive $n$th root of unit.
$endgroup$
$begingroup$
Very elegant! Thank you
$endgroup$
– Omnomnomnom
8 hours ago
add a comment |
$begingroup$
Yes, consider the group of $n^2$ matrices generated by the shift $e_i mapsto e_i+1$ and the diagonal matrix with entries $(1,omega,omega^2,cdots,omega^n-1)$ where $omega$ is a primitive $n$th root of unit.
$endgroup$
Yes, consider the group of $n^2$ matrices generated by the shift $e_i mapsto e_i+1$ and the diagonal matrix with entries $(1,omega,omega^2,cdots,omega^n-1)$ where $omega$ is a primitive $n$th root of unit.
answered 10 hours ago
Guillaume AubrunGuillaume Aubrun
1,9971524
1,9971524
$begingroup$
Very elegant! Thank you
$endgroup$
– Omnomnomnom
8 hours ago
add a comment |
$begingroup$
Very elegant! Thank you
$endgroup$
– Omnomnomnom
8 hours ago
$begingroup$
Very elegant! Thank you
$endgroup$
– Omnomnomnom
8 hours ago
$begingroup$
Very elegant! Thank you
$endgroup$
– Omnomnomnom
8 hours ago
add a comment |
Thanks for contributing an answer to MathOverflow!
- Please be sure to answer the question. Provide details and share your research!
But avoid …
- Asking for help, clarification, or responding to other answers.
- Making statements based on opinion; back them up with references or personal experience.
Use MathJax to format equations. MathJax reference.
To learn more, see our tips on writing great answers.
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
StackExchange.ready(
function ()
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmathoverflow.net%2fquestions%2f326767%2fis-there-always-a-complete-orthogonal-set-of-unitary-matrices%23new-answer', 'question_page');
);
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Sign up or log in
StackExchange.ready(function ()
StackExchange.helpers.onClickDraftSave('#login-link');
);
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Sign up using Google
Sign up using Facebook
Sign up using Email and Password
Post as a guest
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
Required, but never shown
$begingroup$
For what it's worth, I thought of this question while trying to answer this post on MSE
$endgroup$
– Omnomnomnom
10 hours ago
$begingroup$
This may be useful: reed.edu/physics/faculty/wheeler/documents/Miscellaneous%20Math/…
$endgroup$
– Michael Biro
10 hours ago
$begingroup$
google on "unitary error basis"
$endgroup$
– Chris Godsil
10 hours ago
$begingroup$
@ChrisGodsil Excellent, thanks for the tip!
$endgroup$
– Omnomnomnom
8 hours ago