Examples of Gaussian cluster computation
نویسنده
چکیده
We give simple examples that illustrate the principles of one-way quantum computation using Gaussian continuous-variable cluster states. In these examples, we only consider single-mode evolutions, realizable via linear clusters. In particular, we focus on Gaussian single-mode transformations performed through the cluster state. Our examples highlight the differences between cluster-based schemes and protocols in which special quantum states are prepared off-line and then used as a resource for the on-line computation. c © 2008 Optical Society of America
منابع مشابه
Building Gaussian Cluster States by Linear Optics
The linear optical creation of Gaussian cluster states, a potential resource for universal quantum computation, is investigated. We show that for any Gaussian cluster state, the canonical generation scheme in terms of QND-type interactions, can be entirely replaced by off-line squeezers and beam splitters. Moreover, we find that, in terms of squeezing resources, the canonical states are rather ...
متن کاملUniversal quantum computation with continuous-variable cluster states.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quantum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while th...
متن کاملCALCULATION OF NON LIFTING POTENTIAL FLOW USING DESINGULARIZED CAUCHY\'S FORMULA
This paper discusses the disturbance velocity and potential as well as the total velocity formulation for non lifting potential flow problem. The problem is derived based on the Cauchy method formulation. The adding and subtracting back technique is used to desingularize the integral equations. The desingularized boundary integral equations are then discretized. The discretized equations can be...
متن کاملA collection of examples where Neville elimination outperforms Gaussian elimination
Neville elimination is an elimination procedure alternative to Gaussian elimination. It is very useful when dealing with totally positive matrices, for which nice stability results are known. Here we include examples, most of them test matrices used in MATLAB which are not totally positive matrices, where Neville elimination outperforms Gaussian elimination. 2010 Elsevier Inc. All rights reserved.
متن کاملClustering Based on Gaussian Processes
In this letter, we develop a gaussian process model for clustering. The variances of predictive values in gaussian processes learned from a training data are shown to comprise an estimate of the support of a probability density function. The constructed variance function is then applied to construct a set of contours that enclose the data points, which correspond to cluster boundaries. To perfo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006