Information-Theoretic Meaning of Quantum Information Flow and Its Applications to Amplitude Amplification Algorithms
arXiv:1805.05111 · doi:10.1103/PhysRevA.100.032303
Abstract
The advantages of quantum information processing are in many cases obtained as consequences of quantum interactions, especially for computational tasks where two-qubit interactions are essential. In this work, we establish the framework of analyzing and quantifying loss or gain of information on a quantum system when the system interacts with its environment. We show that the information flow, the theoretical method of characterizing (non-)Markovianity of quantum dynamics, corresponds to the rate of the minimum uncertainty about the system given quantum side information. Thereafter, we analyze the information exchange among subsystems that are under the performance of quantum algorithms, in particular, the amplitude amplification algorithms where the computational process relies fully on quantum evolution. Different realizations of the algorithm are considered, such as i)quantum circuits, ii) analog computation, and iii) adiabatic computation. It is shown that, in all the cases, our formalism provides insights about the process of amplifying the amplitude from the information flow or leakage on the subsystems.
arXiv comment7 pages, 5 figures, close to the published version
References in corpus (27)
- Entanglement of Formation of an Arbitrary State of Two Qubits
- Quantum Mechanics helps in searching for a needle in a haystack
- Elementary gates for quantum computation
- Entanglement of a Pair of Quantum Bits
- Measure for the Degree of Non-Markovian Behavior of Quantum Processes in Open Systems
- Non-Markovian dynamics in open quantum systems
- Two-Bit Gates are Universal for Quantum Computation
- Entanglement and non-Markovianity of quantum evolutions
- The operational meaning of min- and max-entropy
- Grover's quantum searching algorithm is optimal
- Quantum Search by Local Adiabatic Evolution
- Experimental control of the transition from Markovian to non-Markovian dynamics of open quantum systems
- On the degree of non-Markovianity of quantum evolution
- Universality in Quantum Computation
- On measures of non-Markovianity: divisibility vs. backflow of information
- Concurrence of mixed bipartite quantum states in arbitrary dimensions
- Concurrence of mixed multi-partite quantum states
- A Universal Two--Bit Gate for Quantum Computation
- Optimal state pairs for non-Markovian quantum dynamics
- Multipartite entanglement in quantum algorithms
- Equivalence between divisibility and monotonic decrease of information in classical and quantum stochastic processes
- Divisibility and Information Flow Notions of Quantum Markovianity for Noninvertible Dynamical Maps
- A smooth entropy approach to quantum hypothesis testing and the classical capacity of quantum channels
- Operational Characterization of Divisibility of Dynamical Maps
- Effective dynamics of disordered quantum systems
- No-signaling Principle Can Determine Optimal Quantum State Discrimination
- Grover search and the no-signaling principle