There is, I think, something ethereal about i —the square root of minus one. I remember first hearing about it at school. It seemed an odd beast at that time—an intruder hovering on the edge of reality.

Usually familiarity dulls this sense of the bizarre, but in the case of i it was the reverse: over the years the sense of its surreal nature intensified. It seemed that it was impossible to write mathematics that described the real world in …

I and i

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

Spintronics, or spin electronics, involves the study of active control and manipulation of spin degrees of freedom in solid-state systems. This article reviews the current status of this subject, including both recent advances and well-established results. The primary focus is on the basic physical principles underlying the generation of carrier spin polarization, spin dynamics, and spin-polarized transport in semiconductors and metals. Spin transport differs from charge transport in that spin is a nonconserved quantity in solids due to spin-orbit and hyperfine coupling. The authors discuss in detail spin decoherence mechanisms in metals and semiconductors. Various theories of spin injection and spin-polarized transport are applied to hybrid structures relevant to spin-based devices and fundamental studies of materials properties. Experimental work is reviewed with the emphasis on projected applications, in which external electric and magnetic fields and illumination by light will be used to control spin and charge dynamics to create new functionalities not feasible or ineffective with conventional electronics.

/pdf/spintronics-fundamentals-and-applications-2dx38n6phu.pdf

Spintronics: Fundamentals and applications

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

/pdf/convex-analysisnoer-san-nojin-zhan-nituite-5dl2rbmoyr.pdf

Convex Analysisの二,三の進展について

This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form ofan efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequenceof gates from a fixed and finite set. The algorithm can be used, for example, to compileShor's algorithm, which uses rotations of π/2k, into an efficient fault-tolerant form usingonly Hadamard, controlled-not, and π/8 gates. The algorithm runs in O(log2.71(1/e))time, and produces as output a sequence of O(log3.97(1/e)) quantum gates which isguaranteed to approximate the desired quantum gate to an accuracy within e > 0. Wealso explain how the algorithm can be generalized to apply to multi-qubit gates and togates from SU(d).

The Solovay-Kitaev algorithm

Complete and precise characterization of a quantum dynamical process can be achieved via the method of quantum process tomography. Using a source of correlated photons, we have implemented several methods, each investigating a wide range of processes, e.g., unitary, decohering, and polarizing. One of these methods, ancilla-assisted process tomography (AAPT), makes use of an additional ‘‘ancilla system,’’ and we have theoretically determined the conditions when AAPT is possible. Surprisingly, entanglement is not required. We present data obtained using both separable and entangled input states. The use of entanglement yields superior results, however.

/pdf/ancilla-assisted-quantum-process-tomography-a52ts3fngk.pdf

Ancilla-assisted quantum process tomography.

This pedagogical review presents the proof of the Solovay-Kitaev theorem in the form of an efficient classical algorithm for compiling an arbitrary single-qubit gate into a sequence of gates from a fixed and finite set. The algorithm can be used, for example, to compile Shor's algorithm, which uses rotations of $\pi / 2^k$, into an efficient fault-tolerant form using only Hadamard, controlled-{\sc not}, and $\pi / 8$ gates. The algorithm runs in $O(\log^{2.71}(1/\epsilon))$ time, and produces as output a sequence of $O(\log^{3.97}(1/\epsilon))$ quantum gates which is guaranteed to approximate the desired quantum gate to an accuracy within $\epsilon > 0$. We also explain how the algorithm can be generalized to apply to multi-qubit gates and to gates from $SU(d)$.

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

We show how to construct quantum gate arrays that can be programmed to perform different unitary operations on a data register, depending on the input to some program register. It is shown that a universal quantum gate array---a gate array which can be programmed to perform any unitary operation---exists only if one allows the gate array to operate in a probabilistic fashion. Thus it is not possible to build a fixed, general purpose quantum computer which can be programmed to perform an arbitrary quantum computation.

/pdf/programmable-quantum-gate-arrays-g3tz8mfbbr.pdf

Programmable Quantum Gate Arrays

A remarkable feature of quantum entanglement is that an entangled state of two parties, Alice ( A) and Bob ( B), may be more disordered locally than globally. That is, S(A)>S(A,B), where S() is the von Neumann entropy. It is known that satisfaction of this inequality implies that a state is nonseparable. In this paper we prove the stronger result that for separable states the vector of eigenvalues of the density matrix of system AB is majorized by the vector of eigenvalues of the density matrix of system A alone. This gives a strong sense in which a separable state is more disordered globally than locally and a new necessary condition for separability of bipartite states in arbitrary dimensions.

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

Michael A. Nielsen

Papers

The Solovay-Kitaev algorithm

Ancilla-assisted quantum process tomography.

The Solovay-Kitaev algorithm

Programmable Quantum Gate Arrays

Separable states are more disordered globally than locally.