Pseudorandom unitaries are neither real nor sparse nor noise-robust
暂无分享,去创建一个
[1] A. Jaffe,et al. Stabilizer Testing and Magic Entropy , 2023, ArXiv.
[2] P. Ananth,et al. Pseudorandom Strings from Pseudorandom Quantum States , 2023, IACR Cryptol. ePrint Arch..
[3] D. E. Koh,et al. Fundamental Limitations on Communication over a Quantum Network , 2023, 2306.04983.
[4] M. Kim,et al. Efficient stabilizer entropies for quantum computers , 2023, 2305.19152.
[5] V. Iyer,et al. Improved Stabilizer Estimation via Bell Difference Sampling , 2023, ArXiv.
[6] vCaslav Brukner,et al. Quantum Reference Frames for Lorentz Symmetry , 2022, 2212.14081.
[7] P. Ananth,et al. Pseudorandom (Function-Like) Quantum State Generators: New Definitions and Applications , 2022, IACR Cryptol. ePrint Arch..
[8] Tulja Varun Kondra,et al. Real quantum operations and state transformations , 2022, 2210.15820.
[9] H. Yuen,et al. Unitary property testing lower bounds by polynomials , 2022, ITCS.
[10] H. Yuen,et al. Testing and Learning Quantum Juntas Nearly Optimally , 2022, SODA.
[11] A. Jaffe,et al. Complexity of quantum circuits via sensitivity, magic, and coherence , 2022, ArXiv.
[12] M. Kim,et al. Scalable Measures of Magic Resource for Quantum Computers , 2022, PRX Quantum.
[13] Mehdi Soleimanifar,et al. Testing matrix product states , 2022, SODA.
[14] P. Ananth,et al. Cryptography from Pseudorandom Quantum States , 2021, IACR Cryptol. ePrint Arch..
[15] T. Morimae,et al. Quantum commitments and signatures without one-way functions , 2021, IACR Cryptol. ePrint Arch..
[16] Jordan S. Cotler,et al. Quantum advantage in learning from experiments , 2021, Science.
[17] N. Gisin,et al. Testing Real Quantum Theory in an Optical Quantum Network. , 2021, Physical review letters.
[18] Salvatore F. E. Oliviero,et al. Stabilizer Rényi Entropy. , 2021, Physical review letters.
[19] Yudong Cao,et al. Minimizing Estimation Runtime on Noisy Quantum Computers , 2021, PRX Quantum.
[20] William Kretschmer. Quantum Pseudorandomness and Classical Complexity , 2021, TQC.
[21] Jian-Wei Pan,et al. Ruling Out Real-Valued Standard Formalism of Quantum Theory. , 2021, Physical review letters.
[22] Carlo Maria Scandolo,et al. Resource theory of imaginarity: Quantification and state conversion , 2021, Physical Review A.
[23] N. Gisin,et al. Quantum theory based on real numbers can be experimentally falsified , 2021, Nature.
[24] Kaifeng Bu,et al. On the statistical complexity of quantum circuits , 2021, Physical Review A.
[25] H. Neven,et al. Focus beyond Quadratic Speedups for Error-Corrected Quantum Advantage , 2020, 2011.04149.
[26] K. Fujii,et al. Quantum Error Mitigation as a Universal Error Reduction Technique: Applications from the NISQ to the Fault-Tolerant Quantum Computing Eras , 2020, PRX Quantum.
[27] Chuan-Feng Li,et al. Operational Resource Theory of Imaginarity. , 2020, Physical review letters.
[28] Earl T. Campbell,et al. Quantifying Quantum Speedups: Improved Classical Simulation From Tighter Magic Monotones , 2020, PRX Quantum.
[29] Lajos Hanzo,et al. When Entanglement Meets Classical Communications: Quantum Teleportation for the Quantum Internet , 2019, IEEE Transactions on Communications.
[30] Zvika Brakerski,et al. (Pseudo) Random Quantum States with Binary Phase , 2019, TCC.
[31] Kaifeng Bu,et al. Efficient classical simulation of Clifford circuits with nonstabilizer input states , 2019, Physical review letters.
[32] Fang Song,et al. Pseudorandom States, Non-Cloning Theorems and Quantum Money , 2017, IACR Cryptol. ePrint Arch..
[33] Dax Enshan Koh,et al. Entanglement scaling in quantum advantage benchmarks , 2018, Physical Review A.
[34] Mark Howard,et al. Simulation of quantum circuits by low-rank stabilizer decompositions , 2018, Quantum.
[35] Ryan LaRose,et al. Quantum-assisted quantum compiling , 2018, Quantum.
[36] G. Gour,et al. Quantum resource theories , 2018, Reviews of Modern Physics.
[37] R. Jozsa,et al. Quantum advantage of unitary Clifford circuits with magic state inputs , 2018, Proceedings of the Royal Society A.
[38] Gilad Gour,et al. Quantifying the imaginarity of quantum mechanics , 2018, Journal of Physics A: Mathematical and Theoretical.
[39] D. Gross,et al. Schur–Weyl Duality for the Clifford Group with Applications: Property Testing, a Robust Hudson Theorem, and de Finetti Representations , 2017, Communications in Mathematical Physics.
[40] J. Fitzsimons,et al. Quantum Advantage from Conjugated Clifford Circuits , 2017, CCC.
[41] Murphy Yuezhen Niu,et al. Quantum simulation from the bottom up: the case of rebits , 2017, ArXiv.
[42] S. Fei,et al. Maximum Relative Entropy of Coherence: An Operational Coherence Measure. , 2017, Physical review letters.
[43] Ashley Montanaro,et al. Learning stabilizer states by Bell sampling , 2017, 1707.04012.
[44] M. Murao,et al. Complex conjugation supermap of unitary quantum maps and its universal implementation protocol , 2017, Physical Review Research.
[45] Antonio Acín,et al. Certified randomness in quantum physics , 2016, Nature.
[46] Maciej Lewenstein,et al. Randomness in quantum mechanics: philosophy, physics and technology , 2016, Reports on progress in physics. Physical Society.
[47] Wen-Li Yang,et al. Coherence depletion in the Grover quantum search algorithm , 2016, 1610.08656.
[48] Paolo Zanardi,et al. Coherence generating power of quantum unitary maps , 2016, 1610.00217.
[49] Christoph Hirche,et al. Efficient quantum pseudorandomness with nearly time-independent hamiltonian dynamics , 2016, 1609.07021.
[50] M. Plenio,et al. Colloquium: quantum coherence as a resource , 2016, 1609.02439.
[51] F. Brandão,et al. Local Random Quantum Circuits are Approximate Polynomial-Designs , 2016, Communications in Mathematical Physics.
[52] Fernando G S L Brandão,et al. Efficient Quantum Pseudorandomness. , 2016, Physical review letters.
[53] Dax Enshan Koh,et al. Further extensions of Clifford circuits and their classical simulation complexities , 2015, Quantum Inf. Comput..
[54] M. B. Plenio,et al. Coherent control of quantum systems as a resource theory , 2015, 1512.07486.
[55] Mark Hillery,et al. Coherence as a resource in decision problems: The Deutsch-Jozsa algorithm and a variation , 2015, 1512.01874.
[56] Kaifeng Bu,et al. Cohering power of quantum operations , 2015, 1509.09109.
[57] Uttam Singh,et al. Average coherence and its typicality for random pure states , 2015, 1509.08939.
[58] Eric Chitambar,et al. Relating the Resource Theories of Entanglement and Quantum Coherence. , 2015, Physical review letters.
[59] Joonwoo Bae,et al. Quantum state discrimination and its applications , 2015, 1707.02571.
[60] Gerardo Adesso,et al. Measuring Quantum Coherence with Entanglement. , 2015, Physical review letters.
[61] Gerardo Adesso,et al. Certifying quantumness: benchmarks for the optimal processing of generalized coherent and squeezed states , 2014, 1407.4133.
[62] Le Phuc Thinh,et al. Quantum randomness extraction for various levels of characterization of the devices , 2014, 1401.4243.
[63] M. Plenio,et al. Quantifying coherence. , 2013, Physical review letters.
[64] Ronald de Wolf,et al. A Survey of Quantum Property Testing , 2013, Theory Comput..
[65] Victor Veitch,et al. The resource theory of stabilizer quantum computation , 2013, 1307.7171.
[66] Richard Jozsa,et al. Classical simulation complexity of extended Clifford circuits , 2013, Quantum Inf. Comput..
[67] Pedro Chamorro-Posada,et al. swap test and Hong-Ou-Mandel effect are equivalent , 2013, 1303.6814.
[68] Guoming Wang,et al. Property testing of unitary operators , 2011, 1110.1133.
[69] Matthew McKague,et al. On the power quantum computation over real Hilbert spaces , 2011, 1109.0795.
[70] Ashley Montanaro,et al. Testing Product States, Quantum Merlin-Arthur Games and Tensor Optimization , 2010, JACM.
[71] H. Briegel,et al. Measurement-based quantum computation , 2009, 0910.1116.
[72] R. A. Low,et al. Learning and testing algorithms for the Clifford group , 2009, 0907.2833.
[73] G. Tóth,et al. Entanglement detection , 2008, 0811.2803.
[74] Cristian S. Calude,et al. Quantum randomness and value indefiniteness , 2006, quant-ph/0611029.
[75] A. J. Short,et al. Entanglement and the foundations of statistical mechanics , 2005 .
[76] Seth Lloyd,et al. Pseudo-Random Unitary Operators for Quantum Information Processing , 2003, Science.
[77] Lov K. Grover,et al. A 2 rebit gate universal for quantum computing , 2002, quant-ph/0210187.
[78] M. Horodecki,et al. Direct estimations of linear and nonlinear functionals of a quantum state. , 2001, Physical review letters.
[79] L. Fortnow,et al. Quantum property testing , 2002, SODA '03.
[80] D. Gottesman. The Heisenberg Representation of Quantum Computers , 1998, quant-ph/9807006.
[81] David Deutsch,et al. Stabilization of Quantum Computations by Symmetrization , 1997, SIAM J. Comput..
[82] Dana Ron,et al. Property testing and its connection to learning and approximation , 1996, Proceedings of 37th Conference on Foundations of Computer Science.
[83] Ronitt Rubinfeld,et al. Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..
[84] Ekert,et al. Quantum cryptography based on Bell's theorem. , 1991, Physical review letters.
[85] Richard Moulds,et al. Quantum Random Number Generators , 2016 .
[86] Yehuda Lindell,et al. Introduction to Modern Cryptography , 2004 .
[87] T. Paul,et al. Quantum computation and quantum information , 2001, SOEN.