相关论文: Cluster state preparation using gates operating at…
The cluster state model for quantum computation has paved the way for schemes that allow scalable quantum computing, even when using non-deterministic quantum gates. Here the initial step is to prepare a large entangled state using…
We establish bounds to the necessary resource consumption when building up cluster states for one-way computing using probabilistic gates. Emphasis is put on state preparation with linear optical gates, as the probabilistic character is…
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…
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…
The creation of complex entangled states, resources that enable quantum computation, can be achieved via simple 'probabilistic' operations which are individually likely to fail. However, typical proposals exploiting this idea carry a severe…
This article is a short introduction to and review of the cluster-state model of quantum computation, in which coherent quantum information processing is accomplished via a sequence of single-qubit measurements applied to a fixed quantum…
State preparation is a process encoding the classical data into the quantum systems. Based on quantum phase estimation, we propose the specific quantum circuits for a deterministic state preparation algorithm and a probabilistic state…
Quantum state discrimination is a fundamental information processing task that serves as a building block for numerous applications and provides implications at the foundational level. In this work, we consider minimum error discrimination…
In this paper, we propose a novel probabilistic control framework for efficiently controlling an ensemble of quantum systems that can also compensate for the interaction of the systems with the external environment. The main challenge in…
Quantum logic gates can perform calculations much more efficiently than their classical counterparts. However, the level of control needed to obtain a reliable quantum operation is correspondingly higher. In order to evaluate the…
We apply a notion of static renormalization to the preparation of entangled states for quantum computing, exploiting ideas from percolation theory. Such a strategy yields a novel way to cope with the randomness of non-deterministic quantum…
We propose an efficient scheme for constructing arbitrary 2-D cluster states using probabilistic entangling quantum gates.In our scheme, the 2-D cluster state is constructed with star-like basic units generated from 1-D cluster chains.By…
The success probability of a quantum algorithm constructed from noisy quantum gates cannot be accurately predicted from single parameter metrics that compare noisy and ideal gates. We illustrate this concept by examining a system with…
A classical decision tree is completely based on splitting measures, which utilize the occurrence of random events in correspondence to its class labels in order to optimally segregate datasets. However, the splitting measures are based on…
Increasingly sophisticated programmable quantum simulators and quantum computers are opening unprecedented opportunities for exploring and exploiting the properties of highly entangled complex quantum systems. The complexity of large…
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…
It is usually assumed that a quantum computation is performed by applying gates in a specific order. One can relax this assumption by allowing a control quantum system to switch the order in which the gates are applied. This provides a more…
A bit-quantum map relates probabilistic information for Ising spins or classical bits to quantum spins or qubits. Quantum systems are subsystems of classical statistical systems. The Ising spins can represent macroscopic two-level…
Estimating properties of a quantum state is an indispensable task in various applications of quantum information processing. To predict properties in the post-processing stage, it is inherent to first perceive the quantum state with a…
We show the following: a randomly chosen pure state as a resource for measurement-based quantum computation, is - with overwhelming probability - of no greater help to a polynomially bounded classical control computer, than a string of…