Can quantum entanglement detection schemes improve search?

DOI10.1007/s11128-011-0231-4zbMath1243.81061arXiv1502.01959WikidataQ57696193 ScholiaQ57696193MaRDI QIDQ430116

Andreas Wichert, Luís Tarrataca

Publication date: 20 June 2012

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

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

zbMATH Keywords

quantum computation; tree search; entanglement detection

Mathematics Subject Classification ID

68P10: Searching and sorting

81P68: Quantum computation

81P40: Quantum coherence, entanglement, quantum correlations

68Q12: Quantum algorithms and complexity in the theory of computing

81P70: Quantum coding (general)

Related Items

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

Cites Work

• Quantum redundancies and local realism
• Perfect correlations in the Einstein-Podolsky-Rosen experiment and Bell's inequalities.
• Method for Direct Detection of Quantum Entanglement
• Rapid solution of problems by quantum computation
• Strengths and Weaknesses of Quantum Computing
• Stabilization of Quantum Computations by Symmetrization
• Separability Criterion for Density Matrices
• Characterization of separable states and entanglement witnesses
• The complexity of theorem-proving procedures
• Logical Reversibility of Computation
• Can Quantum-Mechanical Description of Physical Reality Be Considered Complete?
• [https://portal.mardi4nfdi.de/wiki/Publication:5762040 Die gegenw�rtige Situation in der Quantenmechanik]
• Separability of \(n\)-particle mixed states: necessary and sufficient conditions in terms of linear maps
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item