Sciweavers

10666 search results - page 13 / 2134
» Quantum programming languages
Sort
View
LOGCOM
2010
120views more  LOGCOM 2010»
13 years 2 months ago
Paraconsistent Machines and their Relation to Quantum Computing
We describe a method to axiomatize computations in deterministic Turing machines (TMs). When applied to computations in non-deterministic TMs, this method may produce contradictor...
Juan C. Agudelo, Walter Alexandre Carnielli
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
JELIA
2004
Springer
14 years 27 days ago
Reasoning About Quantum Systems
Abstract. A new logic is proposed for reasoning about quantum systems. The logic embodies the postulates of quantum physics and it was designed from the semantics upwards by identi...
Paulo Mateus, Amílcar Sernadas

Book
321views
15 years 5 months ago
Algorithms
"This book evolved over the past ten years from a set of lecture notes developed while teaching the undergraduate Algorithms course at Berkeley and U.C. San Diego. Our way of ...
S. Dasgupta, C.H. Papadimitriou, and U.V. Vazirani
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