اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدQuantum Arithmetic for Directly Embedded Arrays
65
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
We describe a general-purpose framework to design quantum algorithms relying upon an efficient handling of arrays. The corner-stone of the framework is the direct embedding of information into quantum amplitudes, thus avoiding the need to deal with square roots or encode the information in registers. We discuss the entire pipeline, from data loading to information extraction. Particular attention is devoted to the definition of an efficient tool-kit of quantum arithmetic operations on arrays. We comment on strong and weak points of the proposed manipulations, especially in relation to an effective exploitation of quantum parallelism. Eventually, we give explicit examples regarding the manipulation of generic oracles.
قيم البحث
اقرأ أيضاً
Quantum algorithm involves the manipulation of amplitudes and computational basis, of which manipulating basis is largely a quantum analogue of classical computing that is always a major contributor to the complexity. In order to make full use of qua
ntum mechanical speedup, more transformation should be implemented on amplitudes. Here we propose the notion of quantum amplitude arithmetic (QAA) that intent to evolve the quantum state by performing arithmetic operations on amplitude. Based on the basic design of multiplication and addition operations, QAA can be applied to solve the black-box quantum state preparation problem and the quantum linear system problem with fairly low complexity, and evaluate nonlinear functions on amplitudes directly. QAA is expected to find applications in a variety of quantum algorithms.
Quantum networks provide a platform for astronomical interferometers capable of imaging faint stellar objects. In a recent work [arXiv:1809.01659], we presented a protocol that circumvents transmission losses with efficient use of quantum resources a
nd modest quantum memories. Here we analyze a number of extensions to that scheme. We show that it can be operated as a truly broadband interferometer and generalized to multiple sites in the array. We also analyze how imaging based on the quantum Fourier transform provides improved signal-to-noise ratio compared to classical processing. Finally, we discuss physical realizations including photon-detection-based quantum state transfer.
We present some basic integer arithmetic quantum circuits, such as adders and multipliers-accumulators of various forms, as well as diagonal operators, which operate on multilevel qudits. The integers to be processed are represented in an alternative
basis after they have been Fourier transformed. Several arithmetic circuits operating on Fourier transformed integers have appeared in the literature for two level qubits. Here we extend these techniques on multilevel qudits, as they may offer some advantages relative to qubits implementations. The arithmetic circuits presented can be used as basic building blocks for higher level algorithms such as quantum phase estimation, quantum simulation, quantum optimization etc., but they can also be used in the implementation of a quantum fractional Fourier transform as it is shown in a companion work presented separately.
We propose a new method to directly measure a general multi-particle quantum wave function, a single matrix element in a multi-particle density matrix, by quantum teleportation. The density matrix element is embedded in a virtual logical qubit and is
nondestructively teleported to a single physical qubit for readout. We experimentally implement this method to directly measure the wavefunction of a photonic mixed quantum state beyond a single photon using a single observable for the first time. Our method also provides an exponential advantage over the standard quantum state tomography in measurement complexity to fully characterize a sparse multi-particle quantum state.
We evaluate the performance of quantum arithmetic algorithms run on a distributed quantum computer (a quantum multicomputer). We vary the node capacity and I/O capabilities, and the network topology. The tradeoff of choosing between gates executed re
motely, through ``teleported gates on entangled pairs of qubits (telegate), versus exchanging the relevant qubits via quantum teleportation, then executing the algorithm using local gates (teledata), is examined. We show that the teledata approach performs better, and that carry-ripple adders perform well when the teleportation block is decomposed so that the key quantum operations can be parallelized. A node size of only a few logical qubits performs adequately provided that the nodes have two transceiver qubits. A linear network topology performs acceptably for a broad range of system sizes and performance parameters. We therefore recommend pursuing small, high-I/O bandwidth nodes and a simple network. Such a machine will run Shors algorithm for factoring large numbers efficiently.
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
