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

Time-Domain Multiplexed 2-Dimensional Cluster State: Universal Quantum Computing Platform

174   0   0.0 ( 0 )
 نشر من قبل Warit Asavanant
 تاريخ النشر 2019
  مجال البحث فيزياء
والبحث باللغة English




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

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. Universality 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.


قيم البحث

اقرأ أيضاً

79 - Daniel Nagaj 2010
We present a Hamiltonian quantum computation scheme universal for quantum computation (BQP). Our Hamiltonian is a sum of a polynomial number (in the number of gates L in the quantum circuit) of time-independent, constant-norm, 2-local qubit-qubit int eraction terms. Furthermore, each qubit in the system interacts only with a constant number of other qubits. The computer runs in three steps - starts in a simple initial product-state, evolves it for time of order L^2 (up to logarithmic factors) and wraps up with a two-qubit measurement. Our model differs from the previous universal 2-local Hamiltonian constructions in that it does not use perturbation gadgets, does not need large energy penalties in the Hamiltonian and does not need to run slowly to ensure adiabatic evolution.
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 correc tion 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.
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.
Cluster states, a type of highly entangled state, are essential resources for quantum information processing. Here we demonstrated the generation of a time-domain linear cluster state (t-LCS) using a superconducting quantum circuit consisting of only two transmon qubits. By recycling the physical qubits, the t-LCS equivalent up to four physical qubits was validated by quantum state tomography with fidelity of 59%. We further confirmed the true generation of t-LCS by examining the expectation value of an entanglement witness. Our demonstrated protocol of t-LCS generation allows efficient use of physical qubits which could lead to resource-efficient execution of quantum circuits on large scale.
We introduce a simple yet versatile protocol to inverse engineer the time-dependent Hamiltonian in two- and three level systems. In the protocol, by utilizing a universal SU(2) transformation, a given speedup goal can be obtained with large freedom t o select the control parameters. As an illustration example, the protocol is applied to perform population transfer between nitrogen-vacancy (NV) centers in diamond. Numerical simulation shows that the speed of the present protocol is fast compared with that of the adiabatic process. Moreover, the protocol is also tolerant to decoherence and experimental parameter fluctuations. Therefore, the protocol may be useful for designing an experimental feasible Hamiltonian to engineer a quantum system.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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