Algebraic analysis of quantum search with pure and mixed states

DOI10.1103/PhysRevA.71.042320zbMath1227.81129arXivquant-ph/0504149OpenAlexW2074434391MaRDI QIDQ3102421

Yishai Shimoni, Daniel Shapira, O. Biham

Publication date: 4 December 2011

Published in: Physical Review A (Search for Journal in Brave)

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

zbMATH Keywords

Grover's quantum search algorithm

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum computation (81P68)

Related Items (6)

Dynamical analysis of Grover's search algorithm in arbitrarily high-dimensional search spaces ⋮ An improved formalism for quantum computation based on geometric algebra -- case study: Grover's search algorithm ⋮ Quantum algorithm for the asymmetric weight decision problem and its generalization to multiple weights ⋮ Deterministic generations of quantum state with no more than six qubits ⋮ MÖBIUS TRANSFORMATIONS IN QUANTUM AMPLITUDE AMPLIFICATION WITH GENERALIZED PHASES ⋮ Quantum entanglement involved in Grover's and Shor's algorithms: the four-qubit case

Cites Work

• Quantum computers and unstructured search: finding and counting items with an arbitrarily entangled initial state
• Phase matching in quantum searching.
• Characterization of pure quantum states of multiple qubits using the Groverian entanglement measure
• Strengths and Weaknesses of Quantum Computing

This page was built for publication: Algebraic analysis of quantum search with pure and mixed states