相关论文: Fault-tolerant quantum computation with cluster st…

A class of architectures is advanced for cluster state quantum computation using quantum dots. These architectures include using single and multiple dots as logical qubits. Special attention is given to the supercoherent qubits introduced…

An arbitrarily reliable quantum computer can be efficiently constructed from noisy components using a recursive simulation procedure, provided that those components fail with probability less than the fault-tolerance threshold. Recent…

A major challenge in practical quantum computation is the ineludible errors caused by the interaction of quantum systems with their environment. Fault-tolerant schemes, in which logical qubits are encoded by several physical qubits, enable…

We propose a complete, quantitative quantum computing system which satisfies the five DiVincenzo criteria. The model is based on magnetic clusters with uniaxial anisotropy, where standard, two-state qubits are formed utilizing the two…

With the intense interest in small, noisy quantum computing devices comes the push for larger, more accurate -- and hence more useful -- quantum computers. While fully fault-tolerant quantum computers are, in principle, capable of achieving…

We provide an analysis of basic quantum information processing protocols under the effect of intrinsic non-idealities in cluster states. These non-idealities are based on the introduction of randomness in the entangling steps that create…

Today ion traps are among the most promising physical systems for constructing a quantum device harnessing the computing power inherent in the laws of quantum physics. The standard circuit model of quantum computing requires a universal set…

Usual scenarios of fault-tolerant computation are concerned with the fault-tolerant realization of quantum algorithms that compute classical functions, such as Shor's algorithm for factoring. In particular, this means that input and output…

Fault-tolerant quantum computation is a technique that is necessary to build a scalable quantum computer from noisy physical building blocks. Key for the implementation of fault-tolerant computations is the ability to perform a universal…

We introduce a novel scheme for one-way quantum computing (QC) based on the use of information encoded qubits in an effective cluster state resource. With the correct encoding structure, we show that it is possible to protect the entangled…

We assess the effects of an intrinsic model for imperfections in cluster states by introducing {\it noisy cluster states} and characterizing their role in the one-way model for quantum computation. The action of individual dephasing…

A quantum computer -- i.e., a computer capable of manipulating data in quantum superposition -- would find applications including factoring, quantum simulation and tests of basic quantum theory. Since quantum superpositions are fragile, the…

The paradigm of measurement-based quantum computation opens new experimental avenues to realize a quantum computer and deepens our understanding of quantum physics. Measurement-based quantum computation starts from a highly entangled…

One-way quantum computation, also known as Cluster State Quantum Computation, provides a robust and efficient tool to perform universal quantum computation using only single-qubit projective measurements, given a highly entangled cluster…

The integration of diverse quantum resources and the exploitation of more degrees of freedom provide key operational flexibility for universal fault-tolerant quantum computation. In this work, we propose a flexible…

We show that thresholds for fault-tolerant quantum computation are solely determined by the quality of single-system operations if one allows for d-dimensional systems with $8 \leq d \leq 32$. Each system serves to store one logical qubit…

The so-called "threshold" theorem says that, once the error rate per qubit per gate is below a certain value, indefinitely long quantum computation becomes feasible, even if all of the qubits involved are subject to relaxation processes,…

We consider the problem of fault tolerance in the graph-state model of quantum computation. Using the notion of composable simulations, we provide a simple proof for the existence of an accuracy threshold for graph-state computation by…

Recent research has demonstrated that quantum computers can solve certain types of problems substantially faster than the known classical algorithms. These problems include factoring integers and certain physics simulations. Practical…

We propose an all-linear-optical scheme to ballistically generate a cluster state for measurement-based topological fault-tolerant quantum computation using hybrid photonic qubits entangled in a continuous-discrete domain. Availability of…