Results 1  10
of
754
Decoherence, einselection, and the quantum origins of the classical
 REVIEWS OF MODERN PHYSICS 75, 715. AVAILABLE ONLINE AT HTTP://ARXIV.ORG/ABS/QUANTPH/0105127
, 2003
"... The manner in which states of some quantum systems become effectively classical is of great significance for the foundations of quantum physics, as well as for problems of practical interest such as quantum engineering. In the past two decades it has become increasingly clear that many (perhaps all) ..."
Abstract

Cited by 116 (1 self)
 Add to MetaCart
(Show Context)
The manner in which states of some quantum systems become effectively classical is of great significance for the foundations of quantum physics, as well as for problems of practical interest such 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 environmentinduced 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 "Schrödingercat 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
Electromagnetically induced transparency: Optics in coherent media
 Rev. Mod. Phys
, 2005
"... Coherent preparation by laser light of quantum states of atoms and molecules can lead to quantum interference in the amplitudes of optical transitions. In this way the optical properties of a medium can be dramatically modified, leading to electromagnetically induced transparency and related effects ..."
Abstract

Cited by 85 (0 self)
 Add to MetaCart
Coherent preparation by laser light of quantum states of atoms and molecules can lead to quantum interference in the amplitudes of optical transitions. In this way the optical properties of a medium can be dramatically modified, leading to electromagnetically induced transparency and related effects, which have placed gasphase systems at the center of recent advances in the development of media with radically new optical properties. This article reviews these advances and the new possibilities they offer for nonlinear optics and quantum information science. As a basis for the theory of electromagnetically induced transparency the authors consider the atomic dynamics and the optical response of the medium to a continuouswave laser. They then discuss pulse propagation and the adiabatic evolution of fieldcoupled states and show how coherently prepared media can be used to improve frequency conversion in nonlinear optical mixing experiments. The extension of these concepts to very weak optical fields in the fewphoton limit is then examined. The review concludes with a discussion of future prospects and potential new applications.
The physical implementation of quantum computation
 Fortschr. Phys
, 2000
"... After a brief introduction to the principles and promise of quantum information processing, the requirements for the physical implementation of quantum computation are discussed. These five requirements, plus two relating to the communication of quantum information, are extensively explored and rela ..."
Abstract

Cited by 71 (0 self)
 Add to MetaCart
(Show Context)
After a brief introduction to the principles and promise of quantum information processing, the requirements for the physical implementation of quantum computation are discussed. These five requirements, plus two relating to the communication of quantum information, are extensively explored and related to the many schemes in atomic physics, quantum optics, nuclear and electron magnetic resonance spectroscopy, superconducting electronics, and quantumdot physics, for achieving quantum computing. 1.
Inequalities for quantum entropy. A review with conditions with equality
"... This paper presents selfcontained proofs of the strong subadditivity inequality for von Neumann’s quantum entropy, S(ρ), and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps. Moreover, the approach presented here, whic ..."
Abstract

Cited by 58 (8 self)
 Add to MetaCart
(Show Context)
This paper presents selfcontained proofs of the strong subadditivity inequality for von Neumann’s quantum entropy, S(ρ), and some related inequalities for the quantum relative entropy, most notably its convexity and its monotonicity under stochastic maps. Moreover, the approach presented here, which is based on Klein’s inequality and Lieb’s theorem that the function A → Tr e K+log A is concave, allows one to obtain conditions for equality. In the case of strong subadditivity, which states that S(ρ123)+S(ρ2) ≤ S(ρ12) + S(ρ23) where the subscripts denote subsystems of a composite system, equality holds if and only if log ρ123 = log ρ12 − log ρ2 + log ρ23. Using the fact that the Holevo bound on the accessible information in a quantum ensemble can be obtained as a consequence of the monotonicity of relative entropy, we show that equality can be attained for that bound only when the states in the ensemble commute. The paper concludes with an Appendix giving a short description of Epstein’s elegant proof of Lieb’s
Toward An Architecture For Quantum Programming
, 2003
"... It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of classical and quantum computation. This paper investigates ..."
Abstract

Cited by 58 (0 self)
 Add to MetaCart
It is becoming increasingly clear that, if a useful device for quantum computation will ever be built, it will be embodied by a classical computing machine with control over a truly quantum subsystem, this apparatus performing a mixture of classical and quantum computation. This paper investigates a possible approach to the problem of programming such machines: a template high level quantum language is presented which complements a generic general purpose classical language with a set of quantum primitives.
The densitymatrix renormalization group
 Rev. Mod. Phys
, 2005
"... The densitymatrix renormalization group (DMRG) is a numerical algorithm for the efficient truncation of the Hilbert space of lowdimensional strongly correlated quantum systems based on a rather general decimation prescription. This algorithm has achieved unprecedented precision in the description ..."
Abstract

Cited by 55 (0 self)
 Add to MetaCart
(Show Context)
The densitymatrix renormalization group (DMRG) is a numerical algorithm for the efficient truncation of the Hilbert space of lowdimensional strongly correlated quantum systems based on a rather general decimation prescription. This algorithm has achieved unprecedented precision in the description of onedimensional quantum systems. It has therefore quickly acquired the status
BDDbased synthesis of reversible logic for large functions
 in Design Automation Conf., 2009
"... Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like lowpower design and nanotechnologies. However, current methods for the synthesis of reversible logic are limited, i.e. they a ..."
Abstract

Cited by 45 (27 self)
 Add to MetaCart
(Show Context)
Reversible logic is the basis for several emerging technologies such as quantum computing, optical computing, or DNA computing and has further applications in domains like lowpower design and nanotechnologies. However, current methods for the synthesis of reversible logic are limited, i.e. they are applicable to relatively small functions only. In this paper, we propose a synthesis approach, that can cope with Boolean functions containing more than a hundred of variables. We present a technique to derive reversible circuits for a function given by a Binary Decision Diagram (BDD). The circuit is obtained using an algorithm with linear worst case behavior regarding runtime and space requirements. Furthermore, the size of the resulting circuit is bounded by the BDD size. This allows to transfer theoretical results known from BDDs to reversible circuits. Experiments show better results (with respect to the circuit cost) and a significantly better scalability in comparison to previous synthesis approaches.
An analysis of completelypositive tracepreserving maps on 2x2 matrices
"... We give a useful new characterization of the set of all completely positive, tracepreserving maps Φ: M2 → M2 from which one can easily check any tracepreserving map for complete positivity. We also determine explicitly all extreme points of this set, and give a useful parameterization after reduct ..."
Abstract

Cited by 43 (5 self)
 Add to MetaCart
We give a useful new characterization of the set of all completely positive, tracepreserving maps Φ: M2 → M2 from which one can easily check any tracepreserving map for complete positivity. We also determine explicitly all extreme points of this set, and give a useful parameterization after reduction to a certain canonical form. This allows a detailed examination of an important class of nonunital extreme points which can be characterized as having exactly two images on the Bloch sphere. We also discuss a number of related issues about the images and the geometry of the set of stochastic maps, and show that any stochastic map on M2 can be written as a convex combination of two “generalized ” extreme points.
Quantum information with rydberg atoms
 Rev. Mod. Phys
, 2010
"... Rydberg atoms with principal quantum number n1 have exaggerated atomic properties including dipoledipole interactions that scale as n4 and radiative lifetimes that scale as n3. It was proposed a decade ago to take advantage of these properties to implement quantum gates between neutral atom qubits. ..."
Abstract

Cited by 42 (2 self)
 Add to MetaCart
(Show Context)
Rydberg atoms with principal quantum number n1 have exaggerated atomic properties including dipoledipole interactions that scale as n4 and radiative lifetimes that scale as n3. It was proposed a decade ago to take advantage of these properties to implement quantum gates between neutral atom qubits. The availability of a strong longrange interaction that can be coherently turned on and off is an enabling resource for a wide range of quantum information tasks stretching far beyond the original gate proposal. Rydberg enabled capabilities include longrange twoqubit gates, collective encoding of multiqubit registers, implementation of robust lightatom quantum interfaces, and the potential for simulating quantum manybody physics. The advances of the last decade are reviewed, covering both theoretical and experimental aspects of Rydbergmediated quantum information processing.