Variational processes

J.C. Zambrini

Ph. Blanchard, Weian Zheng

Leonardo Angelini

Thiago O. Maciel, Reinaldo O. Vianna

We develop a quantum process tomography method, which variationally reconstruct the map of a process, using noisy and incomplete information about the dynamics. The new method encompasses the most common quantum process tomography schemes. It is based on the variational quantum tomography method (VQT) proposed by Maciel \emph{et al.} in arXiv:1001.1793[quant-ph] \cite{VQT}.

Tatsuhiko Shirai, Nozomu Togawa

We propose a post-processing variationally scheduled quantum algorithm (pVSQA) for solving constrained combinatorial optimization problems (COPs). COPs are typically transformed into ground-state search problems of the Ising model on a quantum annealer or gate-based quantum device. Variational methods are used to find an optimal schedule function that leads to high-quality solutions in a short amount of time. Post-processing techniques convert the output solutions of the quantum devices to satisfy the constraints of the COPs. pVSQA combines the variational methods and the post-processing technique. We obtain a sufficient condition for constrained COPs to apply pVSQA based on a greedy post-processing algorithm. We apply the proposed method to two constrained NP-hard COPs: the graph partitioning problem and the quadratic knapsack problem. pVSQA on a simulator shows that a small number of variational parameters is sufficient to achieve a (near-)optimal performance within a predetermined operation time. Then building upon the simulator results, we implement pVSQA on a quantum annealer and a gate-based quantum device. The experimental results demonstrate the effectiveness of our proposed method.

M. C. Smith-Agreda