Related papers: Symmetry-induced quantum-inspired parallelism of c…
The search for new computational machines beyond the traditional von Neumann architecture has given rise to a modern area of nonlinear science -- development of unconventional computing -- requiring the efforts of mathematicians, physicists…
In previous work we have proposed a construction of quantum-like bits that could endow a large synchronizing classical system, for example of oscillators, with quantum-like function that is not compromised by decoherence. In the present…
In this paper a formalism for studying the dynamics of quantum systems coupled to classical spin environments is reviewed. The theory is based on generalized antisymmetric brackets and naturally predicts open-path off-diagonal geometric…
The hybrid approach to quantum computation simultaneously utilizes both discrete and continuous variables which offers the advantage of higher density encoding and processing powers for the same physical resources. Trapped ions, with…
The "folding algorithm"\cite{fold1} is a matrix product state algorithm for simulating quantum systems that involves a spatial evolution of a matrix product state. Hence, the computational effort of this algorithm is controlled by the…
Efficient simulations of quantum evolutions of spin-1/2 systems are relevant for ensemble quantum computation as well as in typical NMR experiments. We propose an efficient method to calculate the dynamics of an observable provided that the…
Parallel batched data structures are designed to process synchronized batches of operations in a parallel computing model. In this paper, we propose parallel combining, a technique that implements a concurrent data structure from a parallel…
Coupling of chaotic oscillators has evidenced conditions where synchronization is possible, therefore a nonlinear system can be driven to a particular state through input from a similar oscillator. Here we expand this concept of control of…
Coupled Lindblad pseudomode theory is a promising approach for simulating non-Markovian quantum dynamics on both classical and quantum platforms, with dynamics that can be realized as a quantum channel. We provide theoretical evidence that…
We describe a novel analogue algorithm that allows the simultaneous factorization of an exponential number of large integers with a polynomial number of experimental runs. It is the interference-induced periodicity of "factoring"…
We introduce logical synchrony, a framework that allows distributed computing to be coordinated as tightly as in synchronous systems without the distribution of a global clock or any reference to universal time. We develop a model of events…
Synchrony patterns describe network states in which nodes of a coupled dynamical system are grouped into clusters based on synchronization between nodes. Beyond simple synchrony, synchronized clusters may also exhibit active or inactive…
We consider two different ways to encode quantum information, by parallel or anti-parallel pairs of spins. We find that there is more information in the anti-parallel ones. This purely quantum mechanical effect is due to entanglement, not…
We propose an optical parallel computation similar to quantum computation that can be realized by introducing pseudorandom phase sequences into classical optical fields with two orthogonal modes. Based on the pseudorandom phase sequences,…
In this article, we study some parallel processing algorithms for multiplication and modulo operations. We demonstrate that the state transitions that are formed under these algorithms satisfy lattice-linearity, where these algorithms…
Synchrony patterns characterize network states in which nodes organize into clusters based on their synchronized dynamics. The synchronized clusters may further exhibit either active or inactive states. The simultaneous invariance of active…
Symmetry is fundamental in the description and simulation of quantum systems. Leveraging symmetries in classical simulations of many-body quantum systems can results in significant overhead due to the exponentially growing size of some…
In previous work, we introduced a formalism that maps classical networks of nonlinear oscillators onto a quantum-like Hilbert space. We demonstrated that specific network transformations correspond to quantum gates, underscoring the…
Following the success of Moore's predictions, we are approaching a limit in the miniaturization of semiconductors for computing materials. This has led to the exploration of various research paths to develop alternative computing paradigms,…
In a quantum computer, creating superpositions of quantum bits (qubits) in different states can lead to a speed-up over classical computers [1], but quantum mechanics also allows for the superposition of quantum circuits [2]. In fact, it…