Sciweavers

700 search results - page 121 / 140
» An Introduction to Quantum Computing
Sort
View
DAC
2004
ACM
14 years 8 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf
STOC
2005
ACM
113views Algorithms» more  STOC 2005»
14 years 8 months 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...
DCC
2001
IEEE
14 years 7 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
ICCAD
2007
IEEE
148views Hardware» more  ICCAD 2007»
14 years 4 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
STACS
2009
Springer
14 years 2 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