Skip to main content
SpringerLink
Log in

Universality and optimality of programmable quantum processors

  • Published:
Acta Physica Hungarica Series B, Quantum Electronics

Abstract

We analyze and compare the optimality of approximate and probabilistic universal programmable quantum processors. We define several characteristics how to quantify the optimality and we study in detail performance of three types of programmable quantum processors based on 1) the C-NOT gate, 2) the SWAP operation, and 3) the model of the quantum information distributor — the QID processor. We show under which conditions the measurement assisted QID processor is optimal. We also investigate optimality of the socalled U-processors and we also compare the optimal approximate implementation of U(1) qubit rotations with the known probabilistic implementation as introduced by Vidal, Masanes and Cirac [Phys. Rev. Lett. 88 (2002) 047905].

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. J. Gruska, Foundations of Computing, Thompson Computer Press, London, 1999.

    Google Scholar 

  2. M. Nielsen and I. Chuang, Phys. Rev. Lett. 79 (1997) 321.

    Article  MATH  ADS  MathSciNet  Google Scholar 

  3. M. Hillery, M. Ziman and V. Bužek, Phys. Rev. A 66 (2002) 042302.

    Article  ADS  Google Scholar 

  4. A.Yu. Vlasov, quant-ph/0103119; quant-ph/0311196; quant-ph/0301147; quant-ph/0503230.

  5. M. Dušek and V. Bužek, Phys. Rev. A 66 (2002) 022112; Phys. Rev. Lett. 89 (2002) 190401.

    Article  ADS  Google Scholar 

  6. G.M. D’Ariano and P. Perinotti, Phys. Rev. Lett. 94 (2005) 090401.

    Article  Google Scholar 

  7. J. Gea-Banacloche, Phys. Rev. A 65 (2002) 022308.

    Article  ADS  Google Scholar 

  8. A. Silberfarb and I. Deutsch, Phys. Rev. A 68 (2003) 013817.

    Article  ADS  Google Scholar 

  9. A.K. Ekert, C.M. Alves, D.K.L. Oi, M. Horodecki, P. Horodecki and L.C. Kwek, Phys. Rev. Lett. 88 (2002) 217901.

    Article  ADS  Google Scholar 

  10. J.P. Paz and A. Roncaglia, Phys. Rev. A 68 (2003) 052316.

    Article  ADS  Google Scholar 

  11. M. Hillery, M. Ziman and V. Bužek, Phys. Rev. A 65 (2002) 022301.

    Article  ADS  MathSciNet  Google Scholar 

  12. M. Hillery, M. Ziman and V. Bužek, Phys. Rev. A 69 (2004) 042311.

    Article  ADS  Google Scholar 

  13. M. Hillery, M. Ziman and V. Bužek, Phys. Rev. A 73 (2006) 022345.

    Article  ADS  Google Scholar 

  14. G.M. D’Ariano and P. Perinotti, quant-ph/0510033.

  15. G. Vidal and J.I. Cirac, quant-ph/0012067.

  16. G. Vidal, L. Masanes and J.I. Cirac, Phys. Rev. Lett. 88 (2002) 047905.

    Article  ADS  Google Scholar 

  17. M. Ziman and V. Bužek, Int. J. Quant. Inf. 1 (2003) 523.

    Google Scholar 

  18. M.A. Nielsen and I.L. Chuang, Quantum Computation and Quantum Information, Cambridge University Press, Cambridge, 2000.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Research Center for Quantum Information, Slovak Academy of Sciences, Dúbravská cesta 9, 845 11, Bratislava, Slovakia

    Mário Ziman & Vladimír Bužek

  2. Quniverse, Líščie údolie 116, 841 04, Bratislava, Slovakia

    Mário Ziman & Vladimír Bužek

  3. Faculty of Informatics, Masaryk University, Botanická 68a, 602 00, Brno, Czech Republic

    Mário Ziman & Vladimír Bužek

Authors
  1. Mário Ziman
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladimír Bužek
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mário Ziman.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ziman, M., Bužek, V. Universality and optimality of programmable quantum processors. Acta Phys. Hung. B 26, 277–291 (2006). https://doi.org/10.1556/APH.26.2006.3-4.8

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1556/APH.26.2006.3-4.8

Keywords

PACS

Search

Navigation