اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدContextuality in Measurement-based Quantum Computation
187
0
0.0
(
0
)
تأليف
Robert Raussendorf
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We show, under natural assumptions for qubit systems, that measurement-based quantum computations (MBQCs) which compute a non-linear Boolean function with high probability are contextual. The class of contextual MBQCs includes an example which is of practical interest and has a super-polynomial speedup over the best known classical algorithm, namely the quantum algorithm that solves the Discrete Log problem.
قيم البحث
اقرأ أيضاً
Quantum computation offers a promising new kind of information processing, where the non-classical features of quantum mechanics can be harnessed and exploited. A number of models of quantum computation exist, including the now well-studied quantum c
ircuit model. Although these models have been shown to be formally equivalent, their underlying elementary concepts and the requirements for their practical realization can differ significantly. The new paradigm of measurement-based quantum computation, where the processing of quantum information takes place by rounds of simple measurements on qubits prepared in a highly entangled state, is particularly exciting in this regard. In this article we discuss a number of recent developments in measurement-based quantum computation in both fundamental and practical issues, in particular regarding the power of quantum computation, the protection against noise (fault tolerance) and steps toward experimental realization. Moreover, we highlight a number of surprising connections between this field and other branches of physics and mathematics.
We describe a scheme of quantum computation with magic states on qubits for which contextuality is a necessary resource possessed by the magic states. More generally, we establish contextuality as a necessary resource for all schemes of quantum compu
tation with magic states on qubits that satisfy three simple postulates. Furthermore, we identify stringent consistency conditions on such computational schemes, revealing the general structure by which negativity of Wigner functions, hardness of classical simulation of the computation, and contextuality are connected.
In this letter we generalize Spekkens notion of measurement non-contextuality (NC). We show that any non-contextual ontological model based on this notion of contextuality fails to explain the statistics of outcomes of a single carefully constructed
POVM executed sequentially on a quantum system. The POVM essentially forms a single measurement device. The context of measurement arises from the different configurations in which the device can be used. We develop an inequality from the non-contextual ontic model, and construct corresponding quantum situations where the measurement outcomes from the device violate this NC inequality. Our work brings out the hitherto unexplored implications of contextuality for a single measurement device, and paves the way for further study of consequences of contextuality for sequential measurements.
Measurement-based quantum computation (MBQC) represents a powerful and flexible framework for quantum information processing, based on the notion of entangled quantum states as computational resources. The most prominent application is the one-way qu
antum computer, with the cluster state as its universal resource. Here we demonstrate the principles of MBQC using deterministically generated graph states of up to 7 qubits, in a system of trapped atomic ions. Firstly we implement a universal set of operations for quantum computing. Secondly we demonstrate a family of measurement-based quantum error correction codes, and show their improved performance as the code length is increased. We show that all our graph states violate a multipartite Bell inequality and are therefore capable of information processing tasks that cannot be described by a local hidden variable model. The methods presented can directly be scaled up to generate graph states of several tens of qubits.
Certain physical systems that one might consider for fault-tolerant quantum computing where qubits do not readily interact, for instance photons, are better suited for measurement-based quantum-computational protocols. Here we propose a measurement-b
ased model for universal quantum computation that simulates the braiding and fusion of Majorana modes. To derive our model we develop a general framework that maps any scheme of fault-tolerant quantum computation with stabilizer codes into the measurement-based picture. As such, our framework gives an explicit way of producing fault-tolerant models of universal quantum computation with linear optics using protocols developed using the stabilizer formalism. Given the remarkable fault-tolerant properties that Majorana modes promise, the main example we present offers a robust and resource efficient proposal for photonic quantum computation.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
