Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state

DOI10.1016/S0375-9601(01)00025-1zbMATH Open0972.81020arXivquant-ph/9909089MaRDI QIDQ1840940FDOQ1840940

Authors: Alberto Carlini, Akio Hosoya 

Publication date: 20 February 2001

Published in: Physics Letters. A (Search for Journal in Brave)

Abstract: Grover's quantum algorithm for an unstructured search problem and the Count algorithm by Brassard et al. are generalized to the case when the initial state is arbitrarily and maximally entangled. This ansatz might be relevant with quantum subroutines, when the computational qubits and the environment are coupled, and in general when the control over the quantum system is partial.

Full work available at URL: https://arxiv.org/abs/quant-ph/9909089

Recommendations

• The generalized quantum database search algorithm
• scientific article; zbMATH DE number 1406119
• Entanglement in the Grover search algorithm
• scientific article; zbMATH DE number 1284000
• scientific article; zbMATH DE number 2020426

zbMATH Keywords

coupled commputational qubitspartial quantum system controlunstructured search quantum algorithm

Mathematics Subject Classification ID

Quantum computation (81P68)

Cites Work

• Quantum computation
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• The computer as a physical system: a microscopic quantum mechanical Hamiltonian model of computers as represented by Turing machines
• Strengths and Weaknesses of Quantum Computing
• Title not available (Why is that?)
• Phase matching in quantum searching.

Cited In (7)

• Quantum search in a possible three-dimensional complex subspace
• A desired state can not be found with certainty for Grover's algorithm in a possible three-dimensional complex subspace
• Experimental NMR realization of a generalized quantum search algorithm
• Phase matching condition for quantum search with a generalized initial state
• From orthogonal projections to a generalized quantum search
• Algebraic analysis of quantum search with pure and mixed states
• Generalized quantum counting algorithm for non-uniform amplitude distribution

This page was built for publication: Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1840940)