Sciweavers

515 search results - page 88 / 103
» Classically-controlled Quantum Computation
Sort
View
DCC
2001
IEEE
16 years 1 months ago
The Invariants of the Clifford Groups
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...
Gabriele Nebe, Eric M. Rains, Neil J. A. Sloane
128
Voted
ICCAD
2007
IEEE
148views Hardware» more  ICCAD 2007»
15 years 10 months ago
Fast exact Toffoli network synthesis of reversible logic
— The research in the field of reversible logic is motivated by its application in low-power design, optical computing and quantum computing. Hence synthesis of reversible logic...
Robert Wille, Daniel Große
110
Voted
STACS
2009
Springer
15 years 8 months ago
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
We introduce a new technique proving formula size lower bounds based on the linear programming bound originally introduced by Karchmer, Kushilevitz and Nisan [11] and the theory of...
Kenya Ueno
ASIACRYPT
2009
Springer
15 years 8 months ago
Security Bounds for the Design of Code-Based Cryptosystems
Code-based cryptography is often viewed as an interesting “Post-Quantum” alternative to the classical number theory cryptography. Unlike many other such alternatives, it has th...
Matthieu Finiasz, Nicolas Sendrier
APSCC
2008
IEEE
15 years 8 months ago
Runtime Prediction Based Grid Scheduling of Parameter Sweep Jobs
—This paper examines the problem of predicting job runtimes by exploiting the properties of parameter sweeps. A new parameter sweep prediction framework GIPSy (Grid Information P...
Sam Verboven, Peter Hellinckx, Frans Arickx, Jan B...