{"title":"量子态可分性测试中的一些特殊情况","authors":"Paweł Ryszawa","doi":"10.5604/01.3001.0013.1462","DOIUrl":null,"url":null,"abstract":"This paper shows a simple computational scheme for determining whether a particular quantum state in a specific form is separable across two given sets of qubits. That is, given a set of qubits partitioned into two, it answers the question: does the original state have a separable form as a tensor product of some two other states, which are set up of the two given subsets of qubits?","PeriodicalId":240434,"journal":{"name":"Computer Science and Mathematical Modelling","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On some specific cases of quantum state in testing its separability\",\"authors\":\"Paweł Ryszawa\",\"doi\":\"10.5604/01.3001.0013.1462\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper shows a simple computational scheme for determining whether a particular quantum state in a specific form is separable across two given sets of qubits. That is, given a set of qubits partitioned into two, it answers the question: does the original state have a separable form as a tensor product of some two other states, which are set up of the two given subsets of qubits?\",\"PeriodicalId\":240434,\"journal\":{\"name\":\"Computer Science and Mathematical Modelling\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-03-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Science and Mathematical Modelling\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.5604/01.3001.0013.1462\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Science and Mathematical Modelling","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5604/01.3001.0013.1462","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On some specific cases of quantum state in testing its separability
This paper shows a simple computational scheme for determining whether a particular quantum state in a specific form is separable across two given sets of qubits. That is, given a set of qubits partitioned into two, it answers the question: does the original state have a separable form as a tensor product of some two other states, which are set up of the two given subsets of qubits?
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
