Results 1  10
of
199
Entanglementassisted capacity of a quantum channel and the reverse shannon theorem
 IEEE Trans. Inf. Theory
, 2002
"... Abstract—The entanglementassisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entangleme ..."
Abstract

Cited by 57 (4 self)
 Add to MetaCart
Abstract—The entanglementassisted classical capacity of a noisy quantum channel ( ) is the amount of information per channel use that can be sent over the channel in the limit of many uses of the channel, assuming that the sender and receiver have access to the resource of shared quantum entanglement, which may be used up by the communication protocol. We show that the capacity is given by an expression parallel to that for the capacity of a purely classical channel: i.e., the maximum, over channel inputs, of the entropy of the channel input plus the entropy of the channel output minus their joint entropy, the latter being defined as the entropy of an entangled purification of after half of it has passed through the channel. We calculate entanglementassisted capacities for two interesting quantum channels, the qubit amplitude damping channel and the bosonic channel with amplification/attenuation and Gaussian noise. We discuss how many independent parameters are required to completely characterize the asymptotic behavior of a general quantum channel, alone or in the presence of ancillary resources such as prior entanglement. In the classical analog of entanglementassisted communication—communication over a discrete memoryless channel (DMC) between parties who share prior random information—we show that one parameter is sufficient, i.e., that in the presence of prior shared random information, all DMCs of equal capacity can simulate one another with unit asymptotic efficiency. Index Terms—Channel capacity, entanglement, quantum information, Shannon theory. I.
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 48 (1 self)
 Add to MetaCart
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
Computing the noncomputable
 Contemporary Physics
"... We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic which is equivalent to the Turing halting problem and known to be mathematically non ..."
Abstract

Cited by 31 (7 self)
 Add to MetaCart
We explore in the framework of Quantum Computation the notion of computability, which holds a central position in Mathematics and Theoretical Computer Science. A quantum algorithm that exploits the quantum adiabatic which is equivalent to the Turing halting problem and known to be mathematically noncomputable. Generalised quantum algorithms are also considered for some other mathematical noncomputables in the same and of different noncomputability classes. The key element of all these algorithms is the measurability of both the values of physical observables and of the quantummechanical probability distributions for these values. It is argued that computability, and thus the limits of Mathematics, ought to be determined not
BoseEinstein Condensation of Atomic Hydrogen,” Phys
 Rev. Lett
, 1998
"... We report observation of BoseEinstein condensation of a trapped, dilute gas of atomic hydrogen. The condensate and normal gas are studied by twophoton spectroscopy of the 1S2S transition. Interactions among the atoms produce a shift of the resonance frequency proportional to density. The condensa ..."
Abstract

Cited by 21 (1 self)
 Add to MetaCart
We report observation of BoseEinstein condensation of a trapped, dilute gas of atomic hydrogen. The condensate and normal gas are studied by twophoton spectroscopy of the 1S2S transition. Interactions among the atoms produce a shift of the resonance frequency proportional to density. The condensate is clearly distinguished by its large frequency shift. The peak condensate density is 4.8 ± 1.1 × 10 15 cm −3, corresponding to a condensate population of 10 9 atoms. The BEC transition occurs at about T = 50 µK and n = 1.8 × 10 14 cm −3. Typeset using REVTEX 1 The search for BoseEinstein condensation in dilute atomic gases began in 1978 [1], precipitated by the suggestion of Stwalley and Nasanow [2] that spinpolarized atomic hydrogen should be an ideal candidate for the study of such extreme quantum behavior. Dilute gases of H were first stabilized by Silvera and Walraven [3]. Subsequent attempts to achieve BEC were thwarted by recombination on the walls of the confinement cell [4]. In order to create
Unconditional security of practical quantum key distribution,” arXiv:quantph/0107017
, 2001
"... We present a proof of unconditional security of a practical quantum key distribution protocol. It is an extension of a previous result obtained by Mayers [1, 2], which proves unconditional security provided that a perfect single photon source is used. In present days, perfect single photon sources a ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
We present a proof of unconditional security of a practical quantum key distribution protocol. It is an extension of a previous result obtained by Mayers [1, 2], which proves unconditional security provided that a perfect single photon source is used. In present days, perfect single photon sources are not available and, therefore, practical implementations use either dim laser pulses or postselected states from parametric
Security aspects of practical quantum cryptography
 In Advances in Cryptology— EUROCRYPT2000 (2000
"... Abstract. The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. Unfortunately, the implemented schemes are often operated in a regime which excludes unconditional security. We provide a thorough investigation of security issues f ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
Abstract. The use of quantum bits (qubits) in cryptography holds the promise of secure cryptographic quantum key distribution schemes. Unfortunately, the implemented schemes are often operated in a regime which excludes unconditional security. We provide a thorough investigation of security issues for practical quantum key distribution, taking into account channel losses, a realistic detection process, and modifications of the “qubits ” sent from the sender to the receiver. We first show that even quantum key distribution with perfect qubits might not be achievable over long distances when fixed channel losses and fixed dark count errors are taken into account. Then we show that existing experimental schemes (based on weak pulses) currently do not offer unconditional security for the reported distances and signal strength. Finally we show that parametric downconversion offers enhanced performance compared to its weak coherent pulse counterpart. 1
A Discrete Invitation to Quantum Filtering and Feedback Control
, 2009
"... The engineering and control of devices at the quantum mechanical level—such as those consisting of small numbers of atoms and photons—is a delicate business. The fundamental uncertainty that is inherently present at this scale manifests itself in the unavoidable presence of noise, making this a nov ..."
Abstract

Cited by 11 (2 self)
 Add to MetaCart
The engineering and control of devices at the quantum mechanical level—such as those consisting of small numbers of atoms and photons—is a delicate business. The fundamental uncertainty that is inherently present at this scale manifests itself in the unavoidable presence of noise, making this a novel field of application for stochastic estimation and control theory. In this expository paper we demonstrate estimation and feedback control of quantum mechanical systems in what is essentially a noncommutative version of the binomial model that is popular in mathematical finance. The model is extremely rich and allows a full development of the theory while remaining completely within the setting of finitedimensional Hilbert spaces (thus avoiding the technical complications of the continuous theory). We introduce discretized models of an atom in interaction with the electromagnetic field, obtain filtering equations for photon counting and homodyne detection, and solve a stochastic control problem using dynamic programming and Lyapunov function methods.
On causally asymmetric versions of Occam’s Razor and their relation to thermodynamics
, 2007
"... and their relation to thermodynamics ..."
The complexity of stoquastic local hamiltonian problems. Arxiv: quantph/0606140
, 2006
"... We study the complexity of the Local Hamiltonian Problem (denoted as LHMIN) in the special case when a Hamiltonian obeys conditions of the PerronFrobenius theorem: all offdiagonal matrix elements in the standard basis are real and nonpositive. We will call such Hamiltonians, which are common in ..."
Abstract

Cited by 6 (1 self)
 Add to MetaCart
We study the complexity of the Local Hamiltonian Problem (denoted as LHMIN) in the special case when a Hamiltonian obeys conditions of the PerronFrobenius theorem: all offdiagonal matrix elements in the standard basis are real and nonpositive. We will call such Hamiltonians, which are common in the natural world, stoquastic. An equivalent characterization of stoquastic Hamiltonians is that they have an entrywise nonnegative Gibbs density matrix for any temperature. We prove that LHMIN for stoquastic Hamiltonians belongs to the complexity class AM — a probabilistic version of NP with two rounds of communication between the prover and the verifier. We also show that 2local stoquastic LHMIN is hard for the class MA. With the additional promise of having a polynomial spectral gap, we show that stoquastic LHMIN belongs to the class PostBPP=BPPpath — a generalization of BPP in which a postselective readout is allowed. This last result also shows that any problem solved by adiabatic quantum computation using stoquastic Hamiltonians is in PostBPP ∩ AM. 1