Quantum algorithm for SAT problem andquantum mutual entropy
From MaRDI portal
Abstract: It is von Neumann who opened the window for today's Information epoch. He defined quantum entropy including Shannon's information more than 20 years ahead of Shannon, and he introduced a concept what computation means mathematically. In this paper I will report two works that we have recently done, one of which is on quantum algorithum in generalized sense solving the SAT problem (one of NP complete problems) and another is on quantum mutual entropy properly describing quantum communication processes.
Recommendations
Cites work
- scientific article; zbMATH DE number 1583866 (Why is no real title available?)
- scientific article; zbMATH DE number 3497764 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1342805 (Why is no real title available?)
- scientific article; zbMATH DE number 1120256 (Why is no real title available?)
- scientific article; zbMATH DE number 1530002 (Why is no real title available?)
- scientific article; zbMATH DE number 1834338 (Why is no real title available?)
- scientific article; zbMATH DE number 2110556 (Why is no real title available?)
- A Stochastic Limit Approach to the SAT Problem
- Calculation of the amount of information about a random function contained in another such function
- Complexities and their applications to characterization of chaos
- Compound channels, transition expectations, and liftings
- Conditional expectation in an operator algebra. IV. Entropy and information
- Entanglement, quantum entropy and mutual information
- How Can We Observe and Describe Chaos?
- Information dynamics and open systems. Classical and quantum approach
- New quantum algorithm for studying NP-complete problems
- On compound state and mutual information in quantum information theory (Corresp.)
- Quantum Complexity Theory
- Quantum information theory
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Relative entropy and the Wigner-Yanase-Dyson-Lieb concavity in an interpolation theory
- Relative entropy for states of von Neumann algebras. II
- Some aspects of quantum information theory and their applications to irreversible processes
- Stationary quantum source coding
- Strengths and Weaknesses of Quantum Computing
- The capacity of a quantum channel for simultaneous transmission of classical and quantum information
- Theory of transmission of information
Cited in
(9)- Rényi entropies as a measure of the complexity of counting problems
- On G\'acs' quantum algorithmic entropy
- Quantum circuit physical design methodology with emphasis on physical synthesis
- scientific article; zbMATH DE number 1583866 (Why is no real title available?)
- Solving binary \(\mathcal {MQ}\) with Grover's algorithm
- Three ``quantum algorithms to solve 3-SAT
- A two-way algorithm for the entanglement problem
- Solving SAT (and MaxSAT) with a quantum annealer: foundations, encodings, and preliminary results
- Quantum information and probability: my collaboration with Professor Ingarden
This page was built for publication: Quantum algorithm for SAT problem andquantum mutual entropy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930728)
