{"title":"量子计算","authors":"Jaden Pieper, M. Lladser","doi":"10.4249/scholarpedia.52499","DOIUrl":null,"url":null,"abstract":"• A small set of gates (e.g. AND , OR , NOT ) can be used to compute an arbitrary classical function. We say that such a set of gates is universal for classical computation. • Any unitary operation can be approximated to arbitrary accuracy using Hadamard, phase,CNOT , and π/8 gates. You may wonder why the phase gate appears in this list, since it can be constructed from two π/8 gates; it is included because of its natural role in the fault-tolerant constructions","PeriodicalId":74760,"journal":{"name":"Scholarpedia journal","volume":"13 1","pages":"52499"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Quantum Computation\",\"authors\":\"Jaden Pieper, M. Lladser\",\"doi\":\"10.4249/scholarpedia.52499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"• A small set of gates (e.g. AND , OR , NOT ) can be used to compute an arbitrary classical function. We say that such a set of gates is universal for classical computation. • Any unitary operation can be approximated to arbitrary accuracy using Hadamard, phase,CNOT , and π/8 gates. You may wonder why the phase gate appears in this list, since it can be constructed from two π/8 gates; it is included because of its natural role in the fault-tolerant constructions\",\"PeriodicalId\":74760,\"journal\":{\"name\":\"Scholarpedia journal\",\"volume\":\"13 1\",\"pages\":\"52499\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Scholarpedia journal\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.4249/scholarpedia.52499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Scholarpedia journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.4249/scholarpedia.52499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
• A small set of gates (e.g. AND , OR , NOT ) can be used to compute an arbitrary classical function. We say that such a set of gates is universal for classical computation. • Any unitary operation can be approximated to arbitrary accuracy using Hadamard, phase,CNOT , and π/8 gates. You may wonder why the phase gate appears in this list, since it can be constructed from two π/8 gates; it is included because of its natural role in the fault-tolerant constructions
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
