{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,8]],"date-time":"2026-07-08T00:32:16Z","timestamp":1783470736677,"version":"3.55.0"},"reference-count":21,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[2000,8,1]],"date-time":"2000-08-01T00:00:00Z","timestamp":965088000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[2000,8]]},"DOI":"10.1016\/s0020-0190(00)00084-3","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T16:45:05Z","timestamp":1027615505000},"page":"101-107","source":"Crossref","is-referenced-by-count":124,"title":["A new universal and fault-tolerant quantum basis"],"prefix":"10.1016","volume":"75","author":[{"given":"P.Oscar","family":"Boykin","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tal","family":"Mor","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Matthew","family":"Pulver","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vwani","family":"Roychowdhury","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Farrokh","family":"Vatan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(00)00084-3_ID005","doi-asserted-by":"crossref","first-page":"1524","DOI":"10.1137\/S0097539795293639","article-title":"Quantum computability","volume":"Vol. 26","author":"Adleman","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00084-3_ID006","series-title":"Proc. 29th Annual ACM Symposium on Theory of Computing (STOC'97)","first-page":"46","article-title":"Fault-tolerant quantum computation with constant error","author":"Aharonov","year":"1997"},{"key":"10.1016\/S0020-0190(00)00084-3_ID007","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1098\/rspa.1995.0066","article-title":"A universal two-bit gate for quantum computation","volume":"Vol. 449","author":"Barenco","year":"1995","journal-title":"Proc. Roy. Soc. London Ser. A"},{"key":"10.1016\/S0020-0190(00)00084-3_ID008","doi-asserted-by":"crossref","first-page":"3457","DOI":"10.1103\/PhysRevA.52.3457","article-title":"Elementary gates for quantum computation","volume":"Vol. 52","author":"Barenco","year":"1995","journal-title":"Phys. Rev. A"},{"key":"10.1016\/S0020-0190(00)00084-3_ID009","doi-asserted-by":"crossref","first-page":"1411","DOI":"10.1137\/S0097539796300921","article-title":"Quantum complexity theory","volume":"Vol. 26","author":"Bernstein","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00084-3_ID010","series-title":"Proc. 40th Annual Symposium on Foundations of Computer Science","article-title":"On universal and fault-tolerant quantum computing","author":"Boykin","year":"1999"},{"key":"10.1016\/S0020-0190(00)00084-3_ID011","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1098\/rspa.1985.0070","article-title":"Quantum theory, the Church\u2013Turing principle and the universal quantum computer","volume":"Vol. 400","author":"Deutsch","year":"1985","journal-title":"Proc. Roy. Soc. London Ser. A"},{"key":"10.1016\/S0020-0190(00)00084-3_ID012","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1098\/rspa.1989.0099","article-title":"Quantum computational networks","volume":"Vol. 245","author":"Deutsch","year":"1989","journal-title":"Proc. Roy. Soc. London Ser. A"},{"key":"10.1016\/S0020-0190(00)00084-3_ID013","series-title":"Abstract Algebra","author":"Dummit","year":"1991"},{"key":"10.1016\/S0020-0190(00)00084-3_ID014","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1103\/PhysRevA.57.127","article-title":"Theory of fault-tolerant quantum computation","volume":"Vol. 57","author":"Gottesman","year":"1998","journal-title":"Phys. Rev. A"},{"key":"10.1016\/S0020-0190(00)00084-3_ID015","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1038\/46503","article-title":"Demonstrating the viability of universal quantum computation using teleportation and single-qubit operations","volume":"Vol. 402","author":"Gottesman","year":"1999","journal-title":"Nature"},{"key":"10.1016\/S0020-0190(00)00084-3_ID016","series-title":"Proc. 28th ACM Symposium on Theory of Computing","first-page":"212","article-title":"A fast quantum mechanical algorithm for database search","author":"Grover","year":"1996"},{"key":"10.1016\/S0020-0190(00)00084-3_ID017","doi-asserted-by":"crossref","first-page":"1191","DOI":"10.1070\/RM1997v052n06ABEH002155","article-title":"Quantum computations: Algorithms and error correction","volume":"Vol. 52","author":"Kitaev","year":"1997","journal-title":"Russian Math. Surveys"},{"key":"10.1016\/S0020-0190(00)00084-3_ID018","series-title":"Accuracy threshold for quantum computation","author":"Knill","year":"1996"},{"key":"10.1016\/S0020-0190(00)00084-3_ID019","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1098\/rspa.1998.0166","article-title":"Resilient quantum computation: Error models and thresholds","volume":"Vol. 454","author":"Knill","year":"1998","journal-title":"Proc. Roy. Soc. London Ser. A"},{"key":"10.1016\/S0020-0190(00)00084-3_ID020","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1098\/rspa.1998.0167","article-title":"Reliable quantum computers","volume":"Vol. 454","author":"Preskill","year":"1998","journal-title":"Proc. Roy. Soc. London Ser. A"},{"key":"10.1016\/S0020-0190(00)00084-3_ID021","series-title":"Modern Quantum Mechanics","author":"Sakurai","year":"1994"},{"key":"10.1016\/S0020-0190(00)00084-3_ID022","doi-asserted-by":"crossref","first-page":"2493","DOI":"10.1103\/PhysRevA.52.R2493","article-title":"Scheme for reducing decoherence in quantum computer memory","volume":"Vol. 52","author":"Shor","year":"1995","journal-title":"Phys. Rev. A"},{"key":"10.1016\/S0020-0190(00)00084-3_ID023","doi-asserted-by":"crossref","first-page":"1484","DOI":"10.1137\/S0097539795293172","article-title":"Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer","volume":"Vol. 26","author":"Shor","year":"1997","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0020-0190(00)00084-3_ID024","series-title":"Proc. 37th Annual Symposium on Foundations of Computer Science","first-page":"56","article-title":"Fault-tolerant Quantum Computation","author":"Shor","year":"1996"},{"key":"10.1016\/S0020-0190(00)00084-3_ID025","unstructured":"R. Solovay, A. Yao, Preprint, 1996"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000843?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019000000843?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,21]],"date-time":"2019-04-21T00:23:50Z","timestamp":1555806230000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019000000843"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,8]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2000,8]]}},"alternative-id":["S0020019000000843"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(00)00084-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[2000,8]]}}}