1391 search results - page 11 / 279 » Complexity Limitations on Quantum Computation |
DAC
2010
ACM
13 years 11 months ago
2010
ACM
Reversible logic became a promising alternative to traditional circuits because of its applications e.g. in low-power design and quantum computation. As a result, design of revers...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
The work establishes fundamental limits between rate, reliability and computational complexity, for the general setting of outage-limited MIMO communications. In the high-SNR regim...
ANSS
2005
IEEE
14 years 1 months ago
2005
IEEE
When performed on a classical computer, the simulation of quantum circuits is usually an exponential job. The methodology based on Hardware Description Languages is able to isolat...
CSL
2003
Springer
14 years 26 days ago
2003
Springer
Quantum computation deals with projective measurements and unitary transformations in finite dimensional Hilbert spaces. The paper presents a propositional logic designed to descr...
CORR
2011
Springer
13 years 2 months ago
2011
Springer
Abstract. Notoriously, quantum computation shatters complexity theory, but is innocuous to computability theory [17]. Yet several works have shown how quantum theory as it stands c...