English
Related papers

Related papers: Practical Topological Cluster State Quantum Comput…

200 papers

We describe a fault-tolerant version of the one-way quantum computer using a cluster state in three spatial dimensions. Topologically protected quantum gates are realized by choosing appropriate boundary conditions on the cluster. We…

Quantum Physics · Physics 2007-07-24 Robert Raussendorf , Jim Harrington , Kovid Goyal

We describe a fault-tolerant one-way quantum computer on cluster states in three dimensions. The presented scheme uses methods of topological error correction resulting from a link between cluster states and surface codes. The error…

Quantum Physics · Physics 2007-07-24 R. Raussendorf , J. Harrington , K. Goyal

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…

Quantum Physics · Physics 2010-12-30 Keisuke Fujii , Katsuji Yamamoto

Topological error correction--a novel method to actively correct errors based on cluster states with topological properties--has the highest order of tolerable error rates known to date (10^{-2}). Moreover, the scheme requires only…

Scalable quantum computing can only be achieved if qubits are manipulated fault-tolerantly. Topological error correction - a novel method which combines topological quantum computing and quantum error correction - possesses the highest…

In ideal quantum circuits, qubits are tacitly assumed to be uniformly fabricated and operated by prescribed signals. In reality, however, we must cope with different control signals to adjust individual qubits, which requires a large…

Quantum Physics · Physics 2019-10-15 Tetsufumi Tanamoto , Masahito Ueda

Large-scale quantum computation will only be achieved if experimentally implementable quantum error correction procedures are devised that can tolerate experimentally achievable error rates. We describe a quantum error correction procedure…

Quantum Physics · Physics 2011-02-22 David S. Wang , Austin G. Fowler , Lloyd C. L. Hollenberg

Performing entangling gates between physical qubits is necessary for building a large-scale universal quantum computer, but in some physical implementations - for example, those that are based on linear optics or networks of ion traps -…

Quantum Physics · Physics 2018-03-20 James M. Auger , Hussain Anwar , Mercedes Gimeno-Segovia , Thomas M. Stace , Dan E. Browne

We propose a scalable way to construct a 3D cluster state for fault-tolerant topological one-way computation (TOWC) even if the entangling two-qubit gates succeed with a small probability. It is shown that fault-tolerant TOWC can be…

Quantum Physics · Physics 2010-12-23 Keisuke Fujii , Yuuki Tokunaga

The quantum computing scheme described in Phys. Rev. Lett. 98, 190504 (2007), when viewed as a cluster state computation, features a 3-D cluster state, novel adjustable strength error correction capable of correcting general errors through…

Quantum Physics · Physics 2009-07-16 Austin G. Fowler , Kovid Goyal

A promising approach to overcome decoherence in quantum computing schemes is to perform active quantum error correction using topology. Topological subsystem codes incorporate both the benefits of topological and subsystem codes, allowing…

Quantum Physics · Physics 2012-05-15 Ruben S. Andrist , H. Bombin , Helmut G. Katzgraber , M. A. Martin-Delgado

The surface code is a promising candidate for fault-tolerant quantum computation, achieving a high threshold error rate with nearest-neighbor gates in two spatial dimensions. Here, through a series of numerical simulations, we investigate…

Quantum Physics · Physics 2014-02-18 Ashley M. Stephens

The error threshold for fault tolerant quantum computation with concatenated encoding of qubits is penalized by internal communication overhead. Many quantum computation proposals rely on nearest-neighbour communication, which requires…

Quantum Physics · Physics 2007-05-23 T. Szkopek , P. O. Boykin , H. Fan , V. Roychowdhury , E. Yablonovitch , G. Simms , M. Gyure , B. Fong

A novel scheme is presented for fault-tolerant quantum computation based on the cluster model. Some relevant logical cluster states are constructed in concatenation by post-selection through verification, without necessity of recovery…

Quantum Physics · Physics 2010-08-24 Keisuke Fujii , Katsuji Yamamoto

We investigate a scheme of fault-tolerant quantum computation based on the cluster model. Logical qubits are encoded by a suitable code such as the Steane's 7-qubit code. Cluster states of logical qubits are prepared by post-selection…

Quantum Physics · Physics 2007-05-23 Keisuke Fujii , Katsuji Yamamoto

The states needed in a quantum computation are extremely affected by decoherence. Several methods have been proposed to control error spreading. They use two main tools: fault-tolerant constructions and concatenated quantum error correcting…

Quantum Physics · Physics 2007-05-23 Pedro J. Salas , Angel L. Sanz

Quantum information can be protected from decoherence and other errors, but only if these errors are sufficiently rare. For quantum computation to become a scalable technology, practical schemes for quantum error correction that can…

Quantum Physics · Physics 2013-12-13 Ashley M. Stephens , William J. Munro , Kae Nemoto

We introduce a scheme for fault tolerantly dealing with losses (or other "leakage" errors) in cluster state computation that can tolerate up to 50% qubit loss. This is achieved passively using an adaptive strategy of measurement - no…

Quantum Physics · Physics 2007-05-23 Michael Varnava , Daniel E. Browne , Terry Rudolph

It has been known that quantum error correction via concatenated codes can be done with exponentially small failure rate if the error rate for physical qubits is below a certain accuracy threshold. Other, unconcatenated codes with their own…

Quantum Physics · Physics 2008-12-18 Eric Dennis

High-fidelity control of quantum bits is paramount for the reliable execution of quantum algorithms and for achieving fault-tolerance, the ability to correct errors faster than they occur. The central requirement for fault-tolerance is…

‹ Prev 1 2 3 10 Next ›