اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum imaginary time evolution steered by reinforcement learning
130
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum imaginary time evolution is a powerful algorithm to prepare ground states and thermal states on near-term quantum devices. However, algorithmic errors induced by Trotterization and local approximation severely hinder its performance. Here we propose a deep-reinforcement-learning-based method to steer the evolution and mitigate these errors. In our scheme, the well-trained agent can find the subtle evolution path where most algorithmic errors cancel out, enhancing the recovering fidelity significantly. We verified the validity of the method with the transverse-field Ising model and graph maximum cut problem. Numerical calculations and experiments on a nuclear magnetic resonance quantum computer illustrated the efficacy. The philosophy of our method, eliminating errors with errors, sheds new light on error reduction on near-term quantum devices.
قيم البحث
اقرأ أيضاً
Realistic quantum computing is subjected to noise. A most important frontier in research of quantum computing is to implement noise-resilient quantum control over qubits. Dynamical decoupling can protect coherence of qubits. Here we demonstrate non-t
rivial quantum evolution steered by dynamical decoupling control, which automatically suppresses the noise effect. We designed and implemented a self-protected controlled-NOT gate on the electron spin of a nitrogen-vacancy centre and a nearby carbon-13 nuclear spin in diamond at room temperature, by employing an engineered dynamical decoupling control on the electron spin. Final state fidelities of 0.91 and 0.88 were observed even with imperfect initial states. In the mean time, the qubit coherence time has been elongated by at least 30 folds. The design scheme does not require that the dynamical decoupling control commute with the qubit interaction and works for general systems. This work marks a step toward realistic quantum computing.
The road to computing on quantum devices has been accelerated by the promises that come from using Shors algorithm to reduce the complexity of prime factorization. However, this promise hast not yet been realized due to noisy qubits and lack of robus
t error correction schemes. Here we explore a promising, alternative method for prime factorization that uses well-established techniques from variational imaginary time evolution. We create a Hamiltonian whose ground state encodes the solution to the problem and use variational techniques to evolve a state iteratively towards these prime factors. We show that the number of circuits evaluated in each iteration scales as O(n^{5}d), where n is the bit-length of the number to be factorized and $d$ is the depth of the circuit. We use a single layer of entangling gates to factorize several numbers represented using 7, 8, and 9-qubit Hamiltonians. We also verify the methods performance by implementing it on the IBMQ Lima hardware.
Imaginary time evolution is a powerful tool for studying quantum systems. While it is possible to simulate with a classical computer, the time and memory requirements generally scale exponentially with the system size. Conversely, quantum computers c
an efficiently simulate quantum systems, but not non-unitary imaginary time evolution. We propose a variational algorithm for simulating imaginary time evolution on a hybrid quantum computer. We use this algorithm to find the ground-state energy of many-particle systems; specifically molecular hydrogen and lithium hydride, finding the ground state with high probability. Our method can also be applied to general optimisation problems and quantum machine learning. As our algorithm is hybrid, suitable for error mitigation and can exploit shallow quantum circuits, it can be implemented with current quantum computers.
Quantum simulation on emerging quantum hardware is a topic of intense interest. While many studies focus on computing ground state properties or simulating unitary dynamics of closed systems, open quantum systems are an interesting target of study ow
ing to their ubiquity and rich physical behavior. However, their non-unitary dynamics are also not natural to simulate on near-term quantum hardware. Here, we report algorithms for the digital quantum simulation of the dynamics of open quantum systems governed by a Lindblad equation using an adaptation of the quantum imaginary time evolution (QITE) algorithm. We demonstrate the algorithms on IBM Quantums hardware with simulations of the spontaneous emission of a two level system and the dissipative transverse field Ising model. Our work shows that the dynamics of open quantum systems can be efficiently simulated on near-term quantum hardware.
The architecture of circuital quantum computers requires computing layers devoted to compiling high-level quantum algorithms into lower-level circuits of quantum gates. The general problem of quantum compiling is to approximate any unitary transforma
tion that describes the quantum computation, as a sequence of elements selected from a finite base of universal quantum gates. The existence of an approximating sequence of one qubit quantum gates is guaranteed by the Solovay-Kitaev theorem, which implies sub-optimal algorithms to establish it explicitly. Since a unitary transformation may require significantly different gate sequences, depending on the base considered, such a problem is of great complexity and does not admit an efficient approximating algorithm. Therefore, traditional approaches are time-consuming tasks, unsuitable to be employed during quantum computation. We exploit the deep reinforcement learning method as an alternative strategy, which has a significantly different trade-off between search time and exploitation time. Deep reinforcement learning allows creating single-qubit operations in real time, after an arbitrary long training period during which a strategy for creating sequences to approximate unitary operators is built. The deep reinforcement learning based compiling method allows for fast computation times, which could in principle be exploited for real-time quantum compiling.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
