2018/04/03 by Avhishek Chatterjee, Chatterjee, Avhishek, Krishna Jagannathan +3
Computer Science · Physics and Astronomy · #Age of Information Optimization #FOS: Computer and information sciences #FOS: Physical sciences #Information Theory (cs.IT) #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Quantum Mechanics and Applications #Quantum Physics (quant-ph)
paper · pdf · doi:10.48550/arxiv.1804.00906
openalex publication_date 2018/04/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We consider a setting where qubits are processed sequentially, and derive\nfundamental limits on the rate at which classical information can be\ntransmitted using quantum states that decohere in time. Specifically, we model\nthe sequential processing of qubits using a single server queue, and derive\nexplicit expressions for the capacity of such a `queue-channel.' We also\ndemonstrate a sweet-spot phenomenon with respect to the arrival rate to the\nqueue, i.e., we show that there exists a value of the arrival rate of the\nqubits at which the rate of information transmission (in bits/sec) through the\nqueue-channel is maximized. Next, we consider a setting where the average rate\nof processing qubits is fixed, and show that the capacity of the queue-channel\nis maximized when the processing time is deterministic. We also discuss design\nimplications of these results on quantum information processing systems.\n