Papers
Topics
Authors
Recent
Search
2000 character limit reached

Simple Diagonal State Designs with Reconfigurable Real-Time Circuits

Published 8 Jan 2024 in quant-ph | (2401.04176v3)

Abstract: Unitary designs are widely used in quantum computation, but in many practical settings it suffices to construct a diagonal state design generated with unitary gates diagonal in the computational basis. In this work, we introduce a simple and efficient diagonal state 3-design based on real-time evolutions under 2-local Hamiltonians. Our construction is inspired by the classical Girard-Hutchinson trace estimator in that it involves the stochastic preparation of many random-phase states. Though the exact Girard-Hutchinson states are not tractably implementable on a quantum computer, we can construct states that match the statistical moments of the Girard-Hutchinson states with real-time evolution. Importantly, our random states are all generated using the same Hamiltonians for real-time evolution, with the randomness arising solely from stochastic variations in the durations of the evolutions. In this sense, the circuit is fully reconfigurable and thus suited for near-term realizations on both digital and analog platforms. Moreover, we show how to extend our construction to achieve diagonal state designs of arbitrarily high order.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. D. Chandler, Introduction to Modern Statistical Mechanics (Oxford University Press, 1987).
  2. H. Rue and L. Held, Gaussian Markov random fields: theory and applications (CRC press, 2005).
  3. E. Di Napoli, E. Polizzi, and Y. Saad, Numerical Linear Algebra with Applications 23, 674 (2016).
  4. L. Lin, Y. Saad, and C. Yang, SIAM Review 58, 34 (2016).
  5. R. Baer, D. Neuhauser, and E. Rabani, Annual Review of Physical Chemistry 73, 255 (2022), pMID: 35081326.
  6. P. R. Halmos, The Annals of Mathematical Statistics 17, 34 (1946).
  7. M. Hutchinson, Communications in Statistics - Simulation and Computation 19, 433 (1990).
  8. R. N. Silver and H. Röder, Phys. Rev. E 56, 4822 (1997).
  9. T. Iitaka and T. Ebisuzaki, Phys. Rev. E 69, 057701 (2004).
  10. H. Avron and S. Toledo, J. ACM 58, 10.1145/1944345.1944349 (2011).
  11. E. N. Epperly, J. A. Tropp, and R. J. Webber, arXiv preprint arXiv:2301.07825 https://doi.org/10.48550/arXiv.2301.07825 (2023).
  12. G. H. Low and I. L. Chuang, Phys. Rev. Lett. 118, 010501 (2017).
  13. Y. Dong, L. Lin, and Y. Tong, PRX Quantum 3, 040305 (2022).
  14. A. Girard, Numerische Mathematik 56, 1 (1989).
  15. E. Knill and R. Laflamme, Phys. Rev. Lett. 81, 5672 (1998).
  16. S. Goto, R. Kaneko, and I. Danshita, Phys. Rev. B 104, 045133 (2021).
  17. S. Goto, R. Kaneko, and I. Danshita, Phys. Rev. B 107, 024307 (2023).
  18. Y. Nakata and M. Murao, International Journal of Quantum Information 11, 1350062 (2013).
  19. Y. Nakata, M. Koashi, and M. Murao, New Journal of Physics 16, 053043 (2014).
  20. S. R. White, Phys. Rev. Lett. 102, 190601 (2009).
  21. J. Spencer, Journal of Combinatorial Theory 5, 1 (1968).
  22. E. F. Assmus and J. D. Key, Designs and their Codes, Cambridge Tracts in Mathematics (Cambridge University Press, 1992).
  23. T. Feder and C. S. Subi (2012).
  24. Topics in Chromatic Graph Theory, Encyclopedia of Mathematics and its Applications (Cambridge University Press, 2015).
  25. B. Alspach, J.-C. Bermond, and D. Sotteau, Decomposition into cycles i: Hamilton decompositions, in Cycles and Rays (Springer Netherlands, Dordrecht, 1990) pp. 9–18.
  26. R. Glebov, Z. Luria, and B. Sudakov, Israel Journal of Mathematics 222, 91 (2017).
  27. S. Lloyd, Science 273, 1073 (1996).
  28. M. R. Wall and D. Neuhauser, The Journal of Chemical Physics 102, 8011 (1995).
  29. W. J. Hehre, R. F. Stewart, and J. A. Pople, J. Chem. Phys. 51, 2657 (1969).
  30. J. S. Binkley, J. A. Pople, and W. J. Hehre, Journal of the American Chemical Society 102, 939 (1980).
  31. F. Weigend and R. Ahlrichs, Physical Chemistry Chemical Physics 7, 3297 (2005).
  32. C. L. Cortes and S. K. Gray, Phys. Rev. A 105, 022417 (2022).
  33. S. Chakraborty 10.48550/arXiv.2302.13555 (2023), arXiv:2302.13555 [quant-ph] .
  34. D. Motlagh and N. Wiebe, arXiv preprint arXiv:2308.01501 https://doi.org/10.48550/arXiv.2308.01501 (2023).
  35. H. H. S. Chan, D. M. Ramo, and N. Fitzpatrick, arXiv preprint arXiv:2303.06161 https://doi.org/10.48550/arXiv.2303.06161 (2023).
  36. S. Sidon, Mathematische Annalen 106, 536 (1932).
  37. S. W. Golomb, Academic Press, New York 23, 37 (1972).
  38. K. Drakakis, Advances in Mathematics of Communications 3, 235 (2009).
Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 2 tweets with 0 likes about this paper.