اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLimitations of Quantum Simulation Examined by Simulating a Pairing Hamiltonian using Nuclear Magnetic Resonance
127
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Quantum simulation uses a well-known quantum system to predict the behavior of another quantum system. Certain limitations in this technique arise, however, when applied to specific problems, as we demonstrate with a theoretical and experimental study of an algorithm to find the low-lying spectrum of a Hamiltonian. While the number of elementary quantum gates does scale polynomially with the size of the system, it increases inversely to the desired error bound $epsilon$. Making such simulations robust to decoherence using fault-tolerance constructs requires an additional factor of $1/ epsilon$ gates. These constraints are illustrated by using a three qubit nuclear magnetic resonance system to simulate a pairing Hamiltonian, following the algorithm proposed by Wu, Byrd, and Lidar.
قيم البحث
اقرأ أيضاً
Four-body interaction plays an important role in many-body systems, and it can exhibit interesting phase transition behaviors. Historically it was the need to efficiently simulate quantum systems that lead the idea of a quantum computer. In this Lett
er, we report the experimental demonstration of a four-body interaction in a four- qubit nuclear magnetic resonance quantum information processor. The strongly modulating pulse is used to implement spin selective excitation. The results show a good agreement between theory and experiment.
Liquid crystals offer several advantages as solvents for molecules used for nuclear magnetic resonance quantum computing (NMRQC). The dipolar coupling between nuclear spins manifest in the NMR spectra of molecules oriented by a liquid crystal permits
a significant increase in clock frequency, while short spin-lattice relaxation times permit fast recycling of algorithms, and save time in calibration and signal-enhancement experiments. Furthermore, the use of liquid crystal solvents offers scalability in the form of an expanded library of spin-bearing molecules suitable for NMRQC. These ideas are demonstrated with the successful execution of a 2-qubit Grover search using a molecule ($^{13}$C$^{1}$HCl$_3$) oriented in a liquid crystal and a clock speed eight times greater than in an isotropic solvent. Perhaps more importantly, five times as many logic operations can be executed within the coherence time using the liquid crystal solvent.
The number of steps any classical computer requires in order to find the prime factors of an $l$-digit integer $N$ increases exponentially with $l$, at least using algorithms known at present. Factoring large integers is therefore conjectured to be i
ntractable classically, an observation underlying the security of widely used cryptographic codes. Quantum computers, however, could factor integers in only polynomial time, using Shors quantum factoring algorithm. Although important for the study of quantum computers, experimental demonstration of this algorithm has proved elusive. Here we report an implementation of the simplest instance of Shors algorithm: factorization of ${N=15}$ (whose prime factors are 3 and 5). We use seven spin-1/2 nuclei in a molecule as quantum bits, which can be manipulated with room temperature liquid state nuclear magnetic resonance techniques. This method of using nuclei to store quantum information is in principle scalable to many quantum bit systems, but such scalability is not implied by the present work. The significance of our work lies in the demonstration of experimental and theoretical techniques for precise control and modelling of complex quantum computers. In particular, we present a simple, parameter-free but predictive model of decoherence effects in our system.
Hamiltonian simulation is one of the most important problems in quantum computation, and quantum singular value transformation (QSVT) is an efficient way to simulate a general class of Hamiltonians. However, the QSVT circuit typically involves multip
le ancilla qubits and multi-qubit control gates. We propose a drastically simplified quantum circuit called the minimal QSVT circuit, which uses only one ancilla qubit to simulate a class of $n$-qubit random Hamiltonians. We formulate a simple metric called the quantum unitary evolution score (QUES), which is a scalable quantum benchmark and can be verified without any need for classical computation. We demonstrate that QUES is directly related to the circuit fidelity, and the classical hardness of an associated quantum circuit sampling problem. Theoretical analysis suggests under suitable assumptions, there exists an optimal simulation time $t^{text{opt}}approx 4.81$, at which even a noisy quantum device may be sufficient to demonstrate the classical hardness.
We present an open-source software for the simulation of observables in nuclear magnetic/quadrupole resonance experiments (NMR/NQR) on solid-state samples, developed to assist experimental research in the design of new strategies for the investigatio
n of quantum materials inspired by the early NMR/NQR quantum computation protocols. % The software is based on a quantum mechanical description of nuclear spin dynamics in NMR/NQR experiments and has been widely tested on both theoretical and experimental available results. Moreover, the structure of the software allows an easy generalization of basic experiments to more sophisticated ones, as it includes all the libraries required for the numerical simulation of generic spin systems. In order to make the program easily accessible to a large user base, we developed a user-friendly graphical interface and fully-detailed documentation. Lastly, we portray several examples of the execution of the code that demonstrate the potential of NMR/NQR for the scopes of quantum control and quantum information processing.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
