Related papers: Imperfect Construction of Microclusters
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…
Quantum computing using two optical coherent states as qubit basis states has been suggested as an interesting alternative to single photon optical quantum computing with lower physical resource overheads. These proposals have been…
The schemes for fault-tolerant postselected quantum computation given in [Knill, Fault-Tolerant Postselected Quantum Computation: Schemes, http://arxiv.org/abs/quant-ph/0402171] are analyzed to determine their error-tolerance. The analysis…
Quantum computation promises applications that are thought to be impossible with classical computation. To realize practical quantum computation, the following three properties will be necessary: universality, scalability, and…
Measurement-based Quantum Computation(MBQC) utilize entanglement as resource for performing quantum computation. Generating cluster state using entanglement as resource is a key bottleneck for the adoption of MBQC. To generate cluster state…
In order to use quantum error-correcting codes to actually improve the performance of a quantum computer, it is necessary to be able to perform operations fault-tolerantly on encoded states. I present a general theory of fault-tolerant…
Understanding fault-tolerant properties of quantum circuits is important for the design of large-scale quantum information processors. In particular, simulating properties of encoded circuits is a crucial tool for investigating the…
Quantum error-correcting codes, such as subspace, subsystem, and Floquet codes, are typically constructed within the stabilizer formalism, which does not fully capture the idea of fault-tolerance needed for practical quantum computing…
An entangled state is said to be $m$-uniform if the reduced density matrix of any $m$ qubits is maximally mixed. This is intimately linked to pure quantum error correction codes (QECCs), which allow not only to correct errors, but also to…
The usefulness of solid-state spins in quantum technologies depends on how long they can remain in a coherent superposition of quantum states. This Colloquium discusses how first-principles simulations can predict spin dynamics for…
The performance (accuracy and robustness) of several clustering algorithms is studied for linearly dependent random variables in the presence of noise. It turns out that the error percentage quickly increases when the number of observations…
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,…
Constructing a fault-tolerant quantum computer is a daunting task. Given any design, it is possible to determine the maximum error rate of each type of component that can be tolerated while still permitting arbitrarily large-scale quantum…
Robust quantum computation requires encoding delicate quantum information into degrees of freedom that are hard for the environment to change. Quantum encodings have been demonstrated in many physical systems by observing and correcting…
A quantum operating system (QCOS) is a classic software running on classic hardware. The QCOS is preparing, starting, controlling and managing quantum computations. The reliable execution of fault-tolerant quantum computations will require…
Recent advances in quantum error-correction (QEC) have shown that it is often beneficial to understand fault-tolerance as a dynamical process, a circuit with redundant measurements that help correct errors, rather than as a static code…
Fault-tolerant measurement-based quantum computing (MBQC) provides a compelling framework for fault-tolerant quantum computation, in which quantum information is processed through single-qubit measurements on a three-dimensional entangled…
The computational power of real-world quantum computers is limited by errors. When using quantum computers to perform algorithms which cannot be efficiently simulated classically, it is important to quantify the accuracy with which the…
In this paper, we estimate the errors of Gaussian transformations implemented using one-way quantum computations on cluster states of various configurations. From all possible cluster state configurations, we choose those that give the…
The design and optimization of realistic architectures for fault-tolerant quantum computation requires error models that are both reliable and amenable to large-scale classical simulation. Perhaps the simplest and most practical…