Can quantum entanglement detection schemes improve search?

DOI10.1007/S11128-011-0231-4zbMATH Open1243.81061arXiv1502.01959OpenAlexW3103941697WikidataQ57696193 ScholiaQ57696193MaRDI QIDQ430116FDOQ430116

Authors: Luís Tarrataca, Andreas Wichert 

Publication date: 20 June 2012

Published in: Quantum Information Processing (Search for Journal in Brave)

Abstract: Quantum computation, in particular Grover's algorithm, has aroused a great deal of interest since it allows for a quadratic speedup to be obtained in search procedures. Classical search procedures for an $N$ element database require at most $O(N)$ time complexity. Grover's algorithm is able to find a solution with high probability in $O(sqrtN)$ time through an amplitude amplification scheme. In this work we draw elements from both classical and quantum computation to develop an alternative search proposal based on quantum entanglement detection schemes. In 2002, Horodecki and Ekert proposed an efficient method for direct detection of quantum entanglement. Our proposition to quantum search combines quantum entanglement detection alongside entanglement inducing operators. Grover's quantum search relies on measuring a quantum superposition after having applied a unitary evolution. We deviate from the standard method by focusing on fine-tuning a unitary operator in order to infer the solution with certainty. Our proposal sacrifices space for speed and depends on the mathematical properties of linear positive maps $Lambda$ which have not been operationally characterized. Whether such a $Lambda$ can be easily determined remains an open question.

Full work available at URL: https://arxiv.org/abs/1502.01959

Recommendations

• scientific article
• Enhanced quantum searching via entanglement and partial diffusion
• Perturbations can enhance quantum search
• Optimized search for complex protocols based on entanglement detection
• ENTANGLEMENT IN ADIABATIC QUANTUM SEARCHING ALGORITHMS
• Entanglement in the Grover search algorithm
• QUANTUM SEARCH ALGORITHM CAN BE IMPROVED
• BELL'S INEQUALITIES DETECT EFFICIENT ENTANGLEMENT

zbMATH Keywords

quantum computationtree searchentanglement detection

Mathematics Subject Classification ID

Searching and sorting (68P10) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum computation (81P68) Quantum coherence, entanglement, quantum correlations (81P40) Quantum coding (general) (81P70)

Cites Work

• Introduction to algorithms
• Title not available (Why is that?)
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• Strengths and Weaknesses of Quantum Computing
• Separability Criterion for Density Matrices
• The complexity of theorem-proving procedures
• Logical Reversibility of Computation
• Die gegenw�rtige Situation in der Quantenmechanik
• Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps
• Rapid solution of problems by quantum computation
• Title not available (Why is that?)
• Quantum redundancies and local realism
• Method for direct detection of quantum entanglement
• Perfect correlations in the Einstein-Podolsky-Rosen experiment and Bell's inequalities.
• Strong NP-hardness of the quantum separability problem
• Stabilization of Quantum Computations by Symmetrization
• Characterization of separable states and entanglement witnesses

Cited In (1)

• Approximate conditional teleportation of a \(\Lambda\)-type three-level atomic state based on cavity QED method beyond Bell-state measurement

This page was built for publication: Can quantum entanglement detection schemes improve search?

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