Sciweavers

3328 search results - page 17 / 666
» Topological Quantum Computation
Sort
View
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
13 years 11 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
COCO
2004
Springer
104views Algorithms» more  COCO 2004»
14 years 28 days ago
Quantum Arthur-Merlin Games
This paper studies quantum Arthur–Merlin games, which are Arthur–Merlin games in which Arthur and Merlin can perform quantum computations and Merlin can send Arthur quantum in...
Chris Marriott, John Watrous
UC
2007
Springer
14 years 1 months ago
Taming Non-compositionality Using New Binders
We propose an extension of the traditional λ-calculus in which terms are used to control an outside computing device (quantum computer, DNA computer...). We introduce two new bind...
Frédéric Prost
INFOCOM
2010
IEEE
13 years 5 months ago
Optimal Solutions for Single Fault Localization in Two Dimensional Lattice Networks
Abstract--Achieving fast, precise, and scalable fault localization has long been a highly desired feature in all-optical mesh networks. Monitoring tree (m-tree) is an interesting m...
János Tapolcai, Lajos Rónyai, Pin-Ha...