Data Structures and Algorithms

1702 Submissions

[4] viXra:1702.0321 [pdf] submitted on 2017-02-26 11:24:32

Solving NP-Complete Problems by Self-Supervised Dynamics.

Authors: Michail Zak
Comments: 11 Pages.

The challenge of this paper is to relate quantum-inspired dynamics represented by a self- supervised system, to solutions of noncomputable problems. In the self-supervised systems, the role of actuators is played by the probability produced by the corresponding Liouville equation. Following the Madelung equation that belongs to this class, non- Newtonian properties such as randomness, entanglement, and probability interference typical for quantum systems have been described in [1]. It has been demonstrated there, that such systems exist in the mathematical world: they are presented by ODE coupled with their Liouville equation, but they belong neither to Newtonian nor to quantum physics. The central point of this paper is the application of the self-supervised systems to solve traveling salesman problem.
Category: Data Structures and Algorithms

[3] viXra:1702.0261 [pdf] submitted on 2017-02-20 21:15:53

Solving Noncomputable Problems Using Quantum-Classical Hybrid.

Authors: Michail Zak
Comments: 11 Pages.

The challenge of this paper is to relate quantum-inspired dynamics represented by a self-supervised system, to solutions of noncomputable problems. In the self-supervised systems, the role of actuators is played by the probability produced by the corresponding Liouville equation. Following the Madelung equation that belongs to this class, non-Newtonian properties such as randomness, entanglement, and probability interference typical for quantum systems have been described in [1]. It has been demonstrated there, that such systems exist in the mathematical world: they are presented by ODE coupled with their Liouville equation, but they belong neither to Newtonian nor to quantum physics. The central point of this paper is the application of the self-supervised systems to finding global maximum of functions that is no-where differential, but everywhere continuous (such as Weierstrass functions)
Category: Data Structures and Algorithms

[2] viXra:1702.0156 [pdf] replaced on 2017-02-20 14:49:06

The Bordering Method of the Cholesky Decomposition and its Backward Differentiation

Authors: Stephen P Smith
Comments: 12 Pages.

This paper describes the backward differentiation of the Cholesky decomposition by the bordering method. The backward differentiation of the Cholesky decomposition by the inner product form and the outer product form have been described elsewhere. It is found that the resulting algorithm can be adapted to vector processing, as is also true of the algorithms developed from the inner product form and outer product form. The three approaches can also be fashioned to treat sparse matrices, but this is done by enforcing the same sparse structure found for the Cholesky decomposition on a secondary work space.
Category: Data Structures and Algorithms

[1] viXra:1702.0060 [pdf] submitted on 2017-02-04 06:12:29

Quantum RAM

Authors: George Rajna
Comments: 36 Pages.

The researchers, in their paper published in Science Advances, say this freedom allows quantum computers to store many different states of the system being simulated in different superpositions, using less memory overall than in a classical computer. [26] The advancement of quantum computing faces a tremendous challenge in improving the reproducibility and robustness of quantum circuits. One of the biggest problems in this field is the presence of noise intrinsic to all these devices, the origin of which has puzzled scientists for many decades. [25] Characterising quantum channels with non-separable states of classical light the researchers demonstrate the startling result that sometimes Nature cannot tell the difference between particular types of laser beams and quantum entangled photons. [24] Physicists at Princeton University have revealed a device they've created that will allow a single electron to transfer its quantum information to a photon. [23] A strong, short light pulse can record data on a magnetic layer of yttrium iron garnet doped with Co-ions. This was discovered by researchers from Radboud University in the Netherlands and Bialystok University in Poland. The novel mechanism outperforms existing alternatives, allowing the fastest read-write magnetic recording accompanied by unprecedentedly low heat load. [22] It goes by the unwieldy acronym STT-MRAM, which stands for spin-transfer torque magnetic random access memory. [21] Memory chips are among the most basic components in computers. The random access memory is where processors temporarily store their data, which is a crucial function. Researchers from Dresden and Basel have now managed to lay the foundation for a new memory chip concept. [20] Researchers have built a record energy-efficient switch, which uses the interplay of electricity and a liquid form of light, in semiconductor microchips. The device could form the foundation of future signal processing and information technologies, making electronics even more efficient. [19] The magnetic structure of a skyrmion is symmetrical around its core; arrows indicate the direction of spin. [18]
Category: Data Structures and Algorithms