Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimizing quantum circuits with Riemannian gradient flow

Published 14 Feb 2022 in quant-ph | (2202.06976v2)

Abstract: Variational quantum algorithms are a promising class of algorithms that can be performed on currently available quantum computers. In most settings, the free parameters of a variational circuit are optimized using a classical optimizer that updates parameters in Euclidean geometry. Since quantum circuits are elements of the special unitary group, we can consider an alternative optimization perspective that depends on the structure of this group. In this work, we investigate a Riemannian optimization scheme over the special unitary group and we discuss its implementation on a quantum computer. We illustrate that the resulting Riemannian gradient-flow algorithm has favorable optimization properties for deep circuits and that an approximate version of this algorithm can be performed on near-term hardware.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (60)
  1. A variational eigenvalue solver on a photonic quantum processor. Nature Communications, 5(1):4213, 7 2014.
  2. A Quantum Approximate Optimization Algorithm, 2014. arXiv:1411.4028.
  3. Using models to improve optimizers for variational quantum algorithms. Quantum Science and Technology, 5(4):044008, 10 2020.
  4. Quantum circuit learning. Physical Review A, 98:032309, 9 2018.
  5. Evaluating analytic gradients on quantum hardware. Physical Review A, 99:032331, 3 2019.
  6. R. A. Fisher. On the Mathematical Foundations of Theoretical Statistics. Philosophical Transactions of the Royal Society of London. Series A, Containing Papers of a Mathematical or Physical Character, 222:309–368, 1922.
  7. Shun-ichi Amari. Natural Gradient Works Efficiently in Learning. Neural Computation, 10(2):251–276, 2 1998.
  8. Revisiting Natural Gradient for Deep Networks. In International Conference on Learning Representations 2014, 4 2014.
  9. Noisy Natural Gradient as Variational Inference. In Jennifer Dy and Andreas Krause, editors, Proceedings of the 35th International Conference on Machine Learning, volume 80 of Proceedings of Machine Learning Research, pages 5852–5861. PMLR, 7 2018.
  10. Sandro Sorella. Green Function Monte Carlo with Stochastic Reconfiguration. Physical Review Letters, 80:4558–4561, 5 1998.
  11. Quantum Natural Gradient. Quantum, 4:269, 5 2020.
  12. Connecting geometry and performance of two-qubit parameterized quantum circuits, 2021. arXiv:2106.02593.
  13. Riemannian Adaptive Optimization Methods. In International Conference on Learning Representations, 2019.
  14. Constantin Udrişte. Convex Functions and Optimization Methods on Riemannian Manifolds, volume 297 of Mathematics and Its Applications. Springer Science + Business Media, 1994.
  15. Gradient Flows for Optimization in Quantum Information and Quantum Dynamics: Foundations and Applications. Reviews in Mathematical Physics, 22(06):597–667, 2010.
  16. Optimization and Dynamical Systems. Communications and Control Engineering. Springer-Verlag London, 1994.
  17. Riemannian geometry and automatic differentiation for optimization problems of quantum physics and quantum technologies, 2020. arXiv:2007.01287.
  18. Gradient Flows Computing the C-numerical Range with Applications in NMR Spectroscopy. Journal of Global Optimization, 23(3-4):283–308, 8 2002.
  19. Unitary Control in Quantum Ensembles: Maximizing Signal Intensity in Coherent Spectroscopy. Science, 280(5362):421–424, 1998.
  20. Building Deep Networks on Grassmann Manifolds. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence and Thirtieth Innovative Applications of Artificial Intelligence Conference and Eighth AAAI Symposium on Educational Advances in Artificial Intelligence, AAAI’18/IAAI’18/EAAI’18. AAAI Press, 2018.
  21. Simone Fiori. Quasi-Geodesic Neural Learning Algorithms Over the Orthogonal Group: A Tutorial. Journal of Machine Learning Research, 6(26):743–781, 2005.
  22. Simone Fiori. Learning by Natural Gradient on Noncompact Matrix-Type Pseudo-Riemannian Manifolds. IEEE Transactions on Neural Networks, 21(5):841–852, 2010.
  23. Full-Capacity Unitary Recurrent Neural Networks. In Proceedings of the 30th International Conference on Neural Information Processing Systems, NIPS’16, page 4887–4895, Red Hook, NY, USA, 2016. Curran Associates Inc.
  24. Quantum Computation as Geometry. Science, 311(5764):1133–1135, 2006.
  25. The Geometry of Quantum Computation. Quantum Information and Computation, 8(10):861–899, 11 2008.
  26. Gradient Descent Only Converges to Minimizers. In Vitaly Feldman, Alexander Rakhlin, and Ohad Shamir, editors, 29th Annual Conference on Learning Theory, volume 49 of Proceedings of Machine Learning Research, pages 1246–1257, Columbia University, New York, New York, USA, 23–26 Jun 2016. PMLR.
  27. Simone Fiori. Lie-group-type neural system learning by manifold retractions. Neural Networks, 21(10):1524–1529, 2008.
  28. A. Arvanitoyeorgos. An Introduction to Lie Groups and the Geometry of Homogeneous Spaces, volume 22 of Student Mathematical Library. American Mathematical Society, 2003.
  29. Tin-Yau Tam. Gradient flows and double bracket equations. Differential Geometry and its Applications, 20(2):209–224, 2004.
  30. The Projected Gradient Method for Least Squares Matrix Approximations with Spectral Constraints. SIAM Journal on Numerical Analysis, 27(4):1050–1060, 1990.
  31. R.W. Brockett. Dynamical systems that sort lists, diagonalize matrices, and solve linear programming problems. Linear Algebra and its Applications, 146:79–91, 1991.
  32. Completely integrable gradient flows. Communications in Mathematical Physics, 147(1):57–74, 6 1992.
  33. Franz Wegner. Flow equations for Hamiltonians. Annalen der Physik, 506(2):77–91, 1994.
  34. Stefan Kehrein. The Flow Equation Approach to Many-Particle Systems, volume 216 of Springer Tracts in Modern Physics. Springer-Verlag Berlin, 2006.
  35. Renormalization of Hamiltonians. Physical Review D, 48:5863–5872, 12 1993.
  36. Unifying Variational Methods for Simulating Quantum Many-Body Systems. Physical Review Letters, 100:130501, 3 2008.
  37. General parameter-shift rules for quantum gradients, 2021. arXiv:2107.12390.
  38. Generalized quantum circuit differentiation rules, 2021. arXiv:2108.01218.
  39. Cartan decomposition of S⁢U⁢(2n)𝑆𝑈superscript2𝑛SU(2^{n})italic_S italic_U ( 2 start_POSTSUPERSCRIPT italic_n end_POSTSUPERSCRIPT )and control of spin systems. Chemical Physics, 267(1):11–23, 2001.
  40. Henrique N. Sá Earp and Jiannis K. Pachos. A constructive algorithm for the Cartan decomposition of S⁢U⁢(2N)𝑆𝑈superscript2𝑁SU(2^{N})italic_S italic_U ( 2 start_POSTSUPERSCRIPT italic_N end_POSTSUPERSCRIPT ). Journal of Mathematical Physics, 46(8):082108, 2005.
  41. Decompositions of unitary evolutions and entanglement dynamics of bipartite quantum systems. Journal of Mathematical Physics, 47(8):082109, 2006. https://doi.org/10.1063/1.2245205.
  42. Generalization of the Output of a Variational Quantum Eigensolver by Parameter Interpolation with a Low-depth Ansatz. Physical Review Applied, 11:044087, 4 2019.
  43. Structure optimization for parameterized quantum circuits. Quantum, 5:391, 1 2021.
  44. Sequential minimal optimization for quantum-classical hybrid algorithms. Physical Review Research, 2:043158, 10 2020.
  45. An adaptive variational algorithm for exact molecular simulations on a quantum computer. Nature Communications, 10(1):3007, 6 2019.
  46. Feedback-based quantum optimization, 2021. arXiv:2103.08619.
  47. PennyLane: Automatic differentiation of hybrid quantum-classical computations, 2018. arXiv:1811.04968.
  48. Efficient variational simulation of non-trivial quantum states. SciPost Physics, 6:29, 2019.
  49. Avoiding local minima in variational quantum eigensolvers with the natural gradient optimizer. Physical Review Research, 2:043246, 11 2020.
  50. Exploring Entanglement and Optimization within the Hamiltonian Variational Ansatz. PRX Quantum, 1:020319, 12 2020.
  51. A Jacobi Diagonalization and Anderson Acceleration Algorithm For Variational Quantum Algorithm Parameter Optimization, 2019. arXiv:1904.03206.
  52. Diagnosing barren plateaus with tools from quantum optimal control, 2021. arXiv:2105.14377.
  53. Fixed Depth Hamiltonian Simulation via Cartan Decomposition, 2021. arXiv:2104.00728.
  54. Theory of overparametrization in quantum neural networks, 2021.
  55. Learning Unitaries by Gradient Descent, 2020. 2001.11897.
  56. Universal effectiveness of high-depth circuits in variational eigenproblems. Physical Review Research, 3:023203, 6 2021.
  57. J. Baez and J. P. Muniain. Gauge fields, knots and gravity, volume 4 of Series on Knots and Everything. World Scientific Publishing, 1995.
  58. M. Nakahara. Geometry, topology and physics. Graduate Student Series in Physics. Taylor and Francis group, 2003.
  59. M.P. do Carmo. Riemannian Geometry. Mathematics. Birkhäuser, 1992.
  60. Introduction to Smooth Manifolds. Graduate Texts in Mathematics. Springer, 2003.
Citations (22)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

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

Sign Up to Generate

Open Problems

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

Generate Now

Continue Learning

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

Generate Now

Collections

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

Sign Up