Optimal working point in digitized quantum annealing

Abstract

We present a study of the digitized Quantum Annealing protocol proposed by R. Barends et al., Nature 534, 222 (2016). Our analysis, performed on the benchmark case of a transverse Ising chain problem, shows that the algorithm has a well defined optimal working point for the annealing time ${\tau }_{\mathrm{P}}^{\mathrm{opt}}$ --- scaling as ${\tau }_{\mathrm{P}}^{\mathrm{opt}}\sim \mathrm{P}$, where $\mathrm{P}$ is the number of digital Trotter steps --- beyond which, the residual energy error shoots-up towards the value characteristic of the maximally disordered state. We present an analytical analysis for the translationally invariant transverse Ising chain case, but our numerical evidence suggests that this scenario is more general, surviving, for instance, the presence of disorder.

References in corpus (25)

• Quantum Computing in the NISQ era and beyond
• Surface codes: Towards practical large-scale quantum computation
• Nonequilibrium dynamics of closed interacting quantum systems
• Quantum Annealing in the Transverse Ising Model
• A Quantum Adiabatic Evolution Algorithm Applied to Random Instances of an NP-Complete Problem
• Adiabatic Quantum Computing
• Computational complexity and fundamental limitations to fermionic quantum Monte Carlo simulations
• Control of quantum phenomena: Past, present, and future
• Quantum annealing with more than one hundred qubits
• Dynamics of a Quantum Phase Transition
• Theory of Quantum Annealing of an Ising Spin Glass
• Dynamics of quantum phase transition: exact solution in quantum Ising model
• Quantum Annealing: A New Method for Minimizing Multidimensional Functions
• Digitized adiabatic quantum computing with a superconducting circuit
• Experimental signature of programmable quantum annealing
• Experimental Investigation of an Eight Qubit Unit Cell in a Superconducting Optimization Processor
• Undecidability of the Spectral Gap (short version)
• What is the Computational Value of Finite Range Tunneling?
• Entanglement in a quantum annealing processor
• Quantum versus Classical Annealing of Ising Spin Glasses
• Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
• Adiabatic quantum dynamics of a random Ising chain across its quantum critical point
• Finite Temperature and Dynamical Properties of the Random Transverse-Field Ising Spin Chain
• Quantum Annealing: a journey through Digitalization, Control, and hybrid Quantum Variational schemes
• On the dynamics of Simulated Quantum Annealing in random Ising chains

Cited by in corpus (11)

• Quantum Annealing: An Overview
• Prospects for Quantum Enhancement with Diabatic Quantum Annealing
• Avoiding barren plateaus via transferability of smooth solutions in Hamiltonian Variational Ansatz
• Two-dimensional ${\mathbb{Z}}_2$ lattice gauge theory on a near-term quantum simulator: variational quantum optimization, confinement, and topological order
• Quantum Annealing for Neural Network optimization problems: a new approach via Tensor Network simulations
• A Benchmarking Study of Quantum Algorithms for Combinatorial Optimization
• Beyond Quantum Annealing: Optimal control solutions to MaxCut problems
• Efficient variational quantum circuit structure for correlated topological phases
• Quantum optimal control in quantum technologies. Strategic report on current status, visions and goals for research in Europe
• Noise-aware variational eigensolvers: a dissipative route for lattice gauge theories
• Validity condition for high-fidelity Digitized Quantum Annealing