2016/03/22 by Kaifeng Bu, Bu, Kaifeng, Uttam Singh +5 · 1 citation
Computer Science · Physics and Astronomy · #FOS: Physical sciences #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph) #quant-ph
paper · pdf · doi:10.48550/arxiv.1603.06715
10 pages, 1 figure, RevTeX 4-1, minor revisions are included and a new author is added!
openalex publication_date 2016/03/22 · arxiv created 2016/04/20 · arxiv updated 2016/04/21 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
It is well known that random bipartite pure states are typically maximally entangled within an arbitrarily small error. Showing that the marginals of random bipartite pure states are typically extremely close to the maximally mixed state, is a way to prove the above. However, a more direct way to prove the above is to estimate the distance of random bipartite pure states from the set of maximally entangled states. Here, we find the average distance between a random bipartite pure state and the set of maximally entanglement states as quantified by three different quantifiers of the distance and investigate the typical properties of the same. We then consider random pure states of a single quantum system and give an account of the typicality of the average l1 norm of coherence for these states scaled by the maximum value of the l1 norm of coherence. We also calculate the variance of the l1 norm of coherence of random pure states to elaborate more on the typical nature of the scaled average l1 norm of coherence. Moreover, We compute the distance of a random pure state from the set of maximally coherent states and obtain the average distance.