Modeling photon generation

Similar documents
Diagonalization by a unitary similarity transformation

Linear Algebra (Review) Volker Tresp 2018

2. Introduction to quantum mechanics

Quantum Computing Lecture 2. Review of Linear Algebra

Notes on basis changes and matrix diagonalization

MATH 423 Linear Algebra II Lecture 33: Diagonalization of normal operators.

The Singular Value Decomposition

Spectral Theorem for Self-adjoint Linear Operators

forms Christopher Engström November 14, 2014 MAA704: Matrix factorization and canonical forms Matrix properties Matrix factorization Canonical forms

Lecture notes on Quantum Computing. Chapter 1 Mathematical Background

Vector theory of four-wave mixing: polarization effects in fiber-optic parametric amplifiers

Basic Concepts in Linear Algebra

Linear Algebra Review. Vectors

Linear Algebra (Review) Volker Tresp 2017

Review of Basic Concepts in Linear Algebra

Quantum Information & Quantum Computing

Throughout these notes we assume V, W are finite dimensional inner product spaces over C.

arxiv: v1 [quant-ph] 1 Feb 2010

Linear Algebra: Matrix Eigenvalue Problems

Symmetric and self-adjoint matrices

1 Fundamental physical postulates. C/CS/Phys C191 Quantum Mechanics in a Nutshell I 10/04/07 Fall 2007 Lecture 12

Economics 204 Summer/Fall 2010 Lecture 10 Friday August 6, 2010

The following definition is fundamental.

GROUP THEORY PRIMER. New terms: so(2n), so(2n+1), symplectic algebra sp(2n)

Linear Algebra. Min Yan

EXAM. Exam 1. Math 5316, Fall December 2, 2012

1 The postulates of quantum mechanics

Chem 3502/4502 Physical Chemistry II (Quantum Mechanics) 3 Credits Fall Semester 2006 Christopher J. Cramer. Lecture 5, January 27, 2006

We use the overhead arrow to denote a column vector, i.e., a number with a direction. For example, in three-space, we write

Review problems for MA 54, Fall 2004.

Linear Algebra in Actuarial Science: Slides to the lecture

Chapter 3. Determinants and Eigenvalues

Math 108b: Notes on the Spectral Theorem

CS286.2 Lecture 8: A variant of QPCP for multiplayer entangled games

MATH 5524 MATRIX THEORY Problem Set 4

Closed-Form Solution Of Absolute Orientation Using Unit Quaternions

Designing Information Devices and Systems II

C/CS/Phys 191 Quantum Mechanics in a Nutshell I 10/04/05 Fall 2005 Lecture 11

1. The Polar Decomposition

A = 3 B = A 1 1 matrix is the same as a number or scalar, 3 = [3].

Review of similarity transformation and Singular Value Decomposition

University of Colorado Denver Department of Mathematical and Statistical Sciences Applied Linear Algebra Ph.D. Preliminary Exam June 8, 2012

Foundations of Computer Vision

linearly indepedent eigenvectors as the multiplicity of the root, but in general there may be no more than one. For further discussion, assume matrice

Maths for Signals and Systems Linear Algebra in Engineering

Lecture 10: Eigenvectors and eigenvalues (Numerical Recipes, Chapter 11)

Mathematical Methods wk 2: Linear Operators

18.06 Problem Set 8 - Solutions Due Wednesday, 14 November 2007 at 4 pm in

Isotropic harmonic oscillator

Properties of Matrices and Operations on Matrices

Eigenvectors and Hermitian Operators

Singular Value Decomposition (SVD) and Polar Form

11.0 Introduction. An N N matrix A is said to have an eigenvector x and corresponding eigenvalue λ if. A x = λx (11.0.1)

LINEAR ALGEBRA BOOT CAMP WEEK 4: THE SPECTRAL THEOREM

The Spectral Theorem for normal linear maps

7. Symmetric Matrices and Quadratic Forms

Assignment 11 (C + C ) = (C + C ) = (C + C) i(c C ) ] = i(c C) (AB) = (AB) = B A = BA 0 = [A, B] = [A, B] = (AB BA) = (AB) AB

1 = I I I II 1 1 II 2 = normalization constant III 1 1 III 2 2 III 3 = normalization constant...

Math 489AB Exercises for Chapter 2 Fall Section 2.3

UNIT 6: The singular value decomposition.

Math 408 Advanced Linear Algebra

ALGEBRA QUALIFYING EXAM PROBLEMS LINEAR ALGEBRA

CS 143 Linear Algebra Review

A Brief Outline of Math 355

Notes on singular value decomposition for Math 54. Recall that if A is a symmetric n n matrix, then A has real eigenvalues A = P DP 1 A = P DP T.

Fundamentals of Engineering Analysis (650163)

The Singular Value Decomposition and Least Squares Problems

Chapter 2. Linear Algebra. rather simple and learning them will eventually allow us to explain the strange results of

MATHEMATICS 217 NOTES

Summary of Week 9 B = then A A =

Matrix Representation

Math Fall Final Exam

8. Diagonalization.

The QR Factorization

Econ 204 Supplement to Section 3.6 Diagonalization and Quadratic Forms. 1 Diagonalization and Change of Basis

1 Linearity and Linear Systems

MIT Final Exam Solutions, Spring 2017

Degenerate Perturbation Theory. 1 General framework and strategy

Vector Spaces. Vector space, ν, over the field of complex numbers, C, is a set of elements a, b,..., satisfying the following axioms.

Symmetric and anti symmetric matrices

Ensembles and incomplete information

Mathematical Introduction

Numerical Linear Algebra Homework Assignment - Week 2

Math Linear Algebra II. 1. Inner Products and Norms

EE731 Lecture Notes: Matrix Computations for Signal Processing

Linear Algebra and Dirac Notation, Pt. 3

Diagonalizing Matrices

Applied Linear Algebra in Geoscience Using MATLAB

QM and Angular Momentum

Multiple eigenvalues

Eigenvalues and eigenvectors

Image Registration Lecture 2: Vectors and Matrices

Eigenvalues and Eigenvectors

Final Exam, Linear Algebra, Fall, 2003, W. Stephen Wilson

Characterization of half-radial matrices

GROUP THEORY PRIMER. New terms: tensor, rank k tensor, Young tableau, Young diagram, hook, hook length, factors over hooks rule

Preliminary/Qualifying Exam in Numerical Analysis (Math 502a) Spring 2012

14 Singular Value Decomposition

Physics 221A Fall 2017 Notes 27 The Variational Method

22.3. Repeated Eigenvalues and Symmetric Matrices. Introduction. Prerequisites. Learning Outcomes

Transcription:

Modeling photon generation C. J. McKinstrie Bell Laboratories, Alcatel Lucent, Holmdel, New Jersey 07733 mckinstrie@alcatel-lucent.com / 732-888-7275 Abstract The photons required for a variety of quantum information experiments can be generated by parametric (four-wave mixing) processes in fibers. These processes are driven by one or two strong pumps and couple the evolution of two weak (signal and idler) sidebands. They are governed by the coupled-mode equations d z X = AX + BX and the associated input output relations X(z) = M(z)X(0) +N(z)X (0), where X is the (sideband) amplitude vector, A and B are coefficient matrices (which depend on the fiber and pump parameters), and M and N are transfer matrices. Each of the sideband amplitudes could have one frequency and one polarization component, one frequency and two polarization components, or many frequency and one or two polarization components. For special cases in which the coefficient matrices commute, they are simultaneously diagonalizable. In these cases, the amplitudes of the normal modes obey the one-mode squeezing equations d z x j = α j x j + β j x j, the solutions of which are known. (In-phase quadratures are stretched, whereas out-of-phase quadratures are squeezed.) Despite the fact that parametric processes have been studied for decades, there seems to be no simple solution for the general case, in which the coefficient matrices do not commute. The first goal of workshop is to catalog methods of attack for the general case and, if possible, to find the general solution. The second goal is to solve specific problems of current interest, which involve polarization dynamics, and to interpret the solutions. 1

Parametric devices based on four-wave mixing (FWM) in fibers can amplify, frequency convert, phase conjugate, regenerate and sample optical signals in classical communication systems [1]. They can also generate photon pairs for quantum information (communication and computation) experiments [2]. Three different types of FWM are illustrated in Fig. 1. Modulation interaction (MI) is the degenerate process in which two photons from the same pump are destroyed, and signal and idler (sideband) photons are created (2π p π s + π i, where π j represents a photon with frequency ω j ). Inverse MI is the degenerate process in which two photons from different pumps are destroyed and two signal photons are created (π p +π q 2π s ). Phase conjugation (PC) is the nondegenerate process in which two different pump photons are destroyed and two different sideband photons are created (π p + π q π s +π i ). MI and PC are reviewed in [3, 4, 5, 6]. (a) (b) s p i p s q (c) (d) s p q i p s i q Figure 1: Frequency diagrams for (a) modulation interaction, (b) inverse modulation interaction, and (c) outer-band and (d) inner-band phase conjugation. Long arrows denote pumps (p and q), whereas short arrows denote sidebands (s and i). Downward arrows denote modes that lose photons, whereas upward arrows denote modes that gain photons. Parametric interactions of weak sidebands, driven by strong pumps, are governed by coupled-mode equations (CMEs) of the form d z X = AX +BX, (1) where z is distance, d z = d/dz, X = [x j ] is the n 1 vector of sideband amplitudes (modes), A = [α jk ] and B = [β jk ] are n n coefficient matrices, and denotes a complex conjugate. 2

The entries of the amplitude vector could be the amplitudes of distinct monochromatic sidebands (continuous waves), or different frequency components of multichromatic sidebands (pulses), with one or two polarization components. For uniform media the coupling coefficients are constants, whereas for nonuniform media they vary with distance. Because Eq. (1) is linear in the amplitude vector, its (explicit or implicit) solution can be written in the input output (IO) form X(z) = M(z)X(0)+N(z)X (0), (2) where M = [µ jk ] and N = [ν jk ] are transfer (Green) matrices. For the aforementioned one- and two-mode interactions (scalar MI and PC of continuous waves in isotropic fibers), it is easy to solve the CMEs and interpret the IOEs. However, in some systems several modes interact simultaneously, or several two-mode interactions occur sequentially. For such systems, the CMEs and IOEs are complicated and two related questions arise: Under what conditions can we solve the CMEs explicitly and how can we interpret the (explicit or implicit) IOEs? The main goals of this project are to answer these questions. In these notes I will summarize some previous work briefly. The quantum mechanical properties of parametric processes are not part of the project. However, the laws of quantum mechanics impose constraints on the coefficient and transfer matrices that are worth stating: A is anti-hermitian (so A = ij, where J is hermitian) and B is symmetric (so B = ik, where K is also symmetric). In addition, MM NN = I and MN t NM t = 0. (Mini-project: Can these constraints also be deduced from the laws of classical Hamiltonian mechanics?) Recall that every complex matrix M has the singular value decomposition (SVD), sometimes called the Schmidt decomposition, M = UDV, where U and V are unitary and D is diagonal [7, 8]. The n columns of U are the eigenvectors of MM, the columns of V are the eigenvectors of M M, and the entries of D are the (common) non-negative eigenvalues of MM and M M. The aforementioned constraints on the transfer matrices ensure that they have the simultaneous SVDs M = UD µ V and N = UD ν V t, where D µ = diag(µ j ), D ν = diag(ν j ) and their entries (Schmidt coefficients) satisfy the auxiliary 3

equations µ 2 j ν 2 j = 1. Hence, Eq. (2) can be rewritten in the form X(z) = UD µ V X(0)+UD ν V t X (0), (3) where U, V, D µ and D ν depend implicitly on z [9]. It follows from Eq. (3) that the columns of V define input (Schmidt) modes, the columns of U define output modes, and the mode amplitudes (y j ) obey the (one-mode squeezing) equations y j (z) = µ j (z)y j (0)+ν j (z)yj(0). (4) Equations (3) and (4) are remarkable. They tell us that every parametric process, no matter how complicated, can be decomposed into independent squeezing transformations, the properties of which are known (in-phase quadratures are stretched, whereas out-of-phase quadratures are squeezed). We only need to determine the input and output modes, and the associated squeezing parameters (analytically or numerically). Unfortunately, the decomposition theorem does not tell us how to calculate the transfer matrices, upon which the decomposition depends. Notice that both sets of (input and output) modes (usually) depend on z, as do the coefficients (squeezing parameters). Notice also that decompositions do not concatenate, in the sense that the input modes associated with two successive transformations are not (necessarily) equal to the input modes of the first transformation, and the output modes are not equal to the output modes of the second transformation. One possible way to determine the transfer matrix is to use the adjoint method. Equation (1) and its conjugate can be written in the form d z Y = ily, (5) where the 2n 1 mode vector Y = [X t,x ] t and the 2n 2n coefficient matrix L = J K K J. (6) In general, L is not hermitian (self-adjoint). However, L = I 0 0 I J K K J = J K K J I 0 0 I, (7) 4

so L is simply related to hermitian matrices. (Mini-project: What does this relationship imply about the eigenvalues and eigenvectors of L?) The eigenvectors of L are defined by the equation LE j = λ j E j, whereas the adjoint eigenvectors are defined by the adjoint equation L F j = λ jf j. Neither set of vectors is orthonormal by itself. However, F je k = δ jk. The eigenvectors E j are both input and output modes, and the mode amplitudes (y j ) satisfy the simple evolution equations d z y j = iλ j y j, so y j (z) = e iλjz y j (0). Hence, the solution of Eq. (5) can be written in the IO form Y(z) = T(z)Y(0), T(z) = je j e iλjz F j. (8) The transfer matrix T can be written in the alternative form ED λ F, where E j is the jth column of E, e λ jz is the jth entry of the diagonal matrix D λ and F j is the jth column of F. Notice that the input and output matrices (modes) are constants. Notice also that adjoint decompositionsconcatenate, inthesensethatt(z 2 )T(z 1 ) = T(z 1 +z 2 ): Theinputandoutput modes of the individual and combined transformations are the same. In both regards, the adjoint decomposition is simpler and more informative that the Schmidt decomposition. If the transfer matrix is written in the block-matrix form T = T 11 T 12 T 21 T 22, (9) then Eqs. (2) and (9) imply that T 11 = M, T 12 = N, T 21 = T 12 and T 22 = T 11. Although Eqs. (3) and (8) are both formal solutions to Eq. (1), they are based on different input and output matrices: The n n matrices U and V are unitary (so their n 1 columns are selforthonormal), whereas the 2n 2n matrices E and F are not unitary (their 2n 1 columns are cross-orthonormal). (Mini-project: Is there a simple relation between the Schmidt and adjoint decompositions? If so, under what conditions?) An alternative method of analysis is to rewrite the complex CME (1) as a real CME, in which the variables are the mode quadratures (real and imaginary parts of the mode amplitudes). In this equation, the coefficient matrix is not symmetric. There is an interesting relation between the Schmidt decompositions of the real and complex CMEs [10]. It might be easier to analyze the properties of the real CME. 5

References [1] C. J. McKinstrie, S. Radic and A. H. Gnauck, All-optical signal processing by fiberbased parametric devices, Opt. Photon. News 18 (3), 34 40 (2007). [2] J. Fan, A. Migdall and L. Wang, A twin photon source based on optical fiber, Opt. Photon. News, 18 (3) 26 33 (2007). [3] G. P. Agrawal, Nonlinear Fiber Optics, 4th Ed. (Elsevier, 2006). [4] M. E. Marhic, Fiber Optical Parametric Amplifiers, Oscillators and Related Devices (Cambridge, 2007). [5] C. J. McKinstrie, H. Kogelnik, R. M. Jopson, S. Radic and A. V. Kanaev, Four-wave mixing in fibers with random birefringence, Opt. Express 12, 2033 2055 (2004). [6] C. J. McKinstrie, H. Kogelnik and L. Schenato, Four-wave mixing in a rapidly-spun fiber, Opt. Express 14, 8516 8534 (2006). [7] R. A. Horn and C. R. Johnson, Matrix Analysis (Cambridge University Press, 1985). In particular, see theorems 4.1.5, 4.1.6, 4.5.18 and 7.3.5, and problem 7.3.26. [8] G. W. Stewart, On the early history of the singular value decomposition, SIAM Rev. 35, 551 566 (1993). [9] C. J. McKinstrie, Unitary and singular value decompositions of parametric processes in fibers, Opt. Commun. 282, 583 593 (2009). [10] C. J. McKinstrie and N. Alic, Information efficiencies of parametric devices, to appear in J. Sel. Top. Quantm Electron. The real and complex Schmidt decompositions are described in Appendix C. 6