CB-norm estimates for maps between noncommutative Lp-spaces and quantum channel theory.

In the first part of this work, we show how certain techniques from quantum information theory can be used in order to obtain very sharp embeddings between noncommutative Lp-spaces. Then, we use these estimates to study the classical capacity with restricted assisted entanglement of the quantum erasure channel and the quantum depolarizing channel. In particular, we exactly compute the capacity of the first one and we show that certain nonmultiplicative results hold for the second one.

Resonance fluorescence spectrum of a \Lambda-type quantum emitter close to a metallic nanoparticle

We theoretically study the resonance fluorescence spectrum of a three-level quantum emitter coupled to a spherical metallic nanoparticle. We consider the case that the quantum emitter is driven by a single laser field along one of the optical transitions. We show that the development of the spectrum depends on the relative orientation of the dipole moments of the optical transitions in relation to the metal nanoparticle. In addition, we demonstrate that the location and width of the peaks in the spectrum are strongly modified by the exciton-plasmon coupling and the laser detuning, allowing to achieve controlled strongly subnatural spectral line. A strong antibunching of the fluorescent photons along the undriven transition is also obtained. Our results may be used for creating a tunable source of photons which could be used for a probabilistic entanglement scheme in the field of quantum information processing.

Iterative Phase Optimization of Elementary Quantum Error Correcting Codes

Performing experiments on small-scale quantum computers is certainly a challenging endeavor. Many parameters need to be optimized to achieve high-fidelity operations. This can be done efficiently for operations acting on single qubits, as errors can be fully characterized. For multiqubit operations, though, this is no longer the case, as in the most general case, analyzing the effect of the operation on the system requires a full state tomography for which resources scale exponentially with the system size. Furthermore, in recent experiments, additional electronic levels beyond the two-level system encoding the qubit have been used to enhance the capabilities of quantum-information processors, which additionally increases the number of parameters that need to be controlled. For the optimization of the experimental system for a given task (e.g., a quantum algorithm), one has to find a satisfactory error model and also efficient observables to estimate the parameters of the model. In this manuscript, we demonstrate a method to optimize the encoding procedure for a small quantum error correction code in the presence of unknown but constant phase shifts. The method, which we implement here on a small-scale linear ion-trap quantum computer, is readily applicable to other AMO platforms for quantum-information processing.

Evading Vacuum Noise: Wigner Projections or Husimi Samples?

The accuracy in determining the quantum state of a system depends on the type of measurement performed. Homodyne and heterodyne detection are the two main schemes in continuous-variable quantum information. The former leads to a direct reconstruction of the Wigner function of the state, whereas the latter samples its Husimi Q function. We experimentally demonstrate that heterodyne detection outperforms homodyne detection for almost all Gaussian states, the details of which depend on the squeezing strength and thermal noise.

Euclidean Distance Between Haar Orthogonal and Gaussian Matrices

In this work, we study a version of the general question of how well a Haar-distributed orthogonal matrix can be approximated by a random Gaussian matrix. Here, we consider a Gaussian random matrix (Formula presented.) of order n and apply to it the Gram–Schmidt orthonormalization procedure by columns to obtain a Haar-distributed orthogonal matrix (Formula presented.). If (Formula presented.) denotes the vector formed by the first m-coordinates of the ith row of (Formula presented.) and (Formula presented.), our main result shows that the Euclidean norm of (Formula presented.) converges exponentially fast to (Formula presented.), up to negligible terms. To show the extent of this result, we use it to study the convergence of the supremum norm (Formula presented.) and we find a coupling that improves by a factor (Formula presented.) the recently proved best known upper bound on (Formula presented.). Our main result also has applications in Quantum Information Theory.