Applications and resource reductions in measurement-based variational quantum eigensolvers

Abstract

We discuss the procedure for obtaining measurement-based implementations of quantum algorithms given by quantum circuit diagrams and how to reduce the required resources needed for a given measurement-based computation. This forms the foundation for quantum computing on photonic systems in the near term. To demonstrate that these ideas are well grounded we present three different problems which are solved by employing a measurement-based implementation of the variational quantum eigensolver algorithm (MBVQE). We show that by utilising native measurement-based gates rather than standard gates, such as the standard CNOT, MBQCs may be obtained that are both shallow and have simple connectivity while simultaneously exhibiting a large expressibility. We conclude that MBVQE has promising prospects for resource states that are not far from what is already available today.

12 pages, 8 figures

References in corpus (6)

• Quantum computational advantage using photons
• A Quantum Approximate Optimization Algorithm
• Multi-party entanglement in graph states
• TensorNetwork: A Library for Physics and Machine Learning
• Quantum Image Segmentation Based on Grayscale Morphology
• Graphix: optimizing and simulating measurement-based quantum computation on local-Clifford decorated graph

Cited by in corpus (2)

• Studying the phase diagram of the three-flavor Schwinger model in the presence of a chemical potential with measurement- and gate-based quantum computing
• Optimal Scheduling of Graph States via Path Decompositions