Quantum advantage with shallow circuits
暂无分享,去创建一个
[1] Robert Spalek,et al. Quantum Fan-out is Powerful , 2005, Theory Comput..
[2] Scott Aaronson,et al. BQP and the polynomial hierarchy , 2009, STOC '10.
[3] Scott Aaronson,et al. Quantum computing, postselection, and probabilistic polynomial-time , 2004, Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences.
[4] Martin Schwarz,et al. Architectures for quantum simulation showing quantum supremacy , 2017 .
[5] A. Harrow,et al. Quantum Supremacy through the Quantum Approximate Optimization Algorithm , 2016, 1602.07674.
[6] Sanjeev Arora,et al. Computational Complexity: A Modern Approach , 2009 .
[7] J. Eisert,et al. Architectures for quantum simulation showing a quantum speedup , 2017, 1703.00466.
[8] A. Shimony,et al. Bell’s theorem without inequalities , 1990 .
[9] Andris Ambainis,et al. Quantum walk algorithm for element distinctness , 2003, 45th Annual IEEE Symposium on Foundations of Computer Science.
[10] Ashley Montanaro,et al. Quantum algorithms: an overview , 2015, npj Quantum Information.
[11] Emanuele Viola,et al. Extractors for Circuit Sources , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[12] Ashley Montanaro,et al. Achieving quantum supremacy with sparse and noisy commuting quantum computations , 2016, 1610.01808.
[13] Elham Kashefi,et al. Computational Depth Complexity of Measurement-Based Quantum Computation , 2009, TQC.
[14] L. Csanky,et al. Fast Parallel Matrix Inversion Algorithms , 1976, SIAM J. Comput..
[15] Martin Rötteler,et al. Quantum algorithm for the Boolean hidden shift problem , 2011, COCOON.
[16] J. Bell. On the Einstein-Podolsky-Rosen paradox , 1964 .
[17] Andrew W. Cross,et al. Quantum learning robust against noise , 2014, 1407.5088.
[18] Allan Borodin,et al. Fast parallel matrix and GCD computations , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[19] Richard Cleve,et al. Fast parallel circuits for the quantum Fourier transform , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.
[20] Scott Aaronson,et al. Improved Simulation of Stabilizer Circuits , 2004, ArXiv.
[21] Scott Aaronson,et al. Complexity-Theoretic Foundations of Quantum Supremacy Experiments , 2016, CCC.
[22] David P. DiVincenzo,et al. Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games , 2002, Quantum Inf. Comput..
[23] L. Duan,et al. Quantum Supremacy for Simulating a Translation-Invariant Ising Spin Model. , 2016, Physical review letters.
[24] Ashley Montanaro,et al. Average-case complexity versus approximate simulation of commuting quantum computations , 2015, Physical review letters.
[25] Lior Eldar,et al. Local Hamiltonians Whose Ground States Are Hard to Approximate , 2015, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[26] Martin Nilsson,et al. Parallel Quantum Computation and Quantum Codes , 2001, SIAM J. Comput..
[27] D. Deutsch,et al. Rapid solution of problems by quantum computation , 1992, Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences.
[28] Stefano Pironio,et al. Modeling Pauli measurements on graph states with nearest-neighbor classical communication , 2007 .
[29] R Raussendorf,et al. A one-way quantum computer. , 2001, Physical review letters.
[30] Peter W. Shor,et al. Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer , 1995, SIAM Rev..
[31] Norbert Schuch,et al. How long can a quantum memory withstand depolarizing noise? , 2009, Physical review letters.
[32] Martin Rötteler,et al. Quantum Algorithms to Solve the Hidden Shift Problem for Quadratics and for Functions of Large Gowers Norm , 2009, MFCS.
[33] Ying Li,et al. Efficient Variational Quantum Simulator Incorporating Active Error Minimization , 2016, 1611.09301.
[34] Daniel Gottesman,et al. Fault-tolerant quantum computation with constant overhead , 2013, Quantum Inf. Comput..
[35] Ronald de Wolf,et al. Quantum communication and complexity , 2002, Theor. Comput. Sci..
[36] H. Bombin. Gauge Color Codes: Optimal Transversal Gates and Gauge Fixing in Topological Stabilizer Codes , 2013, 1311.0879.
[37] G. Brassard,et al. Quantum Communication Complexity , 2003 .
[38] H. Briegel,et al. Persistent entanglement in arrays of interacting particles. , 2000, Physical review letters.
[39] Kiel T. Williams,et al. Extreme quantum entanglement in a superposition of macroscopically distinct states. , 1990, Physical review letters.
[40] Rocco A. Servedio,et al. Quantum Algorithms for Learning and Testing Juntas , 2007, Quantum Inf. Process..
[41] Umesh V. Vazirani,et al. Quantum Complexity Theory , 1997, SIAM J. Comput..
[42] M. Mosca,et al. A Meet-in-the-Middle Algorithm for Fast Synthesis of Depth-Optimal Quantum Circuits , 2012, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[43] Kristan Temme,et al. Error Mitigation for Short-Depth Quantum Circuits. , 2016, Physical review letters.
[44] H. Briegel,et al. Measurement-based quantum computation on cluster states , 2003, quant-ph/0301052.
[45] J. Eisert,et al. Multiparty entanglement in graph states , 2003, quant-ph/0307130.
[46] H. Neven,et al. Characterizing quantum supremacy in near-term devices , 2016, Nature Physics.