Sciweavers

206 search results - page 32 / 42
» On the Complexity of Quantum ACC
Sort
View
97
Voted
RIVF
2007
15 years 1 months ago
Stochastic routing in large grid-shaped quantum networks
— This paper investigates the problem of secret key transmissions for an arbitrary Alice-Bob pair in Quantum Key Distribution (QKD)-based networks. We develop a realistic QKDbase...
Cuong Le Quoc, Patrick Bellot, Akim Demaille
QOSA
2009
Springer
15 years 6 months ago
Adaptive Application Composition in Quantum Chemistry
Abstract. Component interfaces, as advanced by the Common Component Architecture (CCA), enable easy access to complex software packages for high-performance scientific computing. ...
Li Li, Joseph P. Kenny, Meng-Shiou Wu, Kevin A. Hu...
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 5 months ago
The second harmonic generation case-study as a gateway for es to quantum control problems
The Second Harmonic Generation (SHG), a process that turns out to be a good test case in the physics lab, can also be considered as a fairly simple theoretical test function for g...
Ofer M. Shir, Thomas Bäck
COCO
2009
Springer
126views Algorithms» more  COCO 2009»
15 years 6 months ago
New Results in the Simultaneous Message Passing Model via Information Theoretic Techniques
—Consider the following Simultaneous Message Passing (SMP) model for computing a relation f ⊆ X ×Y ×Z. In this model Alice, on input x ∈ X and Bob, on input y ∈ Y, send o...
Rahul Jain, Hartmut Klauck
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
16 years 16 hour ago
Efficient testing of groups
We construct an efficient probabilistic algorithm that, given a finite set with a binary operation, tests if it is an abelian group. The distance used is an analogue of the edit d...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...