اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدExperimental Implementation of Efficient Quantum Pseudorandomness on a 12-spin System
52
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum pseudorandomness, also known as unitary designs, comprise a powerful resource for quantum computation and quantum engineering. While it is known in theory that pseudorandom unitary operators can be constructed efficiently, realizing these objects in realistic physical systems can be a challenging task. In this work, we study quantum pseudorandomness generation on a 12-spin nuclear magnetic resonance system. The experimental process is based on the recently proposed design Hamiltonian approach, which has the merit of being significantly more efficient than previous protocols. By applying random refocusing sequences to the experimental system we create a design Hamiltonian the dynamics of which quickly forms unitary designs. We then use multiple-quantum techniques to measure spreading of quantum coherences over systems degrees of freedom, and so to probe the growth of quantum pseudorandomness. The measured multiple-quantum coherence spectra indicate that substantial quantum pseudorandomness have been achieved.
قيم البحث
اقرأ أيضاً
Quantum adiabatic passages can be greatly accelerated by a suitable control field, called a counter-diabatic field, which varies during the scan through resonance. Here, we implement this technique on the electron spin of a single nitrogen-vacancy center in diamond. We demonstrate t
Using nuclear magnetic resonance (NMR) techniques with three-qubit sample, we have experimentally implemented the highly structured algorithm for the 1-SAT problem proposed by Hogg. A simplified temporal averaging procedure was employed to the three-
qubit spin pseudo-pure state. The algorithm was completed with only a single evaluation of structure of the problem and the solutions were found with probability 100%, which outperform both unstructured quantum and the best classical search algorithm.
In this letter, we present an experimental benchmark of operational control methods in quantum information processors extended up to 12 qubits. We implement universal control of this large Hilbert space using two complementary approaches and discuss
their accuracy and scalability. Despite decoherence, we were able to reach a 12-coherence state (or 12-qubits pseudo-pure cat state), and decode it into an 11 qubit plus one qutrit labeled observable pseudo-pure state using liquid state nuclear magnetic resonance quantum information processors.
The depolarizing quantum operation plays an important role in studying the quantum noise effect and implementing general quantum operations. In this work, we report a scheme which implements a fully controllable input-state independent depolarizing q
uantum operation for a photonic polarization qubit.
We construct a quantum oracle relative to which $mathsf{BQP} = mathsf{QMA}$ but cryptographic pseudorandom quantum states and pseudorandom unitary transformations exist, a counterintuitive result in light of the fact that pseudorandom states can be b
roken by quantum Merlin-Arthur adversaries. We explain how this nuance arises as the result of a distinction between algorithms that operate on quantum and classical inputs. On the other hand, we show that some computational complexity assumption is needed to construct pseudorandom states, by proving that pseudorandom states do not exist if $mathsf{BQP} = mathsf{PP}$. We discuss implications of these results for cryptography, complexity theory, and quantum tomography.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
