Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2407.11607 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866908376522293248 |
|---|---|
| author | Bansal, Nikhil Mok, Wai-Keong Bharti, Kishor Koh, Dax Enshan Haug, Tobias |
| author_facet | Bansal, Nikhil Mok, Wai-Keong Bharti, Kishor Koh, Dax Enshan Haug, Tobias |
| contents | Pseudorandom states (PRSs) are state ensembles that cannot be efficiently distinguished from Haar random states. However, the definition of PRSs has been limited to pure states and lacks robustness against noise. Here, we introduce pseudorandom density matrices (PRDMs), ensembles of $n$-qubit states that are computationally indistinguishable from the generalized Hilbert-Schmidt ensemble (GHSE), which is constructed from $(n+m)$-qubit Haar random states with $m$ qubits traced out. For $m=0$, PRDMs are equivalent to PRSs, whereas for $m=ω(\log n)$, PRDMs are computationally indistinguishable from the maximally mixed state. PRDMs with $m=ω(\log n)$ are robust to unital noise channels and separated in terms of security from PRS. PRDMs disguise valuable quantum resources, possessing near-maximal entanglement, magic and coherence, while being computationally indistinguishable from resource-free states. PRDMs exhibit a pseudoresource gap of $Θ(n)$ vs $0$, surpassing previously found gaps. We also render EFI pairs, a fundamental cryptographic primitive, robust to strong mixed unitary noise. Our work has major implications on quantum resource theory: We show that entanglement, magic and coherence cannot be efficiently tested, and that black-box resource distillation requires a superpolynomial number of copies. We also establish lower bounds on the purity needed for efficient testing and black-box distillation. Finally, we introduce memoryless PRSs, a noise-robust notion of PRS which are indistinguishable to Haar random states for efficient algorithms without quantum memory, as well as noise-robust quantum money. Our work provides a comprehensive framework of pseudorandomness for mixed states, which yields powerful quantum cryptographic primitives and fundamental bounds on quantum resource theories. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2407_11607 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Pseudorandom density matrices Bansal, Nikhil Mok, Wai-Keong Bharti, Kishor Koh, Dax Enshan Haug, Tobias Quantum Physics Computational Complexity Cryptography and Security Pseudorandom states (PRSs) are state ensembles that cannot be efficiently distinguished from Haar random states. However, the definition of PRSs has been limited to pure states and lacks robustness against noise. Here, we introduce pseudorandom density matrices (PRDMs), ensembles of $n$-qubit states that are computationally indistinguishable from the generalized Hilbert-Schmidt ensemble (GHSE), which is constructed from $(n+m)$-qubit Haar random states with $m$ qubits traced out. For $m=0$, PRDMs are equivalent to PRSs, whereas for $m=ω(\log n)$, PRDMs are computationally indistinguishable from the maximally mixed state. PRDMs with $m=ω(\log n)$ are robust to unital noise channels and separated in terms of security from PRS. PRDMs disguise valuable quantum resources, possessing near-maximal entanglement, magic and coherence, while being computationally indistinguishable from resource-free states. PRDMs exhibit a pseudoresource gap of $Θ(n)$ vs $0$, surpassing previously found gaps. We also render EFI pairs, a fundamental cryptographic primitive, robust to strong mixed unitary noise. Our work has major implications on quantum resource theory: We show that entanglement, magic and coherence cannot be efficiently tested, and that black-box resource distillation requires a superpolynomial number of copies. We also establish lower bounds on the purity needed for efficient testing and black-box distillation. Finally, we introduce memoryless PRSs, a noise-robust notion of PRS which are indistinguishable to Haar random states for efficient algorithms without quantum memory, as well as noise-robust quantum money. Our work provides a comprehensive framework of pseudorandomness for mixed states, which yields powerful quantum cryptographic primitives and fundamental bounds on quantum resource theories. |
| title | Pseudorandom density matrices |
| topic | Quantum Physics Computational Complexity Cryptography and Security |
| url | https://arxiv.org/abs/2407.11607 |