اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدDemonstration of Two-Qubit Algorithms with a Superconducting Quantum Processor
139
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
By harnessing the superposition and entanglement of physical states, quantum computers could outperform their classical counterparts in solving problems of technological impact, such as factoring large numbers and searching databases. A quantum processor executes algorithms by applying a programmable sequence of gates to an initialized register of qubits, which coherently evolves into a final state containing the result of the computation. Simultaneously meeting the conflicting requirements of long coherence, state preparation, universal gate operations, and qubit readout makes building quantum processors challenging. Few-qubit processors have already been shown in nuclear magnetic resonance, cold ion trap and optical systems, but a solid-state realization has remained an outstanding challenge. Here we demonstrate a two-qubit superconducting processor and the implementation of the Grover search and Deutsch-Jozsa quantum algorithms. We employ a novel two-qubit interaction, tunable in strength by two orders of magnitude on nanosecond time scales, which is mediated by a cavity bus in a circuit quantum electrodynamics (cQED) architecture. This interaction allows generation of highly-entangled states with concurrence up to 94%. Although this processor constitutes an important step in quantum computing with integrated circuits, continuing efforts to increase qubit coherence times, gate performance and register size will be required to fulfill the promise of a scalable technology.
قيم البحث
اقرأ أيضاً
With qubit measurement and control fidelities above the threshold of fault-tolerance, much attention is moving towards the daunting task of scaling up the number of physical qubits to the large numbers needed for fault tolerant quantum computing. Her
e, quantum dot based spin qubits may offer significant advantages due to their potential for high densities, all-electrical operation, and integration onto an industrial platform. In this system, the initialisation, readout, single- and two-qubit gates have been demonstrated in various qubit representations. However, as seen with other small scale quantum computer demonstrations, combining these elements leads to new challenges involving qubit crosstalk, state leakage, calibration, and control hardware which provide invaluable insight towards scaling up. Here we address these challenges and demonstrate a programmable two-qubit quantum processor in silicon by performing both the Deutsch-Josza and the Grover search algorithms. In addition, we characterise the entanglement in our processor through quantum state tomography of Bell states measuring state fidelities between 85-89% and concurrences between 73-80%. These results pave the way for larger scale quantum computers using spins confined to quantum dots.
Practical quantum computers require the construction of a large network of highly coherent qubits, interconnected in a design robust against errors. Donor spins in silicon provide state-of-the-art coherence and quantum gate fidelities, in a physical
platform adapted from industrial semiconductor processing. Here we present a scalable design for a silicon quantum processor that does not require precise donor placement and allows hundreds of nanometers inter-qubit distances, therefore facilitating fabrication using current technology. All qubit operations are performed via electrical means on the electron-nuclear spin states of a phosphorus donor. Single-qubit gates use low power electric drive at microwave frequencies, while fast two-qubit gates exploit electric dipole-dipole interactions. Microwave resonators allow for millimeter-distance entanglement and interfacing with photonic links. Sweet spots protect the qubits from charge noise up to second order, implying that all operations can be performed with error rates below quantum error correction thresholds, even without any active noise cancellation technique.
The prospect of building quantum circuits using advanced semiconductor manufacturing positions quantum dots as an attractive platform for quantum information processing. Extensive studies on various materials have led to demonstrations of two-qubit l
ogic in gallium arsenide, silicon, and germanium. However, interconnecting larger numbers of qubits in semiconductor devices has remained an outstanding challenge. Here, we demonstrate a four-qubit quantum processor based on hole spins in germanium quantum dots. Furthermore, we define the quantum dots in a two-by-two array and obtain controllable coupling along both directions. Qubit logic is implemented all-electrically and the exchange interaction can be pulsed to freely program one-qubit, two-qubit, three-qubit, and four-qubit operations, resulting in a compact and high-connectivity circuit. We execute a quantum logic circuit that generates a four-qubit Greenberger-Horne-Zeilinger state and we obtain coherent evolution by incorporating dynamical decoupling. These results are an important step towards quantum error correction and quantum simulation with quantum dots.
We report the characterization of a two-qubit processor implemented with two capacitively coupled tunable superconducting qubits of the transmon type, each qubit having its own non-destructive single-shot readout. The fixed capacitive coupling yields
the sqrt{iSWAP} two-qubit gate for a suitable interaction time. We reconstruct by state tomography the coherent dynamics of the two-bit register as a function of the interaction time, observe a violation of the Bell inequality by 22 standard deviations after correcting readout errors, and measure by quantum process tomography a gate fidelity of 90%.
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 algorit
hm 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.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
