What if you have only one copy? Low-depth quantum circuits have no advantage in decision problems!
Abstract: The conventional approach to understanding the characteristics of an unknown quantum state involves having numerous identical independent copies of the system in that state. However, we demonstrate that gleaning insights into specific properties is feasible even with a single-state sample. Perhaps surprisingly, the confidence level of our findings increases proportionally with the number of qubits. Our conclusions apply to quantum states with low circuit complexity, including noise-affected ones. Additionally, this extends to learning from a solitary sample of probability distributions. Our results establish a strong lower bound for discriminating quantum states with low complexity. Furthermore, we reveal no quantum advantage in decision problems involving low-depth quantum circuits. Our results can be used to verify NISQ devices.
- E. Bagan, M. Baig, R. Muñoz Tapia, and A. Rodriguez, “Collective versus local measurements in a qubit mixed-state estimation,” Phys. Rev. A 69, 010304 (2004).
- M. Keyl, “Quantum state estimation and large deviations,” Reveiws in Mathematical Physics 18, 19 (2006).
- M. Guţă and J. Kahn, “Optimal estimation of qubit states with continuous time measurements,” Communications in Mathematical Physics 277, 127 (2008), quant-ph/0608074 .
- J. Haah, A. W. Harrow, Z. Ji, X. Wu, , and N. Yu, “Sample-optimal tomography of quantum states,” in Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC ’16 (2016) pp. 913–925.
- R. O’Donnell and J. Wright, “Efficient quantum tomography,” in Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC ’16 (2016) pp. 899–912.
- R. O’Donnell and J. Wright, “Efficient quantum tomography ii,” in Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC ’17 (2017) pp. 962–974.
- S. T. Flammia, D. Gross, Y. Liu, and J. Eisert, “Quantum tomography via compressed sensing: Error bounds, sample complexity, and efficient estimators,” New J. Phys. 14, 095022 (2012).
- S. Aaronson, “Shadow tomography of quantum states,” in Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018 (Association for Computing Machinery, New York, NY, USA, 2018) p. 325–338.
- J. Cotler and F. Wilczek, “Quantum overlapping tomography,” Physical Review Letters 124 (2020), 10.1103/physrevlett.124.100401.
- H.-Y. Huang, R. Kueng, and J. Preskill, “Predicting many properties of a quantum system from very few measurements,” Nature Physics (2020), 10.1038/s41567-020-0932-7.
- H.-Y. Huang, R. Kueng, G. Torlai, V. V. Albert, and J. Preskill, “Provably efficient machine learning for quantum many-body problems,” Science 377 (2022), 10.1126/science.abk3333.
- T. J. Evans, R. Harper, and S. T. Flammia, “Scalable bayesian hamiltonian learning,” arXiv:1912.07636 (2019).
- C. Bădescu and R. O’Donnell, “Improved quantum data analysis,” in Proceedings of the 53rd Annual ACM SIGACT Symposium on Theory of Computing, STOC 2021 (Association for Computing Machinery, New York, NY, USA, 2021) p. 1398–1411.
- N. Yu, “Sample efficient tomography via pauli measurements,” (2020).
- N. Yu and T.-C. Wei, “Learning marginals suffices!” (2023), arXiv:2303.08938 [quant-ph] .
- H. Zhao, L. Lewis, I. Kannan, Y. Quek, H.-Y. Huang, and M. C. Caro, “Learning quantum states and unitaries of bounded gate complexity,” (2023), arXiv:2310.19882 [quant-ph] .
- H.-Y. Huang, Y. Liu, M. Broughton, I. Kim, A. Anshu, Z. Landau, and J. R. McClean, “Learning shallow quantum circuits,” (2024), arXiv:2401.10095 [quant-ph] .
- B. M. Terhal and D. P. DiVincenzo, “Adaptive quantum computation, constant depth quantum circuits and arthur-merlin games,” 4 (2004), 10.48550/ARXIV.QUANT-PH/0205133.
- J. Watrous, “imits on the power of quantum statistical zero-knowledge,” in Proceedings of the 43rd Symposium on Foundations of Computer Science, FOCS ’02 (IEEE Computer Society, USA, 2002) p. 459.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.