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:1901.00015 · Physical Review Research

Methodology for replacing indirect measurements with direct measurements

Kosuke Mitarai, Keisuke Fujii

Published Aug 9, 2019• 145 citations
arXivHTMLPDF

Abstract

This work investigates the mechanism by which indirect measurements can be replaced by direct ones in quantum algorithms. The authors propose a protocol to simplify the measurement of correlators in the quantum simulation and derivatives with respect to the parameters in the variational algorithms, by reducing the required number of gates.

DOI
10.1103/physrevresearch.1.013006

Related papers

COMPROMISING NON-DEMOLITION AND INFORMATION GAINING FOR QUBIT STATE ESTIMATION

László Ruppert, Attila Magyar, Katalin Mária Hangos

An indirect measurement scheme is used in this paper, which allows us to to optimally select the elements of the measurement protocol according to a pre-defined weighting between the variance of the estimated state parameters and the ratio of the non-demolished copies of the system.

•Oct 1, 2008•1 citation

Theory of Quantum Mechanical Measurements

Günther Ludwig

No measurement is possible without any theory. With respect to a theory under consideration one has to distinguish between direct and indirect measurements. Direct measurements are defined by pre-theories, i.e. without the theory under consideration. The direct measurements for quantum theory are given by measurable processes on macroscopic devices. It is demonstrated how indirect measurements in quantum mechanics can be reduced to direct measurements. A theory of the measuring device is in this context not possible by quantum mechanics alone, but by a more comprehensive theory of macrosystems.

Metrologia•Jan 1, 1986•9 citations

High-Order Randomized Compiler for Hamiltonian Simulation

Kouhei Nakaji, Mohsen Bagherimehrab, Alán Aspuru‐Guzik

Hamiltonian simulation is known to be one of the fundamental building blocks of a variety of quantum algorithms such as its most immediate application, that of simulating many-body systems to extract their physical properties. In this work, we present qSWIFT, a high-order randomized algorithm for Hamiltonian simulation. In qSWIFT, the required number of gates for a given precision is independent of the number of terms in the Hamiltonian, while the systematic error is exponentially reduced with regard to the order parameter. In this respect, our qSWIFT is a higher-order counterpart of the previously proposed quantum stochastic drift protocol (qDRIFT), the number of gates in which scales linearly with the inverse of the precision required. We construct the qSWIFT channel and establish a rigorous bound for the systematic error quantified by the diamond norm. qSWIFT provides an algorithm to estimate given physical quantities by using a system with one ancilla qubit, which is as simple as other product-formula-based approaches such as regular Trotter-Suzuki decompositions and qDRIFT. Our numerical experiment reveals that the required number of gates in qSWIFT is significantly reduced compared to qDRIFT. In particular, the advantage is significant for problems where high precision is required; e.g., to achieve a systematic relative propagation error of 10−6 , the required number of gates in third-order qSWIFT is 1000 times smaller than that of qDRIFT. Published by the American Physical Society 2024

arXiv:2302.14811•PRX Quantum•May 8, 2024•42 citations

Variational quantum algorithms with significantly fewer measurements

Ryan Babbush, Jarrod R. McClean, Nan Ding +3 more

Bulletin of the American Physical Society•Mar 14, 2017•0 citations

Numerical Error Extraction by Quantum Measurement Algorithm

Clement Ronfaut, Robin Ollive, Stephane Louise

In quantum computing, some of the main quantum operations (i.e., gates) cannot be simply implemented and require an approximation. Major quantum algorithm routines enable the implementation of these specific quantum gates by combining basic quantum circuits with an iterative structure. In this structure, the number of repetitions of the basic circuit pattern is associated with convergence parameters. The asymptotic convergence of the gate error with respect to the number of basic pattern repetitions is known as the query complexity. The underlying convergence law is bounded, but often lacks explicit constants for specific problem instances. Upper bounds are generally too pessimistic to be useful in practice. The actual convergence law contains constants that depend on the joint properties of the matrix encoded by the query and the initial state vector, which are difficult to compute classically. This paper proposes a strategy to study this convergence law directly from the Quantum Processing Unit (QPU) output. Given a convergence law, this protocol extracts the numerical values of the associated constants from the gate (i.e., operation) approximation at different accuracies (i.e., convergence parameters) constructed directly on the QPU. This protocol is called Numerical Error Extraction by Quantum Measurement Algorithm (NEEQMA). NEEQMA concepts are tested on specific instances of Quantum Signal Processing (QSP) and Hamiltonian Simulation via Trotterization. Knowing the convergence constants associated with a semi-norm of the error allows selecting the smallest convergence parameters that achieve the required gate approximation accuracy, thereby satisfying the quantum algorithm's requirements.

quant-pharXiv:2602.01927•Feb 3, 2026•4 citations

Diagrammatic representation of direct measurement systems of quantum states, processes, and measurements

Kazuhisa Ogawa, H. Kobayashi, Akihisa Tomita

A diagrammatic representation that intuitively shows the relation between measurement systems using qubit probes and their outcomes is introduced. This representation enables us to design direct measurement systems of quantum states, processes, and measurements systematically.

The Rochester Conferences on Coherence and Quantum Optics and the Quantum Information and Measurement meeting•Jan 1, 2019•0 citations
This work investigates the mechanism by which indirect measurements can be replaced by direct ones in quantum algorithms. The authors propose a protocol to simplify the measurement of correlators in the quantum simulation and derivatives with respect to the parameters in the variational algorithms, by reducing the required number of gates.
No measurement is possible without any theory. With respect to a theory under consideration one has to distinguish between direct and indirect measurements. Direct measurements are defined by pre-theories, i.e. without the theory under consideration. The direct measurements for quantum theory are given by measurable processes on macroscopic devices. It is demonstrated how indirect measurements in quantum mechanics can be reduced to direct measurements. A theory of the measuring device is in this context not possible by quantum mechanics alone, but by a more comprehensive theory of macrosystems.
Hamiltonian simulation is known to be one of the fundamental building blocks of a variety of quantum algorithms such as its most immediate application, that of simulating many-body systems to extract their physical properties. In this work, we present qSWIFT, a high-order randomized algorithm for Hamiltonian simulation. In qSWIFT, the required number of gates for a given precision is independent of the number of terms in the Hamiltonian, while the systematic error is exponentially reduced with regard to the order parameter. In this respect, our qSWIFT is a higher-order counterpart of the previously proposed quantum stochastic drift protocol (qDRIFT), the number of gates in which scales linearly with the inverse of the precision required. We construct the qSWIFT channel and establish a rigorous bound for the systematic error quantified by the diamond norm. qSWIFT provides an algorithm to estimate given physical quantities by using a system with one ancilla qubit, which is as simple as other product-formula-based approaches such as regular Trotter-Suzuki decompositions and qDRIFT. Our numerical experiment reveals that the required number of gates in qSWIFT is significantly reduced compared to qDRIFT. In particular, the advantage is significant for problems where high precision is required; e.g., to achieve a systematic relative propagation error of 10−6 , the required number of gates in third-order qSWIFT is 1000 times smaller than that of qDRIFT. Published by the American Physical Society 2024
In quantum computing, some of the main quantum operations (i.e., gates) cannot be simply implemented and require an approximation. Major quantum algorithm routines enable the implementation of these specific quantum gates by combining basic quantum circuits with an iterative structure. In this structure, the number of repetitions of the basic circuit pattern is associated with convergence parameters. The asymptotic convergence of the gate error with respect to the number of basic pattern repetitions is known as the query complexity. The underlying convergence law is bounded, but often lacks explicit constants for specific problem instances. Upper bounds are generally too pessimistic to be useful in practice. The actual convergence law contains constants that depend on the joint properties of the matrix encoded by the query and the initial state vector, which are difficult to compute classically. This paper proposes a strategy to study this convergence law directly from the Quantum Processing Unit (QPU) output. Given a convergence law, this protocol extracts the numerical values of the associated constants from the gate (i.e., operation) approximation at different accuracies (i.e., convergence parameters) constructed directly on the QPU. This protocol is called Numerical Error Extraction by Quantum Measurement Algorithm (NEEQMA). NEEQMA concepts are tested on specific instances of Quantum Signal Processing (QSP) and Hamiltonian Simulation via Trotterization. Knowing the convergence constants associated with a semi-norm of the error allows selecting the smallest convergence parameters that achieve the required gate approximation accuracy, thereby satisfying the quantum algorithm's requirements.