Fetching the paper…
Reading the bibliography…
We initiate the systematic study of experimental quantum physics from the perspective of computational complexity.
1903
Earlier work this paper cites.
1909
Earlier work this paper cites.
Millikan, R. A. (1910). XXII. A new modification of the cloud method of determining the elementary electrical charge and the most probable value of that charge. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science
1910
Earlier work this paper cites.
1911
Earlier work this paper cites.
1911
Earlier work this paper cites.
1911
Earlier work this paper cites.
1912
Earlier work this paper cites.
Yao, A. C. C. (1993, November). Quantum circuit complexity. In Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science
1993
Earlier work this paper cites.
Papadimitriou, C. (1994). Computatational Complexity
1994
Earlier work this paper cites.
Barenco, A., Bennett, C. H., Cleve, R., DiVincenzo, D. P., Margolus, N., Shor, P., … & Weinfurter, H. (1995). Elementary gates for quantum computation. Physical Review A
1995
Earlier work this paper cites.
Kitaev, A. Y. (1995). Quantum measurements and the Abelian stabilizer problem. quant-ph/9511026
1995
Earlier work this paper cites.
Bernstein, E., & Vazirani, U. (1997). Quantum complexity theory. SIAM Journal on Computing
1997
Earlier work this paper cites.
Simon, D. R. (1997). On the power of quantum computation. SIAM Journal on Computing
1997
Earlier work this paper cites.
Aharonov, D., Kitaev, A., & Nisan, N. (1998, May). Quantum circuits with mixed states. In Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing
1998
Earlier work this paper cites.
Knill, E., Laflamme, R., & Zurek, W. H. (1998). Resilient quantum computation. Science
1998
Earlier work this paper cites.
Raz, R. (1999, May). Exponential separation of quantum and classical communication complexity. In Proceedings of the Thirty-First Annual ACM symposium on Theory of Computing
1999
Earlier work this paper cites.
Kitaev, A., & Watrous, J. (2000, May). Parallelization, amplification, and exponential time simulation of quantum interactive proof systems. In Proceedings of the Thirty-second Annual ACM symposium on Theory of Computing
2000
Earlier work this paper cites.
Buhrman, H., Cleve, R., Watrous, J., & De Wolf, R. (2001). Quantum fingerprinting. Physical Review Letters
2001
Earlier work this paper cites.
Ledoux, M. (2001). The concentration of measure phenomenon
2001
Earlier work this paper cites.
2002
Earlier work this paper cites.
Nielsen, M. A., & Chuang, I. (2002). Quantum Computation and Quantum Information
2002
Earlier work this paper cites.
de Wolf, R. (2002). Quantum communication and complexity. Theoretical Computer Science
2002
Earlier work this paper cites.
D’Ariano, G. M., Paris, M. G., & Sacchi, M. F. (2003). Quantum tomography. Advances in Imaging and Electron Physics
2003
Earlier work this paper cites.
Kitaev, A. Y. (2003). Fault-tolerant quantum computation by anyons. Annals of Physics
2003
Earlier work this paper cites.
Ettinger, M., Høyer, P., & Knill, E. (2004). The quantum query complexity of the hidden subgroup problem is polynomial. Information Processing Letters
2004
Earlier work this paper cites.
Kok, P., Braunstein, S. L., & Dowling, J. P. (2004). Quantum lithography, entanglement and Heisenberg-limited parameter estimation. Journal of Optics B: Quantum and Semiclassical Optics
2004
Earlier work this paper cites.
Bacon, D., Childs, A. M., & van Dam, W. (2005). Optimal measurements for the dihedral hidden subgroup problem. quant-ph/0501044
2005
Earlier work this paper cites.
Gavinsky, D., Kempe, J., Kerenidis, I., Raz, R., & de Wolf, R. (2007, June). Exponential separations for one-way quantum communication complexity, with applications to cryptography. In Proceedings of the Thirty-ninth Annual ACM Symposium on Theory of Computing
2007
Earlier work this paper cites.
Gutoski, G., & Watrous, J. (2007, June). Toward a general theory of quantum games. In Proceedings of the Thirty-ninth annual ACM symposium on Theory of Computing
2007
Earlier work this paper cites.
Hayden, P., & Preskill, J. (2007). Black holes as mirrors: quantum information in random subsystems. Journal of High Energy Physics
2007
Earlier work this paper cites.
Aharonov, D., & Ben-Or, M. (2008). Fault-tolerant quantum computation with constant error rate. SIAM Journal on Computing
2008
Earlier work this paper cites.
Bar-Yossef, Z., Jayram, T. S., & Kerenidis, I. (2008). Exponential separation of quantum and classical one-way communication complexity. SIAM Journal on Computing
2008
Earlier work this paper cites.
Chiribella, G., D’Ariano, G. M., & Perinotti, P. (2008). Quantum circuit architecture. Physical Review Letters
2008
Cited alongside, same era.
Arora, S., & Barak, B. (2009). Computational Complexity: A Modern Approach. Cambridge University Press
2009
Cited alongside, same era.
Broadbent, A., Fitzsimons, J., & Kashefi, E. (2009, October). Universal blind quantum computation. In 2009 50th Annual IEEE Symposium on Foundations of Computer Science
2009
Cited alongside, same era.
Harrow, A. W., & Low, R. A. (2009). Random quantum circuits are approximate 2-designs. Communications in Mathematical Physics
2009
Cited alongside, same era.
Low, R. A. (2009). Large deviation bounds for k k -designs. Proceedings of the Royal Society A: Mathematical, Physical and Engineering Sciences
2009
Cited alongside, same era.
O’Donnell, R., & Wright, J. (2016, June). Efficient quantum tomography. In Proceedings of the forty-eighth annual ACM symposium on Theory of Computing
2016
Later among the works it cites.
2017
Later among the works it cites.
Atia, Y., & Aharonov, D. (2017). Fast-forwarding of Hamiltonians and exponentially precise measurements. Nature Communications
2017
Later among the works it cites.
2017
Later among the works it cites.
Fitzsimons, J. F., & Kashefi, E. (2017). Unconditionally verifiable blind quantum computation. Physical Review A
2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Radhakrishnan, J., Rötteler, M., & Sen, P. (2009). Random measurement bases, quantum state distinction and applications to the hidden subgroup problem. Algorithmica
2009
Cited alongside, same era.
Sheridan, L., Maslov, D., & Mosca, M. (2009). Approximating fractional time quantum evolution. Journal of Physics A: Mathematical and Theoretical
2009
Cited alongside, same era.
Yu, N. (2020). Sample efficient tomography via Pauli Measurements. arXiv:2009.04610
2009
Cited alongside, same era.
Aharonov, D., Ben-Or, M., & Eban, E. (2010). Proceedings of Innovations in Computer Science
2010
Cited alongside, same era.
Dong, D., & Petersen, I. R. (2010). Quantum control theory and applications: a survey. IET Control Theory & Applications
2010
Cited alongside, same era.
Gross, D., Liu, Y. K., Flammia, S. T., Becker, S., & Eisert, J. (2010). Quantum state tomography via compressed sensing. Physical Review Letters
2010
Cited alongside, same era.
Harrow, A. W., Hassidim, A., Leung, D. W., & Watrous, J. (2010). Adaptive versus nonadaptive strategies for quantum channel discrimination. Physical Review A
2010
Cited alongside, same era.
Later among the works it cites.
Haah, J., Harrow, A. W., Ji, Z., Wu, X., & Yu, N. (2017). Sample-optimal tomography of quantum states. IEEE Transactions on Information Theory
2017
Later among the works it cites.
Kueng, R., Rauhut, H., & Terstiege, U. (2017). Low rank matrix recovery from rank one measurements. Applied and Computational Harmonic Analysis
2017
Later among the works it cites.
Riofrío, C. A., Gross, D., Flammia, S. T., Monz, T., Nigg, D., Blatt, R., & Eisert, J. (2017). Experimental quantum compressed sensing for a seven-qubit system. Nature Communications
2017
Later among the works it cites.
Schmitt, S., Gefen, T., Stürner, F. M., Unden, T., Wolff, G., Müller, C., … & Meijer, J. (2017). Submillihertz magnetic spectroscopy performed with a nanoscale quantum sensor. Science
2017
Later among the works it cites.
2018
Later among the works it cites.
Cotler, J., Jian, C. M., Qi, X. L., & Wilczek, F. (2018). Superdensity operators for spacetime quantum mechanics. Journal of High Energy Physics
2018
Later among the works it cites.
Ji, Z., Liu, Y. K., & Song, F. (2018, August). Pseudorandom quantum states. In Annual International Cryptology Conference
2018
Later among the works it cites.
Pollock, F. A., Rodríguez-Rosario, C., Frauenheim, T., Paternostro, M., & Modi, K. (2018). Non-Markovian quantum processes: Complete framework and efficient characterization. Physical Review A
2018
Later among the works it cites.
Preskill, J. (2018). Quantum Computing in the NISQ era and beyond. Quantum
2018
Later among the works it cites.
Zhou, S., Zhang, M., Preskill, J., & Jiang, L. (2018). Achieving the Heisenberg limit in quantum metrology using quantum error correction. Nature Communications
2018
Later among the works it cites.
Aaronson, S. (2019). Shadow tomography of quantum states. SIAM Journal on Computing
2019
Later among the works it cites.
Cotler, J., Choi, S., Lukin, A., Gharibyan, H., Grover, T., Tai, M. E., … & Greiner, M. (2019). Quantum Virtual Cooling. Physical Review X
2019
Later among the works it cites.
Cotler, J., Han, X., Qi, X. L., & Yang, Z. (2019). Quantum Causal Influence. Journal of High Energy Physics
2019
Later among the works it cites.
Gheorghiu, A., Kapourniotis, T., & Kashefi, E. (2019). Verification of quantum computation: An overview of existing approaches. Theory of Computing Systems, 63(4), 715-808
2019
Later among the works it cites.
Gilyén, A., Su, Y., Low, G. H., & Wiebe, N. (2019, June). Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing
2019
Later among the works it cites.
Harrow, A.W. & Saeed, M. Approximate unitary t-designs by short random quantum circuits using nearest neighbor and long-range gates. Plenary talk at Quantum Information Processing
2019
Later among the works it cites.
Miyazaki, J., Soeda, A., & Murao, M. (2019). Complex conjugation supermap of unitary quantum maps and its universal implementation protocol. Physical Review Research
2019
Later among the works it cites.
Quintino, M. T., Dong, Q., Shimbo, A., Soeda, A., & Murao, M. (2019). Probabilistic exact universal quantum circuits for transforming unitary operations. Physical Review A
2019
Later among the works it cites.
Quintino, M. T., Dong, Q., Shimbo, A., Soeda, A., & Murao, M. (2019). Reversing unknown quantum transformations: Universal quantum circuit for inverting general unitary operations. Physical Review Letters
2019
Later among the works it cites.
Chia, N. H., Chung, K. M., & Lai, C. Y. (2020, June). On the need for large quantum depth. In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
2020
Later among the works it cites.
Cotler, J., & Wilczek, F. (2020). Quantum overlapping tomography. Physical Review Letters
2020
Later among the works it cites.
Coudron, M., & Menda, S. (2020). Computations with greater quantum depth are strictly more powerful (relative to an oracle). In Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing
2020
Later among the works it cites.
Li, Z., Zou, L., & Hsieh, T. H. (2020). Hamiltonian Tomography via Quantum Quench. Physical Review Letters
2020
Later among the works it cites.
Chen, S., Cotler, J., Huang, H. Y., & Li, J. (2021). Exponential Separations Between Learning With and Without Quantum Memory. To appear
2021
Closest in time.
Huang, H. Y. (2021). Experimental advantage in learning with noisy quantum memory. Talk presented at Google Quantum Summer Symposium 2021
2021
Closest in time.