اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدReducing qubit requirements for quantum simulation using molecular point group symmetries
180
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Simulating molecules is believed to be one of the early-stage applications for quantum computers. Current state-of-the-art quantum computers are limited in size and coherence, therefore optimizing resources to execute quantum algorithms is crucial. In this work, we develop the second quantization representation of the spatial-symmetries which are then transformed to their qubit operator representation. These qubit operator representations are used to reduce the number of qubits required for simulating molecules. We present our results for various molecules and elucidate a formal connection of this work with a previous technique that analyzed generic $Z_2$ Pauli symmetries.
قيم البحث
اقرأ أيضاً
We investigate multiqubit permutation-symmetric states with maximal entropy of entanglement. Such states can be viewed as particular spin states, namely anticoherent spin states. Using the Majorana representation of spin states in terms of points on
the unit sphere, we analyze the consequences of a point-group symmetry in their arrangement on the quantum properties of the corresponding state. We focus on the identification of anticoherent states (for which all reduced density matrices in the symmetric subspace are maximally mixed) associated with point-group symmetric sets of points. We provide three different characterizations of anticoherence, and establish a link between point symmetries, anticoherence and classes of states equivalent through stochastic local operations with classical communication (SLOCC). We then investigate in detail the case of small numbers of qubits, and construct infinite families of anticoherent states with point-group symmetry of their Majorana points, showing that anticoherent states do exist to arbitrary order.
Fault-tolerant quantum computing demands many qubits with long lifetimes to conduct accurate quantum gate operations. However, external noise limits the computing time of physical qubits. Quantum error correction codes may extend such limits, but imp
erfect gate operations introduce errors to the correction procedure as well. The additional gate operations required due to the physical layout of qubits exacerbate the situation. Here, we use density-matrix simulations to investigate the performance change of logical qubits according to quantum error correction codes and qubit layouts and the expected performance of logical qubits with gate operation time and gate error rates. Considering current qubit technology, the small quantum error correction codes are chosen. Assuming 0.1% gate error probability, a logical qubit encoded by a 5-qubit quantum error correction code is expected to have a fidelity 0.25 higher than its physical counterpart.
Classical simulations of quantum circuits are limited in both space and time when the qubit count is above 50, the realm where quantum supremacy reigns. However, recently, for the low depth circuit with more than 50 qubits, there are several methods
of simulation proposed by teams at Google and IBM. Here, we present a scheme of simulation which can extract a large amount of measurement outcomes within a short time, achieving a 64-qubit simulation of a universal random circuit of depth 22 using a 128-node cluster, and 56- and 42-qubit circuits on a single PC. We also estimate that a 72-qubit circuit of depth 23 can be simulated in about 16 h on a supercomputer identical to that used by the IBM team. Moreover, the simulation processes are exceedingly separable, hence parallelizable, involving just a few inter-process communications. Our work enables simulating more qubits with less hardware burden and provides a new perspective for classical simulations.
The exact evaluation of the molecular ground state in quantum chemistry requires an exponential increasing computational cost. Quantum computation is a promising way to overcome the exponential problem using polynomial-time quantum algorithms. A quan
tum-classical hybrid optimization scheme known as the variational quantum eigensolver (VQE) is preferred for this task for noisy intermediate-scale quantum devices. However, the circuit depth becomes one of the bottlenecks of its application to large molecules of more than 20 qubits. In this work, we propose a new strategy by employing the point group symmetry to reduce the number of operators in constructing ansatz to achieve a more compact quantum circuit. We illustrate this methodology with a series of molecules ranging from LiH (12 qubits) to C2H4 (28 qubits). A significant reduction of up to 82% of the operator numbers is reached on C2H4, which enables the largest molecule ever simulated by VQE to the best of our knowledge.
Full quantum capability devices can provide secure communications, but they are challenging to make portable given the current technology. Besides, classical portable devices are unable to construct communication channels resistant to quantum compute
rs. Hence, communication security on portable devices cannot be guaranteed. Semi-Quantum Communication (SQC) attempts to break the quandary by lowering the receivers required quantum capability so that secure communications can be implemented on a portable device. However, all SQC protocols have low qubit efficiency and complex hardware implementations. The protocols involving quantum entanglement require linear Entanglement Preservation Time (EPT) and linear quregister size. In this paper, we propose two new keyless SQC protocols that address the aforementioned weaknesses. They are named Economic Keyless Semi-Quantum Point-to-point Communication (EKSQPC) and Rate Estimation EKSQPC (REKSQPC). They achieve theoretically constant minimal EPT and quregister size, regardless of message length. We show that the new protocols, with low overhead, can detect Measure and Replay Attacks (MRAs). REKSQDC is tolerant to transmission impairments and environmental perturbations. The protocols are based on a new quantum message transmission operation termed Tele-Fetch. Like QKD, their strength depends on physical principles rather than mathematical complexity.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
