Sciweavers

508 search results - page 51 / 102
» Quantum Computers
Sort
View
ICCAD
2002
IEEE
189views Hardware» more  ICCAD 2002»
14 years 8 months ago
Reversible logic circuit synthesis
Reversible, or information-lossless, circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requir...
Vivek V. Shende, Aditya K. Prasad, Igor L. Markov,...
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
14 years 11 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
FCT
2007
Springer
14 years 2 months ago
Product Rules in Semidefinite Programming
Abstract. In recent years we have witnessed the proliferation of semidefinite programming bounds in combinatorial optimization [1,5,8], quantum computing [9,2,3,6,4,16] and even in...
Rajat Mittal, Mario Szegedy
VIS
2009
IEEE
430views Visualization» more  VIS 2009»
14 years 9 months ago
Interactive Volume Rendering of Functional Representations in Quantum Chemistry
Simulation and computation in chemistry studies have been improved as computational power has increased over decades. Many types of chemistry simulation results are available, from...
Yun Jang and Ugo Varetto
STACS
1999
Springer
14 years 3 months ago
On Quantum Algorithms for Noncommutative Hidden Subgroups
Quantum algorithms for factoring and finding discrete logarithms have previously been generalized to finding hidden subgroups of finite Abelian groups. This paper explores the ...
Mark Ettinger, Peter Høyer