Quantum Queuing Networks Throughput Optimisation

  • Dariusz KurzykEmail author
  • Piotr Gawron
Conference paper


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.



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


  1. 1.
    V. Anisimov, Switching Processes in Queueing Models (Wiley, New York, 2010)Google Scholar
  2. 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)CrossRefzbMATHGoogle Scholar
  3. 3.
    P. Gawron, D. Kurzyk, Z. Puchała, A model for quantum queue. Int. J. Quantum Inf. 11(02), 135401 (2013)CrossRefGoogle Scholar
  4. 4.
    J. Kempe, Quantum random walks: an introductory overview. Contemp. Phys. 44(4), 307–327 (2003)CrossRefMathSciNetGoogle Scholar
  5. 5.
    M.A. Nielsen, I.L. Chuang, Quantum Computation and Quantum Information (Cambridge University Press, Cambridge, 2000)zbMATHGoogle Scholar
  6. 6.
    S. Ying, M. Ying, Removing measurements from quantum walks. Phys. Rev. A 87(1), 012337 (2013)CrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Institute of Theoretical and Applied InformaticsPolish Academy of SciencesGliwicePoland
  2. 2.Institute of MathematicsSilesian University of TechnologyGliwicePoland

Personalised recommendations