CARVIEW |
Stack Exchange Network
Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Visit Stack ExchangeTeams
Q&A for work
Connect and share knowledge within a single location that is structured and easy to search.
Learn more about TeamsWelcome to Quantum Computing Stack Exchange

Quantum Computing Stack Exchange is a question and answer site for scientists, engineers, mathematicians, programmers and computing professionals interested in quantum computing and quantum information. It's built and run by you as part of the Stack Exchange network of Q&A sites. With your help, we're working together to build a library of detailed answers to every question about quantum computing and quantum information.
We're a little bit different from other sites. Here's how:
Ask questions, get answers, no distractions
This site is all about getting answers. It's not a discussion forum. There's no chit-chat.
Just questions...
...and answers.
Good answers are voted up and rise to the top.
The best answers show up first so that they are always easy to find.
The person who asked can mark one answer as "accepted".
Accepting doesn't mean it's the best answer, it just means that it worked for the person who asked.
How to prove that ${\rm tr}(A|\psi\rangle\langle\psi|)=\langle\psi| A|\psi\rangle$?
How can one prove that $tr(A\mid\psi\rangle\langle\psi\mid)=\langle\psi\mid A\mid\psi\rangle$? In Nielsen/Chuang they mention this is due to Gram-Schmidt decomposition but I can’t understand how.
10155 bronze badges
2 Answers
You can use the cyclic property of the trace, ${\rm Tr}(XY) = {\rm Tr}(YX)$.
Another way is to note that both sides are linear over $A$. Thus it's enough to prove it for $A = E_{ij} = |i\rangle\langle j|$.

8,1311313 silver badges2525 bronze badges
You can proceed in the following way: $\text{Tr}(A|\psi\rangle\langle\psi|) = \sum_i \langle i|A|\psi\rangle\langle\psi|i\rangle = \sum_i \langle\psi|i\rangle\langle i|a|\psi\rangle = \langle \psi|(\sum_i |i\rangle\langle i|)A|\psi\rangle = \langle\psi|A|\psi\rangle$

1,61488 silver badges1111 bronze badges
Get answers to practical, detailed questions
Focus on questions about an actual problem you have faced. Include details about what you have tried and exactly what you are trying to do.
Ask about...
- Specific issues with quantum computing or quantum information
- Real problems or questions that you’ve encountered
Not all questions work well in our format. Avoid questions that are primarily opinion-based, or that are likely to generate discussion rather than answers.
Questions that need improvement may be closed until someone fixes them.
Don't ask about...
- Anything not directly related to quantum computing or quantum information
- Questions that are primarily opinion-based
- Questions with too many possible answers or that would require an extremely long answer
Tags make it easy to find interesting questions
All questions are tagged with their subject areas. Each can have up to 5 tags, since a question might be related to several subjects.
Click any tag to see a list of questions with that tag, or go to the tag list to browse for topics that interest you.
How to prove that ${\rm tr}(A|\psi\rangle\langle\psi|)=\langle\psi| A|\psi\rangle$?
How can one prove that $tr(A\mid\psi\rangle\langle\psi\mid)=\langle\psi\mid A\mid\psi\rangle$? In Nielsen/Chuang they mention this is due to Gram-Schmidt decomposition but I can’t understand how.
10155 bronze badges
You earn reputation when people vote on your posts
Your reputation score goes up when others vote up your questions, answers and edits.
United States
245 3 22 74
As you earn reputation, you'll unlock new privileges like the ability to vote, comment, and even edit other people's posts.
Reputation | Privilege |
---|---|
15 | Vote up |
50 | Leave comments |
125 | Vote down (costs 1 rep on answers) |
At the highest levels, you'll have access to special moderation tools. You'll be able to work alongside our community moderators to keep the site focused and helpful.
Reputation | Privilege |
---|---|
500 | Vote to close, reopen, or migrate questions |
1000 | Edit other people's posts |
2000 | Access to moderation tools |
Improve posts by editing or commenting
Our goal is to have the best answers to every question, so if you see questions or answers that can be improved, you can edit them.
Use edits to fix mistakes, improve formatting, or clarify the meaning of a post.
Use comments to ask for more information or clarify a question or answer.
You can always comment on your own questions and answers. Once you earn 50 reputation, you can comment on anybody's post.
Remember: we're all here to learn, so be friendly and helpful!
You can use the cyclic property of the trace, ${\rm Tr}(XY) = {\rm Tr}(YX)$.
Another way is to note that both sides are linear over $A$. Thus it's enough to prove it for $A = E_{ij} = |i\rangle\langle j|$.

8,1311313 silver badges2525 bronze badges
Unlock badges for special achievements
Badges are special achievements you earn for participating on the site. They come in three levels: bronze, silver, and gold.
Student | First question with score of 1 or more |
Editor | First edit |
Good Answer | Answer score of 25 or more |
Civic Duty | Vote 300 or more times |
Famous Question | Question with 10,000 views |
Sign up to get started
Signing up allows you to:
- Earn reputation when you help others with questions, answers and edits.
- Select favorite tags to customize your home page.
- Claim your first badge: Informed
Quantum Computing Stack Exchange is part of the Stack Exchange network
Like this site? Stack Exchange is a network of 182 Q&A sites just like it. Check out the full list of sites.