Sciweavers

153 search results - page 4 / 31
» On an equivalence in discrete extremal problems
Sort
View
ICCAD
2007
IEEE
153views Hardware» more  ICCAD 2007»
14 years 3 months ago
Checking equivalence of quantum circuits and states
Among the post-CMOS technologies currently under investigation, quantum computing (QC) holds a special place. QC offers not only extremely small size and low power, but also expon...
George F. Viamontes, Igor L. Markov, John P. Hayes
TIT
2002
86views more  TIT 2002»
13 years 6 months ago
A low-rate bound on the reliability of a quantum discrete memoryless channel
We extend a low-rate improvement of the random coding bound on the reliability of a classical discrete memoryless channel (DMC) to its quantum counterpart. The key observation that...
Alexander Barg
MOC
2010
13 years 1 months ago
H(div) preconditioning for a mixed finite element formulation of the diffusion problem with random data
We study H(div) preconditioning for the saddle-point systems that arise in a stochastic Galerkin mixed formulation of the steady-state diffusion problem with random data. The key i...
Howard C. Elman, Darran G. Furnival, Catherine E. ...
DAC
2007
ACM
14 years 7 months ago
On Resolution Proofs for Combinational Equivalence
Modern combinational equivalence checking (CEC) engines are complicated programs which are difficult to verify. In this paper we show how a modern CEC engine can be modified to pr...
Satrajit Chatterjee, Alan Mishchenko, Robert K. Br...
ECCC
2008
98views more  ECCC 2008»
13 years 6 months ago
Closed Timelike Curves Make Quantum and Classical Computing Equivalent
While closed timelike curves (CTCs) are not known to exist, studying their consequences has led to nontrivial insights in general relativity, quantum information, and other areas....
Scott Aaronson, John Watrous