Results 21 to 30 of about 745,886 (317)
Quantum Modular Adder over GF(2n − 1) without Saving the Final Carry
Applied Sciences, 2021 Addition is the most basic operation of computing based on a bit system. There are various addition algorithms considering multiple number systems and hardware, and studies for a more efficient addition are still ongoing.
Aeyoung Kim +4 more
doaj +1 more source
A brief introduction to quantum algorithms [PDF]
CCF Transactions on High Performance Computing (2022) 4:53-62, 2022 Quantum algorithms are demonstrated to outperform classical algorithms for certain problems and thus are promising candidates for efficient information processing. Herein we aim to provide a brief and popular introduction to quantum algorithms for both the academic community and the general public with interest.
arxiv +1 more source
Quantum defragmentation algorithm [PDF]
Physical Review A, 2010 In this addendum of our paper [D. Burgarth and V. Giovannetti, Phys. Rev. Lett. 99, 100501 (2007)] we prove that during the transformation that allows one to enforce control by relaxation on a quantum system, the ancillary memory can be kept at a finite size, independently from the fidelity one wants to achieve.
BURGARTH D, GIOVANNETTI, VITTORIO
openaire +4 more sources
Frontiers in Quantum Science and Technology, 2023 Most currently used cryptographic tools for protecting data are based on certain computational assumptions, which makes them vulnerable with respect to technological and algorithmic developments, such as quantum computing.
Aleksey K. Fedorov, Aleksey K. Fedorov
doaj +1 more source
Quantum Algorithms for Quantum Field Theories [PDF]
Science, 2012 Quantum Leap? Quantum computers are expected to be able to solve some of the most difficult problems in mathematics and physics. It is not known, however, whether quantum field theories (QFTs) can be simulated efficiently with a quantum computer.
Jordan, Stephen P. +2 more
openaire +6 more sources
TOOLS FOR QUANTUM ALGORITHMS [PDF]
International Journal of Modern Physics C, 1999 We present efficient implementations of a number of operations for quantum computers. These include controlled phase adjustments of the amplitudes in a superposition, permutations, approximations of transformations and generalizations of the phase adjustments to block matrix transformations.
Tad Hogg +3 more
openaire +3 more sources
Simulating the quantum Fourier transform, Grover's algorithm, and the quantum counting algorithm with limited entanglement using tensor-networks [PDF]
Phys. Rev. Research 6, 033325 (2024), 2023 Quantum algorithms reformulate computational problems as quantum evolutions in a large Hilbert space. Most quantum algorithms assume that the time-evolution is perfectly unitary and that the full Hilbert space is available. However, in practice, the available entanglement may be limited, leading to a reduced fidelity of the quantum algorithms.
arxiv +1 more source
Quantum prediction algorithms [PDF]
Physical Review A, 1997 53 pages, RevTeX with ...
Adrian Kent, Jim McElwaine
openaire +3 more sources
Quantum Algorithm for Spectral Regression for Regularized Subspace Learning
IEEE Access, 2019 In this paper, we propose an efficient quantum algorithm for spectral regression which is a dimensionality reduction framework based on the regression and spectral graph analysis. The quantum algorithm involves two core subroutines: the quantum principal
Fan-Xu Meng +3 more
doaj +1 more source
Quantum Relief algorithm [PDF]
Quantum Information Processing, 2018 Relief algorithm is a feature selection algorithm used in binary classification proposed by Kira and Rendell, and its computational complexity remarkable increases with both the scale of samples and the number of features. In order to reduce the complexity, a quantum feature selection algorithm based on Relief algorithm, also called quantum Relief ...
Wen-Jie Liu +4 more
openaire +3 more sources