Skip to main content
SpringerLink
Log in

Quantum Queuing Networks Throughput Optimisation

  • Conference paper
  • First Online:
Information Sciences and Systems 2014

  • 813 Accesses

Abstract

We study models of quantum queues based on discrete time quantum walks with barriers. Our considerations refer to multi-servers queuing models. Input and output of jobs in the queue are realised by systems consisting of quantum coins and walkers. We show that presented models behave differently from the classical ones. We also present numerical methods for optimisation of jobs processed by the system. We simultaneously maximise jobs throughput in the system and minimise the number of jobs lost.

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

Access this chapter

Log in via an institution
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 EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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

Institutional subscriptions

References

  1. V. Anisimov, Switching Processes in Queueing Models (Wiley, New York, 2010)

    Google Scholar 

  2. E. Bach, S. Copersmith, M.P. Goldschen, R. Joynt, J. Watrous, One-dimensional quantum walks with absorbing boundaries. J. Comput. Syst. Sci. 69(4), 562–592 (2004)

    Article  MATH  Google Scholar 

  3. P. Gawron, D. Kurzyk, Z. Puchała, A model for quantum queue. Int. J. Quantum Inf. 11(02), 135401 (2013)

    Article  Google Scholar 

  4. J. Kempe, Quantum random walks: an introductory overview. Contemp. Phys. 44(4), 307–327 (2003)

    Article  MathSciNet  Google Scholar 

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

    MATH  Google Scholar 

  6. S. Ying, M. Ying, Removing measurements from quantum walks. Phys. Rev. A 87(1), 012337 (2013)

    Article  Google Scholar 

Download references

Acknowledgments

Acknowledgements Research supported by the Grant N N516 481840 financed by Polish National Science Centre.

Author information

Authors and Affiliations

  1. Institute of Theoretical and Applied Informatics, Polish Academy of Sciences, Bałtycka 5, 44-100, Gliwice, Poland

    Dariusz Kurzyk

  2. Institute of Mathematics, Silesian University of Technology, Kaszubska 23, 44-100, Gliwice, Poland

    Dariusz Kurzyk & Piotr Gawron

Authors
  1. Dariusz Kurzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Piotr Gawron
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Dariusz Kurzyk .

Editor information

Editors and Affiliations

  1. Polish Academy of Sciences, Gliwice, Poland

    Tadeusz Czachórski

  2. Imperial College London, London, United Kingdom

    Erol Gelenbe

  3. Imperial College London, London, United Kingdom

    Ricardo Lent

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Kurzyk, D., Gawron, P. (2014). Quantum Queuing Networks Throughput Optimisation. In: Czachórski, T., Gelenbe, E., Lent, R. (eds) Information Sciences and Systems 2014. Springer, Cham. https://doi.org/10.1007/978-3-319-09465-6_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09465-6_22

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09464-9

  • Online ISBN: 978-3-319-09465-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation