Funder
NSFC
Henan Key Laboratory of Network Cryptography Technology
Publisher
Springer Science and Business Media LLC
Subject
Electrical and Electronic Engineering,Modeling and Simulation,Signal Processing,Theoretical Computer Science,Statistical and Nonlinear Physics,Electronic, Optical and Magnetic Materials
Reference39 articles.
1. Ambainis, A., Nayak, A., Ta-Shma, A., Vazirani, U.: Dense quantum coding and a lower bound for 1-way quantum automata. In: Proceedings of 31st ACM Symposium on Theory of Computing, pp. 376–383 (1999)
2. Ambainis, A., Leung, D., Mancinska, L., et al.: Quantum random access codes with shared randomness. arXiv: 0810.2937 (2008)
3. Wiesner, S.: Conjugate coding. ACM Sigact. News 15, 78–88 (1983)
4. Nayak, A.: Optimal lower bounds for quantum automata and random access codes. In: Proceedings of 40th Annual Symposium on Foundations of Computer Science, pp. 369–377 (1999)
5. Hayashi, M., Iwama, K., Nishimura, H., Raymond, R., et al.: (4, 1)-Quantum random access coding does not exist-one qubit is not enough to recover one of four bits. New J. Phys. 8, 129 (2006)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献