Sciweavers

11547 search results - page 22 / 2310
» Quantum computing and communication
Sort
View
133
Voted
IPPS
2003
IEEE
15 years 9 months ago
Global Communication Optimization for Tensor Contraction Expressions under Memory Constraints
The accurate modeling of the electronic structure of atoms and molecules involves computationally intensive tensor contractions involving large multi-dimensional arrays. The effi...
Daniel Cociorva, Xiaoyang Gao, Sandhya Krishnan, G...
122
Voted
STOC
2002
ACM
130views Algorithms» more  STOC 2002»
16 years 4 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...
138
Voted
CORR
2004
Springer
94views Education» more  CORR 2004»
15 years 3 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
94
Voted
SAC
2009
ACM
15 years 10 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
133
Voted
STACS
2009
Springer
15 years 10 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