arXiv:quant-ph/0509052

Implications of the Luders Postulate for Quantum Algorithms

Bernhard K. Meister

Published Sep 7, 2005• 0 citations

Abstract

The Luders postulate is reviewed and implications for quantum algorithms are discussed. A search algorithm for an unstructured database is described.

DOI: 10.48550/arxiv.quant-ph/0509052

Related papers

Models of quantum search algorithms. Introduction for IT students – pedagogical examples

Иванцова О. В., Nikita Ryabov, V. Korenkov +1 more

This article is one of a series of articles on quantum algorithms. The article discusses quantum oracle models and Grover's computational algorithm for search problems in an unstructured database.

System Analysis in Science and EducationJan 1, 20200 citations

A New Efficient Quantum Search Algorithm for searching explicitly known target hidden in the unstructured database

Dhananjay P. Mehendale

Jan 1, 20260 citations

A New Exponentially Fast Quantum Algorithm for Searching Target in the Unstructured Database

Quantum Physics LettersApr 1, 20220 citations

A Simple Quantum Algorithm for Exponentially Fast Target Searching in the Unstructured Database

Dhananjay P. Mehendale

Quantum Physics LettersAug 1, 20173 citations

THE LÜDERS POSTULATE AND THE DISTINGUISHABILITY OF OBSERVABLES

BERNHARD K. MEISTER

The Lüders postulate is reviewed and implications for the distinguishability of observables are discussed. As an example the distinguishability of two similar spin-[Formula: see text] particle observables is described and implementation issues are briefly analyzed.

arXiv:quant-ph/0701118International Journal of Modern Physics BSep 30, 20070 citations

Quantum Algorithms

Seyed Massoud Amini

We give a short overview of quantum algorithms. Some famous algorithms such as Deutsch-Jozsa and Simon are covered with more details. The directions for further development are addressed,

Jun 1, 20090 citations