相关论文: Examples of Gaussian cluster computation
We describe a solid state implementation of a quantum computer using ballistic single electrons as flying qubits in 1D nanowires. We show how to implement all the steps required for universal quantum computation: preparation of the initial…
Measurement-induced quantum computation with continuous-variable cluster states utilizes teleportation to transmit and alter quantum states via measurement-and-feedforward control. One of the key challenges of this approach is the…
In the study of quantum computation, data is represented in terms of linear operators which form a generalized model of probability, and computations are most commonly described as products of unitary transformations, which are the…
We apply ideas from the cluster method to q-count the permutations of a multiset according to the number of occurrences of certain generalized patterns, as defined by Babson and Steingrimsson. In particular, we consider those patterns with…
The clustering algorithms that view each object data as a single sample drawn from a certain distribution, Gaussian distribution, for example, has been a hot topic for decades. Many clustering algorithms: such as k-means and spectral…
We study one-mode Gaussian quantum channels in continuous-variable systems by performing a black-box characterization using complete positivity and trace preserving conditions, and report the existence of two subsets that do not have a…
We discuss and generalize multi-particle entanglement based on statistical correlations using Ursell-Mayer type of cluster coefficients. Cluster coefficients are used to distinguish different, independent entangled systems as well as those…
Quantum cluster approaches offer new perspectives to study the complexities of macroscopic correlated fermion systems. These approaches can be understood as generalized mean-field theories. Quantum cluster approaches are non-perturbative…
We show that the following nontrivial necessary precondition for an entanglement evolution equation for pure Gaussian states under one-sided Gaussian channels holds. Suppose a Gaussian quantum channel acts on one mode of a pure entangled…
We discuss the question of the existence of quantum one-way permutations. First, we prove the equivalence between inverting a permutation and that of constructing a polynomial size network for reflecting about a given quantum state. Next,…
The present paper is concerned with the concept of the one-way quantum computer, beyond binary-systems, and its relation to the concept of stabilizer quantum codes. This relation is exploited to analyze a particular class of quantum…
Quantum computation is based on implementing selected unitary transformations which represent algorithms. A generalized optimal control theory is used to find the driving field that generates a prespecified unitary transformation. The…
In this paper we argue that one-way quantum computation can be seen as a form of phase transition with the available information about the solution of the computation being the order parameter. We draw a number of striking analogies between…
A measurement-based quantum computer could consist of a local-gapped Hamiltonian system, whose thermal states --at sufficiently low temperature-- are universal resources for the computation. Initialization of the computer would correspond…
The fidelity of a quantum transformation is strongly linked with the prior partial information of the state to be transformed. We illustrate this interesting point by proposing and demonstrating the superior cloning of coherent states with…
We provide explicit circuits implementing the Kitaev-Webb algorithm for the preparation of multi-dimensional Gaussian states on quantum computers. While asymptotically efficient due to its polynomial scaling, we find that the circuits…
Cluster states can be used to perform measurement-based quantum computation. The cluster state is a useful resource, because once it has been generated only local operations and measurements are needed to perform universal quantum…
We propose a computationally simple framework for clustering functional data based on Gaussian-process-generated random projections. In this approach, each curve is first projected onto a large collection of independent Gaussian process…
Continuous-variable quantum computing utilizes continuous parameters of a quantum system to encode information, promising efficient solutions to complex problems. Trapped-ion systems provide a robust platform with long coherence times and…
We discuss a model for quantum computing with initially mixed states. Although such a computer is known to be less powerful than a quantum computer operating with pure (entangled) states, it may efficiently solve some problems for which no…