3713 search results - page 26 / 743 » Quantum Information Theory |
ICALP
2004
Springer
14 years 27 days ago
2004
Springer
Quantum algorithms for graph problems are considered, both in the adjacency matrix model and in an adjacency list-like array model. We give almost tight lower and upper bounds for ...
JCC
2007
13 years 7 months ago
2007
Abstract: The relative aromaticity of benzenoid rings in the linear polyacenes is investigated using two novel aromaticity approaches. According to the first, the aromaticity of i...
STOC
2006
ACM
14 years 1 months ago
2006
ACM
It has been known for some time that graph isomorphism reduces to the hidden subgroup problem (HSP). What is more, most exponential speedups in quantum computation are obtained by...
ICCAD
2002
IEEE
14 years 4 months ago
2002
IEEE
Reversible, or information-lossless, circuits have applications in digital signal processing, communication, computer graphics and cryptography. They are also a fundamental requir...
DIS
2001
Springer
14 years 1 days ago
2001
Springer
In this paper we describe BR-4, a computational model of scienti c discovery in particle physics. The system incorporates operators for determining quantum values of known particle...