اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum walks on a programmable two-dimensional 62-qubit superconducting processor
107
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
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 8x8 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.
قيم البحث
اقرأ أيضاً
The universal quantum computer is a device capable of simulating any physical system and represents a major goal for the field of quantum information science. Algorithms performed on such a device are predicted to offer significant gains for some imp
ortant computational tasks. In the context of quantum information, universal refers to the ability to perform arbitrary unitary transformations in the systems computational space. The combination of arbitrary single-quantum-bit (qubit) gates with an entangling two-qubit gate is a gate set capable of achieving universal control of any number of qubits, provided that these gates can be performed repeatedly and between arbitrary pairs of qubits. Although gate sets have been demonstrated in several technologies, they have as yet been tailored toward specific tasks, forming a small subset of all unitary operators. Here we demonstrate a programmable quantum processor that realises arbitrary unitary transformations on two qubits, which are stored in trapped atomic ions. Using quantum state and process tomography, we characterise the fidelity of our implementation for 160 randomly chosen operations. This universal control is equivalent to simulating any pairwise interaction between spin-1/2 systems. A programmable multi-qubit register could form a core component of a large-scale quantum processor, and the methods used here are suitable for such a device.
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.
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.
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.
We report the preparation and verification of a genuine 12-qubit entanglement in a superconducting processor. The processor that we designed and fabricated has qubits lying on a 1D chain with relaxation times ranging from 29.6 to 54.6 $mu$s. The fide
lity of the 12-qubit entanglement was measured to be above $0.5544pm0.0025$, exceeding the genuine multipartite entanglement threshold by 21 statistical standard deviations. Our entangling circuit to generate linear cluster states is depth-invariant in the number of qubits and uses single- and double-qubit gates instead of collective interactions. Our results are a substantial step towards large-scale random circuit sampling and scalable measurement-based quantum computing.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
