- Conference date: 19–23 July 2010
- Location: Brisbane, (Australia)
An algebraic reformulation of the quantum search algorithm associated to a k‐valued oracle function, is introduced in terms of the so called oracle matrix algebra , by means of which a Bloch sphere like description of search is obtained. A parametric family of symmetric completely positive trace preserving (CPTP) maps, that formalize the presence of quantum noise but preserves the complexity of the algorithm, is determined. Dimensional reduction of representations of oracle Lie algebra is introduced in order to determine the reduced density matrix of subsets of qubits in database. The L1 vector‐induced norm of reduced density matrix is employed to define an index function for the quantum entanglement between database qubits, in the presence of non invariant noise CPTP maps. Analytic investigations provide a causal relation between entanglement and fidelity of the algorithm, which is controlled by quantum noise parameter.
MOST READ THIS MONTH
MOST CITED THIS MONTH
Article metrics loading...