Author:
Boykin P. Oscar,Mor Tal,Roychowdhury Vwani,Vatan Farrokh
Publisher
Springer Science and Business Media LLC
Subject
Computer Science Applications
Reference27 articles.
1. Aharonov D, Ben-Or M (1996) Polynomial simulations of decohered quantum computers. In: Proceedings of the 37th annual symposium on foundations of computer science, FOCS’96. IEEE Computer Society Press, Los Alamitos, pp 46–55
2. Aharonov D, Ben-Or M (1997) Fault tolerant quantum computation with constant error. In: Proceedings 29th annual ACM symposium on theory of computing, ACM, New York, pp 176–188. Extended version: Quant-ph/9906129
3. Boyer B, Brassard G, Hoyer P, Tapp A (1998) Tight bounds on quantum searching. Fortschr Phys 46(4–5):493–505
4. Boykin PO, Mor T, Pulver M, Roychowdhury VP, Vatan F (1999) On universal and fault–tolerant quantum computation. In: Proceedings of the 40th annual symposium on foundations of computer science, pp 486–494. Quant-ph/9906054
5. Boykin PO, Mor T, Pulver M, Roychowdhury VP, Vatan F (2000) A new universal and fault-tolerant quantum basis. Inf Process Lett 75:101–107
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献