ترغب بنشر مسار تعليمي؟ اضغط هنا

Encoded Universality in Physical Implementations of a Quantum Computer

67   0   0.0 ( 0 )
 نشر من قبل Daniel A. Lidar
 تاريخ النشر 2001
  مجال البحث فيزياء
والبحث باللغة English
 تأليف D. Bacon




اسأل ChatGPT حول البحث

We revisit the question of universality in quantum computing and propose a new paradigm. Instead of forcing a physical system to enact a predetermined set of universal gates (e.g., single-qubit operations and CNOT), we focus on the intrinsic ability of a system to act as a universal quantum computer using only its naturally available interactions. A key element of this approach is the realization that the fungible nature of quantum information allows for universal manipulations using quantum information encoded in a subspace of the full system Hilbert space, as an alternative to using physical qubits directly. Starting with the interactions intrinsic to the physical system, we show how to determine the possible universality resulting from these interactions over an encoded subspace. We outline a general Lie-algebraic framework which can be used to find the encoding for universality and give several examples relevant to solid-state quantum computing.



قيم البحث

اقرأ أيضاً

We consider the estimation of a Hamiltonian parameter of a set of highly photosensitive samples, which are damaged after a few photons $N_{rm abs}$ are absorbed, for a total time $T$. The samples are modelled as a two mode photonic system, where phot ons simultaneously acquire information on the unknown parameter and are absorbed at a fixed rate. We show that arbitrarily intense coherent states can obtain information at a rate that scales at most linearly with $N_{rm abs}$ and $T$, whereas quantum states with finite intensity can overcome this bound. We characterise the quantum advantage as a function of $N_{rm abs}$ and $T$, as well as its robustness to imperfections (non-ideal detectors, finite preparation and measurement rates for quantum photonic states). We discuss an implementation in cavity QED, where Fock states are both prepared and measured by coupling atomic ensembles to the cavities. We show that superradiance, arising due to a collective coupling between the cavities and the atoms, can be exploited for improving the speed and efficiency of the measurement.
We derive an encoded universality representation for a generalized anisotropic exchange Hamiltonian that contains cross-product terms in addition to the usual two-particle exchange terms. The recently developed algebraic approach is used to show that the minimal universality-generating encodings of one logical qubit are based on three physical qubits. We show how to generate both single- and two-qubit operations on the logical qubits, using suitably timed conjugating operations derived from analysis of the commutator algebra. The timing of the operations is seen to be crucial in allowing simplification of the gate sequences for the generalized Hamiltonian to forms similar to that derived previously for the symmetric (XY) anisotropic exchange Hamiltonian. The total number of operations needed for a controlled-Z gate up to local transformations is five. A scalable architecture is proposed.
One of the most promising applications of quantum computing is simulating quantum many-body systems. However, there is still a need for methods to efficiently investigate these systems in a native way, capturing their full complexity. Here, we propos e variational quantum anomaly detection, an unsupervised quantum machine learning algorithm to analyze quantum data from quantum simulation. The algorithm is used to extract the phase diagram of a system with no prior physical knowledge and can be performed end-to-end on the same quantum device that the system is simulated on. We showcase its capabilities by mapping out the phase diagram of the one-dimensional extended Bose Hubbard model with dimerized hoppings, which exhibits a symmetry protected topological phase. Further, we show that it can be used with readily accessible devices nowadays and perform the algorithm on a real quantum computer.
The primary resource for quantum computation is Hilbert-space dimension. Whereas Hilbert space itself is an abstract construction, the number of dimensions available to a system is a physical quantity that requires physical resources. Avoiding a dema nd for an exponential amount of these resources places a fundamental constraint on the systems that are suitable for scalable quantum computation. To be scalable, the effective number of degrees of freedom in the computer must grow nearly linearly with the number of qubits in an equivalent qubit-based quantum computer.
We implement several quantum algorithms in real five-qubit superconducting quantum processor IBMqx4 to perform quantum computation of the dynamics of spin-1/2 particles interacting directly and indirectly through the boson field. Particularly, we foc us on effects arising due to the presence of entanglement in the initial state of the system. The dynamics is implemented in a digital way using Trotter expansion of evolution operator. Our results demonstrate that dynamics in our modeling based on real device is governed by quantum interference effects being highly sensitive to phase parameters of the initial state. We also discuss limitations of our approach due to the device imperfection as well as possible scaling towards larger systems.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا