Sciweavers

7486 search results - page 18 / 1498
» The Limits of Quantum Computers
Sort
View
CORR
2004
Springer
94views Education» more  CORR 2004»
13 years 7 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
SAC
2009
ACM
14 years 2 months ago
Bulk based preconditioning for quantum dot computations
Abstract— This article describes how to accelerate the convergence of Preconditioned Conjugate Gradient (PCG) type eigensolvers for the computation of several states around the b...
Christof Vömel, Stanimire Tomov, Osni Marques
ISCA
2006
IEEE
120views Hardware» more  ISCA 2006»
14 years 1 months ago
Interconnection Networks for Scalable Quantum Computers
We show that the problem of communication in a quantum computer reduces to constructing reliable quantum channels by distributing high-fidelity EPR pairs. We develop analytical m...
Nemanja Isailovic, Yatish Patel, Mark Whitney, Joh...
STACS
2009
Springer
14 years 2 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 1 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