D. Bera, Stephen A. Fenner, F. Green, Steven Homer
{"title":"Efficient universal quantum circuits","authors":"D. Bera, Stephen A. Fenner, F. Green, Steven Homer","doi":"10.26421/QIC10.1-2-2","DOIUrl":null,"url":null,"abstract":"Universal circuits can be viewed as general-purpose simulators for central classes ofcircuits and can be used to capture the computational power of the circuit class beingsimulated. We define and construct quantum universal circuits which are efficient andhave very little overhead in simulation. For depth we construct universal circuits whosedepth is the same order as the circuits being simulated. For size, there is a log factorblow-up in the universal circuits constructed here which is nearly optimal.","PeriodicalId":54524,"journal":{"name":"Quantum Information & Computation","volume":"115 1","pages":"418-428"},"PeriodicalIF":0.7000,"publicationDate":"2009-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Quantum Information & Computation","FirstCategoryId":"101","ListUrlMain":"https://doi.org/10.26421/QIC10.1-2-2","RegionNum":4,"RegionCategory":"物理与天体物理","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 16
Abstract
Universal circuits can be viewed as general-purpose simulators for central classes ofcircuits and can be used to capture the computational power of the circuit class beingsimulated. We define and construct quantum universal circuits which are efficient andhave very little overhead in simulation. For depth we construct universal circuits whosedepth is the same order as the circuits being simulated. For size, there is a log factorblow-up in the universal circuits constructed here which is nearly optimal.
期刊介绍:
Quantum Information & Computation provides a forum for distribution of information in all areas of quantum information processing. Original articles, survey articles, reviews, tutorials, perspectives, and correspondences are all welcome. Computer science, physics and mathematics are covered. Both theory and experiments are included. Illustrative subjects include quantum algorithms, quantum information theory, quantum complexity theory, quantum cryptology, quantum communication and measurements, proposals and experiments on the implementation of quantum computation, communications, and entanglement in all areas of science including ion traps, cavity QED, photons, nuclear magnetic resonance, and solid-state proposals.