Related papers: Examples of Gaussian cluster computation
We investigate non-Gaussian states of light as ancillary inputs for generating nonlinear transformations required for quantum computing with continuous variables. We consider a recent proposal for preparing a cubic phase state, find the…
With a combination of the quantum repeater and the cluster state approaches, we show that efficient quantum computation can be constructed even if all the entangling quantum gates only succeed with an arbitrarily small probability $p$. The…
Construction of explicit quantum circuits follows the notion of the "standard circuit model" introduced in the solid and profound analysis of elementary gates providing quantum computation. Nevertheless the model is not always optimal (e.g.…
A scheme for the implementation of the cluster state model of quantum computing in optical fibers, which enables the feedforward feature, is proposed. This scheme uses the time-bin encoding of qubits. Following previously suggested methods…
We investigate the computational power of creating steady-states of quantum dissipative systems whose evolution is governed by time-independent and local couplings to a memoryless environment. We show that such a model allows for efficient…
We review clustering as an analysis tool and the underlying concepts from an introductory perspective. What is clustering and how can clusterings be realised programmatically? How can data be represented and prepared for a clustering task?…
Quantum Gaussian states can be considered as the majority of the practical quantum states used in quantum communications and more generally in quantum information. Here we consider their properties in relation with the geometrically uniform…
We interpret quantum computing as a geometric evolution process by reformulating finite quantum systems via Connes' noncommutative geometry. In this formulation, quantum states are represented as noncommutative connections, while gauge…
In spite of their evident logical character, particle statistics symmetries are not among the inherently quantum features exploited in quantum computation. A difficulty may be that, being a constant of motion of a unitary evolution, a…
Typical quantum computing schemes require transformations (gates) to be targeted at specific elements (qubits). In many physical systems, direct targeting is difficult to achieve; an alternative is to encode local gates into globally…
We explore the main processes involved in the evolution of general quantum systems by means of Diagrams of States, a novel method to graphically represent and analyze how quantum information is elaborated during computations performed by…
We exhibit a simple procedure to find how classical signals should be processed in cluster-state quantum computation. Using stabilizers characterizing a cluster state, we can easily find a precise classical signal-flow that is required in…
In this paper we are interested to model quantum signal by statistical signal processing methods. The Gaussian distribution has been considered for the input quantum signal as Gaussian state have been proven to a type of important robust…
We present a robust method, based only on measurements, to produce superconducting cluster states. The measurement of the current of a few parallel Josephson-junction qubits realizes a novel type of quantum-state selector. Using this…
Gaussian states are the backbone of quantum information protocols with continuous variable systems, whose power relies fundamentally on the entanglement between the different modes. In the case of global pure states, knowledge of the…
We build a framework allowing for a systematic investigation of the issue: "Which quantum states are universal resources for one-way quantum computation?" We start by re-examining what is exactly meant by "universality" in quantum…
We present a scheme to improve the noise threshold for the fault-tolerant topological one-way computation with a constant overhead. Certain cluster states of finite size, say star clusters, are constructed with logical qubits through an…
We propose a method to efficiently generate cluster states in charge qubits, both semiconducting and superconducting, as well as flux qubits. We show that highly-entangled cluster states can be realized by a `one-touch' entanglement…
We propose a scheme for quantum computing using high-Q cavities in which the qubits are represented by single cavity modes restricted in the space spanned by the two lowest Fock states. We show that single qubit operations and universal…
We present a study of the entanglement properties of Gaussian cluster states, proposed as a universal resource for continuous-variable quantum computing. A central aim is to compare mathematically-idealized cluster states defined using…