Skip to main content

On Rank Two Channels

  • Chapter

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 4123))

Abstract

Based on some identities for the determinant of completely positive maps of rank two, concurrences are calculated or estimated from below.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ruskai, M.B., Szarek, S., Werner, E.: An analysis of completely–positive trace–preserving maps on 2x2 matrices. Lin. Alg. Appl. 347, 159–187 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  2. Gorini, V., Sudarshan, E.C.G.: Extreme affine transformations. Commun. Math. Phys. 46, 43–52 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  3. Verstraete, F., Verschelde, H.: On one-qubit channels, quant-ph/0202124

    Google Scholar 

  4. Hill, S., Wootters, W.: Entanglement of a pair of quantum bits. Phys. Rev. Lett. 78, 5022–5025 (1997)

    Article  Google Scholar 

  5. Bennett, C., Di Vincenzo, D., Smolin, J., Wootters, W.: Mixed state entanglement and quantum error correction. Phys. Rev. A 54, 3824–3851 (1996)

    Article  MathSciNet  Google Scholar 

  6. Wootters, W.: Entanglement of formation of an arbitrary state of two qubits. Phys. Rev. Lett. 80, 2245 (1998)

    Article  Google Scholar 

  7. Benatti, F., Narnhofer, A., Uhlmann, A.: Broken symmetries in the entanglement of formation. Int. J. Theor. Phys. 42, 983–999 (2003)

    Article  MATH  Google Scholar 

  8. Uhlmann, A.: On 1-qubit channels. J. Phys. A, Math. Gen. 34, 7074–7055 (2001); Revised version: e-print, quant-ph/0011106 (2001)

    Google Scholar 

  9. Uhlmann, A.: Fidelity and concurrence of conjugated states. Phys. Rev. A 62 (2000)

    Google Scholar 

  10. Wootters, W.K.: Entanglement of formation and concurrence. Quantum Information and Computation 1, 27–47 (2002)

    MathSciNet  Google Scholar 

  11. Mintert, F., Kuś, M., Buchleitner, A.: Concurrence of mixed bipartite quantum states of arbitrary dimensions, e-print, quant-ph/0403063

    Google Scholar 

  12. Rungta, R., Buzek, V., Caves, C.M., Hillery, M., Milburn, G.J., Wootters, W.K.: Universal state inversion and concurrence in arbitrary dimensions. Phys. Rev. A 64, 042315 (2001)

    Google Scholar 

  13. Uhlmann, A.: Concurrence and foliations induced by some 1-qubit channels. Int. J. Theor. Phys. 42, 983–999 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kossakowski, A.: Remarks on positive maps of finite-dimensional simple Jordan algebras. Rep. Math. Phys. 46, 393–397 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  15. Fei, S., Jost, J., Li-Jost, X., Wang, G.: Entanglement of formation for a class of quantum states, e-print, quant-ph/0304095

    Google Scholar 

Download references

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Uhlmann, A. (2006). On Rank Two Channels. In: Ahlswede, R., et al. General Theory of Information Transfer and Combinatorics. Lecture Notes in Computer Science, vol 4123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11889342_23

Download citation

  • DOI: https://doi.org/10.1007/11889342_23

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-46244-6

  • Online ISBN: 978-3-540-46245-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics