اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLow overhead universality and quantum supremacy using only $Z$-control
107
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We consider a model of quantum computation we call Varying-$Z$ (V$Z$), defined by applying controllable $Z$-diagonal Hamiltonians in the presence of a uniform and constant external $X$-field, and prove that it is universal, even in 1D. Universality is demonstrated by construction of a universal gate set with $O(1)$ depth overhead. We then use this construction to describe a circuit whose output distribution cannot be classically simulated unless the polynomial hierarchy collapses, with the goal of providing a low-resource method of demonstrating quantum supremacy. The V$Z$ model can achieve quantum supremacy in $O(n)$ depth, equivalent to the random circuit sampling models despite a higher degree of homogeneity: it requires no individually addressed $X$-control.
قيم البحث
اقرأ أيضاً
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.
As Moores law reaches its limits, quantum computers are emerging with the promise of dramatically outperforming classical computers. We have witnessed the advent of quantum processors with over $50$ quantum bits (qubits), which are expected to be bey
ond the reach of classical simulation. Quantum supremacy is the event at which the old Extended Church-Turing Thesis is overturned: A quantum computer performs a task that is practically impossible for any classical (super)computer. The demonstration requires both a solid theoretical guarantee and an experimental realization. The lead candidate is Random Circuit Sampling (RCS), which is the task of sampling from the output distribution of random quantum circuits. Google recently announced a $53-$qubit experimental demonstration of RCS. Soon after, classical algorithms appeared that challenge the supremacy of random circuits by estimating their outputs. How hard is it to classically simulate the output of random quantum circuits? We prove that estimating the output probabilities of random quantum circuits is formidably hard ($#P$-Hard) for any classical computer. This makes RCS the strongest candidate for demonstrating quantum supremacy relative to all other proposals. The robustness to the estimation error that we prove may serve as a new hardness criterion for the performance of classical algorithms. To achieve this, we introduce the Cayley path interpolation between any two gates of a quantum computation and convolve recent advances in quantum complexity and information with probability and random matrices. Furthermore, we apply algebraic geometry to generalize the well-known Berlekamp-Welch algorithm that is widely used in coding theory and cryptography. Our results imply that there is an exponential hardness barrier for the classical simulation of most quantum circuits.
Even if Google AIs Sycamore processor is efficient for the particular task it has been designed for it fails to deliver universal computational capacity. Furthermore, even classical devices implementing transverse homoclinic orbits realize exponentia
l speedups with respect to universal classical as well as quantum computations. Moreover, relative to the validity of quantum mechanics, there already exist quantum oracles which violate the Church-Turing thesis.
This is an updated version of supplementary information to accompany Quantum supremacy using a programmable superconducting processor, an article published in the October 24, 2019 issue of Nature. The main article is freely available at https://www.n
ature.com/articles/s41586-019-1666-5. Summary of changes since arXiv:1910.11333v1 (submitted 23 Oct 2019): added URL for qFlex source code; added Erratum section; added Figure S41 comparing statistical and total uncertainty for log and linear XEB; new References [1,65]; miscellaneous updates for clarity and style consistency; miscellaneous typographical and formatting corrections.
In this work we derive novel ultrafast shortcuts for adiabatic rapid passage for a qubit where the only control variable is the longitudinal $z$-field, while the transverse $x$-field remains constant. This restrictive framework is pertinent to some i
mportant tasks in quantum computing, for example the design of a high fidelity controlled-phase gate can be mapped to the adiabatic quantum control of such a qubit. We study this problem in the adiabatic reference frame and with appropriately rescaled time, using as control input the derivative of the total field polar angle (with respect to rescaled time). We first show that a constant pulse can achieve perfect adiabatic rapid passage at only specific times, corresponding to resonant shortcuts to adiabaticity. We next show that, by using on-off-on-...-on-off-on pulse-sequences with appropriate characteristics (amplitude, timing, and number of pulses), a perfect fidelity can be obtained for every duration larger than the limit $pi/Omega$, where $Omega$ is the constant transverse $x$-field. We provide equations from which these characteristics can be calculated. The proposed methodology for generalized resonant shortcuts exploits the advantages of composite pulses in the rescaled time, while the corresponding control $z$-field varies continuously and monotonically in the original time. Of course, as the total duration approaches the lower limit, the changes in the control signal become more abrupt. These results are not restricted only to quantum information processing applications, but is also expected to impact other areas, where adiabatic rapid passage is used.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
