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

Fast quantum computation at arbitrarily low energy

92   0   0.0 ( 0 )
 نشر من قبل Stephen Jordan
 تاريخ النشر 2017
  مجال البحث فيزياء
والبحث باللغة English
 تأليف Stephen P. Jordan




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

One version of the energy-time uncertainty principle states that the minimum time $T_{perp}$ for a quantum system to evolve from a given state to any orthogonal state is $h/(4 Delta E)$ where $Delta E$ is the energy uncertainty. A related bound called the Margolus-Levitin theorem states that $T_{perp} geq h/(2 E)$ where E is the expectation value of energy and the ground energy is taken to be zero. Many subsequent works have interpreted $T_{perp}$ as defining a minimal time for an elementary computational operation and correspondingly a fundamental limit on clock speed determined by a systems energy. Here we present local time-independent Hamiltonians in which computational clock speed becomes arbitrarily large relative to E and $Delta E$ as the number of computational steps goes to infinity. We argue that energy considerations alone are not sufficient to obtain an upper bound on computational speed, and that additional physical assumptions such as limits to information density and information transmission speed are necessary to obtain such a bound.



قيم البحث

اقرأ أيضاً

When calculating the overhead of a quantum algorithm made fault-tolerant using the surface code, many previous works have used defects and braids for logical qubit storage and state distillation. In this work, we show that lattice surgery reduces the storage overhead by over a factor of 4, and the distillation overhead by nearly a factor of 5, making it possible to run algorithms with $10^8$ T gates using only $3.7times 10^5$ physical qubits capable of executing gates with error $psim 10^{-3}$. These numbers strongly suggest that defects and braids in the surface code should be deprecated in favor of lattice surgery.
This review article summarizes the requirement of low temperature conditions in existing experimental approaches to quantum computation and quantum simulation.
237 - Daniel Nagaj 2009
We present two universal models of quantum computation with a time-independent, frustration-free Hamiltonian. The first construction uses 3-local (qubit) projectors, and the second one requires only 2-local qubit-qutrit projectors. We build on Feynma ns Hamiltonian computer idea and use a railroad-switch type clock register. The resources required to simulate a quantum circuit with L gates in this model are O(L) small-dimensional quantum systems (qubits or qutrits), a time-independent Hamiltonian composed of O(L) local, constant norm, projector terms, the possibility to prepare computational basis product states, a running time O(L log^2 L), and the possibility to measure a few qubits in the computational basis. Our models also give a simplified proof of the universality of 3-local Adiabatic Quantum Computation.
We present a detailed analysis of the modulated-carrier quantum phase gate implemented with Wigner crystals of ions confined in Penning traps. We elaborate on a recent scheme, proposed by two of the authors, to engineer two-body interactions between ions in such crystals. We analyze for the first time the situation in which the cyclotron (w_c) and the crystal rotation (w_r) frequencies do not fulfill the condition w_c=2w_r. It is shown that even in the presence of the magnetic field in the rotating frame the many-body (classical) Hamiltonian describing small oscillations from the ion equilibrium positions can be recast in canonical form. As a consequence, we are able to demonstrate that fast and robust two-qubit gates are achievable within the current experimental limitations. Moreover, we describe a realization of the state-dependent sign-changing dipole forces needed to realize the investigated quantum computing scheme.
Quantum learning (in metrology and machine learning) involves estimating unknown parameters from measurements of quantum states. The quantum Fisher information matrix can bound the average amount of information learnt about the unknown parameters per experimental trial. In several scenarios, it is advantageous to concentrate information in as few states as possible. Here, we present two go-go theorems proving that negativity, a narrower nonclassicality concept than noncommutation, enables unbounded and lossless distillation of Fisher information about multiple parameters in quantum learning.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

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