Results 81 to 90 of about 6,645,845 (367)
Quantum algorithm for the Vlasov equation [PDF]
The Vlasov-Maxwell system of equations, which describes classical plasma physics, is extremely challenging to solve, even by numerical simulation on powerful computers. By linearizing and assuming a Maxwellian background distribution function, we convert
A. Engel, Graeme Smith, S. Parker
semanticscholar +1 more source
Quantum image classification using principal component analysis
We present a novel quantum algorithm for classification of images. The algorithm is constructed using principal component analysis and von Neuman quantum measurements.
Gawron, Piotr +2 more
core +1 more source
Quantum Algorithm for Linear Differential Equations with Exponentially Improved Dependence on Precision [PDF]
We present a quantum algorithm for systems of (possibly inhomogeneous) linear ordinary differential equations with constant coefficients. The algorithm produces a quantum state that is proportional to the solution at a desired final time.
D. Berry +3 more
semanticscholar +1 more source
Operational Algorithms for Separable Qubit X States
This work motivates and applies operational methodology to simulation of quantum statistics of separable qubit X states. Three operational algorithms for evaluating separability probability distributions are put forward.
Demosthenes Ellinas
doaj +1 more source
Digital-analog quantum algorithm for the quantum Fourier transform [PDF]
Quantum computers will allow calculations beyond existing classical computers. However, current technology is still too noisy and imperfect to construct a universal digital quantum computer with quantum error correction.
Ana Martin +3 more
semanticscholar +1 more source
Quantum Phase Estimation Algorithm for Finding Polynomial Roots
Quantum algorithm is an algorithm for solving mathematical problems using quantum systems encoded as information, which is found to outperform classical algorithms in some specific cases.
Tansuwannont Theerapat +3 more
doaj +1 more source
The quantum query complexity of the hidden subgroup problem is polynomial
We present a quantum algorithm which identifies with certainty a hidden subgroup of an arbitrary finite group G in only a polynomial (in log |G|) number of calls to the oracle. This is exponentially better than the best classical algorithm.
Aaronson +15 more
core +1 more source
Superlinear advantage for exact quantum algorithms [PDF]
A quantum algorithm is exact if, on any input data, it outputs the correct answer with certainty (probability 1). A key question is: how big is the advantage of exact quantum algorithms over their classical counterparts: deterministic algorithms.
Ambainis, Andris
core +1 more source
Quantum algorithm for simulating the wave equation [PDF]
We present a quantum algorithm for simulating the wave equation under Dirichlet and Neumann boundary conditions. The algorithm uses Hamiltonian simulation and quantum linear system algorithms as subroutines.
Pedro C. S. Costa +2 more
semanticscholar +1 more source
Unique biological samples, such as site‐specific mutant proteins, are available only in limited quantities. Here, we present a polarization‐resolved transient infrared spectroscopy setup with referencing to improve signal‐to‐noise tailored towards tracing small signals. We provide an overview of characterizing the excitation conditions for polarization‐
Clark Zahn, Karsten Heyne
wiley +1 more source

