Efficient computing procedures and impossibility to solve the problem of exact prediction of events in the quantum world

Author： Namiot V.A.   Chernavskii D.S.  

Publisher： Elsevier

ISSN： 0375-9601

Source： Physics Letters A, Vol.320, Iss.1, 2003-12, pp. : 1-4

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

New methods for proving the impossibility to solve problems through reduction of problem spaces

By Hernando Antonio  

Annals of Mathematics and Artificial Intelligence, Vol. 57, Iss. 3-4, 2009-12 ,pp. : 205-231

Springer Publishing Company

Access to resources Recommend Favorite

The Initialization Problem in Quantum Computing

By Kak S.  

Foundations of Physics, Vol. 29, Iss. 2, 1999-02 ,pp. : 267-279

Springer Publishing Company

Access to resources Recommend Favorite

An efficient approach to solve very large dense linear systems with verified computing on clusters

By  

NUMERICAL LINEAR ALGEBRA WITH APPLICATIONS (ELECTRONIC), Vol. 22, Iss. 2, 2015-03 ,pp. : 299-316

John Wiley & Sons Inc

Access to resources Recommend Favorite

Quantum computing

By Greenland P. T.  

Contemporary Physics, Vol. 42, Iss. 4, 2001-07 ,pp. : 239-241

Taylor & Francis Ltd

Access to resources Recommend Favorite

The Exact Path Length Problem

By Nykanen M.   Ukkonen E.  

Journal of Algorithms, Vol. 42, Iss. 1, 2002-01 ,pp. : 41-53

Elsevier

Access to resources Recommend Favorite