اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدFull reconstruction of a 14-qubit state within four hours
362
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Full quantum state tomography (FQST) plays a unique role in the estimation of the state of a quantum system without emph{a priori} knowledge or assumptions. Unfortunately, since FQST requires informationally (over)complete measurements, both the number of measurement bases and the computational complexity of data processing suffer an exponential growth with the size of the quantum system. A 14-qubit entangled state has already been experimentally prepared in an ion trap, and the data processing capability for FQST of a 14-qubit state seems to be far away from practical applications. In this paper, the computational capability of FQST is pushed forward to reconstruct a 14-qubit state with a run time of only 3.35 hours using the linear regression estimation (LRE) algorithm, even when informationally overcomplete Pauli measurements are employed. The computational complexity of the LRE algorithm is first reduced from $O(10^{19})$ to $O(10^{15})$ for a 14-qubit state, by dropping all the zero elements, and its computational efficiency is further sped up by fully exploiting the parallelism of the LRE algorithm with parallel Graphic Processing Unit (GPU) programming. Our result can play an important role in quantum information technologies with large quantum systems.
قيم البحث
اقرأ أيضاً
An experiment is performed to reconstruct an unknown photonic quantum state with a limited amount of copies. A semi-quantum reinforcement learning approach is employed to adapt one qubit state, an agent, to an unknown quantum state, an environment, b
y successive single-shot measurements and feedback, in order to achieve maximum overlap. The experimental learning device herein, composed of a quantum photonics setup, can adjust the corresponding parameters to rotate the agent system based on the measurement outcomes 0 or 1 in the environment (i.e., reward/punishment signals). The results show that, when assisted by such a quantum machine learning technique, fidelities of the deterministic single-photon agent states can achieve over 88% under a proper reward/punishment ratio within 50 iterations. This protocol offers a tool for reconstructing an unknown quantum state when only limited copies are provided, and can also be extended to higher dimensions, multipartite, and mixed quantum state scenarios.
The generalized amplitude damping (GAD) quantum channel implements the interaction between a qubit and an environment with arbitrary temperature and arbitrary interaction time. Here, we implement a photonic version of the GAD for the case of infinite
interaction time (full thermalization). We also show that this quantum channel works as a thermal bath with controlled temperature.
Many-qubit entanglement is crucial for quantum information processing although its exploitation is hindered by the detrimental effects of the environment surrounding the many-qubit system. It is thus of importance to study the dynamics of general mul
tipartite nonclassical correlation, including but not restricted to entanglement, under noise. We did this study for four-qubit GHZ state under most common noises in an experiment and found that nonclassical correlation is more robust than entanglement except when it is imposed to dephasing channel. Quantum discord presents a sudden transition in its dynamics for Pauli-X and Pauli-Y noises as well as Bell-diagonal states interacting with dephasing reservoirs and it decays monotonically for Pauli-Z and isotropic noises.
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 examine the various properties of the three four-qubit monogamy relations, all of which introduce the power factors in the three-way entanglement to reduce the tripartite contributions. On the analytic ground as much as possible we try to find the
minimal power factors, which make the monogamy relations hold if the power factors are larger than the minimal powers. Motivated to the three-qubit monogamy inequality we also examine whether those four-qubit monogamy relations provide the SLOCC-invariant four-way entanglement measures or not. Our analysis indicate that this is impossible provided that the monogamy inequalities are derived merely by introducing weighting power factors.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
