{"title":"经典和量子分支程序的计算能力","authors":"F. Ablayev","doi":"10.1117/12.683111","DOIUrl":null,"url":null,"abstract":"We present a classical stochastic simulation technique of quantum Branching programs. This technique allows to prove the following relations among complexity classes: PrQP-BP &subuline; PP-BP and BQP-BP &subuline; PP-BP. Here BPP-BP and PP-BP stands for the classes of functions computable with bounded error and unbounded error respectively by stochastic branching program of polynomial size. BQP-BP and PrQP-BP stands the classes of functions computable with bounded error and unbounded error respectively by quantum branching program of polynomial size. Second. We present two different types, of complexity lower bounds for quantum nonuniform automata (OBDDs). We call them \"metric\" and \"entropic\" lower bounds in according to proof technique used. We present explicit Boolean functions that show that these lower bounds are tight enough. We show that when considering \"almost all Boolean functions\" on n variables our entropic lower bounds gives exponential (2c(δ)(n-log n)) lower bound for the width of quantum OBDDs depending on the error δ allowed.","PeriodicalId":90714,"journal":{"name":"Quantum bio-informatics V : proceedings of the quantum bio-informatics 2011, Tokyo University of Science, Japan, 7-12 March 2011. Quantum Bio-Informatics (Conference) (5th : 2011 : Tokyo, Japan)","volume":"38 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2006-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"On computational power of classical and quantum branching programs\",\"authors\":\"F. Ablayev\",\"doi\":\"10.1117/12.683111\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a classical stochastic simulation technique of quantum Branching programs. This technique allows to prove the following relations among complexity classes: PrQP-BP &subuline; PP-BP and BQP-BP &subuline; PP-BP. Here BPP-BP and PP-BP stands for the classes of functions computable with bounded error and unbounded error respectively by stochastic branching program of polynomial size. BQP-BP and PrQP-BP stands the classes of functions computable with bounded error and unbounded error respectively by quantum branching program of polynomial size. Second. We present two different types, of complexity lower bounds for quantum nonuniform automata (OBDDs). We call them \\\"metric\\\" and \\\"entropic\\\" lower bounds in according to proof technique used. We present explicit Boolean functions that show that these lower bounds are tight enough. We show that when considering \\\"almost all Boolean functions\\\" on n variables our entropic lower bounds gives exponential (2c(δ)(n-log n)) lower bound for the width of quantum OBDDs depending on the error δ allowed.\",\"PeriodicalId\":90714,\"journal\":{\"name\":\"Quantum bio-informatics V : proceedings of the quantum bio-informatics 2011, Tokyo University of Science, Japan, 7-12 March 2011. Quantum Bio-Informatics (Conference) (5th : 2011 : Tokyo, Japan)\",\"volume\":\"38 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-05-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Quantum bio-informatics V : proceedings of the quantum bio-informatics 2011, Tokyo University of Science, Japan, 7-12 March 2011. Quantum Bio-Informatics (Conference) (5th : 2011 : Tokyo, Japan)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.683111\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum bio-informatics V : proceedings of the quantum bio-informatics 2011, Tokyo University of Science, Japan, 7-12 March 2011. Quantum Bio-Informatics (Conference) (5th : 2011 : Tokyo, Japan)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.683111","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
On computational power of classical and quantum branching programs
We present a classical stochastic simulation technique of quantum Branching programs. This technique allows to prove the following relations among complexity classes: PrQP-BP &subuline; PP-BP and BQP-BP &subuline; PP-BP. Here BPP-BP and PP-BP stands for the classes of functions computable with bounded error and unbounded error respectively by stochastic branching program of polynomial size. BQP-BP and PrQP-BP stands the classes of functions computable with bounded error and unbounded error respectively by quantum branching program of polynomial size. Second. We present two different types, of complexity lower bounds for quantum nonuniform automata (OBDDs). We call them "metric" and "entropic" lower bounds in according to proof technique used. We present explicit Boolean functions that show that these lower bounds are tight enough. We show that when considering "almost all Boolean functions" on n variables our entropic lower bounds gives exponential (2c(δ)(n-log n)) lower bound for the width of quantum OBDDs depending on the error δ allowed.