اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAny non-affine one-to-one binary gate suffices for computation
50
0
0.0
(
0
)
تأليف
Seth Lloyd
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Any non-affine one-to-one binary gate can be wired together with suitable inputs to give AND, OR, NOT and fan-out gates, and so suffices to construct a general-purpose computer.
قيم البحث
اقرأ أيضاً
We propose a one-step scheme to implement a multiqubit controlled phase gate of one qubit simultaneously controlling multiple qubits with three-level atoms at distant nodes in coupled cavity arrays. The selective qubit-qubit couplings are achieved by
adiabatically eliminating the atomic excited states and photonic states and the required phase shifts between the control qubit and any target qubit can be realized through suitable choices of the parameters of the external fields. Moreover, the effective model is robust against decoherence because neither the atoms nor the field modes during the gate operation are excited, leading to a useful step toward scalable quantum computing networks.
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 co
mputation 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 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.
We consider the problem of $1$-sided device-independent self-testing of any pure entangled two-qubit state based on steering inequalities which certify the presence of quantum steering. In particular, we note that in the $2-2-2$ steering scenario (in
volving $2$ parties, $2$ measurement settings per party, $2$ outcomes per measurement setting), the maximal violation of a fine-grained steering inequality can be used to witness certain extremal steerable correlations, which certify all pure two-qubit entangled states. We demonstrate that the violation of analogous CHSH inequality of steering or nonvanishing value of a quantity constructed using a correlation function called mutual predictability together with the maximal violation of fine-grained steering inequality can be used to self-test any pure entangled two-qubit state in a $1$-sided device-independent way.
Compared with the idea of universal quantum computation, a direct synthesis of a multiqubit logic gate can greatly improve the efficiency of quantum information processing tasks. Here we propose an efficient scheme to implement a three-qubit controll
ed-not (Toffoli) gate of neutral atoms based on unconventional Rydberg pumping. By adjusting the strengths of Rabi frequencies of driving fields, the Toffoli gate can be achieved within one step, which is also insensitive to the fluctuation of the Rydberg-Rydberg interaction. Considering different atom alignments, we can obtain a high-fidelity Toffoli gate at the same operation time $sim 7~mu s$. In addition, our scheme can be further extended to the four-qubit case without altering the operating time.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
