اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum state reduction for universal measurement based computation
159
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Measurement based quantum computation (MBQC), which requires only single particle measurements on a universal resource state to achieve the full power of quantum computing, has been recognized as one of the most promising models for the physical realization of quantum computers. Despite considerable progress in the last decade, it remains a great challenge to search for new universal resource states with naturally occurring Hamiltonians, and to better understand the entanglement structure of these kinds of states. Here we show that most of the resource states currently known can be reduced to the cluster state, the first known universal resource state, via adaptive local measurements at a constant cost. This new quantum state reduction scheme provides simpler proofs of universality of resource states and opens up plenty of space to the search of new resource states, including an example based on the one-parameter deformation of the AKLT state studied in [Commun. Math. Phys. 144, 443 (1992)] by M. Fannes et al. about twenty years ago.
قيم البحث
اقرأ أيضاً
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.
Blind quantum computation (BQC) enables a client with less quantum computational ability to delegate her quantum computation to a server with strong quantum computational power while preserving the clients privacy. Generally, many-qubit entangled sta
tes are often used to complete BQC tasks. But for a large-scale entangled state, it is difficult to be described since its Hilbert space dimension is increasing exponentially. Furthermore, the number of entangled qubits is limited in experiment of existing works. To tackle this problem, in this paper we propose a universal BQC protocol based on measurement with minor resources, where the trap technology is adopted to verify correctness of the servers measurement outcomes during computation and testing process. In our model there are two participants, a client who prepares initial single-qubit states and a server that performs universal quantum computation. The client is almost classical since she does not require any quantum computational power, quantum memory. To realize the clients universal BQC, we construct an $mtimes n$ latticed state composed of six-qubit cluster states and eight-qubit cluster states, which needs less qubits than the brickwork state. Finally, we analyze and prove the blindness, correctness, universality and verifiability of our proposed BQC protocol.
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.
Blind quantum computation (BQC) allows that a client who has limited quantum abilities can delegate quantum computation to a server who has advanced quantum technologies but learns nothing about the clients private information. For example, measureme
nt-based model can guarantee privacy of clients inputs, quantum algorithms and outputs. However, it still remains a challenge to directly encrypt quantum algorithms in circuits model. To solve the problem, we propose GTUBQC, the first gate teleportation-based universal BQC protocol. Specifically, in this paper we consider a scenario where there are a trusted center responsible for preparing initial states, a client with the ability to perform X, Z, and two non-communicating servers conducting UBQC (universal BQC) and Bell measurements. GTUBQC ensures that all quantum outputs are at the clients side and the client only needs to detect whether servers honestly return correct measurement outcomes or not. In particular, GTUBQC can hide the universal quantum gates by encrypting the rotation angles, because arbitrary unitary operation can be decomposed into a combination of arbitrary rotation operators. Also, GTUBQC protocol can facilitate realizing UBQC in circuits, since GTUBQC uses one-time-pad to guarantee blindness. We prove the blindness and correctness of GTUBQC, and apply our approach to other types of computational tasks, such as quantum Fourier transform.
A set of stabilizer operations augmented by some special initial states known as magic states, gives the possibility of universal fault-tolerant quantum computation. However, magic state preparation inevitably involves nonideal operations that introd
uce noise. The most common method to eliminate the noise is magic state distillation (MSD) by stabilizer operations. Here we propose a hybrid MSD protocol by connecting a four-qubit H-type MSD with a five-qubit T-type MSD, in order to overcome some disadvantages of the previous MSD protocols. The hybrid MSD protocol further integrates distillable ranges of different existing MSD protocols and extends the T-type distillable range to the stabilizer octahedron edges. And it provides considerable improvement in qubit cost for almost all of the distillable range. Moreover, we experimentally demonstrate the four-qubit H-type MSD protocol using nuclear magnetic resonance technology, together with the previous five-qubit MSD experiment, to show the feasibility of the hybrid MSD protocol.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
