اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدEffective Simulation of Quantum Entanglement using Classical Fields Modulated with Pseudorandom Phase Sequences
96
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
An effective simulation of quantum entanglement is presented using classical fields modulated with n pseudorandom phase sequences (PPSs) that constitute a n2^n-dimensional Hilbert space with a tensor product structure. Applications to classical fields are examplied by effective simulation of both Bell and GHZ states, and a correlation analysis was performed to characterize the simulation. Results that strictly comply with criteria of quantum entanglement were obtained and the approach was also shown to be applicable to a system consisting of n quantum particles.
قيم البحث
اقرأ أيضاً
We demonstrate that a tensor product structure and optical analogy of quantum entanglement can be obtained by introducing pseudorandom phase sequences into classical fields with two orthogonal modes. Using the classical analogy, we discuss efficient
simulation of several typical quantum states, including product state, Bell states, GHZ state, and W state. By performing quadrature demodulation scheme, we propose a sequence permutation mechanism to simulate certain quantum states and a generalized gate array model to simulate quantum algorithm, such as Shors algorithm and Grovers algorithm. The research on classical simulation of quantum states is important, for it not only enables potential beyond quantum computation, but also provides useful insights into fundamental concepts of quantum mechanics.
We propose an optical parallel computation similar to quantum computation that can be realized by introducing pseudorandom phase sequences into classical optical fields with two orthogonal modes. Based on the pseudorandom phase sequences, we first pr
opose a theoretical framework of phase ensemble model referring from the concept of quantum ensemble. Using the ensemble model, we further demonstrate the inseparability of the fields similar to quantum entanglement. It is interesting that a N2^N dimensional Hilbert space spanned by N optical fields is larger than that spanned by N quantum particles. This leads a problem for our scheme that is not the lack of resources but the redundancy of resources. In order to reduce the redundancy, we propose a special sequence permutation mechanism to efficiently imitate certain quantum states, including the product state, Bell states, GHZ state and W state. For better fault tolerance, we further devise each orthogonal mode of optical fields is measured to assign discrete values. Finally, we propose a generalized gate array model to imitate some quantum algorithms, such as Shors algorithm, Grovers algorithm and quantum Fourier algorithm. The research on the optical parallel computation might be important, for it not only has the potential beyond quantum computation, but also provides useful insights into fundamental concepts of quantum mechanics.
Quantum optimal control represents a powerful technique to enhance the performance of quantum experiments by engineering the controllable parameters of the Hamiltonian. However, the computational overhead for the necessary optimization of these contr
ol parameters drastically increases as their number grows. We devise a novel variant of a gradient-free optimal-control method by introducing the idea of phase-modulated driving fields, which allows us to find optimal control fields efficiently. We numerically evaluate its performance and demonstrate the advantages over standard Fourier-basis methods in controlling an ensemble of two-level systems showing an inhomogeneous broadening. The control fields optimized with the phase-modulated method provide an increased robustness against such ensemble inhomogeneities as well as control-field fluctuations and environmental noise, with one order of magnitude less of average search time. Robustness enhancement of single quantum gates is also achieved by the phase-modulated method. Under environmental noise, an XY-8 sequence constituted by optimized gates prolongs the coherence time by $50%$ compared with standard rectangular pulses in our numerical simulations, showing the application potential of our phase-modulated method in improving the precision of signal detection in the field of quantum sensing.
It is believed that random quantum circuits are difficult to simulate classically. These have been used to demonstrate quantum supremacy: the execution of a computational task on a quantum computer that is infeasible for any classical computer. The t
ask underlying the assertion of quantum supremacy by Arute et al. (Nature, 574, 505--510 (2019)) was initially estimated to require Summit, the worlds most powerful supercomputer today, approximately 10,000 years. The same task was performed on the Sycamore quantum processor in only 200 seconds. In this work, we present a tensor network-based classical simulation algorithm. Using a Summit-comparable cluster, we estimate that our simulator can perform this task in less than 20 days. On moderately-sized instances, we reduce the runtime from years to minutes, running several times faster than Sycamore itself. These estimates are based on explicit simulations of parallel subtasks, and leave no room for hidden costs. The simulators key ingredient is identifying and optimizing the stem of the computation: a sequence of pairwise tensor contractions that dominates the computational cost. This orders-of-magnitude reduction in classical simulation time, together with proposals for further significant improvements, indicates that achieving quantum supremacy may require a period of continuing quantum hardware developments without an unequivocal first demonstration.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
