Modified Grover’s algorithm for an expectation-value quantum computer
نویسندگان
چکیده
منابع مشابه
Shortening Grover’s Search Algorithm for an Expectation Value Quantum Computer
Quantum algorithms are conventionally formulated for implementation on a single system of qubits amenable to projective measurements. However, in expectation value quantum computation, such as nuclear magnetic resonance realizations, the computer consists of an ensemble of identical qubit-systems amenable only to expectation value measurements. The prevalent strategy in such expectation value i...
متن کاملDeterministic Quantum Annealing Expectation-Maximization Algorithm
Maximum likelihood estimation (MLE) is one of the most important methods in machine learning, and the expectation-maximization (EM) algorithm is often used to obtain maximum likelihood estimates. However, EM heavily depends on initial configurations and fails to find the global optimum. On the other hand, in the field of physics, quantum annealing (QA) was proposed as a novel optimization appro...
متن کاملAn Online Expectation-Maximisation Algorithm for Nonnegative Matrix Factorisation Models
In this paper we formulate the nonnegative matrix factorisation (NMF) problem as a maximum likelihood estimation problem for hidden Markov models and propose online expectation-maximisation (EM) algorithms to estimate the NMF and the other unknown static parameters. We also propose a sequential Monte Carlo approximation of our online EM algorithm. We show the performance of the proposed method ...
متن کاملAn Expectation-Maximization Algorithm for the Fractal Inverse Problem
We present an Expectation-Maximization algorithm for the fractal inverse problem: the problem of fitting a fractal model to data. In our setting the fractals are Iterated Function Systems (IFS), with similitudes as the family of transformations. The data is a point cloud in R with arbitrary dimension H. Each IFS defines a probability distribution on R , so that the fractal inverse problem can b...
متن کاملAn expectation maximization algorithm for training hidden substitution models.
We derive an expectation maximization algorithm for maximum-likelihood training of substitution rate matrices from multiple sequence alignments. The algorithm can be used to train hidden substitution models, where the structural context of a residue is treated as a hidden variable that can evolve over time. We used the algorithm to train hidden substitution matrices on protein alignments in the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Physical Review A
سال: 2002
ISSN: 1050-2947,1094-1622
DOI: 10.1103/physreva.65.052321