(Pseudo) Random Quantum States with Binary Phase-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

(Pseudo) Random Quantum States with Binary Phase

Published:2019 Issue: Volume: Page:229-250
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Brakerski Zvika,Shmueli Omri

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-030-36030-6_10

Reference15 articles.

1. Akavia, A., Bogdanov, A., Guo, S., Kamath, A., Rosen, A.: Candidate weak pseudorandom functions in ac0 mod2. In: Electronic Colloquium on Computational Complexity (ECCC), vol. 21, p. 33 (2014)

2. Ambainis, A., Emerson, J.: Quantum t-designs: t-wise independence in the quantum world. In: Twenty-Second Annual IEEE Conference on Computational Complexity (CCC 2007), pp. 129–140. IEEE (2007)

3. Brakerski, Z., Shmueli, O.: (pseudo) random quantum states with binary phase. CoRR, abs/1906.10611 (2019)

4. Dankert, C., Cleve, R., Emerson, J., Livine, E.: Exact and approximate unitary 2-designs and their application to fidelity estimation. Phys. Rev. A 80(1), 012304 (2009)

5. Harrow, A.W., Low, R.A.: Random quantum circuits are approximate 2-designs. Commun. Math. Phys. 291(1), 257–302 (2009)

Cited by 16 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Improved Stabilizer Estimation via Bell Difference Sampling;Proceedings of the 56th Annual ACM Symposium on Theory of Computing;2024-06-10

2. Pseudorandom Isometries;Lecture Notes in Computer Science;2024

3. A survey on the complexity of learning quantum states;Nature Reviews Physics;2023-12-11

4. Uncloneable Cryptography;Communications of the ACM;2023-10-20

5. Quantum Cryptography in Algorithmica;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号京ICP备18003416号-3