Manipulating quantum entanglement with atoms and photons in a cavity

JM Raimond, M Brune, S Haroche - Reviews of Modern Physics, 2001 - APS
After they have interacted, quantum particles generally behave as a single nonseparable
entangled system. The concept of entanglement plays an essential role in quantum physics …

Quantum concepts in optical polarization

AZ Goldberg, P De La Hoz, G Björk… - Advances in Optics …, 2021 - opg.optica.org
We comprehensively review the quantum theory of the polarization properties of light. In
classical optics, these traits are characterized by the Stokes parameters, which can be …

Separability of n-particle mixed states: necessary and sufficient conditions in terms of linear maps

M Horodecki, P Horodecki, R Horodecki - Physics Letters A, 2001 - Elsevier
We provide necessary and sufficient conditions for separability of mixed states of n-particle
systems. The conditions are formulated in terms of maps which are positive on product …

Experimental realization of Shor's quantum factoring algorithm using nuclear magnetic resonance

LMK Vandersypen, M Steffen, G Breyta, CS Yannoni… - Nature, 2001 - nature.com
The number of steps any classical computer requires in order to find the prime factors of an l-
digit integer N increases exponentially with l, at least using algorithms known at present …

Negative quasi-probability as a resource for quantum computation

V Veitch, C Ferrie, D Gross, J Emerson - New Journal of Physics, 2012 - iopscience.iop.org
A central problem in quantum information is to determine the minimal physical resources
that are required for quantum computational speed-up and, in particular, for fault-tolerant …

Distance measures to compare real and ideal quantum processes

A Gilchrist, NK Langford, MA Nielsen - Physical Review A—Atomic, Molecular …, 2005 - APS
With growing success in experimental implementations it is critical to identify a “gold
standard” for quantum information processing, a single measure of distance that can be …

Unknown quantum states: the quantum de Finetti representation

CM Caves, CA Fuchs, R Schack - Journal of Mathematical Physics, 2002 - pubs.aip.org
We present an elementary proof of the quantum de Finetti representation theorem, a
quantum analog of de Finetti's classical theorem on exchangeable probability assignments …

Quantum computing with NMR

JA Jones - Progress in nuclear magnetic resonance spectroscopy, 2011 - Elsevier
Quantum computers [1–4] are explicitly quantum mechanical systems that use phenomena
such as superposition and entanglement to perform computational tasks more efficiently …

All-silicon quantum computer

TD Ladd, JR Goldman, F Yamaguchi, Y Yamamoto… - Physical Review Letters, 2002 - APS
A solid-state implementation of a quantum computer composed entirely of silicon is
proposed. Qubits are 29 Si nuclear spins arranged as chains in a 28 Si (spin-0) matrix with …

Criteria for continuous-variable quantum teleportation

SL Braunstein, CA Fuchs, HJ Kimble - Journal of Modern Optics, 2000 - Taylor & Francis
We derive an experimentally testable criterion for the teleportation of quantum states of
continuous variables. This criterion is especially relevant to the recent experiment of …