Sciweavers

3328 search results - page 142 / 666
» Topological Quantum Computation
Sort
View
GLVLSI
2007
IEEE
135views VLSI» more  GLVLSI 2007»
14 years 4 months ago
Exact sat-based toffoli network synthesis
Compact realizations of reversible logic functions are of interest in the design of quantum computers. Such reversible functions are realized as a cascade of Toffoli gates. In th...
Daniel Große, Xiaobo Chen, Gerhard W. Dueck,...
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 3 months ago
Towards the Classical Communication Complexity of Entanglement Distillation Protocols with Incomplete Information
Entanglement is an essential resource for quantum communication and quantum computation, similar to shared random bits in the classical world. Entanglement distillation extracts n...
Andris Ambainis, Ke Yang
ICALP
2003
Springer
14 years 3 months ago
A Direct Sum Theorem in Communication Complexity via Message Compression
We prove lower bounds for the direct sum problem for two-party bounded error randomised multipleround communication protocols. Our proofs use the notion of information cost of a p...
Rahul Jain, Jaikumar Radhakrishnan, Pranab Sen
CVPR
2001
IEEE
15 years 7 days ago
A Topology Preserving Deformable Model Using Level Sets
Active contour and surface models, also known as deformable models, constitute a class of powerful segmentation techniques. Geometric deformable models implemented via level-set m...
Xiao Han, Chenyang Xu, Jerry L. Prince
ICCV
2007
IEEE
15 years 4 days ago
Correspondence Establishment in Statistical Modeling of Shapes with Arbitrary Topology
Correspondence establishment is a key step in statistical shape model building. There are several automated methods for solving this problem in 3D, but they usually can only handl...
Ekaterina Syrkina, Gábor Székely, Mi...