Perspectives on Utilization of Measurements in Quantum Algorithms

Abstract

Measurement is a fundamental operation in quantum computing and has many important use cases in quantum algorithms. This article provides a comprehensive overview of the basic measurement operations in quantum computing and represents a selected set of their applications in quantum algorithms. Our goal is to provide one of the first algorithmic overviews of measurement processes in quantum computing. From the quantum information-theoretical perspective, measurements are either a method to access the result of a quantum computation or a technique to modify a quantum state. We also identify measurement-based methods to solve quantum computational challenges, such as error mitigation and circuit cutting. We discuss three main categories of measurements: performing measurements in static quantum circuits, modifying the quantum state in dynamic quantum circuits via measurements, and addressing challenges in quantum computing with measurements. Based on the reviewed topics, the measurement operations are frequently not at the center of the quantum algorithm design. However, the most novel and error-prone quantum algorithms will likely require sophisticated measurement schemes. Thus, the central message of this article is to broaden the view of measurement operations and highlight their importance at every level of quantum algorithm design.

12 pages; 6 figures; 3 tables

References in corpus (38)

• A variational eigenvalue solver on a quantum processor
• Variational Quantum Algorithms
• A Quantum Approximate Optimization Algorithm
• Error mitigation for short-depth quantum circuits
• Cost Function Dependent Barren Plateaus in Shallow Parametrized Quantum Circuits
• Symmetric Informationally Complete Quantum Measurements
• Extending the computational reach of a noisy superconducting quantum processor
• From Classical to Quantum Shannon Theory
• Application of a resource theory for magic states to fault-tolerant quantum computing
• Layerwise learning for quantum neural networks
• Trading classical and quantum computational resources
• Simulating Large Quantum Circuits on a Small Quantum Computer
• Is quantum advantage the right goal for quantum machine learning?
• Estimating outcome probabilities of quantum circuits using quasiprobabilities
• Challenges and Opportunities in Quantum Optimization
• Doubling the size of quantum simulators by entanglement forging
• Group-Invariant Quantum Machine Learning
• A Lie Algebraic Theory of Barren Plateaus for Deep Parameterized Quantum Circuits
• Informationally complete measurements and groups representation
• Tensor Networks in a Nutshell
• Quantifying magic for multi-qubit operations
• Quantum Neuron: an elementary building block for machine learning on quantum computers
• Circuit knitting with classical communication
• Efficient Long-Range Entanglement using Dynamic Circuits
• QNLP in Practice: Running Compositional Models of Meaning on a Quantum Computer
• Learning to Measure: Adaptive Informationally Complete Generalized Measurements for Quantum Algorithms
• Constructing a virtual two-qubit gate by sampling single-qubit operations
• Fast quantum circuit cutting with randomized measurements
• Quasiprobability decompositions with reduced sampling overhead
• Quantum Fourier Transform using Dynamic Circuits
• Towards large-scale quantum optimization solvers with few qubits
• A Simple Quantum Neural Net with a Periodic Activation Function
• Dual frame optimization for informationally complete quantum measurements
• Experimental demonstration of the advantage of adaptive quantum circuits
• Scalable tensor-network error mitigation for near-term quantum computing
• Explainable quantum regression algorithm with encoded data structure
• Single-shot quantum machine learning
• Gate Teleportation in Noisy Quantum Networks with the SquidASM Simulator