{"title":"提取量子纠缠(一般纠缠净化协议)","authors":"A. Ambainis, Adam D. Smith, Ke Yang","doi":"10.1109/CCC.2002.1004345","DOIUrl":null,"url":null,"abstract":"We study the problem of extracting Einstein-Podolsky-Rosen (EPR) pairs from a general source of entanglement. Suppose Alice and Bob share a bipartite state /spl rho/ which is \"reasonably close\" to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of /spl rho/ and a maximally entangled state. They wish to \"purify\" /spl rho/ using local operations and classical communication, and output a state that is arbitrarily close to EPR pairs. We prove that, on average, Alice and Bob cannot increase the fidelity of the input state significantly. On the other hand, there exist protocols that may fail with a small probability, and otherwise will output states arbitrarily close to EPR pairs with very high probability. These protocols come from the \"purity-testing protocols\" of H. Barnum et al. (2001).","PeriodicalId":193513,"journal":{"name":"Proceedings 17th IEEE Annual Conference on Computational Complexity","volume":"101 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2001-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"15","resultStr":"{\"title\":\"Extracting quantum entanglement (general entanglement purification protocols)\",\"authors\":\"A. Ambainis, Adam D. Smith, Ke Yang\",\"doi\":\"10.1109/CCC.2002.1004345\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We study the problem of extracting Einstein-Podolsky-Rosen (EPR) pairs from a general source of entanglement. Suppose Alice and Bob share a bipartite state /spl rho/ which is \\\"reasonably close\\\" to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of /spl rho/ and a maximally entangled state. They wish to \\\"purify\\\" /spl rho/ using local operations and classical communication, and output a state that is arbitrarily close to EPR pairs. We prove that, on average, Alice and Bob cannot increase the fidelity of the input state significantly. On the other hand, there exist protocols that may fail with a small probability, and otherwise will output states arbitrarily close to EPR pairs with very high probability. These protocols come from the \\\"purity-testing protocols\\\" of H. Barnum et al. (2001).\",\"PeriodicalId\":193513,\"journal\":{\"name\":\"Proceedings 17th IEEE Annual Conference on Computational Complexity\",\"volume\":\"101 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2001-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"15\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings 17th IEEE Annual Conference on Computational Complexity\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCC.2002.1004345\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings 17th IEEE Annual Conference on Computational Complexity","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCC.2002.1004345","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We study the problem of extracting Einstein-Podolsky-Rosen (EPR) pairs from a general source of entanglement. Suppose Alice and Bob share a bipartite state /spl rho/ which is "reasonably close" to perfect EPR pairs. The only information Alice and Bob possess is a lower bound on the fidelity of /spl rho/ and a maximally entangled state. They wish to "purify" /spl rho/ using local operations and classical communication, and output a state that is arbitrarily close to EPR pairs. We prove that, on average, Alice and Bob cannot increase the fidelity of the input state significantly. On the other hand, there exist protocols that may fail with a small probability, and otherwise will output states arbitrarily close to EPR pairs with very high probability. These protocols come from the "purity-testing protocols" of H. Barnum et al. (2001).