메뉴 건너뛰기




Volumn 64, Issue 5, 2001, Pages 10-

Separability properties of three-mode Gaussian states

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84864443961     PISSN: 10502947     EISSN: 10941622     Source Type: Journal    
DOI: 10.1103/PhysRevA.64.052303     Document Type: Article
Times cited : (3)

References (44)
  • 35
    • 85037230384 scopus 로고    scopus 로고
    • To be precise, we should define J with an index n to keep track of the dimension of the space (Formula presented) on which it acts. But since n will always be clear from the context we will omit this index and just use J to make the expressions more readable
    • To be precise, we should define J with an index n to keep track of the dimension of the space (Formula presented) on which it acts. But since n will always be clear from the context we will omit this index and just use J to make the expressions more readable.
  • 37
    • 85037238299 scopus 로고    scopus 로고
    • A linear transformation S on phase space is called symplectic if it preserves J, i.e., if (Formula presented) holds. The symplectic transformations contain those physical operations on CV states that can currently be routinely realized in the laboratory. They comprise all unitary operations generated by a Hamiltonian quadratic in the canonical operators (Formula presented) (Formula presented) i.e., in quantum optical terms, beam splitter, phase shifter, and squeezer
    • A linear transformation S on phase space is called symplectic if it preserves J, i.e., if (Formula presented) holds. The symplectic transformations contain those physical operations on CV states that can currently be routinely realized in the laboratory. They comprise all unitary operations generated by a Hamiltonian quadratic in the canonical operators (Formula presented) (Formula presented) i.e., in quantum optical terms, beam splitter, phase shifter, and squeezer.
  • 38
    • 85037210058 scopus 로고    scopus 로고
    • the following, it is convenient to use the notation (Formula presented) for block-diagonal matrices: if A and B are (Formula presented) and (Formula presented) square matrices, respectively, then (Formula presented) is the (Formula presented) square matrix (Formula presented)
    • In the following, it is convenient to use the notation (Formula presented) for block-diagonal matrices: if A and B are (Formula presented) and (Formula presented) square matrices, respectively, then (Formula presented) is the (Formula presented) square matrix (Formula presented)
  • 41
    • 85037207628 scopus 로고    scopus 로고
    • The following definitions assume that (Formula presented) [If one of them is 0, the corresponding ellipse degenerates into a circle around (0,0) and we can take an arbitrary (Formula presented) to make sense of (Formula presented)] The criterion is not affected by this assumption, since it relies on Ineqs. (3.21)
    • The following definitions assume that (Formula presented) [If one of them is 0, the corresponding ellipse degenerates into a circle around (0,0) and we can take an arbitrary (Formula presented) to make sense of (Formula presented)] The criterion is not affected by this assumption, since it relies on Ineqs. (3.21).
  • 44
    • 85037234408 scopus 로고    scopus 로고
    • the case (Formula presented) the borders of the ellipses either do not intersect at all or coincide. In both cases we have to look for solutions among the remaining seven candidates
    • In the case (Formula presented) the borders of the ellipses either do not intersect at all or coincide. In both cases we have to look for solutions among the remaining seven candidates.


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.