Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userOn the Irresistible Efficiency of Signal Processing Methods in Quantum Computing
106
0
0.0
(
0
)
Added by
Andreas Klappenecker
Publication date
2001
fields
Physics
and research's language is
English
Authors
Andreas Klappenecker
Ask ChatGPT about the research
No Arabic abstract
We show that many well-known signal transforms allow highly efficient realizations on a quantum computer. We explain some elementary quantum circuits and review the construction of the Quantum Fourier Transform. We derive quantum circuits for the Discrete Cosine and Sine Transforms, and for the Discrete Hartley transform. We show that at most O(log^2 N) elementary quantum gates are necessary to implement any of those transforms for input sequences of length N.
rate research
Read More
Quantum computing architectures rely on classical electronics for control and readout. Employing classical electronics in a feedback loop with the quantum system allows to stabilize states, correct errors and to realize specific feedforward-based quantum computing and communication schemes such as deterministic quantum teleportation. These feedback and feedforward operations are required to be fast compared to the coherence time of the quantum system to minimize the probability of errors. We present a field programmable gate array (FPGA) based digital signal processing system capable of real-time quadrature demodulation, determination of the qubit state and generation of state-dependent feedback trigger signals. The feedback trigger is generated with a latency of $110,mathrm{ns}$ with respect to the timing of the analog input signal. We characterize the performance of the system for an active qubit initialization protocol based on dispersive readout of a superconducting qubit and discuss potential applications in feedback and feedforward algorithms.
Quantum signal processing (QSP) is a powerful quantum algorithm to exactly implement matrix polynomials on quantum computers. Asymptotic analysis of quantum algorithms based on QSP has shown that asymptotically optimal results can in principle be obtained for a range of tasks, such as Hamiltonian simulation and the quantum linear system problem. A further benefit of QSP is that it uses a minimal number of ancilla qubits, which facilitates its implementation on near-to-intermediate term quantum architectures. However, there is so far no classically stable algorithm allowing computation of the phase factors that are needed to build QSP circuits. Existing methods require the usage of variable precision arithmetic and can only be applied to polynomials of relatively low degree. We present here an optimization based method that can accurately compute the phase factors using standard double precision arithmetic operations. We demonstrate the performance of this approach with applications to Hamiltonian simulation, eigenvalue filtering, and the quantum linear system problems. Our numerical results show that the optimization algorithm can find phase factors to accurately approximate polynomials of degree larger than $10,000$ with error below $10^{-12}$.
Classical machine learning theory and theory of quantum computations are among of the most rapidly developing scientific areas in our days. In recent years, researchers investigated if quantum computing can help to improve classical machine learning algorithms. The quantum machine learning includes hybrid methods that involve both classical and quantum algorithms. Quantum approaches can be used to analyze quantum states instead of classical data. On other side, quantum algorithms can exponentially improve classical data science algorithm. Here, we show basic ideas of quantum machine learning. We present several new methods that combine classical machine learning algorithms and quantum computing methods. We demonstrate multiclass tree tensor network algorithm, and its approbation on IBM quantum processor. Also, we introduce neural networks approach to quantum tomography problem. Our tomography method allows us to predict quantum state excluding noise influence. Such classical-quantum approach can be applied in various experiments to reveal latent dependence between input data and output measurement results.
Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. Based on a greedy-type metric clustering and augmentation scheme, we show how a partition of unity can be generated in an efficient way on graphs. We investigate how PUMs can be combined with a local graph basis function (GBF) approximation method in order to obtain low-cost global interpolation or classification schemes. From a theoretical point of view, we study necessary prerequisites for the partition of unity such that global error estimates of the PUM follow from corresponding local ones. Finally, properties of the PUM as cost-efficiency and approximation accuracy are investigated numerically.
Reservoir computer is a temporal information processing system that exploits an artificial or physical dissipative dynamics to learn a dynamical system generating the target time-series. This paper proposes the use of real superconducting quantum computing devices as the reservoir, where the dissipative property is served by the natural noise added to the quantum bits. The performance of this natural quantum reservoir is demonstrated in a benchmark time-series regression problem and a practical problem classifying different objects based on a temporal sensor data. In both cases the proposed reservoir computer shows a higher performance than a linear regression or classification model. The results indicate that a noisy quantum device potentially functions as a reservoir computer, and notably, the quantum noise, which is undesirable in the conventional quantum computation, can be used as a rich computation resource.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
