학술
기타
Constraints on recovering quantum information after erasure
arXiv Math
CC BY
이 매체는 공공·자유 라이선스로 본문을 직접 표시합니다.Abstract
Suppose that we encode quantum information into $ n $ physical carriers.
With what probabilities can we perfectly recover the quantum information after sets of carriers have been erased?
This question arises in the study of quantum erasure channels, for which M.B.
Hastings conjectured that if each carrier is independently erased with probability $ t \geq 1/2 $, then it is impossible to recover the quantum information with asymptotically vanishing error and probability $ > 1-t $.
We prove this conjecture by establishing new no-cloning constraints on realizable recovery probabilities.
이 뉴스, 어떠셨어요?
탭 한 번으로 반응 · 로그인 불필요
관련 뉴스
관련 뉴스 제보는 로그인 후 가능합니다.
'research' 카테고리 뉴스
arXiv의 다른 기사
Deterministic Replay for AI Agent Systems
arXiv CS.AI
Generative Ontology Induction: Domain-Agnostic Schema Discovery from Document Corpora Using Large Language Models
arXiv CS.AI
Democratizing AI with Small Language Models: Structured Benchmarking and Parameter-Efficient Fine-Tuning for Local Deployment
arXiv CS.AI