Part I. Fundamental Concepts: 1. Introduction and overview 2. Introduction to quantum mechanics 3. Introduction to computer science Part II. Quantum Computation: 4. Quantum circuits 5. The quantum Fourier transform and its application 6. Quantum search algorithms 7. Quantum computers: physical realization Part III. Quantum Information: 8. Quantum noise and quantum operations 9. Distance measures for quantum information 10. Quantum error-correction 11. Entropy and information 12. Quantum information theory Appendices References Index.

Quantum Computation and Quantum Information

The entanglement of a pure state of a pair of quantum systems is defined as the entropy of either member of the pair. The entanglement of formation of a mixed state $\ensuremath{\rho}$ is the minimum average entanglement of an ensemble of pure states that represents \ensuremath{\rho}. An earlier paper conjectured an explicit formula for the entanglement of formation of a pair of binary quantum objects (qubits) as a function of their density matrix, and proved the formula for special states. The present paper extends the proof to arbitrary states of this system and shows how to construct entanglement-minimizing decompositions.

Entanglement of Formation of an Arbitrary State of Two Qubits

All our former experience with application of quantum theory seems to say:
{\it what is predicted by quantum formalism must occur in laboratory} But the
essence of quantum formalism - entanglement, recognized by Einstein, Podolsky,
Rosen and Schr\"odinger - waited over 70 years to enter to laboratories as a
new resource as real as energy This holistic property of compound quantum systems, which involves
nonclassical correlations between subsystems, is a potential for many quantum
processes, including ``canonical'' ones: quantum cryptography, quantum
teleportation and dense coding However, it appeared that this new resource is
very complex and difficult to detect Being usually fragile to environment, it
is robust against conceptual and mathematical tools, the task of which is to
decipher its rich structure This article reviews basic aspects of entanglement including its
characterization, detection, distillation and quantifying In particular, the
authors discuss various manifestations of entanglement via Bell inequalities,
entropic inequalities, entanglement witnesses, quantum cryptography and point
out some interrelations They also discuss a basic role of entanglement in
quantum communication within distant labs paradigm and stress some
peculiarities such as irreversibility of entanglement manipulations including
its extremal form - bound entanglement phenomenon A basic role of entanglement
witnesses in detection of entanglement is emphasized

Quantum entanglement

Quantum computers promise to increase greatly the efficiency of solving problems such as factoring large integers, combinatorial optimization and quantum physics simulation. One of the greatest challenges now is to implement the basic quantum-computational elements in a physical system and to demonstrate that they can be reliably and scalably controlled. One of the earliest proposals for quantum computation is based on implementing a quantum bit with two optical modes containing one photon. The proposal is appealing because of the ease with which photon interference can be observed. Until now, it suffered from the requirement for non-linear couplings between optical modes containing few photons. Here we show that efficient quantum computation is possible using only beam splitters, phase shifters, single photon sources and photo-detectors. Our methods exploit feedback from photo-detectors and are robust against errors from photon loss and detector inefficiency. The basic elements are accessible to experimental investigation with current technology.

A scheme for efficient quantum computation with linear optics.

Entanglement purification protocols (EPPs) and quantum error-correcting codes (QECCs) provide two ways of protecting quantum states from interaction with the environment. In an EPP, perfectly entangled pure states are extracted, with some yield D, from a mixed state M shared by two parties; with a QECC, an arbitrary quantum state |\ensuremath{\xi}〉 can be transmitted at some rate Q through a noisy channel \ensuremath{\chi} without degradation. We prove that an EPP involving one-way classical communication and acting on mixed state M^(\ensuremath{\chi}) (obtained by sharing halves of Einstein-Podolsky-Rosen pairs through a channel \ensuremath{\chi}) yields a QECC on \ensuremath{\chi} with rate Q=D, and vice versa. We compare the amount of entanglement E(M) required to prepare a mixed state M by local actions with the amounts ${\mathit{D}}_{1}$(M) and ${\mathit{D}}_{2}$(M) that can be locally distilled from it by EPPs using one- and two-way classical communication, respectively, and give an exact expression for E(M) when M is Bell diagonal. While EPPs require classical communication, QECCs do not, and we prove Q is not increased by adding one-way classical communication. However, both D and Q can be increased by adding two-way communication. We show that certain noisy quantum channels, for example a 50% depolarizing channel, can be used for reliable transmission of quantum states if two-way communication is available, but cannot be used if only one-way communication is available. We exhibit a family of codes based on universal hashing able to achieve an asymptotic Q (or D) of 1-S for simple noise models, where S is the error entropy. We also obtain a specific, simple 5-bit single-error-correcting quantum block code. We prove that iff a QECC results in high fidelity for the case of no error then the QECC can be recast into a form where the encoder is the matrix inverse of the decoder. \textcopyright{} 1996 The American Physical Society.

Mixed State Entanglement and Quantum Error Correction

If two separated observers are supplied with entanglement, in the form of n pairs of particles in identical partly entangled pure states, one member of each pair being given to each observer, they can, by local actions of each observer, concentrate this entanglement into a smaller number of maximally entangled pairs of particles, for example, Einstein-Podolsky-Rosen singlets, similarly shared between the two observers. The concentration process asymptotically conserves entropy of entanglement---the von Neumann entropy of the partial density matrix seen by either observer---with the yield of singlets approaching, for large n, the base-2 entropy of entanglement of the initial partly entangled pure state. Conversely, any pure or mixed entangled state of two systems can be produced by two classically communicating separated observers, drawing on a supply of singlets as their sole source of entanglement. \textcopyright{} 1996 The American Physical Society.

https://arxiv.org/pdf/quant-ph/9511030.pdf

Concentrating partial entanglement by local operations

An algorithmic proof that any discrete finite-dimensional unitary operator can be constructed in the laboratory using optical devices is given. Our recursive algorithm factorizes any N\ifmmode\times\else\texttimes\fi{}N unitary matrix into a sequence of two-dimensional beam splitter transformations. The experiment is built from the corresponding devices. This also permits the measurement of the observable corresponding to any discrete Hermitian matrix. Thus optical experiments with any type of radiation (photons, atoms, etc.) exploring higher-dimensional discrete quantum systems become feasible.

Experimental realization of any discrete unitary operator.

This paper documents the discovery of a new, better-than-classical quantum algorithm for the depth-two AND/OR tree problem. We describe the genetic programming system that was constructed specifically for this work, the quantum computer simulator that is used to evaluate the fitness of evolving quantum algorithms, and the newly discovered algorithm.

/pdf/finding-a-better-than-classical-quantum-and-or-algorithm-2skwld57x2.pdf

Finding a better-than-classical quantum AND/OR algorithm using genetic programming

Transmitting quantum information between two remote parties is a requirement for many quantum applications; however, direct transmission of states is often impossible because of noise and loss in the communication channel. Entanglement-enhanced state communication can be used to avoid this issue, but current techniques require extensive experimental resources to transmit large quantum states deterministically. To reduce these resource requirements, we use photon pairs hyperentangled in polarization and orbital angular momentum to implement superdense teleportation, which can communicate a specific class of single-photon ququarts. We achieve an average fidelity of 87.0(1)%, almost twice the classical limit of 44% with reduced experimental resources than traditional techniques. We conclude by discussing the information content of this constrained set of states and demonstrate that this set has an exponentially larger state space volume than the lower-dimensional general states with the same number of state parameters.

/pdf/superdense-teleportation-using-hyperentangled-photons-38z74op3yt.pdf

Herbert J. Bernstein

Papers

Concentrating partial entanglement by local operations

Experimental realization of any discrete unitary operator.

Finding a better-than-classical quantum AND/OR algorithm using genetic programming

Superdense teleportation using hyperentangled photons.

Quantum computing applications of genetic programming