اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدLimitations in quantum computing from resource constraints
381
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
Fault-tolerant schemes can use error correction to make a quantum computation arbitrarily ac- curate, provided that errors per physical component are smaller than a certain threshold and in- dependent of the computer size. However in current experiments, physical resource limitations like energy, volume or available bandwidth induce error rates that typically grow as the computer grows. Taking into account these constraints, we show that the amount of error correction can be opti- mized, leading to a maximum attainable computational accuracy. We find this maximum for generic situations where noise is scale-dependent. By inverting the logic, we provide experimenters with a tool to finding the minimum resources required to run an algorithm with a given computational accuracy. When combined with a full-stack quantum computing model, this provides the basis for energetic estimates of future large-scale quantum computers.
قيم البحث
اقرأ أيضاً
Small, out-of-equilibrium, and quantum systems defy simple thermodynamic expressions. Such systems are exemplified by molecular switches, which exchange heat with a bath. These molecules can photoisomerize, or change conformation, or switch, upon abs
orbing light. The photoisomerization probability depends on kinetic details that couple the molecules energetics to its dissipation. Therefore, a simple, general, thermodynamic-style bound on the photoisomerization probability seems out of reach. We derive such a bound using a resource theory. The resource-theory framework is a set of mathematical tools, developed in quantum information theory, used to generalize thermodynamics to small and quantum settings. From this toolkit has been derived a generalization of the second law, the thermomajorization preorder. We use thermomajorization to upper-bound the photoisomerization probability. Then, we compare the bound with an equilibrium prediction and with a Lindbladian model. We identify a realistic parameter regime in which the Lindbladian evolution saturates the thermomajorization bound. We also quantify the energy coherence in the electronic degree of freedom, and we argue that this coherence cannot promote photoisomerization. This work illustrates how quantum-information-theoretic thermodynamics can elucidate complex quantum processes in nature, experiments, and synthetics.
$mathbb{Z}_d$ Parafermions are exotic non-Abelian quasiparticles generalizing Majorana fermions, which correspond to the case $d=2$. In contrast to Majorana fermions, braiding of parafermions with $d>2$ allows to perform an entangling gate. This has
spurred interest in parafermions and a variety of condensed matter systems have been proposed as potential hosts for them. In this work, we study the computational power of braiding parafermions more systematically. We make no assumptions on the underlying physical model but derive all our results from the algebraical relations that define parafermions. We find a familiy of $2d$ representations of the braid group that are compatible with these relations. The braiding operators derived this way reproduce those derived previously from physical grounds as special cases. We show that if a $d$-level qudit is encoded in the fusion space of four parafermions, braiding of these four parafermions allows to generate the entire single-qudit Clifford group (up to phases), for any $d$. If $d$ is odd, then we show that in fact the entire many-qudit Clifford group can be generated.
We propose a method for the implementation of one-way quantum computing in superconducting circuits. Measurement-based quantum computing is a universal quantum computation paradigm in which an initial cluster-state provides the quantum resource, whil
e the iteration of sequential measurements and local rotations encodes the quantum algorithm. Up to now, technical constraints have limited a scalable approach to this quantum computing alternative. The initial cluster state can be generated with available controlled-phase gates, while the quantum algorithm makes use of high-fidelity readout and coherent feedforward. With current technology, we estimate that quantum algorithms with above 20 qubits may be implemented in the path towards quantum supremacy. Moreover, we propose an alternative initial state with properties of maximal persistence and maximal connectedness, reducing the required resources of one-way quantum computing protocols.
Quantum computing is on the verge of a transition from fundamental research to practical applications. Yet, to make the step to large-scale quantum computation, an extensible qubit system has to be developed. In classical semiconductor technology, th
is was made possible by the invention of the integrated circuit, which allowed to interconnect large numbers of components without having to solder to each and every one of them. Similarly, we expect that the scaling of interconnections and control lines with the number of qubits will be a central bottleneck in creating large-scale quantum technology. Here, we define the quantum Rents exponent $p$ to quantify the progress in overcoming this challenge at different levels throughout the quantum computing stack. We further discuss the concept of quantum extensibility as an indicator of a platforms potential to reach the large quantum volume needed for universal quantum computing and review extensibility limits faced by different qubit implementations on the way towards truly large-scale qubit systems.
Building a quantum computer that surpasses the computational power of its classical counterpart is a great engineering challenge. Quantum software optimizations can provide an accelerated pathway to the first generation of quantum computing applicati
ons that might save years of engineering effort. Current quantum software stacks follow a layered approach similar to the stack of classical computers, which was designed to manage the complexity. In this review, we point out that greater efficiency of quantum computing systems can be achieved by breaking the abstractions between these layers. We review several works along this line, including two hardware-aware compilation optimizations that break the quantum Instruction Set Architecture (ISA) abstraction and two error-correction/information-processing schemes that break the qubit abstraction. Last, we discuss several possible future directions.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
