mlsanityData to 14 Oct 2026

Improvement in Variational Quantum Algorithms by Measurement Simplification

arXiv 2312.06176 ↗First posted 11 Dec 2023quant-ph cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Variational Quantum Algorithms (VQAs) are expected to be promising algorithms with quantum advantages that can be run at quantum computers in the close future. In this work, we review simple rules in basic quantum circuits, and propose a simplification method, Measurement Simplification, that simplifies the expression for the measurement of quantum circuit. By the Measurement Simplification, we simplified the specific result expression of VQAs and obtained large improvements in calculation time and required memory size. Here we applied Measurement Simplification to Variational Quantum Linear Solver (VQLS), Variational Quantum Eigensolver (VQE) and other Quantum Machine Learning Algorithms to show an example of speedup in the calculation time and required memory size.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 2 of its 10 references that are in the map. First posted on arXiv 11 Dec 2023.

Builds on

2 of 10 references.

References · 2

  1. 2020Variational Quantum Algorithmscited by 692
  2. 2019Variational Quantum Circuits for Deep Reinforcement Learningcited by 167

Built on by

Not cited yet.