5 research outputs found
Quantum approximate optimization algorithm applied to the binary perceptron
We apply digitized Quantum Annealing (QA) and Quantum Approximate Optimization Algorithm (QAOA) to a paradigmatic task of supervised learning in artificial neural networks: the optimization of synaptic weights for the binary perceptron. At variance with the usual QAOA applications to MaxCut, or to quantum spin-chains ground state preparation, the classical is characterized by highly non-local multi-spin interactions. Yet, we provide evidence for the existence of optimal solutions for the QAOA parameters, which are among typical instances of the same problem, and we prove numerically an enhanced performance of QAOA over traditional QA. We also investigate on the role of the landscape geometry in this problem. \revision{By artificially breaking this geometrical structure, we show that the detrimental effect of a gap-closing transition, encountered in QA, is also negatively affecting the performance of our QAOA implementation
Avoiding barren plateaus via transferability of smooth solutions in a Hamiltonian variational ansatz
A large ongoing research effort focuses on variational quantum algorithms (VQAs), representing leading candidates to achieve computational speed-ups on current quantum devices. The scalability of VQAs to a large number of qubits, beyond the simulation capabilities of classical computers, is still debated. Two major hurdles are the proliferation of low-quality variational local minima, and the exponential vanishing of gradients in the cost-function landscape, a phenomenon referred to as barren plateaus. In this work, we show that by employing iterative search schemes, one can effectively prepare the ground state of paradigmatic quantum many-body models, also circumventing the barren plateau phenomenon. This is accomplished by leveraging the transferability to larger system sizes of a class of iterative solutions, displaying an intrinsic smoothness of the variational parameters, a result that does not extend to other solutions found via random-start local optimization. Our scheme could be directly tested on near-term quantum devices, running a refinement optimization in a favorable local landscape with nonvanishing gradients
Avoiding barren plateaus via transferability of smooth solutions in a Hamiltonian variational ansatz
A large ongoing research effort focuses on variational quantum algorithms (VQAs), representing leading candidates to achieve computational speed-ups on current quantum devices. The scalability of VQAs to a large number of qubits, beyond the simulation capabilities of classical computers, is still debated. Two major hurdles are the proliferation of low-quality variational local minima, and the exponential vanishing of gradients in the cost-function landscape, a phenomenon referred to as barren plateaus. In this work, we show that by employing iterative search schemes, one can effectively prepare the ground state of paradigmatic quantum many-body models, also circumventing the barren plateau phenomenon. This is accomplished by leveraging the transferability to larger system sizes of a class of iterative solutions, displaying an intrinsic smoothness of the variational parameters, a result that does not extend to other solutions found via random-start local optimization. Our scheme could be directly tested on near-term quantum devices, running a refinement optimization in a favorable local landscape with nonvanishing gradients
Two-Dimensional Z<sub>2</sub> Lattice Gauge Theory on a Near-Term Quantum Simulator:Variational Quantum Optimization, Confinement, and Topological Order
We propose an implementation of a two-dimensional lattice
gauge theory model on a shallow quantum circuit, involving a number of single
and two-qubits gates comparable to what can be achieved with present-day and
near-future technologies. The ground state preparation is numerically analyzed
on a small lattice with a variational quantum algorithm, which requires a small
number of parameters to reach high fidelities and can be efficiently scaled up
on larger systems. Despite the reduced size of the lattice we consider, a
transition between confined and deconfined regimes can be detected by measuring
expectation values of Wilson loop operators or the topological entropy.
Moreover, if periodic boundary conditions are implemented, the same optimal
solution is transferable among all four different topological sectors, without
any need for further optimization on the variational parameters. Our work shows
that variational quantum algorithms provide a useful technique to be added in
the growing toolbox for digital simulations of lattice gauge theories.Comment: 22 pages, 19 figure