Sciweavers

508 search results - page 12 / 102
» Quantum Computers
Sort
View
ENTCS
2008
94views more  ENTCS 2008»
13 years 10 months ago
From Reversible to Irreversible Computations
In this paper we study the relation between reversible and irreversible computation applicable to different models of computation -- here we are considering classical and quantum ...
Alexander S. Green, Thorsten Altenkirch
CORR
2004
Springer
94views Education» more  CORR 2004»
13 years 9 months ago
Quantum Computing, Postselection, and Probabilistic Polynomial-Time
I study the class of problems efficiently solvable by a quantum computer, given the ability to "postselect" on the outcomes of measurements. I prove that this class coin...
Scott Aaronson
CATS
2007
13 years 11 months ago
Quantum List Decoding from Quantumly Corrupted Codewords for Classical Block Codes of Polynomially Small Rate
d Abstract) Tomoyuki Yamakami Department of Computer Software, University of Aizu 90 Kami-Iawase, Tsuruga, Ikki-machi, Fukushima 965-8580, Japan Our task of quantum list decoding ...
Tomoyuki Yamakami
STOC
2002
ACM
130views Algorithms» more  STOC 2002»
14 years 10 months ago
Secure multi-party quantum computation
Secure multi-party computing, also called secure function evaluation, has been extensively studied in classical cryptography. We consider the extension of this task to computation...
Claude Crépeau, Daniel Gottesman, Adam Smit...