Open Access. Powered by Scholars. Published by Universities.^{®}

Articles **1** - **5** of ** 5**

## Full-Text Articles in Computer Engineering

Computation In Quantum Space-Time Could Lead To A Super-Polynomial Speedup, Vladik Kreinovich, Michael Zakharevich

#### Computation In Quantum Space-Time Could Lead To A Super-Polynomial Speedup, Vladik Kreinovich, Michael Zakharevich

*Departmental Technical Reports (CS)*

In theoretical computer science, researchers usually distinguish between feasible problems (that can be solved in polynomial time) and problems that require more computation time. A natural question is: can we use new physical processes, processes that have not been used in modern computers, to make computations drastically faster -- e.g., to make intractable problems feasible? Such a possibility would occur if a physical process provides a super-polynomial (= faster than polynomial) speed-up.

In this direction, the most active research is undertaken in quantum computing. It is well known that quantum processes can drastically speed up computations; however, there are no proven ...

Square Root Of "Not": A Major Difference Between Fuzzy And Quantum Logics, Vladik Kreinovich, Ladislav J. Kohout, Eunjin Kim

#### Square Root Of "Not": A Major Difference Between Fuzzy And Quantum Logics, Vladik Kreinovich, Ladislav J. Kohout, Eunjin Kim

*Departmental Technical Reports (CS)*

Many authors have mentioned the similarity between quantum logic and fuzzy logic. In this paper, we show that, in spite of this similarity, these logics are not identical. Specifically, we emphasize that while quantum logic has a special ``square root of not'' operation which is very useful in quantum computing, fuzzy logic lacks such an operation.

Quantum Computing As A Particular Case Of Computing With Tensors, Martine Ceberio, Vladik Kreinovich

#### Quantum Computing As A Particular Case Of Computing With Tensors, Martine Ceberio, Vladik Kreinovich

*Departmental Technical Reports (CS)*

One of the main potential applications of uncertainty in computations is quantum computing. In this paper, we show that the success of quantum computing can be explained by the fact that quantum states are, in effect, tensors.

Fast Quantum Algorithms For Handling Probabilistic And Interval Uncertainty, Vladik Kreinovich, Luc Longpre

#### Fast Quantum Algorithms For Handling Probabilistic And Interval Uncertainty, Vladik Kreinovich, Luc Longpre

*Departmental Technical Reports (CS)*

No abstract provided.

Towards Computers Of Generation Omega - Non-Equilibrium Thermodynamics, Granularity, And Acausal Processes: A Brief Survey, Misha Kosheleva, Vladik Kreinovich

#### Towards Computers Of Generation Omega - Non-Equilibrium Thermodynamics, Granularity, And Acausal Processes: A Brief Survey, Misha Kosheleva, Vladik Kreinovich

*Departmental Technical Reports (CS)*

Proceedings of the International Conference on Intelligent Systems and Semiotics (ISAS'97), National Institute of Standards and Technology Publ., Gaithersburg, MD, 1997, pp. 383-388.

Nowadays, we are using mainly computer of fourth generation, and we are designing fifth-generation computers. It is reasonable to ask: what is the perspective? What will the computers of generation omega look like?

--As the speed of data processing increases, we face a natural limitation of *causality*, according to which the speed of all processes is limited by the speed of light.

--Lately, a new area of *acausal* (causality violating) processes has entered mainstream physics.

This ...