Optimal solutions to quantum annealing using two independent control functions
arXiv:2110.13852 · doi:10.1103/PhysRevA.105.032454
Abstract
We investigate the quantum computing paradigm consisted of obtaining a target state that encodes the solution of a certain computational task by evolving the system with a combination of the problem-Hamiltonian and the driving-Hamiltonian. We analyze this paradigm in the light of Optimal Control Theory considering each Hamiltonian modulated by an independent control function. In the case of short evolution times and bounded controls, we analytically demonstrate that an optimal solution consists of both controls tuned at their upper bound for the whole evolution time. This optimal solution is appealing because of its simplicity and experimental feasibility. To numerically solve the control problem, we propose the use of a quantum optimal control technique adapted to limit the amplitude of the controls. As an application, we consider a teleportation protocol and compare the fidelity of the teleported state obtained for the two-control functions with the usual single-control function scheme and with the quantum approximate optimization algorithm (QAOA). We also investigate the energetic cost and the robustness against systematic errors in the teleportation protocol, considering different time evolution schemes. We show that the scheme with two-control functions yields a higher fidelity than the other schemes for the same evolution time.
arXiv comment23 pages, 7 figures
References in corpus (33)
- Quantum Computing in the NISQ era and beyond
- Supplementary information for "Quantum supremacy using a programmable superconducting processor"
- A variational eigenvalue solver on a quantum processor
- Variational Quantum Algorithms
- Hardware-efficient Variational Quantum Eigensolver for Small Molecules and Quantum Magnets
- Quantum Annealing in the Transverse Ising Model
- Adiabatic Quantum Computing
- Quantum annealing with more than one hundred qubits
- Theory of Quantum Annealing of an Ising Spin Glass
- Hartree-Fock on a superconducting qubit quantum computer
- Benchmarking an 11-qubit quantum computer
- Quantum Approximate Optimization of Non-Planar Graph Problems on a Planar Superconducting Processor
- Digitized adiabatic quantum computing with a superconducting circuit
- Introduction to the Pontryagin Maximum Principle for Quantum Optimal Control
- Optimizing Variational Quantum Algorithms using Pontryagin's Minimum Principle
- Prospects for Quantum Enhancement with Diabatic Quantum Annealing
- Benchmarking the Quantum Approximate Optimization Algorithm
- Shortcuts to Adiabaticity in Digitized Adiabatic Quantum Computing
- Optimal Protocols in Quantum Annealing and QAOA Problems
- From pulses to circuits and back again: A quantum optimal control perspective on variational quantum algorithms
- Quantum-optimal-control-inspired ansatz for variational quantum algorithms
- Classical variational simulation of the Quantum Approximate Optimization Algorithm
- Shortcut to adiabatic gate teleportation
- Adiabatic Gate Teleportation
- Energetic cost of Hamiltonian quantum gates
- Progress toward favorable landscapes in quantum combinatorial optimization
- Two-parameter counter-diabatic driving in quantum annealing
- Searching for quantum optimal controls under severe constraints
- Optimal Control for Closed and Open System Quantum Optimization
- Application of Pontryagin's Minimum Principle to Grover's Quantum Search Problem
- LibOPT: An Open-Source Platform for Fast Prototyping Soft Optimization Techniques
- Optimal control of universal quantum gates in a double quantum dot
- Optimal control of hybrid qubits: implementing the quantum permutation algorithm