Approximate k-uniform states: definition, construction and applications
Kaiyi Guo, Fei Shi, You Zhou, Qi Zhao

TL;DR
This paper introduces the concept of approximate $k$-uniform states, demonstrating their construction via random methods, and explores their applications in quantum error correction and information masking, bridging theory and practical quantum computing.
Contribution
It pioneers the study of approximate $k$-uniform states, providing probabilistic constructions, analyzing their properties, and connecting them to quantum error-correcting codes and information masking.
Findings
Approximate $k$-uniform states are locally indistinguishable from exact states.
High-probability constructions from Haar-random ensembles and shallow circuits.
Haar random states enable high-performance quantum error-correcting codes.
Abstract
-Uniform states are fundamental to quantum information and computing, with applications in multipartite entanglement and quantum error-correcting codes (QECCs). Prior work has primarily focused on constructing exact -uniform states or proving their nonexistence. However, due to inevitable theoretical approximations and experimental imperfections, generating exact -uniform states is neither feasible nor necessary in practice. In this work, we initiate the study of approximate -uniform states, demonstrating that they are locally indistinguishable from their exact counterparts unless massive measurements are performed. We prove that such states can be constructed with high probability from the Haar-random ensemble and, more efficiently, via shallow random quantum circuits. Furthermore, we establish a connection between approximate -uniform states and approximate QECCs,…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Complexity and Algorithms in Graphs · Quantum Information and Cryptography
