Quantum information

From Wikipedia, the free encyclopedia
  (Redirected from Quantum information theory)
Jump to navigation Jump to search
Optical lattices use lasers to separate rubidium atoms (red) for use as information bits in neutral-atom quantum processors -- prototype devices which designers are trying to develop into full-fledged quantum computers.[1] Credit: NIST

Quantum information is the information of the state of a quantum system. It is the basic entity of study in quantum information theory,[2] and can be manipulated using quantum information processing techniques. Quantum information refers to both the technical definition in terms of Von Neumann entropy and the general computational term.

It an interdisciplinary field that involves quantum mechanics, computer science, information theory, philosophy and cryptography among other fields.[3][4] It's study is also relevant to disciplines such as cognitive science, psychology and neuroscience.[5] Its main focus is in extracting information from matter at the microscopic scale. Observation in science is one of the most important ways of acquiring information and measurement is required in order to quantify the observation, making this crucial to the scientific method. In quantum mechanics, due to the uncertainty principle, non-commuting observables cannot be precisely measured simultaneously. The act of measurement disturbs the state of the system.[6] Hence, it is impossible to make a perfect measurement in microscopic or quantum systems.[5]

Information is something that is encoded in the state of a quantum system,[6] it is physical.[6] While quantum mechanics deals with examining properties of matter at the microscopic level, [7][8][5] quantum information science focuses on extracting information from those properties,[5] and quantum computation manipulates and processes information - performs logical operations - using quantum information processing techniques.[9]

Quantum information, like classical information, can be processed using digital computers, transmitted from one location to another, manipulated with algorithms, and analyzed with computer science and mathematics. Just like the basic unit of classical information is the bit, quantum information deals with qubits. Quantum information can be measured using Von Neumann entropy.

Recently, the field of quantum computing has become an active research area because of the possibility to disrupt modern computation, communication, and cryptography.[10]

History and Development[edit]

Development from fundamental quantum mechanics[edit]

The history of quantum information began at the turn of the 20th century when classical physics was revolutionized into quantum physics.The theories of classical physics were predicting absurdities such as the ultraviolet catastrophe, or electrons spiraling into the nucleus. At first these problems were brushed aside by adding ad hoc hypothesis to classical physics. Soon, it became apparent that a new theory must be created in order to make sense of these absurdities, and the theory of quantum mechanics was born.[2]

Quantum mechanics was formulated by Schrodinger using wave mechanics and Heisenberg using matrix mechanics.[citation needed] The equivalence of these methods was proven later.[11] Their formulations described the dynamics of microscopic systems but had several unsatisfactory aspects in describing measurement processes. Von Neumann formulated quantum theory using operator algebra in a way that it described measurement as well as dynamics.[12] These studies emphasized the philosophical aspects of measurement rather than a quantitative approach to extracting information via measurements.

See: Dynamical Pictures

Evolution Picture
of: Heisenberg Schrödinger
Ket state constant
Observable constant
Density matrix constant

Development from communication[edit]

In 1960s, Stratonovich, Helstrom and Gordon[13] proposed a formulation of optical communications using quantum mechanics. This was the first historical appearance of quantum information theory. They mainly studied error probabilities and channel capacities for communication.[13][14] Later, Holevo obtained an upper bound of communication speed in the transmission of a classical message via a quantum channel.[15] [16]

Development from atomic physics and relativity[edit]

In the 1970s techniques of manipulating single quantum states such as the atom trap and the scanning tunneling microscope were starting to get developed. Isolating single atoms and moving them around to fashion an array of atoms at will was starting to become a reality. Prior to these developments, complete control over single quantum systems was not possible, and techniques involved a somewhat coarse level of control over a large number of quantum systems, none of which individually were directly accessible.[2] Extracting and manipulating information stored in individual atoms naturally started to become an interesting avenue, and quantum information and computation was starting to get developed.

In the 1980s, interest arose in whether it might be possible to use quantum effects to signal faster than light, an attempt of disproving Einstein's theory of relativity. If cloning an unknown quantum state were possible then Einstein's theory could be disproved. However, it turns out that quantum states could not, in general, be cloned. The no-cloning theorem is one of the earliest results of quantum information.[2]

Development from cryptography[edit]

Despite all the excitement and interest over studying isolated quantum systems and trying to find a way to circumvent the theory of relativity, research in quantum information theory became stagnant in the 1980s. However, around the same time another avenue started dabbling into quantum information and computation: Cryptography. In a general sense, cryptography is the problem of doing communication or computation involving two or more parties who may not trust one another.[2]

Bennett and Brassard developed a communication channel on which it is impossible eavesdrop without being detected, a way of communicating secretly at long distances using the BB84 quantum cryptographic protocol.[17]The key idea was the use of the fundamental principle of quantum mechanics that observation disturbs the observed, and the introduction of a eavesdropper in a secure communication line will immediately let the two parties trying to communicate would know of the presence of the eavesdropper.

See also: Quantum cryptography

Development from computer science and mathematics[edit]

With the advent of Alan Turing's revolutionary ideas of a programmable computer, or Turing machine, he showed that any real-world computation can be translated into an equivalent computation involving a Turing machine. [18][19]This is known as the Church-Turing Thesis.

Soon enough, the first computers were made and computer hardware grew at such a fast pace that the growth, through experience in production, was codified into an empirical relationship called Moore's law. This 'law' is a projective trend that states that the number of transistors in an integrated circuit doubles every two years.[20] As transistors began to become smaller and smaller in order to pack more power per surface area, quantum effects started to show up in the electronics resulting in inadvertent interference. This led to the advent of quantum computing, which used quantum mechanics to design algorithms.

At this point, quantum computers showed promise of being much faster than classical computers for certain specific problems. One such example problem was developed by David Deutsch and Richard Jozsa, known as the Deutsch–Jozsa algorithm. This problem however held little to no practical applications.[2] Peter Shor in 1994 came up with a very important and practical problem, one of finding the prime factors of an integer. The discrete logarithm problem as it was called, could be solved efficiently on a quantum computer but not on a classical computer hence showing that quantum computers are more powerful than Turing machines.

See also: Quantum Supremacy, Quantum algorithms

Development from information theory[edit]

Around the time computer science was making a revolution, so was information theory and communication, through Claude Shannon.[21][22][23] Shannon developed two fundamental theorems of information theory: noiseless channel coding theorem and noisy channel coding theorem. He also showed that error correcting codes could be used to protect information being sent.

Quantum information theory also followed a similar trajectory, Ben Schumacher in 1995 made an analogue to Shannon's noiseless coding theorem using the qubit. A theory of error-correction also developed, which allows quantum computers to make efficient computations regardless of noise, and make reliable communication over noisy quantum channels.[2]

Qubits and quantum information[edit]

Quantum information differs strongly from classical information, epitomized by the bit, in many striking and unfamiliar ways. While the fundamental unit of classical information is the bit, the most basic unit of quantum information is the qubit. Classical information is measured using Shannon entropy, while the quantum mechanical analogue is Von Neumann entropy. Given a statistical ensemble of quantum mechanical systems with the density matrix , it is given by [2] Many of the same entropy measures in classical information theory can also be generalized to the quantum case, such as Holevo entropy[24] and the conditional quantum entropy.

Unlike classical digital states (which are discrete), a qubit is continuous-valued, describable by a direction on the Bloch sphere. Despite being continuously valued in this way, a qubit is the smallest possible unit of quantum information, and despite the qubit state being continuously-valued, it is impossible to measure the value precisely. Five famous theorems describe the limits on manipulation of quantum information.[2]

  1. no-teleportation theorem, which states that a qubit cannot be (wholly) converted into classical bits; that is, it cannot be "read".
  2. no-cloning theorem, which prevents an arbitrary qubit from being copied.
  3. no-deleting theorem, which prevents an arbitrary qubit from being deleted.
  4. no-broadcast theorem, Although a single qubit can be transported from place to place (e.g. via quantum teleportation), it cannot be delivered to multiple recipients.
  5. no-hiding theorem, which demonstrates the conservation of quantum information.

These theorems prove that quantum information within the universe is conserved. They open up possibilities in quantum information processing.

Quantum information processing[edit]

The state of a qubit contains all of its information. This state is frequently expressed as a vector on the Bloch sphere. This state can be changed by applying linear transformations or quantum gates to them. These unitary transformations are described as rotations on the Bloch Sphere. While classical gates correspond to the familiar operations of Boolean logic, quantum gates are physical unitary operators.

  • Due to the volatility of quantum systems and the impossibility of copying states, the storing of quantum information is much more difficult than storing classical information. Nevertheless, with the use of quantum error correction quantum information can still be reliably stored in principle. The existence of quantum error correcting codes has also led to the possibility of fault tolerant quantum computation.
  • Classical bits can be encoded into and subsequently retrieved from configurations of qubits, through the use of quantum gates. By itself, a single qubit can convey no more than one bit of accessible classical information about its preparation. This is Holevo's theorem. However, in superdense coding a sender, by acting on one of two entangled qubits, can convey two bits of accessible information about their joint state to a receiver.
  • Quantum information can be moved about, in a quantum channel, analogous to the concept of a classical communications channel. Quantum messages have a finite size, measured in qubits; quantum channels have a finite channel capacity, measured in qubits per second.
  • Quantum information, and changes in quantum information, can be quantitatively measured by using an analogue of Shannon entropy, called the von Neumann entropy.
  • In some cases quantum algorithms can be used to perform computations faster than in any known classical algorithm. The most famous example of this is Shor's algorithm that can factor numbers in polynomial time, compared to the best classical algorithms that take sub-exponential time. As factorization is an important part of the safety of RSA encryption, Shor's algorithm sparked the new field of post-quantum cryptography that tries to find encryption schemes that remain safe even when quantum computers are in play. Other examples of algorithms that demonstrate quantum supremacy include Grover's search algorithm, where the quantum algorithm gives a quadratic speed-up over the best possible classical algorithm. The complexity class of problems efficiently solvable by a quantum computer is known as BQP.
  • Quantum key distribution (QKD) allows unconditionally secure transmission of classical information, unlike classical encryption, which can always be broken in principle, if not in practice. Do note that certain subtle points regarding the safety of QKD are still hotly debated.

The study of all of the above topics and differences comprises quantum information theory.

Relation to quantum mechanics[edit]

Quantum mechanics is the study of how microscopic physical systems change dynamically in nature. In the field of quantum information theory, the quantum systems studied are abstracted away from any real world counterpart. A qubit might for instance physically be a photon in a linear optical quantum computer, an ion in a trapped ion quantum computer, or it might be a large collection of atoms as in a superconducting quantum computer. Regardless of the physical implementation, the limits and features of qubits implied by quantum information theory hold as all these systems are all mathematically described by the same apparatus of density matrices over the complex numbers. Another important difference with quantum mechanics is that, while quantum mechanics often studies infinite-dimensional systems such as a harmonic oscillator, quantum information theory concerns both with continuous-variable systems[25] and finite-dimensional systems [26] .[27][28]

Entropy and Information[edit]

Entropy measures the uncertainty in the state of a physical system.[2] Entropy can be studied from the point of view of both the classical and quantum information theories.

Classical Information[edit]

Classical information is based on the concepts of information laid out by Claude Shannon. Classical information, in principle, can be stored in a bit of binary strings. Any system having two states is a capable bit.[29]

Shannon Entropy[edit]

Main article: Entropy (information theory)

Shannon entropy is the quantification of the information gained by measuring the value of a random variable. Another way of thinking about it is by looking at the uncertainty of a system prior to measurement. As a result, entropy, as pictured by Shannon, can be seen either a measure of the uncertainty prior to making a measurement or as a measure of information gained after making said measurement.[2]

Shannon entropy, written as a functional of a discrete probability distribution, associated with events , can be seen as the average information associated with this set of events, in units of bits:

This definition of entropy can be used to quantify the physical resources required to store the output of an information source. The ways of interpreting Shannon entropy discussed above are usually only meaningful when the number of samples of an experiment is large.[30]

See also: Shannon's noiseless channel coding theorem

Rényi Entropy[edit]

Main article: Rényi entropy

The Rényi entropy is a generalization of Shannon entropy defined above. The Rényi entropy of order r, written as a function of a discrete probability distribution, , associated with events , is defined as:[29]

for and

We arrive at the definition of Shannon entropy from Rényi when

Quantum Information[edit]

Quantum information theory is largely an extension of classical information theory to quantum systems. Classical information is produced when measurements of quantum systems are made.[29]

Von Neumann entropy[edit]

Main article: Von Neumann entropy

One interpretation of Shannon entropy was the uncertainty associated with a probability distribution. When we want to describe the information or the uncertainty of a quantum state, the probability distributions are simply swapped out by density operators .

s are the eigenvalues of .

Von Neumann plays a similar role in quantum information that Shannon entropy does in classical information

Applications[edit]

Quantum communication

Quantum communication is one of the applications of quantum physics and quantum information. There are some famous theorems such as the no-cloning theorem that illustrate some important properties in quantum communication. Dense coding and quantum teleportation are also applications of quantum communication. They are two opposite ways to communicate using qubits. While teleportation transfers one qubit from Alice and Bob by communicating two classical bits under the assumption that Alice and Bob have a pre-shared Bell state, dense coding transfers two classical bits from Alice to Bob by using one qubit, again under the same assumption, that Alice and Bob have a pre-shared Bell state.

Quantum Key Distribution

Main article: Quantum Key Distribution

One of the best known applications of quantum cryptography is quantum key distribution which provide a theoretical solution to the security issue of a classical key. The advantage of quantum key distribution is that it is impossible to copy a quantum key because of the no-cloning theorem. If someone tries to read encoded data, the quantum state being transmitted will change. This could be used to detect eavesdropping.

The first quantum key distribution scheme BB84, developed by Charles Bennett and Gilles Brassard in 1984. It is usually explained as a method of securely communicating a private key from a third party to another for use in one-time pad encryption.[2]

  • E91

E91 was made by Artur Ekert in 1991. His scheme uses entangled pairs of photons. These two photons can be created by Alice, Bob, or by a third party including eavesdropper Eve. One of the photons is distributed to Alice and the other to Bob so that each one ends up with one photon from the pair.

This scheme relies on two properties of quantum entanglement:

  1. The entangled states are perfectly correlated which means that if Alice and Bob both measure their particles having either a vertical or horizontal polarization, they always get the same answer with 100% probability. The same is true if they both measure any other pair of complementary (orthogonal) polarizations. This necessitates that the two distant parties have exact directionality synchronization. However, from quantum mechanics theory the quantum state is completely is completely random so that it is impossible for Alice to predict if she will get vertical polarization or horizontal polarization results.
  2. Any attempt at eavesdropping by Eve destroys this quantum entanglement such that Alice and Bob can detect.
  • B92

B92 is a simpler version of BB84.[31]

The main difference between B92 and BB84:

  • B92 only needs two states
  • BB84 needs 4 polarization states

Like the BB84, Alice transmits to Bob a string of photons encoded with randomly chosen bits but this time the bits Alice chooses the bases she must use. Bob still randomly chooses a basis by which to measure but if he chooses the wrong basis, he will not measure anything which is guaranteed by quantum mechanics theories. Bob can simply tell Alice after each bit she sends whether or not he measured it correctly.[32]

Quantum computation

Main article: Quantum computing

The most widely used model in quantum computation is the quantum circuit, which are based on the quantum bit "qubit". Qubit is somewhat analogous to the bit in classical computation. Qubits can be in a 1 or 0 quantum state, or they can be in a superposition of the 1 and 0 states. However, when qubits are measured the result of the measurement is always either a 0 or a 1; the probabilities of these two outcomes depend on the quantum state that the qubits were in immediately prior to the measurement.

Any quantum computation algorithm can be represented as a network of quantum logic gates.

Quantum decoherence

Main article: Quantum decoherence

If a quantum system were perfectly isolated, it would maintain coherence perfectly, but it would be impossible to test the entire system. If it is not perfectly isolated, for example during a measurement, coherence is shared with the environment and appears to be lost with time; this process is called quantum decoherence. As a result of this process, quantum behavior is apparently lost, just as energy appears to be lost by friction in classical mechanics.

Quantum error correction

Main article: Quantum error correction

QEC is used in quantum computing to protect quantum information from errors due to decoherence and other quantum noise. Quantum error correction is essential if one is to achieve fault-tolerant quantum computation that can deal not only with noise on stored quantum information, but also with faulty quantum gates, faulty quantum preparation, and faulty measurements.

Peter Shor first discovered this method of formulating a quantum error correcting code by storing the information of one qubit onto a highly entangled state of ancilla qubits. A quantum error correcting code protects quantum information against errors.

Journals[edit]

Many journals publish research in quantum information science, although only a few are dedicated to this area. Among these are:

See also[edit]

Notes[edit]

  1. ^ "Free-Images.com - Free Public Domain Images". free-images.com. Retrieved 2020-11-13.
  2. ^ a b c d e f g h i j k l Nielsen, Michael A. (2010). Quantum computation and quantum information. Chuang, Isaac L. (10th anniversary ed.). Cambridge: Cambridge University Press. ISBN 978-1107002173. OCLC 665137861.
  3. ^ Bokulich, Alisa; Jaeger, Gregg (2010-06-10). Philosophy of Quantum Information and Entanglement. Cambridge University Press. ISBN 978-1-139-48766-5.
  4. ^ Benatti, Fabio; Fannes, Mark; Floreanini, Roberto; Petritis, Dimitri (2010-09-21). Quantum Information, Computation and Cryptography: An Introductory Survey of Theory, Technology and Experiments. Springer Science & Business Media. ISBN 978-3-642-11913-2.
  5. ^ a b c d Hayashi, Masahito (2017). Quantum Information Theory. Graduate Texts in Physics. doi:10.1007/978-3-662-49725-8. ISBN 978-3-662-49723-4.[page needed]
  6. ^ a b c Preskill, John. "Lecture notes for physics 229." Quantum information and computation 16 (1998).
  7. ^ "The Feynman Lectures on Physics Vol. III Ch. 1: Quantum Behavior". wayback.archive-it.org. Retrieved 2020-11-11.
  8. ^ "Quantum mechanics", Wikipedia, 2020-11-05, retrieved 2020-11-11
  9. ^ Lo, Hoi-Kwong; Spiller, Tim; Popescu, Sandu (1998). Introduction to Quantum Computation and Information. World Scientific. ISBN 978-981-02-4410-1.
  10. ^ Lo, Hoi-Kwong; Spiller, Tim; Popescu, Sandu (1998). Introduction to Quantum Computation and Information. World Scientific. ISBN 978-981-02-4410-1.
  11. ^ Perlman, H. S. (November 1964). "Equivalence of the Schroedinger and Heisenberg Pictures". Nature. 204 (4960): 771–772. Bibcode:1964Natur.204..771P. doi:10.1038/204771b0. S2CID 4194913.
  12. ^ Neumann, John von (2018-02-27). Mathematical Foundations of Quantum Mechanics: New Edition. Princeton University Press. ISBN 978-0-691-17856-1.
  13. ^ a b Gordon, J. (September 1962). "Quantum Effects in Communications Systems". Proceedings of the IRE. 50 (9): 1898–1908. doi:10.1109/JRPROC.1962.288169. S2CID 51631629.
  14. ^ Helstrom, Carl Wilhelm (1976). Quantum Detection and Estimation Theory. Academic Press. ISBN 978-0-08-095632-9.[page needed]
  15. ^ A. S. Holevo, “Bounds for the Quantity of Information Transmitted by a Quantum Communication Channel”, Probl. Peredachi Inf., 9:3 (1973), ; Problems Inform. Transmission, 9:3 (1973), http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=ppi&paperid=903&option_lang=eng
  16. ^ A. S. Holevo, “On Capacity of a Quantum Communications Channel”, Probl. Peredachi Inf., 15:4 (1979), ; Problems Inform. Transmission, 15:4 (1979), http://www.mathnet.ru/php/archive.phtml?wshow=paper&jrnid=ppi&paperid=1507&option_lang=eng
  17. ^ Bennett, Charles H.; Brassard, Gilles (December 2014). "Quantum cryptography: Public key distribution and coin tossing". Theoretical Computer Science. 560: 7–11. arXiv:2003.06557v1. doi:10.1016/j.tcs.2014.05.025. S2CID 27022972.
  18. ^ Weisstein, Eric W. "Church-Turing Thesis". mathworld.wolfram.com. Retrieved 2020-11-13.
  19. ^ Deutsch, D. (8 July 1985). "Quantum theory, the Church–Turing principle and the universal quantum computer". Proceedings of the Royal Society of London. A. Mathematical and Physical Sciences. 400 (1818): 97–117. Bibcode:1985RSPSA.400...97D. doi:10.1098/rspa.1985.0070. S2CID 1438116.
  20. ^ Moore, G.E. (January 1998). "Cramming More Components Onto Integrated Circuits". Proceedings of the IEEE. 86 (1): 82–85. doi:10.1109/JPROC.1998.658762. S2CID 6519532.
  21. ^ Shannon, C. E. (October 1948). "A Mathematical Theory of Communication". Bell System Technical Journal. 27 (4): 623–656. doi:10.1002/j.1538-7305.1948.tb00917.x. hdl:11858/00-001M-0000-002C-4314-2.
  22. ^ "A Mathematical Theory of Communication" (PDF). 1998-07-15. Archived (PDF) from the original on 1998-07-15. Retrieved 2020-11-13.
  23. ^ Shannon, C. E.; Weaver, W. (1949). "The mathematical theory of communication". Cite journal requires |journal= (help)
  24. ^ "Alexandr S. Holevo". Mi.ras.ru. Retrieved 4 December 2018.
  25. ^ Weedbrook, Christian; Pirandola, Stefano; García-Patrón, Raúl; Cerf, Nicolas J.; Ralph, Timothy C.; Shapiro, Jeffrey H.; Lloyd, Seth (1 May 2012). "Gaussian quantum information". Reviews of Modern Physics. 84 (2): 621–669. arXiv:1110.3234. Bibcode:2012RvMP...84..621W. doi:10.1103/RevModPhys.84.621. S2CID 119250535.
  26. ^ Masahito Hayashi, "Quantum Information Theory: Mathematical Foundation"[page needed]
  27. ^ J. Watrous, The Theory of Quantum Information (Cambridge Univ. Press, 2018). Freely available at [1]
  28. ^ Wilde, Mark M. (2013). "Concepts in Quantum Shannon Theory". Quantum Information Theory. pp. 3–25. doi:10.1017/cbo9781139525343.002. ISBN 9781139525343.
  29. ^ a b c Jaeger, Gregg (2007-04-03). Quantum Information: An Overview. Springer Science & Business Media. ISBN 978-0-387-36944-0.
  30. ^ Watrous, John. "CS 766/QIC 820 Theory of Quantum Information (Fall 2011)." (2011).
  31. ^ Bennett, Charles H. (1992-05-25). "Quantum cryptography using any two nonorthogonal states". Physical Review Letters. 68 (21): 3121–3124. Bibcode:1992PhRvL..68.3121B. doi:10.1103/PhysRevLett.68.3121. PMID 10045619.
  32. ^ "Quantum Key Distribution - QKD". www.cse.wustl.edu. Retrieved 2020-11-21.
  33. ^ "npj Quantum Information". Nature.com. Retrieved 4 December 2018.
  34. ^ "Quantum Homepage". Quantum-journal.org. Retrieved 4 December 2018.
  35. ^ "Quantum Science and Technology". IOP Publishing. Retrieved 12 January 2019.

References[edit]