English
Related papers

Related papers: Practical Topological Cluster State Quantum Comput…

200 papers

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…

Quantum Physics · Physics 2020-08-12 S. Omkar , Y. S. Teo , H. Jeong

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…

Quantum Physics · Physics 2009-11-11 L. -M. Duan , R. Raussendorf

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…

Quantum Physics · Physics 2008-02-03 Dorit Aharonov , Michael Ben-Or

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…

Quantum Physics · Physics 2013-12-17 Joshua M. Waddington , Joshua A. Kettlewell , Pieter Kok

Many proposals for quantum information processing are subject to detectable loss errors. In this paper, we show that topological error correcting codes, which protect against computational errors, are also extremely robust against losses.…

Quantum Physics · Physics 2015-05-13 Thomas M. Stace , Sean D. Barrett , Andrew C. Doherty

A new way of addressing loss errors is introduced which combines ideas from measurement-based quantum computation and concatenated quantum codes, allowing for universal quantum computation. It is shown that for the case where leakage is…

Quantum Physics · Physics 2015-03-20 David A. Herrera-Martí , Terry Rudolph

In principle a 1D array of nearest-neighbour linked qubits is compatible with fault tolerant quantum computing. However such a restricted topology necessitates a large overhead for shuffling qubits and consequently the fault tolerance…

Quantum Physics · Physics 2018-06-12 Ying Li , Simon C. Benjamin

In this paper, we place bounds on when it is impossible to purify a noisy two-qubit state if all the gates used in the purification protocol are subject to adversarial local, independent, noise. It is found that the gate operations must be…

Quantum Physics · Physics 2008-05-20 Alastair Kay

Topological measurement-based quantum computation (MBQC) enables one to carry out universal fault-tolerant quantum computation via single-qubit Pauli measurements with a family of large entangled states called cluster states as resources.…

Quantum Physics · Physics 2022-01-06 Seok-Hyung Lee , Hyunseok Jeong

Estimates of the quantum accuracy threshold often tacitly assume that it is possible to interact arbitrary pairs of qubits in a quantum computer with a failure rate that is independent of the distance between them. None of the many physical…

Quantum Physics · Physics 2013-05-29 A. M. Stephens , Z. W. E. Evans

One of the main problems for the future of practical quantum computing is to stabilize the computation against unwanted interactions with the environment and imperfections in the applied operations. Existing proposals for quantum memories…

Quantum Physics · Physics 2007-05-23 Emanuel Knill , Raymond Laflamme

The surface code scheme for quantum computation features a 2d array of nearest-neighbor coupled qubits yet claims a threshold error rate approaching 1% (NJoP 9:199, 2007). This result was obtained for the toric code, from which the surface…

Quantum Physics · Physics 2014-11-18 D. S. Wang , A. G. Fowler , A. M. Stephens , L. C. L. Hollenberg

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;…

Quantum Physics · Physics 2013-05-29 Ying Li , Sean D. Barrett , Thomas M. Stace , Simon C. Benjamin

The usual scenario in fault tolerant quantum computation involves certain amount of qubits encoded in each code block, transversal operations between them and destructive measurements of ancillary code blocks. We introduce a new approach in…

Quantum Physics · Physics 2015-05-13 H. Bombin , M. A. Martin-Delgado

Measurement based quantum computation requires the generation of a cluster state (quantum resource) prior to starting a computation. Generation of this entangled state can be difficult with many schemes already proposed. We present an…

Quantum Physics · Physics 2015-03-17 Neil B. Lovett , Benjamin T. H. Varcoe

Many physical systems considered promising qubit candidates are not, in fact, two-level systems. Such systems can leak out of the preferred computational states, leading to errors on any qubits that interact with leaked qubits. Without…

Quantum Physics · Physics 2013-10-09 Austin G. Fowler

We investigate a scheme for topological quantum computing using optical hybrid qubits and make an extensive comparison with previous all-optical schemes. We show that the photon loss threshold reported by Omkar {\it et al}. [Phys. Rev.…

Quantum Physics · Physics 2021-03-17 S. Omkar , Y. S. Teo , Seung-Woo Lee , H. Jeong

Measurement-based quantum computing is an alternative paradigm to the circuit-based model. This approach can be advantageous in certain scenarios, such as when read-out is fast and accurate, but two-qubit gates realized via inter-particle…

Quantum Physics · Physics 2021-11-16 Zhangjie Qin , Woo-Ram Lee , Brian DeMarco , Bryce Gadway , Svetlana Kotochigova , V. W. Scarola

We establish and explore a new connection between quantum information theory and classical statistical mechanics by studying the problem of qubit losses in 2D topological color codes. We introduce a protocol to cope with qubit losses, which…

Quantum Physics · Physics 2018-08-15 D. Vodola , D. Amaro , M. A. Martin-Delgado , M. Müller

We study how heralded qubit losses during the preparation of a two-dimensional cluster state, a universal resource state for one-way quantum computation, affect its computational power. Above the percolation threshold we present a…