Fiveable

โžฟQuantum Computing Unit 9 Review

QR code for Quantum Computing practice questions

9.3 Quantum operations and completely positive maps

9.3 Quantum operations and completely positive maps

Written by the Fiveable Content Team โ€ข Last updated August 2025
Written by the Fiveable Content Team โ€ข Last updated August 2025
โžฟQuantum Computing
Unit & Topic Study Guides

Quantum operations are the building blocks of quantum information processing. They transform quantum states, enabling computation and communication. These operations come in two flavors: unitary (reversible) and non-unitary (irreversible), each playing a crucial role in quantum systems.

Completely positive maps provide a mathematical framework for describing quantum operations. They ensure that physical transformations preserve the positivity of density matrices. This concept is fundamental to understanding how quantum information is processed and transmitted in real-world systems.

Quantum Operations

Types of quantum operations

  • Quantum operations transform quantum states and can be classified into two main categories
    • Unitary operations are reversible transformations that preserve the inner product between states (orthogonality)
      • Represented mathematically by unitary matrices UU satisfying Uโ€ U=UUโ€ =IU^\dagger U = UU^\dagger = I, where Uโ€ U^\dagger is the conjugate transpose of UU and II is the identity matrix
    • Non-unitary operations are irreversible transformations that do not preserve the inner product between states
      • Include processes such as measurement (projective or POVM), dissipation (interaction with the environment), and decoherence (loss of quantum coherence)
  • Kraus representation provides a general framework to describe any quantum operation E\mathcal{E} as a sum of Kraus operators EiE_i
    • The action of E\mathcal{E} on a state ฯ\rho is given by E(ฯ)=โˆ‘iEiฯEiโ€ \mathcal{E}(\rho) = \sum_i E_i \rho E_i^\dagger, where EiE_i are the Kraus operators
    • Kraus operators must satisfy the completeness relation โˆ‘iEiโ€ Ei=I\sum_i E_i^\dagger E_i = I to ensure the operation is trace-preserving
Types of quantum operations, Circuits of space and time quantum channels โ€“ Quantum

Concept of completely positive maps

  • Completely positive (CP) maps are a special class of quantum operations that preserve positivity of density matrices
    • A map E\mathcal{E} is positive if it maps positive operators to positive operators, i.e., if ฯโ‰ฅ0\rho \geq 0, then E(ฯ)โ‰ฅ0\mathcal{E}(\rho) \geq 0
    • A map E\mathcal{E} is completely positive if (IโŠ—E)(ฯ)(\mathcal{I} \otimes \mathcal{E})(\rho) is positive for any positive operator ฯ\rho, where I\mathcal{I} is the identity map on an ancillary system
  • Choi-Jamioล‚kowski isomorphism establishes a one-to-one correspondence between CP maps and positive semidefinite matrices
    • The Choi matrix of a CP map E\mathcal{E} is given by J(E)=(IโŠ—E)(โˆฃฮฆ+โŸฉโŸจฮฆ+โˆฃ)J(\mathcal{E}) = (\mathcal{I} \otimes \mathcal{E})(\ket{\Phi^+}\bra{\Phi^+}), where โˆฃฮฆ+โŸฉ=1dโˆ‘i=1dโˆฃiโŸฉโŠ—โˆฃiโŸฉ\ket{\Phi^+} = \frac{1}{\sqrt{d}} \sum_{i=1}^d \ket{i} \otimes \ket{i} is a maximally entangled state
    • A map E\mathcal{E} is CP if and only if its Choi matrix J(E)J(\mathcal{E}) is positive semidefinite
  • Stinespring dilation theorem states that any CP map can be realized as a unitary operation on a larger Hilbert space followed by a partial trace
    • Mathematically, E(ฯ)=TrE[U(ฯโŠ—โˆฃ0โŸฉโŸจ0โˆฃ)Uโ€ ]\mathcal{E}(\rho) = \text{Tr}_E[U(\rho \otimes \ket{0}\bra{0})U^\dagger], where UU is a unitary operator acting on the system and an ancillary environment, and โˆฃ0โŸฉ\ket{0} is a fixed ancillary state
    • This representation provides an operational interpretation of CP maps and their connection to open quantum systems
Types of quantum operations, Variational Quantum Singular Value Decomposition โ€“ Quantum

Transformation of quantum states

  • Unitary operations transform quantum states by applying a unitary matrix UU to the state vector or density matrix
    • For a pure state โˆฃฯˆโŸฉ\ket{\psi}, the transformed state is UโˆฃฯˆโŸฉU\ket{\psi}
    • For a density matrix ฯ\rho, the transformed state is UฯUโ€ U\rho U^\dagger
  • Non-unitary operations, such as measurements or dissipative processes, transform quantum states according to their Kraus representation
    • Applying Kraus operators EiE_i to a state ฯ\rho yields a new state E(ฯ)=โˆ‘iEiฯEiโ€ \mathcal{E}(\rho) = \sum_i E_i \rho E_i^\dagger
    • Projective measurements transform a state ฯ\rho into a post-measurement state ฯi=PiฯPi/Tr(Piฯ)\rho_i = P_i \rho P_i / \text{Tr}(P_i \rho) with probability pi=Tr(Piฯ)p_i = \text{Tr}(P_i \rho), where PiP_i are the measurement projectors

Effects on quantum systems

  • State fidelity quantifies the similarity between two quantum states ฯ\rho and ฯƒ\sigma
    • Fidelity is defined as F(ฯ,ฯƒ)=TrฯฯƒฯF(\rho, \sigma) = \text{Tr}\sqrt{\sqrt{\rho}\sigma\sqrt{\rho}} and ranges from 0 (orthogonal states) to 1 (identical states)
    • For pure states โˆฃฯˆโŸฉ\ket{\psi} and โˆฃฯ•โŸฉ\ket{\phi}, fidelity reduces to the squared overlap F(โˆฃฯˆโŸฉ,โˆฃฯ•โŸฉ)=โˆฃโŸจฯˆโˆฃฯ•โŸฉโˆฃ2F(\ket{\psi}, \ket{\phi}) = |\braket{\psi|\phi}|^2
  • Quantum channel capacity characterizes the maximum rate at which information can be reliably transmitted through a quantum channel E\mathcal{E}
    • Classical capacity C(E)C(\mathcal{E}) quantifies the maximum rate of classical information transmission, given by C(E)=maxโกpi,ฯiฯ‡({pi,E(ฯi)})C(\mathcal{E}) = \max_{p_i, \rho_i} \chi(\{p_i, \mathcal{E}(\rho_i)\}), where ฯ‡\chi is the Holevo information
    • Quantum capacity Q(E)Q(\mathcal{E}) quantifies the maximum rate of quantum information transmission, given by Q(E)=limโกnโ†’โˆž1nmaxโกฯIc(ฯ,EโŠ—n)Q(\mathcal{E}) = \lim_{n \to \infty} \frac{1}{n} \max_{\rho} I_c(\rho, \mathcal{E}^{\otimes n}), where IcI_c is the coherent information
  • Quantum error correction aims to protect quantum information from errors induced by quantum operations
    • Quantum information is encoded into a larger Hilbert space using error-correcting codes (stabilizer codes, topological codes)
    • Syndrome measurements are performed to detect and correct errors without disturbing the encoded information
    • Examples of quantum error-correcting codes include the Shor code, the Steane code, and the surface code