Sciweavers

508 search results - page 14 / 102
» Poly-locality in quantum computing
Sort
View
STACS
2009
Springer
14 years 3 months ago
Locally Decodable Quantum Codes
We study a quantum analogue of locally decodable error-correcting codes. A q-query locally decodable quantum code encodes n classical bits in an m-qubit state, in such a way that ...
Jop Briet, Ronald de Wolf
ASPLOS
2006
ACM
14 years 2 months ago
A program transformation and architecture support for quantum uncomputation
  Quantum  computing’s  power  comes  from  new  algorithms  that exploit quantum mechanical phenomena for computation. Quantum algorithms  are  different  from...
Ethan Schuchman, T. N. Vijaykumar
ENTCS
2008
94views more  ENTCS 2008»
13 years 8 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
ISCA
2006
IEEE
92views Hardware» more  ISCA 2006»
13 years 8 months ago
Quantum Memory Hierarchies: Efficient Designs to Match Available Parallelism in Quantum Computing
The assumption of maximum parallelism support for the successful realization of scalable quantum computers has led to homogeneous, "sea-of-qubits" architectures. The res...
Darshan D. Thaker, Tzvetan S. Metodi, Andrew W. Cr...
ECCC
2008
98views more  ECCC 2008»
13 years 8 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous