Universal Effectiveness of High-Depth Circuits in Variational Eigenproblems

@article{Kim2020UniversalEO,
  title={Universal Effectiveness of High-Depth Circuits in Variational Eigenproblems},
  author={Joonho Kim and Jaedeok Kim and Dario Rosa},
  journal={ArXiv},
  year={2020},
  volume={abs/2010.00157}
}
We explore the effectiveness of high-depth, noiseless, parameteric quantum circuits by challenging their capability to simulate the ground states of quantum many-body Hamiltonians. Even a generic layered circuit Ansatz can approximate the ground state with high precision, as long as the circuit depth exceeds a certain threshold level that exponentially scales with the number of qubits, despite the abundance of the barren plateaus. This success is due to the fact that the energy landscape in the… 
Critical Points in Quantum Generative Models
TLDR
The first proof of this transition in trainability in quantum generative models is given, specializing to this latter class of quantum generatives, using techniques inspired by those used to study the loss landscapes of classical neural networks.
Theory of overparametrization in quantum neural networks
TLDR
This paper presents a meta-analyses of the LaSalle–Cerezo–Larocca–Bouchut–Seiden–Stein cellular automaton, a model derived from the model developed by J. J. Giambiagi in 2007, which states that the model derived in this paper can be modified for flows on rugous topographies varying around an inclined plane.
Beyond Barren Plateaus: Quantum Variational Algorithms Are Swamped With Traps
TLDR
It is proved that a wide class of variational quantum models—which are shallow, and exhibit no barren plateus—have only a superpolynomially small fraction of local minima within any constant energy from the global minimum, rendering these models untrainable if no good initial guess of the optimal parameters is known.
Degeneracy Engineering for Classical and Quantum Annealing: A Case Study of Sparse Linear Regression in Collider Physics
Classical and quantum annealing are computing paradigms that have been proposed to solve a wide range of optimization problems. In this paper, we aim to enhance the performance of annealing
ForeSight: Reducing SWAPs in NISQ Programs via Adaptive Multi-Candidate Evaluations
TLDR
ForeSight is proposed, a compiler that simultaneously evaluates multiple SWAP candidates for several operations into the future, delays SWAP selections to analyze their impact on future SWAP decisions and avoids early convergence on sub-optimal candidates.
Optimizing quantum circuits with Riemannian gradient flow
TLDR
It is illustrated 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.
Parent Hamiltonian as a benchmark problem for variational quantum eigensolvers
TLDR
This work proposes a technique to construct a benchmark problem whose ground state is guaranteed to be achievable with a given ansatz by using the idea of parent Hamiltonian of a low-depth parameterized quantum circuits.
Quantum Chaos and Circuit Parameter Optimization
Joonho Kim, Yaron Oz, 3 and Dario Rosa School of Natural Sciences, Institute for Advanced Study, Princeton, NJ 08540, USA. Simons Center for Geometry and Physics, SUNY, Stony Brook, NY 11794, USA.
The Optimization Landscape of Hybrid Quantum-Classical Algorithms: from Quantum Control to NISQ Applications
This review investigates the landscapes of hybrid quantum-classical optimization algorithms that are prevalent in many rapidly developing quantum technologies, where the objective function is
Variational quantum classifiers through the lens of the Hessian
TLDR
The Hessian is calculated, the curvature information of variational quantum classifiers (VQC) is interpreted and the loss function’s convergence is shown, and it is shown how the adaptive Hessian learning rate can influence the convergence while training the variational circuits.
...
1
2
...

References

SHOWING 1-10 OF 54 REFERENCES
Efficient symmetry-preserving state preparation circuits for the variational quantum eigensolver algorithm
The variational quantum eigensolver is one of the most promising approaches for performing chemistry simulations using noisy intermediate-scale quantum (NISQ) processors. The efficiency of this
Variational quantum eigensolver with fewer qubits
We propose a qubit efficient scheme to study ground state properties of quantum many-body systems on near-term noisy intermediate scale quantum computers. One can obtain a tensor network
Barren plateaus in quantum neural network training landscapes
TLDR
It is shown that for a wide class of reasonable parameterized quantum circuits, the probability that the gradient along any reasonable direction is non-zero to some fixed precision is exponentially small as a function of the number of qubits.
Expressibility and Entangling Capability of Parameterized Quantum Circuits for Hybrid Quantum‐Classical Algorithms
TLDR
It is investigated how expressibility “saturates” with increased circuit depth, finding that the rate and saturated value appear to be distinguishing features of a PQC, and methods and results can be useful for algorithm development and design of experiments.
An initialization strategy for addressing barren plateaus in parametrized quantum circuits
TLDR
This technical note theoretically motivate and empirically validate an initialization strategy which can resolve the barren plateau problem for practical applications and shows empirically that variational quantum eigensolvers and quantum neural networks initialized using this strategy can be trained using a gradient based method.
Layerwise learning for quantum neural networks
TLDR
This work investigates a layerwise learning strategy for parametrized quantum circuits and shows that when considering sampling noise, this strategy can help avoid the problem of barren plateaus of the error surface due to the low depth of circuits, low number of parameters trained in one step, and larger magnitude of gradients compared to training the full circuit.
Cost-Function-Dependent Barren Plateaus in Shallow Quantum Neural Networks
TLDR
Two results are rigorously proved that establish a connection between locality and trainability in VQAs and illustrate these ideas with large-scale simulations of a particular VQA known as quantum autoencoders.
Learning to learn with quantum neural networks via classical neural networks
TLDR
This work trains classical recurrent neural networks to assist in the quantum learning process, also know as meta-learning, to rapidly find approximate optima in the parameter landscape for several classes of quantum variational algorithms.
Spectral and thermodynamic properties of the Sachdev-Ye-Kitaev model
We study spectral and thermodynamic properties of the Sachdev-Ye-Kitaev model, a variant of the $k$-body embedded random ensembles studied for several decades in the context of nuclear physics and
A variational eigenvalue solver on a photonic quantum processor
TLDR
The proposed approach drastically reduces the coherence time requirements and combines this method with a new approach to state preparation based on ansätze and classical optimization, enhancing the potential of quantum resources available today and in the near future.
...
1
2
3
4
5
...