Sciweavers

587 search results - page 97 / 118
» Quantum computation and quantum information
Sort
View
CORR
2007
Springer
113views Education» more  CORR 2007»
13 years 9 months ago
Geometry and the complexity of matrix multiplication
We survey results in algebraic complexity theory, focusing on matrix multiplication. Our goals are (i.) to show how open questions in algebraic complexity theory are naturally pose...
J. M. Landsberg
JCC
2008
76views more  JCC 2008»
13 years 9 months ago
Effects of spin-orbit coupling on magnetic properties of discrete and extended magnetic systems
: In accounting for the magnetic properties of discrete and extended compounds with unpaired spins, it is crucial to know the nature of their ground and low-lying excited states. I...
Dadi Dai, Hongjun Xiang, Myung-Hwan Whangbo
ENTCS
2011
131views more  ENTCS 2011»
13 years 4 months ago
Computational Complexity in Non-Turing Models of Computation: The What, the Why and the How
We preliminarily recap what is meant by complexity and non-Turing computation, by way of explanation of our title, ‘Computational Complexity in Non-Turing Models of Computationâ...
Ed Blakey
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,...
QI
2009
Springer
123views Physics» more  QI 2009»
14 years 4 months ago
Hilbert Space Models Commodity Exchanges
Abstract. It is argued that the vector space measures used to measure closeness of market prices to predictors for market prices are invalid because of the observed metric of commo...
Paul Cockshott