相关论文: Fault-tolerant linear optics quantum computation b…

Photonic quantum computers use the bosonic statistics of photons to construct, through quantum interference, the large entangled states required for measurement-based quantum computation. Therefore, any which-way information present in the…

We present a scheme which offers a significant reduction in the resources required to implement linear optics quantum computing. The scheme is a variation of the proposal of Knill, Laflamme, and Milburn, and makes use of an incremental…

We present a theoretical framework for state-adaptive quantum error correction that bridges the gap between quantum computing and error correction paradigms. By incorporating knowledge of quantum states into the error correction process, we…

Color code is a promising topological code for fault-tolerant quantum computing. Insufficient research on the color code has delayed its practical application. In this work, we address several key issues to facilitate practical…

Blind quantum computation is an appealing use of quantum information technology because it can conceal both the client's data and the algorithm itself from the server. However, problems need to be solved in the practical use of blind…

In this thesis we examine a variety of techniques for reducing the resources required for fault-tolerant quantum computation. First, we show how to simplify universal encoded computation by using only transversal gates and standard error…

Error-correction process has to be carried out periodically to prevent accumulation of errors in fault-tolerant quantum computation. It is believed that the best choice to get maximum threshold value is carrying out an error-correction…

As information carriers in quantum computing, photonic qubits have the advantage of undergoing negligible decoherence. However, the absence of any significant photon-photon interaction is problematic for the realization of non-trivial…

We introduce a scheme for linear optics quantum computation, that makes no use of teleported gates, and requires stable interferometry over only the coherence length of the photons. We achieve a much greater degree of efficiency and a…

We propose a novel architecture for fault-tolerant quantum computing that incorporates strong single-photon nonlinearities into a photonic GHZ-measurement-based architecture. The nonlinearities substantially reduce resource overheads…

We present a scheme of fault-tolerant quantum computation for a local architecture in two spatial dimensions. The error threshold is 0.75% for each source in an error model with preparation, gate, storage and measurement errors.

We exhibit a simple, systematic procedure for detecting and correcting errors using any of the recently reported quantum error-correcting codes. The procedure is shown explicitly for a code in which one qubit is mapped into five. The…

Fusion-based quantum computing is an attractive model for fault-tolerant computation based on photonics requiring only finite-sized entangled resource states followed by linear-optics operations and photon measurements. Large-scale…

Recently Shor showed how to perform fault tolerant quantum computation when the error probability is logarithmically small. We improve this bound and describe fault tolerant quantum computation when the error probability is smaller than…

Knill, Laflamme, and Milburn [Nature 409, 46 (2001)] have shown that quantum logic operations can be performed using linear optical elements and additional ancilla photons. Their approach is probabilistic in the sense that the logic devices…

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…

This paper reports on experiments realized on several IBM 5Q chips which show evidence for the advantage of using error detection and fault-tolerant design of quantum circuits. We show an average improvement of the task of sampling from…

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…

Quantum computation must be performed in a fault-tolerant manner to be realizable in practice. Recent progress has uncovered quantum error-correcting codes with sparse connectivity requirements and constant qubit overhead. Existing schemes…

In certain approaches to quantum computing the operations between qubits are non-deterministic and likely to fail. For example, a distributed quantum processor would achieve scalability by networking together many small components;…