Related papers: Time-Optimal Generation of Cluster States
The cluster state, the highly entangled state that is the central resource for one-way quantum computing, can be efficiently generated in a variety of physical implementations via global nearest-neighbor interactions. In practice, a…
The ability to manipulate and control fluid flows is of great importance in many scientific and engineering applications. Here, a cluster-based control framework is proposed to determine optimal control laws with respect to a cost function…
Cluster states for measurement-based quantum computing can be created with entangling operations of arbitrary low success probability. This will place a lower bound on the minimum lifetime of the qubits used in the implementation. Here, we…
We suggest an adaptive control scheme for the control of zero-lag and cluster synchronization in delay-coupled networks. Based on the speed-gradient method, our scheme adapts the topology of a network such that the target state is realized.…
Gaussian cluster states are ideal infinitely squeezed states. In practice it is possible to construct only approximated version of them with finite squeezing. Here we show how to determine the specific multi-mode squeezing transformation,…
We study the problem of clustering sequences of unlabeled point sets taken from a common metric space. Such scenarios arise naturally in applications where a system or process is observed in distinct time intervals, such as biological…
Cluster states are an essential component in one-way quantum computation protocols. We present two schemes to generate addressable continuous-variable cluster states from quadrature squeezed cylindrically polarized modes. By including…
We study a network of finitely many interacting clusters where each cluster is a collection of globally coupled circle maps in the thermodynamic (or mean field) limit. The state of each cluster is described by a probability measure, and its…
Cluster states are useful in many quantum information processing applications. In particular, universal measurement-based quantum computation (MBQC) utilizes 2D cluster states, and topologically fault-tolerant MBQC requires cluster states…
Clustering provides a common means of identifying structure in complex data, and there is renewed interest in clustering as a tool for the analysis of large data sets in many fields. A natural question is how many clusters are appropriate…
The one-dimensional contact process is analyzed by a cluster approximation. In this approach, the hierarchy of rate equations for the densities of finite length empty intervals are truncated under the assumption that adjacent intervals are…
The coexistence of coherently and incoherently oscillating parts in a system of identical oscillators with symmetrical coupling, i.e., a chimera state, is even observable with uniform global coupling. We address the question of the…
Cluster synchronization is a phenomenon in which a network self-organizes into a pattern of synchronized sets. It has been shown that diverse patterns of stable cluster synchronization can be captured by symmetries of the network. Here we…
The ubiquitous occurrence of cluster patterns in nature still lacks a comprehensive understanding. It is known that the dynamics of many such natural systems is captured by ensembles of Stuart-Landau oscillators. Here, we investigate…
In a Newtonian system with localized interactions the whole set of particles is naturally decomposed into dynamical clusters, defined as finite groups of particles having an influence on each other's trajectory during a given interval of…
Cluster states are versatile quantum resources and an essential building block for measurement-based quantum computing. The possibility to generate cluster states in specific systems may thus serve as an indicator regarding if and to what…
In temporal ordered clustering, given a single snapshot of a dynamic network in which nodes arrive at distinct time instants, we aim at partitioning its nodes into $K$ ordered clusters $\mathcal{C}_1 \prec \cdots \prec \mathcal{C}_K$ such…
Jeong and Steinhardt (JS) implement local rules by selecting the sub-ensemble of tilings which have the maximum occurrences of a chosen pattern (``cluster'') C It is unknown how to prove that a given C implies a given sub-ensemble;…
The genetic cluster-exact approximation algorithm is an efficient method to calculate ground states of EA spin glasses. The method can be used to study ground-state landscapes by calculating many independent ground states for each…
It has recently been established that cluster-like states -- states that are in the same symmetry-protected topological phase as the cluster state -- provide a family of resource states that can be utilized for Measurement-Based Quantum…