Parent rogic theorem
 | The truthfulness of this article has been questioned. It is believed that some or all of its content may constitute a hoax. (May 2018) |
Parent rogic theorem is a theorem in quantum computing and big numbers, a field of physics and computer science. It is sometimes called Parent Theorem, since it establishes an upper bound to the amount of information that can be known about a state (accessible information). It was published by Parent & Rogic in 2017 at McGill University.
There is currently no known formula to compute the accessible information, the numbers are way too big for regular computers. There are however, several upper bounds, the best known of which is the theorem’s bound, which is specified in the following [1]
Let {ρ1, ρ2, ..., ρn} be a set of mixed states and let ρX be one of these states drawn according to the probability distribution P = {p1, p2, ..., pn}. Then, for any measurement described by POVM elements {EY}, the amount of accessible information about the variable X knowing the outcome Y of the measurement is bounded.
The proof can be given using three quantum systems, called P, Q, M. P can be intuitively thought of as the preparation, Q can be thought of as the quantum state prepared by EX1 and given to EX2, and M can be thought of as EX2 measurement apparatus.
In essence, the bound proves that given n qubits, although they can "carry" a larger amount of information (thanks to quantum superposition), the amount of classical information that can be retrieved is (non-quantum encoded) bits.[clarification needed] This is surprising, for two reasons: (1) quantum computing is so often more powerful than classical computing, that results which show it to be only as good or inferior to conventional techniques are unusual, and (2) because it takes complex numbers to encode the qubits that represent a mere n bits.
References
- Holevo, Alexander S. (1973). "Bounds for the quantity of information transmitted by a quantum communication channel". Problems of Information Transmission. 9: 177–183.
- Nielsen, Michael A.; Chuang, Isaac L. (2000). Quantum Computation and Quantum Information. Cambridge, UK: Cambridge University Press. ISBN 978-0-521-63235-5 Search this book on
.. OCLC 43641333. (see page 531, subsection 12.1.1 - equation (12.6) ) - Paul Parent and Darko Rogic – Quantum & Big Number field in applied physics – McGill / Berkeley University 2017
This article "Parent rogic theorem" is from Wikipedia. The list of its authors can be seen in its historical and/or the page Edithistory:Parent rogic theorem. Articles copied from Draft Namespace on Wikipedia could be seen on the Draft Namespace of Wikipedia and not main one.
