A Proposal for Quantum Fisher Information Optimization and its Relation with Entanglement Measures (1705.04682v1)
Abstract: Studies about Quantum Information Theory continue actively in many research institutions. Very recently, pratical setups of large scale quantum computers are widely studied e.g. quantum repeaters, memories and processors. Entanglement provides us a computational advantage in realization of quantum algorithms. Some ways to quantifiying entanglement were defined. The best formal way to quantify it, is the methods that we call Entanglement Measures or Entanglement Monotones. In this research area, State Ordering Problem is defined and still an open problem especially for multiparticle entangled states. Fisher Information provides a good background for the solution of some actual Information Theory problems. Quantum Fisher Information (QFI) is a value that could be used in situations where phase sensitivity is important and this concept is expected to be the quantum version of the mentioned inftrastructure for Quantum Systems. QFI cannot be defined as an Entaglement Measure or Monotone. In the scope of this thesis, a new optimization technique is proposed for optimizing QFI and thanks to this optimization method, the ordering relation between QFI and entanglement measures is studied. Based on the studies made in the area of quantum state ordering, new and interesting analysis results are found and reported. The main important and interesting result achieved is that for two qubit quantum states, QFI maximized under Local Operation and Classical Communication has an interesting ordering relation with entanglement measures especially with Relative Entropy of Entanglement. Our study is extended for the qubit-qutrit systems and ordering relations and classification results are presented. For some quantum systems, the changes in QFI under decoherence channels are also considered.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.