اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدTopological cluster state quantum computing
106
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 the correction of Z errors only, a threshold error rate approaching 1% and low overhead arbitrarily long-range logical gates. In this work, we review the scheme in detail framing discussion solely in terms of the required 3-D cluster state and its stabilizers.
قيم البحث
اقرأ أيضاً
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 provide equivale
nce transformations for these boundary conditions that can be used to simplify fault-tolerant circuits and to derive circuit identities in a topological manner. The spatial dimensionality of the scheme can be reduced to two by converting one spatial axis of the cluster into time. The error threshold is 0.75% for each source in an error model with preparation, gate, storage and measurement errors. The operational overhead is poly-logarithmic in the circuit size.
We present results illustrating the construction of 3D topological cluster states with coherent state logic. Such a construction would be ideally suited to wave-guide implementations of quantum optical processing. We investigate the use of a ballisti
c CSign gate, showing that given large enough initial cat states, it is possible to build large 3D cluster states. We model X and Z basis measurements by displaced photon number detections and x-quadrature homodyne detections, respectively. We investigate whether teleportation can aid cluster state construction and whether the introduction of located loss errors fits within the topological cluster state framework.
The development of a large scale quantum computer is a highly sought after goal of fundamental research and consequently a highly non-trivial problem. Scalability in quantum information processing is not just a problem of qubit manufacturing and cont
rol but it crucially depends on the ability to adapt advanced techniques in quantum information theory, such as error correction, to the experimental restrictions of assembling qubit arrays into the millions. In this paper we introduce a feasible architectural design for large scale quantum computation in optical systems. We combine the recent developments in topological cluster state computation with the photonic module, a simple chip based device which can be used as a fundamental building block for a large scale computer. The integration of the topological cluster model with this comparatively simple operational element addresses many significant issues in scalable computing and leads to a promising modular architecture with complete integration of active error correction exhibiting high fault-tolerant thresholds.
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 fault-tolerance. Univer
sality is the ability to execute arbitrary multi-input quantum algorithms. Scalability means that computational resources such as logical qubits can be increased without requiring exponential increase in physical resources. Lastly, fault-tolerance is the ability to perform quantum algorithms in presence of imperfections and noise. A promising approach to scalability was demonstrated with the generation of one-million-mode 1-dimensional cluster state, a resource for one-input computation in measurement-based quantum computation (MBQC). The demonstration was based on time-domain multiplexing (TDM) approach using continuous-variable (CV) optical flying qumodes (CV analogue of qubit). Demonstrating universality, however, has been a challenging task for any physical system and approach. Here, we present, for the first time among any physical system, experimental realization of a scalable resource state for universal MBQC: a 2-dimensional cluster state. We also prove the universality and give the methodology for utilizing this state in MBQC. Our state is based on TDM approach that allows unlimited resource generation regardless of the coherence time of the system. As a demonstration of our method, we generate and verify a 2-dimensional cluster state capable of about 5,000 operation steps on 5 inputs.
Read-Rezayi fractional quantum Hall states are among the prime candidates for realizing non-Abelian anyons which in principle can be used for topological quantum computation. We present a prescription for efficiently finding braids which can be used
to carry out a universal set of quantum gates on encoded qubits based on anyons of the Read-Rezayi states with $k>2$, $k eq4$. This work extends previous results which only applied to the case $k = 3$ (Fibonacci) and clarifies why in that case gate constructions are simpler than for a generic Read-Rezayi state.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
