اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدOne-way quantum computation with two-photon multiqubit cluster states
79
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We describe in detail the application of four qubit cluster states, built on the simultaneous entanglement of two photons in the degrees of freedom of polarization and linear momentum, for the realization of a complete set of basic one-way quantum computation operations. These consist of arbitrary single qubit rotations, either probabilistic or deterministic, and simple two qubit gates, such as a c-not gate for equatorial qubits and a universal c-phase (CZ) gate acting on arbitrary target qubits. Other basic computation operations, such as the Grovers search and the Deutschs algorithms, have been realized by using these states. In all the cases we obtained a high value of the operation fidelities. These results demonstrate that cluster states of two photons entangled in many degrees of freedom are good candidates for the realization of more complex quantum computation operations based on a larger number of qubits.
قيم البحث
اقرأ أيضاً
We report an experimental realization of one-way quantum computing on a two-photon four-qubit cluster state. This is accomplished by developing a two-photon cluster state source entangled both in polarization and spatial modes. With this special sour
ce, we implemented a highly efficient Grovers search algorithm and high-fidelity two qubits quantum gates. Our experiment demonstrates that such cluster states could serve as an ideal source and a building block for rapid and precise optical quantum computation.
General solutions to the quantum Rabi model involve subspaces with unbounded number of photons. However, for the multiqubit multimode case, we find special solutions with at most one photon for arbitrary number of qubits and photon modes. Unlike the
Juddian solution, ours exists for arbitrary single qubit-photon coupling strength with constant eigenenergy. This corresponds to a horizontal line in the spectrum, while still being a qubit-photon entangled state. As a possible application, we propose an adiabatic scheme for the fast generation of arbitrary single-photon multimode W states with nonadiabatic error less than 1%. Finally, we propose a superconducting circuit design, showing the experimental feasibility of the multimode multiqubit Rabi model.
We describe a generalization of the cluster-state model of quantum computation to continuous-variable systems, along with a proposal for an optical implementation using squeezed-light sources, linear optics, and homodyne detection. For universal quan
tum computation, a nonlinear element is required. This can be satisfied by adding to the toolbox any single-mode non-Gaussian measurement, while the initial cluster state itself remains Gaussian. Homodyne detection alone suffices to perform an arbitrary multi-mode Gaussian transformation via the cluster state. We also propose an experiment to demonstrate cluster-based error reduction when implementing Gaussian operations.
We propose and demonstrate the scaling up of photonic graph state through path qubit fusion. Two path qubits from separate two-photon four-qubit states are fused to generate a two-dimensional seven-qubit graph state composed of polarization and path
qubits. Genuine seven-qubit entanglement is verified by evaluating the witness operator. Six qubits from the graph state are used to execute the general two-qubit Deutsch-Jozsa algorithm with a success probability greater than 90%.
We prove that quantum-hard one-way functions imply simulation-secure quantum oblivious transfer (QOT), which is known to suffice for secure computation of arbitrary quantum functionalities. Furthermore, our construction only makes black-box use of th
e quantum-hard one-way function. Our primary technical contribution is a construction of extractable and equivocal quantum bit commitments based on the black-box use of quantum-hard one-way functions in the standard model. Instantiating the Crepeau-Kilian (FOCS 1988) framework with these commitments yields simulation-secure QOT.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
