Related papers: Symbolic-numerical Algorithm for Generating Cluste…
We use an one dimensional model of a square barrier embedded in an infinite potential well to demonstrate that tunneling leads to a complex behavior of the wave function and that the degree of complexity may be quantified by use of the…
Simulating the unitary dynamics of a quantum system is a fundamental problem of quantum mechanics, in which quantum computers are believed to have significant advantage over their classical counterparts. One prominent such instance is the…
This chapter gives a self-contained review of the how standard open quantum system Hamiltonians can be mapped analytically onto representations in which the environments appear as one dimensional harmonic chains with nearest neighbour…
Quantum networks are natural scenarios for the communication of information among distributed parties, and the arena of promising schemes for distributed quantum computation. Measurement-based quantum computing is a prominent example of how…
We introduce an architecture for neural quantum states for many-body quantum-mechanical systems, based on normalizing flows. The use of normalizing flows enables efficient uncorrelated sampling of configurations from the probability…
Recent works have shown that defining a behavioural equivalence that matches the observational properties of a quantum-capable, concurrent, non-deterministic system is a surprisingly difficult task. We explore coalgebras over distributions…
We consider the following model of decision-making by cognitive systems. We present an algorithm -- quantum-like representation algorithm (QLRA) -- which provides a possibility to represent probabilistic data of any origin by complex…
Reconstruction based subspace clustering methods compute a self reconstruction matrix over the samples and use it for spectral clustering to obtain the final clustering result. Their success largely relies on the assumption that the…
We propose a new architecture for the measurement-based quantum computation model. The new design relies on small composite light-atom primary clusters. These are then assembled into cluster arrays using ancillary light modes and the actual…
The present paper deals with the possibility of creation of the quantum computer in which the role of q-bits is played by quasi-particles. In such a computer, the elementary computation block should represent a cluster created on the basis…
We introduce a low complexity approach to iterative equalization and decoding, or "turbo equalization", that uses clustered models to better match the nonlinear relationship that exists between likelihood information from a channel decoder…
We expand a set of notions recently introduced providing the general setting for a universal representation of the quantum structure on which quantum information stands. The dynamical evolution process associated with generic quantum…
The open quantum system eigenstate in the vicinity of low-energy decay channel may mimic its features, in particular the characteristic clustering properties of the decay channel. This generic mechanism of clusterization, the so-called…
We study the quantum tunnelling of a very complex object of which only part is coupled to an external potential ( the potential barrier ). We treat this problem as the tunnelling of a particle (part of the system affected by the potential)…
Quantum time evolution exhibits rich physics, attributable to the interplay between the density and phase of a wave function. However, unlike classical heat diffusion, the wave nature of quantum mechanics has not yet been extensively…
Sequential Monte Carlo methods are typically not straightforward to implement on parallel architectures. This is because standard resampling schemes involve communication between all particles. The $\alpha$-sequential Monte Carlo method was…
In the past few years there has been a tumultuous activity aimed at introducing novel conceptual schemes for quantum computing. The approach proposed in (Marzuoli A and Rasetti M 2002, 2005a) relies on the (re)coupling theory of SU(2)…
Quantum machine learning algorithms have emerged to be a promising alternative to their classical counterparts as they leverage the power of quantum computers. Such algorithms have been developed to solve problems like electronic structure…
We present a quantum-classical hybrid algorithm that simulates electronic structures of periodic systems such as ground states and quasiparticle band structures. By extending the unitary coupled cluster (UCC) theory to describe crystals in…
As was shown in \cite{GPS} the matrix $L=|| l_i^j||$ whose entries $l_i^j$ are generators of the so-called reflection equation algebra is subject to some polynomial identity looking like the Cayley-Hamilton identity for a numerical matrix.…