Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

arXiv:2507.04325 · IEEE International Conference on Quantum Software (QSW)

Perspectives on Utilization of Measurements in Quantum Algorithms

Valter Uotila, Ilmo Salmenperä, Leo Becker, Arianne Meijer-van de Griend, Aakash Ravindra Shinde, Jukka K. Nurminen

Published Jul 7, 2025• 8 citations
arXivHTMLPDF

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.

DOI
10.1109/qsw67625.2025.00016

Related papers

A Review of Quantum Computing: Fundamental Concepts, Physical Implementations and Future Challenges

L. Sujitha, Y. Ganga Devi

Quantum computing represents a transformative paradigm that exploits the principles of quantum mechanics—superposition, entanglement, and quantum interference—to perform computations beyond the capabilities of classical computers. This review presents a comprehensive overview of the fundamental concepts underlying quantum computation, including qubits, quantum gates, quantum algorithms and measurement theory. It further examines major physical implementations of quantum computers, such as superconducting circuits, trapped ions, photonic systems, spin-based qubits, and topological approaches, highlighting their operational principles, advantages, and technological limitations. Key challenges hindering large-scale quantum computation—decoherence, error rates, qubit scalability, and fault tolerance—are critically discussed. Additionally, recent progress in quantum error correction, hybrid quantum–classical algorithms, and hardware optimization is summarized. The review concludes by outlining future research directions and potential applications of quantum computing in cryptography, materials science, optimization, and drug discovery. By integrating theoretical foundations with experimental advancements, this article aims to provide a clear and accessible reference for students, researchers, and scientists entering the rapidly evolving field of quantum computing.

•Feb 11, 2026•0 citations

Requirements and Challenges of a Measurement Apparatus for Quantum Computer Operation

Leopoldo Angrisani, Pasquale Daponte, Mauro D'Arco +3 more

This article provides a comprehensive overview of the methods and tools used to control and measure superconducting qubits in state-of-the-art quantum processors. First, the fundamentals of quantum processors that use superconducting qubits are introduced to familiarize the readers with the basic terminology and help them easily grasp the essential concepts. Next, the most common measurement methods and related equipment are presented, including control hardware, signal sources and digital waveform recorders/analyzers. The implementation of gates for computation and the methods for readout operations are then discussed to demonstrate the challenges faced and the performance achievable with state-of-the-art technology.

IEEE International Instrumentation and Measurement Technology Conference•May 1, 2026•0 citations

Quantum Measurement for Quantum Chemistry on a Quantum Computer

Smik Patel, Praveen Jayakumar, Tzu-Ching Yen +1 more

Quantum chemistry is among the most promising applications of quantum computing, offering the potential to solve complex electronic structure problems more efficiently than classical approaches. A critical component of any quantum algorithm is the measurement step, where the desired properties are extracted from a quantum computer. This review focuses on recent advancements in quantum measurement techniques tailored for quantum chemistry, particularly within the second quantized framework suitable for current and near-term quantum hardware. We provide a comprehensive overview of measurement strategies developed primarily for the Variational Quantum Eigensolver (VQE) and its derivatives. These strategies address the inherent challenges posed by the complexity of the electronic Hamiltonian operator. Additionally, we examine methods for estimating excited states and one- and two-electron properties, extending the applicability of quantum algorithms to broader chemical phenomena. Key aspects of the review include approaches for constructing measurement operators with reduced classical preprocessing and quantum implementation costs, techniques to minimize the number of measurements required for a given accuracy, and error mitigation strategies that leverage symmetries and other properties of the measurement operators. Furthermore, we explore measurement schemes rooted in Quantum Phase Estimation (QPE), which are expected to become viable with the advent of fault-tolerant quantum computing. This review emphasizes foundational concepts and methodologies rather than numerical benchmarks, serving as a resource for researchers aiming to enhance the efficiency and accuracy of quantum measurements in quantum chemistry.

arXiv:2501.14968•Chemical Reviews•Jul 21, 2025•36 citations

Measurement-based quantum computing

Steven Anatolievich Duplij, Raimund Vogl

In this chapter, the measurement-based quantum computation model is overviewed and comprehensive references are given. The computation process starts with several entangled qubits and measurements act on each qubit separately. The result is then exploited for next measurements. To avoid measurement indeterminacy, local unitary operations (named corrections) are implemented, which give the one-way computation.

Institute of Physics eBooks•Nov 1, 2023•0 citations

Scalable Quantum Algorithms for Noisy Quantum Computers

Julien Gacon

Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.

arXiv:2403.00940•Jan 1, 2024•7 citations

The role of quantum measurements in physical processes and protocols

Benjamin Cruikshank, Kurt Jacobs

Abstract In this mainly pedagogical article, we discuss under what circumstances measurements play a special role in quantum processes. In particular, we discuss the following facts that appear to be a common area of confusion. (i) From a fundamental point of view, measurements play no special role whatsoever: all dynamics that can be generated by measurements can be generated by unitary processes (for which post-selection is no exception). (ii) From a purely physical point of view, measurements are not ‘outside’ of quantum mechanics. (iii) The only difference between the abilities of measurement-based protocols and unitary circuits for quantum computing comes from practical (technology dependent) constraints. We emphasise the importance of distinguishing between differences that are (i) fundamental but without physical import; (ii) fundamental and possess physical import; and (iii) are not fundamental but have practical import. We also emphasise the importance of separating theoretical and experimental elements of measurement, primarily projection and amplification , which are physically very different. Note that since we are concerned with facts regarding physical processes, this article has little if anything to do with interpretations of quantum mechanics.

arXiv:1707.04241•Quantum Science and Technology•Jul 7, 2017•5 citations
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.
Quantum computing represents a transformative paradigm that exploits the principles of quantum mechanics—superposition, entanglement, and quantum interference—to perform computations beyond the capabilities of classical computers. This review presents a comprehensive overview of the fundamental concepts underlying quantum computation, including qubits, quantum gates, quantum algorithms and measurement theory. It further examines major physical implementations of quantum computers, such as superconducting circuits, trapped ions, photonic systems, spin-based qubits, and topological approaches, highlighting their operational principles, advantages, and technological limitations. Key challenges hindering large-scale quantum computation—decoherence, error rates, qubit scalability, and fault tolerance—are critically discussed. Additionally, recent progress in quantum error correction, hybrid quantum–classical algorithms, and hardware optimization is summarized. The review concludes by outlining future research directions and potential applications of quantum computing in cryptography, materials science, optimization, and drug discovery. By integrating theoretical foundations with experimental advancements, this article aims to provide a clear and accessible reference for students, researchers, and scientists entering the rapidly evolving field of quantum computing.
This article provides a comprehensive overview of the methods and tools used to control and measure superconducting qubits in state-of-the-art quantum processors. First, the fundamentals of quantum processors that use superconducting qubits are introduced to familiarize the readers with the basic terminology and help them easily grasp the essential concepts. Next, the most common measurement methods and related equipment are presented, including control hardware, signal sources and digital waveform recorders/analyzers. The implementation of gates for computation and the methods for readout operations are then discussed to demonstrate the challenges faced and the performance achievable with state-of-the-art technology.
Quantum chemistry is among the most promising applications of quantum computing, offering the potential to solve complex electronic structure problems more efficiently than classical approaches. A critical component of any quantum algorithm is the measurement step, where the desired properties are extracted from a quantum computer. This review focuses on recent advancements in quantum measurement techniques tailored for quantum chemistry, particularly within the second quantized framework suitable for current and near-term quantum hardware. We provide a comprehensive overview of measurement strategies developed primarily for the Variational Quantum Eigensolver (VQE) and its derivatives. These strategies address the inherent challenges posed by the complexity of the electronic Hamiltonian operator. Additionally, we examine methods for estimating excited states and one- and two-electron properties, extending the applicability of quantum algorithms to broader chemical phenomena. Key aspects of the review include approaches for constructing measurement operators with reduced classical preprocessing and quantum implementation costs, techniques to minimize the number of measurements required for a given accuracy, and error mitigation strategies that leverage symmetries and other properties of the measurement operators. Furthermore, we explore measurement schemes rooted in Quantum Phase Estimation (QPE), which are expected to become viable with the advent of fault-tolerant quantum computing. This review emphasizes foundational concepts and methodologies rather than numerical benchmarks, serving as a resource for researchers aiming to enhance the efficiency and accuracy of quantum measurements in quantum chemistry.
Quantum computing not only holds the potential to solve long-standing problems in quantum physics, but also to offer speed-ups across a broad spectrum of other fields. Access to a computational space that incorporates quantum effects, such as superposition and entanglement, enables the derivation of promising quantum algorithms for important tasks, including preparing the ground state of a quantum system or predicting its evolution over time. Successfully tackling these tasks promises insights into significant theoretical and technological questions, such as superconductivity and the design of new materials. The aim of quantum algorithms is to use a series of quantum operations in a quantum circuit to solve a problem beyond the reach of classical computers. However, the noise and limited scale of current quantum computers restricts these circuits to moderate sizes and depths. As a result, many prominent algorithms are currently infeasible to run for problem sizes of practical interest. In response, recent research focused on variational quantum algorithms, which allow the selection of circuits that act within a quantum device's capabilities. Yet, these algorithms can require the execution of a large number of circuits, leading to prohibitively long computation times. This doctoral thesis develops two main techniques to reduce these quantum computational resource requirements, with the goal of scaling up application sizes on current quantum processors. The first approach is based on stochastic approximations of computationally costly quantities, such as quantum circuit gradients or the quantum geometric tensor (QGT). The second method takes a different perspective on the QGT, leading to a potentially more efficient description of time evolution on current quantum computers. Both techniques rely on maintaining available information and only computing necessary corrections, instead of re-computing possibly redundant data. The main focus of application for our algorithms is the simulation of quantum systems, broadly defined as including the preparation of ground and thermal states, and the real- and imaginary-time propagation of a system. The developed subroutines, however, can further be utilized in the fields of optimization or machine learning. Our algorithms are benchmarked on a range of representative models, such as Ising or Heisenberg spin models, both in numerical simulations and experiments on the hardware. In combination with error mitigation techniques, the latter is scaled up to 27 qubits; into a regime that variational quantum algorithms are challenging to scale to on noisy quantum computers without our algorithms.
Abstract In this mainly pedagogical article, we discuss under what circumstances measurements play a special role in quantum processes. In particular, we discuss the following facts that appear to be a common area of confusion. (i) From a fundamental point of view, measurements play no special role whatsoever: all dynamics that can be generated by measurements can be generated by unitary processes (for which post-selection is no exception). (ii) From a purely physical point of view, measurements are not ‘outside’ of quantum mechanics. (iii) The only difference between the abilities of measurement-based protocols and unitary circuits for quantum computing comes from practical (technology dependent) constraints. We emphasise the importance of distinguishing between differences that are (i) fundamental but without physical import; (ii) fundamental and possess physical import; and (iii) are not fundamental but have practical import. We also emphasise the importance of separating theoretical and experimental elements of measurement, primarily projection and amplification , which are physically very different. Note that since we are concerned with facts regarding physical processes, this article has little if anything to do with interpretations of quantum mechanics.