2000 character limit reached
Improving Parameter Training for VQEs by Sequential Hamiltonian Assembly (2312.05552v1)
Published 9 Dec 2023 in quant-ph and cs.LG
Abstract: A central challenge in quantum machine learning is the design and training of parameterized quantum circuits (PQCs). Similar to deep learning, vanishing gradients pose immense problems in the trainability of PQCs, which have been shown to arise from a multitude of sources. One such cause are non-local loss functions, that demand the measurement of a large subset of involved qubits. To facilitate the parameter training for quantum applications using global loss functions, we propose a Sequential Hamiltonian Assembly, which iteratively approximates the loss function using local components. Aiming for a prove of principle, we evaluate our approach using Graph Coloring problem with a Varational Quantum Eigensolver (VQE). Simulation results show, that our approach outperforms conventional parameter training by 29.99% and the empirical state of the art, Layerwise Learning, by 5.12% in the mean accuracy. This paves the way towards locality-aware learning techniques, allowing to evade vanishing gradients for a large class of practically relevant problems.
- Adiabatic quantum computation is equivalent to standard quantum computation. In Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science, FOCS ’04, page 42–51, USA. IEEE Computer Society.
- Demonstration of a scaling advantage for a quantum annealer over simulated annealing. Phys. Rev. X, 8:031016.
- Bansal, N. (2014). New Developments in Iterated Rounding (Invited Talk). In Raman, V. and Suresh, S. P., editors, 34th International Conference on Foundation of Software Technology and Theoretical Computer Science (FSTTCS 2014), volume 29 of Leibniz International Proceedings in Informatics (LIPIcs), pages 1–10, Dagstuhl, Germany. Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik.
- Greedy layer-wise training of deep networks. In Schölkopf, B., Platt, J., and Hoffman, T., editors, Advances in Neural Information Processing Systems, volume 19. MIT Press.
- A review on quantum approximate optimization algorithm and its variants.
- Beweis des Adiabatensatzes. Zeitschrift für Phys., 51(3):165–180.
- Bradley, D. M. (2010). Learning in modular systems. Carnegie Mellon University.
- Abrupt transitions in variational quantum circuit training. Phys. Rev. A, 103:032607.
- Variational quantum algorithms. Nat. Rev. Phys., 3(9):625–644.
- Cost function dependent barren plateaus in shallow parametrized quantum circuits. Nature communications, 12(1):1791.
- Rapid solution of problems by quantum computation. Proceedings of the Royal Society of London. Series A: Mathematical and Physical Sciences, 439(1907):553–558.
- Quantum circuit architecture search for variational quantum algorithms. npj Quantum Inf., 8(1):62.
- A quantum approximate optimization algorithm.
- The adjoint is all you need: Characterizing barren plateaus in quantum ansätze.
- Gilbert, E. N. (1959). Random Graphs. The Annals of Mathematical Statistics, 30(4):1141 – 1144.
- Understanding the difficulty of training deep feedforward neural networks. In Teh, Y. W. and Titterington, M., editors, Proceedings of the Thirteenth International Conference on Artificial Intelligence and Statistics, volume 9 of Proceedings of Machine Learning Research, pages 249–256, Chia Laguna Resort, Sardinia, Italy. PMLR.
- A Direct Search Optimization Method That Models the Objective and Constraint Functions by Linear Interpolation, pages 51–67. Springer Netherlands, Dordrecht.
- Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. In Proceedings of the Twenty-Eighth Annual ACM Symposium on Theory of Computing, STOC ’96, page 212–219, New York, NY, USA. Association for Computing Machinery.
- Exploring network structure, dynamics, and function using networkx. Technical report, Los Alamos National Lab.(LANL), Los Alamos, NM (United States).
- Connecting ansatz expressibility to gradient magnitudes and barren plateaus. PRX Quantum, 3:010313.
- An empirical study of optimizers for quantum machine learning. In 2020 IEEE 6th International Conference on Computer and Communications (ICCC), pages 1560–1566.
- Evaluating the performance of some local optimizers for variational quantum classifiers. Journal of Physics: Conference Series, 1817(1):012015.
- The impact of cost function globality and locality in hybrid quantum neural networks on nisq devices. Machine Learning: Science and Technology, 4(1):015004.
- Optimal quantum measurements of expectation values of observables. Physical Review A, 75(1):012328.
- Lanczos, C. (2012). The Variational Principles of Mechanics. Dover Books on Physics. Dover Publications.
- Layer vqe: A variational approach for combinatorial optimization on noisy quantum computers. IEEE Transactions on Quantum Engineering, 3:1–20.
- Lucas, A. (2014). Ising formulations of many np problems. Frontiers in Physics, 2.
- Barren plateaus in quantum neural network training landscapes. Nat. Commun., 9(1):4812.
- Quantum circuit learning. Phys. Rev. A, 98:032309.
- Quantum Computation and Quantum Information: 10th Anniversary Edition. Cambridge University Press.
- A variational eigenvalue solver on a photonic quantum processor. Nat. Commun., 5(1):4213.
- An in-principle super-polynomial quantum advantage for approximating combinatorial optimization problems.
- A unified theory of barren plateaus for deep parametrized quantum circuits.
- Avoiding barren plateaus using classical shadows. PRX Quantum, 3:020365.
- Evaluating analytic gradients on quantum hardware. Phys. Rev. A, 99:032331.
- Effect of data encoding on the expressive power of variational quantum-machine-learning models. Phys. Rev. A, 103:032430.
- Expressibility and entangling capability of parameterized quantum circuits for hybrid quantum-classical algorithms. Advanced Quantum Technologies, 2(12):1900070.
- Layerwise learning for quantum neural networks. Quantum Mach. Intell., 3(1):5.
- Limitations of optimization algorithms on noisy quantum devices. Nature Physics, 17(11):1221–1227.
- Quantum optimization for the graph coloring problem with space-efficient embedding. In 2020 IEEE International Conference on Quantum Computing and Engineering (QCE), pages 56–62.
- On barren plateaus and cost function locality in variational quantum algorithms. Journal of Physics A: Mathematical and Theoretical, 54(24):245301.
- Noise-induced barren plateaus in variational quantum algorithms. Nature communications, 12(1):6961.
- Phase transitions in the coloring of random graphs. Phys. Rev. E, 76:031131.
- Escaping from the barren plateau via gaussian initializations in deep variational quantum circuits. In Koyejo, S., Mohamed, S., Agarwal, A., Belgrave, D., Cho, K., and Oh, A., editors, Advances in Neural Information Processing Systems, volume 35, pages 18612–18627. Curran Associates, Inc.
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.
