Quantum algorithm for SAT problem andquantum mutual entropy
From MaRDI portal
Publication:930728
DOI10.1016/S0034-4877(05)80007-2zbMath1140.81335arXivquant-ph/0406214OpenAlexW2087897565MaRDI QIDQ930728
Publication date: 1 July 2008
Published in: Reports on Mathematical Physics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/quant-ph/0406214
Quantum computation (81P68) Measures of information, entropy (94A17) Channel models (including quantum) in information and communication theory (94A40)
Related Items
Quantum circuit physical design methodology with emphasis on physical synthesis ⋮ Quantum Information and Probability: My Collaboration with Professor Ingarden
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some aspects of quantum information theory and their applications to irreversible processes
- Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
- Quantum information theory
- Relative entropy for states of von Neumann algebras. II
- Complexities and their applications to characterization of chaos
- Compound channels, transition expectations, and liftings
- Information dynamics and open systems. Classical and quantum approach
- New quantum algorithm for studying NP-complete problems
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- Stationary quantum source coding
- Calculation of the amount of information about a random function contained in another such function
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum Complexity Theory
- Strengths and Weaknesses of Quantum Computing
- How Can We Observe and Describe Chaos?
- Entanglement, quantum entropy and mutual information
- A Stochastic Limit Approach to the SAT Problem
- On compound state and mutual information in quantum information theory (Corresp.)
- Theory of transmission of information
- Conditional expectation in an operator algebra. IV. Entropy and information
