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

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 is an updated version of supplementary information to accompany "Quantum supremacy using a programmable superconducting processor", an article published in the October 24, 2019 issue of Nature. The main article is freely available at this https URL. Summary of changes since arXiv:1910.11333v1 (submitted 23 Oct 2019): added URL for qFlex source code; added Erratum section; added Figure S41 comparing statistical and total uncertainty for log and linear XEB; new References [1,65]; miscellaneous updates for clarity and style consistency; miscellaneous typographical and formatting corrections.

/pdf/supplementary-information-for-quantum-supremacy-using-a-3tkhfafpzk.pdf

Supplementary information for "Quantum supremacy using a programmable superconducting processor"

as quantum engineering. In the past two decades it has become increasingly clear that many (perhaps all) of the symptoms of classicality can be induced in quantum systems by their environments. Thus decoherence is caused by the interaction in which the environment in effect monitors certain observables of the system, destroying coherence between the pointer states corresponding to their eigenvalues. This leads to environment-induced superselection or einselection, a quantum process associated with selective loss of information. Einselected pointer states are stable. They can retain correlations with the rest of the universe in spite of the environment. Einselection enforces classicality by imposing an effective ban on the vast majority of the Hilbert space, eliminating especially the flagrantly nonlocal ''Schrodinger-cat states.'' The classical structure of phase space emerges from the quantum Hilbert space in the appropriate macroscopic limit. Combination of einselection with dynamics leads to the idealizations of a point and of a classical trajectory. In measurements, einselection replaces quantum entanglement between the apparatus and the measured system with the classical correlation. Only the preferred pointer observable of the apparatus can store information that has predictive power. When the measured quantum system is microscopic and isolated, this restriction on the predictive utility of its correlations with the macroscopic apparatus results in the effective ''collapse of the wave packet.'' The existential interpretation implied by einselection regards observers as open quantum systems, distinguished only by their ability to acquire, store, and process information. Spreading of the correlations with the effectively classical pointer states throughout the environment allows one to understand ''classical reality'' as a property based on the relatively objective existence of the einselected states. Effectively classical pointer states can be ''found out'' without being re-prepared, e.g, by intercepting the information already present in the environment. The redundancy of the records of pointer states in the environment (which can be thought of as their ''fitness'' in the Darwinian sense) is a measure of their classicality. A new symmetry appears in this setting. Environment-assisted invariance or envariance sheds new light on the nature of ignorance of the state of the system due to quantum correlations with the environment and leads to Born's rules and to reduced density matrices, ultimately justifying basic principles of the program of decoherence and einselection.

/pdf/decoherence-einselection-and-the-quantum-origins-of-the-5c70dshgfi.pdf

Decoherence, einselection, and the quantum origins of the classical

We show that for an m-qubit quantum system, there is a ball of radius asymptotically approaching kappa 2^{-gamma m} in Frobenius norm, centered at the identity matrix, of separable (unentangled) positive semidefinite matrices, for an exponent gamma = (1/2)((ln 3/ln 2) - 1), roughly 29248125 This is much smaller in magnitude than the best previously known exponent, from our earlier work, of 1/2 For normalized m-qubit states, we get a separable ball of radius sqrt(3^(m+1)/(3^m+3)) * 2^{-(1 + \gamma)m}, ie sqrt{3^{m+1}/(3^m+3)}\times 6^{-m/2} (note that \kappa = \sqrt{3}), compared to the previous 2 * 2^{-3m/2} This implies that with parameters realistic for current experiments, NMR with standard pseudopure-state preparation techniques can access only unentangled states if 36 qubits or fewer are used (compared to 23 qubits via our earlier results) We also obtain an improved exponent for m-partite systems of fixed local dimension d_0, although approaching our earlier exponent as d_0 approaches infinity

Further results on the multipartite separable ball

Size of the separable neighborhood of the maximally mixed bipartite quantum state

We consider the problem of optimal asymptotically faithful compression for ensembles of mixed quantum states. Although the optimal rate is unknown, we prove upper and lower bounds and describe a series of illustrative examples of compression of mixed states. We also discuss a classical analogue of the problem.

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

On quantum coding for ensembles of mixed states

Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical ``black box'' function drawn from some set of such black box functions, we investigate a more general quantum query model in which the goal is to compute functions of N by N ``black box'' unitary matrices drawn from a set of such matrices, a problem with applications to determining properties of quantum physical systems. We characterize the existence of an algorithm for such a query problem, with given error and number of queries, as equivalent to the feasibility of a certain set of semidefinite programming constraints, or equivalently the infeasibility of a dual of these constraints, which we construct. Relaxing the primal constraints to correspond to mere pairwise near-orthogonality of the final states of a quantum computer, conditional on black-box inputs having distinct function values, rather than bounded-error determinability of the function value via a single measurement on the output states, we obtain a relaxed primal program the feasibility of whose dual still implies the nonexistence of a quantum algorithm. We use this to obtain a generalization, to our not-necessarily-commutative setting, of the ``spectral adversary method'' for quantum query lower bounds.

Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries

Quantum information science is a source of task-related axioms whose consequences can be explored in general settings encompassing quantum mechanics, classical theory, and more. Quantum states are compendia of probabilities for the outcomes of possible operations we may perform a system: ``operational states.'' I discuss general frameworks for ``operational theories'' (sets of possible operational states of a system), in which convexity plays key role. The main technical content of the paper is in a theorem that any such theory naturally gives rise to a ``weak effect algebra'' when outcomes having the same probability in all states are identified, and in the introduction of a notion of ``operation algebra'' that also takes account of sequential and conditional operations. Such frameworks are appropriate for investigating what things look like from an ``inside view,'' i.e. for describing perspectival information that one subsystem of the world can have about another. Understanding how such views can combine, and whether an overall ``geometric'' picture (``outside view'') coordinating them all can be had, even if this picture is very different in structure from the perspectives within it, is the key to whether we may be able to achieve a unified, ``objective'' physical view in which quantum mechanics is the appropriate description for certain perspectives, or whether quantum mechanics is truly telling us we must go beyond this ``geometric'' conception of physics.

Howard Barnum

Papers

Further results on the multipartite separable ball

Size of the separable neighborhood of the maximally mixed bipartite quantum state

On quantum coding for ensembles of mixed states

Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries

Quantum information processing, operational quantum logic, convexity, and the foundations of physics