اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدProgramming a quantum computer with quantum instructions
125
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
The equivalence between the instructions used to define programs and the input data on which the instructions operate is a basic principle of classical computer architectures and programming. Replacing classical data with quantum states enables fundamentally new computational capabilities with scaling advantages for many applications, and numerous models have been proposed for realizing quantum computation. However, within each of these models, the quantum data are transformed by a set of gates that are compiled using solely classical information. Conventional quantum computing models thus break the instruction-data symmetry: classical instructions and quantum data are not directly interchangeable. In this work, we use a density matrix exponentiation protocol to execute quantum instructions on quantum data. In this approach, a fixed sequence of classically-defined gates performs an operation that uniquely depends on an auxiliary quantum instruction state. Our demonstration relies on a 99.7% fidelity controlled-phase gate implemented using two tunable superconducting transmon qubits, which enables an algorithmic fidelity surpassing 90% at circuit depths exceeding 70. The utilization of quantum instructions obviates the need for costly tomographic state reconstruction and recompilation, thereby enabling exponential speedup for a broad range of algorithms, including quantum principal component analysis, the measurement of entanglement spectra, and universal quantum emulation.
قيم البحث
اقرأ أيضاً
Parallel operations in conventional computing have proven to be an essential tool for efficient and practical computation, and the story is not different for quantum computing. Indeed, there exists a large body of works that study advantages of paral
lel implementations of quantum gates for efficient quantum circuit implementations. Here, we focus on the recently invented efficient, arbitrary, simultaneously entangling (EASE) gates, available on a trapped-ion quantum computer. Leveraging its flexibility in selecting arbitrary pairs of qubits to be coupled with any degrees of entanglement, all in parallel, we show a $n$-qubit Clifford circuit can be implemented using $6log(n)$ EASE gates, a $n$-qubit multiply-controlled NOT gate can be implemented using $3n/2$ EASE gates, and a $n$-qubit permutation can be implemented using six EASE gates. We discuss their implications to near-term quantum chemistry simulations and the state of the art pattern matching algorithm. Given Clifford + multiply-controlled NOT gates form a universal gate set for quantum computing, our results imply efficient quantum computation by EASE gates, in general.
Modern cryptography is largely based on complexity assumptions, for example, the ubiquitous RSA is based on the supposed complexity of the prime factorization problem. Thus, it is of fundamental importance to understand how a quantum computer would e
ventually weaken these algorithms. In this paper, one follows Feynmans prescription for a computer to simulate the physics corresponding to the algorithm of factoring a large number $N$ into primes. Using Dirac-Jordan transformation theory one translates factorization into the language of quantum hermitical operators, acting on the vectors of the Hilbert space. This leads to obtaining the ensemble of factorization of $N$ in terms of the Euler function $varphi(N)$, that is quantized. On the other hand, considering $N$ as a parameter of the computer, a Quantum Mechanical Prime Counting Function $pi_{QM}(x)$, where $x$ factorizes $N$, is derived. This function converges to $pi(x)$ when $Ngg x$. It has no counterpart in analytic number theory and its derivation relies on semiclassical quantization alone.
The problem of quantum test is formally addressed. The presented method attempts the quantum role of classical test generation and test set reduction methods known from standard binary and analog circuits. QuFault, the authors software package genera
tes test plans for arbitrary quantum circuits using the very efficient simulator QuIDDPro[1]. The quantum fault table is introduced and mathematically formalized, and the test generation method explained.
We present efficient quantum algorithms for simulating time-dependent Hamiltonian evolution of general input states using an oracular model of a quantum computer. Our algorithms use either constant or adaptively chosen time steps and are significant
because they are the first to have time-complexities that are comparable to the best known methods for simulating time-independent Hamiltonian evolution, given appropriate smoothness criteria on the Hamiltonian are satisfied. We provide a thorough cost analysis of these algorithms that considers discretizion errors in both the time and the representation of the Hamiltonian. In addition, we provide the first upper bounds for the error in Lie-Trotter-Suzuki approximations to unitary evolution operators, that use adaptively chosen time steps.
Domains are homogeneous areas of discrete symmetry, created in nonequilibrium phase transitions. They are separated by domain walls, topological objects which prevent them from fusing together. Domains may reconfigure by thermally-driven microscopic
processes, and in quantum systems, by macroscopic quantum tunnelling. The underlying microscopic physics that defines the systems energy landscape for tunnelling is of interest in many different systems, from cosmology and other quantum domain systems, and more generally to nuclear physics, matter waves, magnetism, and biology. A unique opportunity to investigate the dynamics of microscopic correlations leading to emergent behaviour, such as quantum domain dynamics is offered by quantum materials. Here, as a direct realization of Feynmans idea of using a quantum computer to simulate a quantum system, we report an investigation of quantum electron reconfiguration dynamics and domain melting in two matching embodiments: a prototypical two-dimensionally electronically ordered solid-state quantum material and a simulation on a latest-generation quantum simulator. We use scanning tunnelling microscopy to measure the time-evolution of electronic domain reconfiguration dynamics and compare this with the time evolution of domains in an ensemble of entangled correlated electrons in simulated quantum domain melting. The domain reconfiguration is found to proceed by tunnelling in an emergent, self-configuring energy landscape, with characteristic step-like time evolution and temperature-dependences observed macroscopically. The remarkable correspondence in the dynamics of a quantum material and a quantum simulation opens the way to an understanding of emergent behaviour in diverse interacting many-body quantum systems at the microscopic level.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
