اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDemonstrating quantum speed-up in a superconducting two-qubit processor
134
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We operate a superconducting quantum processor consisting of two tunable transmon qubits coupled by a swapping interaction, and equipped with non destructive single-shot readout of the two qubits. With this processor, we run the Grover search algorithm among four objects and find that the correct answer is retrieved after a single run with a success probability between 0.52 and 0.67, significantly larger than the 0.25 achieved with a classical algorithm. This constitutes a proof-of-concept for the quantum speed-up of electrical quantum processors.
قيم البحث
اقرأ أيضاً
We report on the coherence of Greenberger-Horne-Zeilinger (GHZ) states comprised of up to 8 qubits in the IBM ibmqx5 16-qubit quantum processor. In particular, we evaluate the coherence of GHZ states with $N=1,ldots,8$ qubits, as a function of a dela
y time between state creation and measurement. We find that the decay in coherence occurs at a rate that is linear in the number of qubits. This is consistent with a model in which the dominant noise affecting the system is uncorrelated across qubits.
Quantum walks are the quantum mechanical analogue of classical random walks and an extremely powerful tool in quantum simulations, quantum search algorithms, and even for universal quantum computing. In our work, we have designed and fabricated an 8x
8 two-dimensional square superconducting qubit array composed of 62 functional qubits. We used this device to demonstrate high fidelity single and two particle quantum walks. Furthermore, with the high programmability of the quantum processor, we implemented a Mach-Zehnder interferometer where the quantum walker coherently traverses in two paths before interfering and exiting. By tuning the disorders on the evolution paths, we observed interference fringes with single and double walkers. Our work is an essential milestone in the field, brings future larger scale quantum applications closer to realization on these noisy intermediate-scale quantum processors.
We have developed a quantum annealing processor, based on an array of tunably coupled rf-SQUID flux qubits, fabricated in a superconducting integrated circuit process [1]. Implementing this type of processor at a scale of 512 qubits and 1472 programm
able inter-qubit couplers and operating at ~ 20 mK has required attention to a number of considerations that one may ignore at the smaller scale of a few dozen or so devices. Here we discuss some of these considerations, and the delicate balance necessary for the construction of a practical processor that respects the demanding physical requirements imposed by a quantum algorithm. In particular we will review some of the design trade-offs at play in the floor-planning of the physical layout, driven by the desire to have an algorithmically useful set of inter-qubit couplers, and the simultaneous need to embed programmable control circuitry into the processor fabric. In this context we have developed a new ultra-low power embedded superconducting digital-to-analog flux converters (DACs) used to program the processor with zero static power dissipation, optimized to achieve maximum flux storage density per unit area. The 512 single-stage, 3520 two-stage, and 512 three-stage flux-DACs are controlled with an XYZ addressing scheme requiring 56 wires. Our estimate of on-chip dissipated energy for worst-case reprogramming of the whole processor is ~ 65 fJ. Several chips based on this architecture have been fabricated and operated successfully at our facility, as well as two outside facilities (see for example [2]).
We have designed, fabricated and operated a scalable system for applying independently programmable time-independent, and limited time-dependent flux biases to control superconducting devices in an integrated circuit. Here we report on the operation
of a system designed to supply 64 flux biases to devices in a circuit designed to be a unit cell for a superconducting adiabatic quantum optimization system. The system requires six digital address lines, two power lines, and a handful of global analog lines.
Quantum algorithms are known for presenting more efficient solutions to certain computational tasks than any corresponding classical algorithm. It has been thought that the origin of the power of quantum computation has its roots in non-classical cor
relations such as entanglement or quantum discord. However, it has been recently shown that even a single pure qudit is sufficient to design an oracle-based algorithm which solves a black-box problem faster than any classical approach to the same problem. In particular, the algorithm that we consider determines whether eight permutation functions defined on a set of four elements is positive or negative cyclic. While any classical solution to this problem requires two evaluations of the function, quantum mechanics allows us to perform the same task with only a single evaluation. Here, we present the first experimental demonstration of the considered quantum algorithm with a quadrupolar nuclear magnetic resonance setup using a single four-level quantum system, i.e., a ququart.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
