Quantum Computing
Josh's user avatar
Josh's user avatar
Josh's user avatar
Josh
  • Member for 1 year, 6 months
  • Last seen this week
Profile Activity
Stats
355
reputation
3k
reached
0
answers
17
questions
Communities
View all
Badges
This user doesn’t have any gold badges yet.
1
silver badge
9
bronze badges
Top tags
View all tags
0
Score
5
Posts
29
Posts %
0
Score
5
Posts
29
Posts %
0
Score
4
Posts
24
Posts %
0
Score
3
Posts
18
Posts %
0
Score
3
Posts
18
Posts %
0
Score
3
Posts
18
Posts %
Top posts
View all questions and answers
All Questions Answers
Score Newest
question
3
Visualize representation of a qubit
Jun 8, 2022
question
3
Why can the max-relative entropy be written as $D_{\max}(\rho \parallel \sigma) = \inf \{ \lambda : \rho \leq 2^\lambda \sigma \}$?
Mar 12
question
3
Why is applying a Hadamard transform useful in the entanglement-based version of BB84
Apr 2
question
3
Is verifying the solution to a QMA-complete problem efficient?
Jun 12
question
2
How Does the Transformation $|x \rangle | 0 \rangle \rightarrow | x \rangle | Hx \rangle $ Avoid Violating the No-Cloning Theorem?
Apr 8
question
2
How should $\rho(b,b')$ be interpreted in the context of classical-quantum state
Aug 23
question
2
Are there computational problems with classical advantage over quantum computing?
Feb 7
question
2
Comparison of Quantum Mutual Information and Coherent Information with Classical Mutual Information
Feb 26
question
1
Prove that the conditional min-entropy is $H_{\rm min}(A|B)=\max_\sigma\sup\{\lambda:\,\rho\le 2^{-\lambda}(I\otimes\sigma)\}$
Mar 12
question
1
What do we mean by family of CSS codes?
Apr 5
Top network posts
View all network posts
14
Intuition behind Group Action
8
Showing that prime factors of a number is congruent to $1 \pmod 5$
5
Is there any unique value for Euler Phi Function $\phi(n)$?
5
Evaluating the infinite series $\sum_{n=0}^{\infty} (1/n!)^m$

Your privacy

By clicking “Accept all cookies”, you agree Stack Exchange can store cookies on your device and disclose information in accordance with our Cookie Policy.