Quantum algorithms for the ordered search problem via semidefinite programming
Abstract
One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log{sub 2} N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log{sub 605} N{approx_equal}0.433 log{sub 2} N queries, which improves upon the previously best known exact algorithm.
 Authors:
 Institute for Quantum Information, California Institute of Technology, Pasadena, California 91125 (United States)
 Center for Advanced Studies, Department of Physics and Astronomy, University of New Mexico, Albuquerque, New Mexico 87131 (United States)
 Laboratory for Information and Decision Systems, Massachusetts Institute of Technology, Cambridge, Massachusetts 02139 (United States)
 Publication Date:
 OSTI Identifier:
 20982281
 Resource Type:
 Journal Article
 Resource Relation:
 Journal Name: Physical Review. A; Journal Volume: 75; Journal Issue: 3; Other Information: DOI: 10.1103/PhysRevA.75.032335; (c) 2007 The American Physical Society; Country of input: International Atomic Energy Agency (IAEA)
 Country of Publication:
 United States
 Language:
 English
 Subject:
 71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSICS; ALGORITHMS; PROGRAMMING; QUANTUM COMPUTERS; QUANTUM INFORMATION; QUANTUM MECHANICS
Citation Formats
Childs, Andrew M., Landahl, Andrew J., and Parrilo, Pablo A. Quantum algorithms for the ordered search problem via semidefinite programming. United States: N. p., 2007.
Web. doi:10.1103/PHYSREVA.75.032335.
Childs, Andrew M., Landahl, Andrew J., & Parrilo, Pablo A. Quantum algorithms for the ordered search problem via semidefinite programming. United States. doi:10.1103/PHYSREVA.75.032335.
Childs, Andrew M., Landahl, Andrew J., and Parrilo, Pablo A. 2007.
"Quantum algorithms for the ordered search problem via semidefinite programming". United States.
doi:10.1103/PHYSREVA.75.032335.
@article{osti_20982281,
title = {Quantum algorithms for the ordered search problem via semidefinite programming},
author = {Childs, Andrew M. and Landahl, Andrew J. and Parrilo, Pablo A.},
abstractNote = {One of the most basic computational problems is the task of finding a desired item in an ordered list of N items. While the best classical algorithm for this problem uses log{sub 2} N queries to the list, a quantum computer can solve the problem using a constant factor fewer queries. However, the precise value of this constant is unknown. By characterizing a class of quantum query algorithms for the ordered search problem in terms of a semidefinite program, we find quantum algorithms for small instances of the ordered search problem. Extending these algorithms to arbitrarily large instances using recursion, we show that there is an exact quantum ordered search algorithm using 4 log{sub 605} N{approx_equal}0.433 log{sub 2} N queries, which improves upon the previously best known exact algorithm.},
doi = {10.1103/PHYSREVA.75.032335},
journal = {Physical Review. A},
number = 3,
volume = 75,
place = {United States},
year = 2007,
month = 3
}

We express the optimization of entanglement witnesses for arbitrary bipartite states in terms of a class of convex optimization problems known as robust semidefinite programs (RSDPs). We propose, using well known properties of RSDPs, several sufficient tests for separability of mixed states. Our results are then generalized to multipartite density operators.

Checking 2xM quantum separability via semidefinite programming
In this paper, we propose a sequence of tests which give a definitive test for checking 2xM separability. The test is definitive in the sense that each test corresponds to checking membership in a cone, and that the closure of the union of all these cones consists exactly of all 2xM separable states. Membership in each single cone may be checked via semidefinite programming, and is thus a tractable problem. This sequential test comes about by considering the dual problem, the characterization of all positive maps acting C{sup 2x2}{yields}C{sup MxM}. The latter in turn is solved by characterizing all positivemore » 
Suboptimal quantumerrorcorrecting procedure based on semidefinite programming
In this paper, we consider a simplified errorcorrecting problem: for a fixed encoding process, to find a cascade connected quantum channel such that the worst fidelity between the input and the output becomes maximum. With the use of the onetoone parametrization of quantum channels, a procedure finding a suboptimal errorcorrecting channel based on a semidefinite programming is proposed. The effectiveness of our method is verified by an example of the bitflip channel decoding. 
Global solutions of restricted openshell HartreeFock theory from semidefinite programming with applications to strongly correlated quantum systems
We present a density matrix approach for computing global solutions of restricted openshell HartreeFock theory, based on semidefinite programming (SDP), that gives upper and lower bounds on the HartreeFock energy of quantum systems. While wave function approaches to HartreeFock theory yield an upper bound to the HartreeFock energy, we derive a semidefinite relaxation of HartreeFock theory that yields a rigorous lower bound on the HartreeFock energy. We also develop an upperbound algorithm in which HartreeFock theory is cast as a SDP with a nonconvex constraint on the rank of the matrix variable. Equality of the upper and lowerbound energies guaranteesmore » 