ترغب بنشر مسار تعليمي؟ اضغط هنا

Universal computation by quantum walk

120   0   0.0 ( 0 )
 نشر من قبل Andrew M. Childs
 تاريخ النشر 2008
  مجال البحث فيزياء
والبحث باللغة English
 تأليف Andrew M. Childs




اسأل ChatGPT حول البحث

In some of the earliest work on quantum mechanical computers, Feynman showed how to implement universal quantum computation by the dynamics of a time-independent Hamiltonian. I show that this remains possible even if the Hamiltonian is restricted to be a sparse matrix with all entries equal to 0 or 1, i.e., the adjacency matrix of a low-degree graph. Thus quantum walk can be regarded as a universal computational primitive, with any desired quantum computation encoded entirely in some underlying graph. The main idea of the construction is to implement quantum gates by scattering processes.



قيم البحث

اقرأ أيضاً

The universal quantum computation model based on quantum walk by Childs has opened the door for a new way of studying the limitations and advantages of quantum computation, as well as for its intermediate-term simulation. In recent years, the growing interest in noisy intermediate-scale quantum computers (NISQ) has lead to intense efforts being directed at understanding the computational advantages of open quantum systems. In this work, we extend the quantum walk model to open noisy systems in order to provide such a tool for the study of NISQ computers. Our method does not use explicit purification, and allows to ignore the environment degrees of freedom and get direct and much more efficient access to the entanglement properties of the system. In our representation, the quantum walk amplitudes represent elements in a density matrix rather than the wavefunction of a pure state. Despite the non-trivial manifestation of the normalization requirement in this setting, we model the application of general unitary gates and nonunitary channels, with an explicit implementation protocol for channels that are commonly used in noise models.
We show that braidings of the metaplectic anyons $X_epsilon$ in $SO(3)_2=SU(2)_4$ with their total charge equal to the metaplectic mode $Y$ supplemented with measurements of the total charge of two metaplectic anyons are universal for quantum computa tion. We conjecture that similar universal computing models can be constructed for all metaplectic anyon systems $SO(p)_2$ for any odd prime $pgeq 5$. In order to prove universality, we find new conceptually appealing universal gate sets for qutrits and qupits.
Quantum walk has been regarded as a primitive to universal quantum computation. By using the operations required to describe the single particle discrete-time quantum walk on a position space we demonstrate the realization of the universal set of qua ntum gates on two- and three-qubit systems. The idea is to utilize the effective Hilbert space of the single qubit and the position space on which it evolves in order to realize multi-qubit states and universal set of quantum gates on them. Realization of many non-trivial gates and engineering arbitrary states is simpler in the proposed quantum walk model when compared to the circuit based model of computation. We will also discuss the scalability of the model and some propositions for using lesser number of qubits in realizing larger qubit systems.
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.
Harnessing non-abelian statistics of anyons to perform quantum computational tasks is getting closer to reality. While the existence of universal anyons by braiding alone such as the Fibonacci anyon is theoretically a possibility, accessible anyons w ith current technology all belong to a class that is called weakly integral---anyons whose squared quantum dimensions are integers. We analyze the computational power of the first non-abelian anyon system with only integral quantum dimensions---$D(S_3)$, the quantum double of $S_3$. Since all anyons in $D(S_3)$ have finite images of braid group representations, they cannot be universal for quantum computation by braiding alone. Based on our knowledge of the images of the braid group representations, we set up three qutrit computational models. Supplementing braidings with some measurements and ancillary states, we find a universal gate set for each model.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا